Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f1
      0: f2 -> f2 : A'=1+A, B'=1+B, C'=-1+C, [], cost: 1
      1: f1 -> f2 : [ A>=C && B>=1+A && C>=1+B ], cost: 1
      2: f1 -> f300 : D'=free, [ C>=1+B && B>=1+A && C>=1+A ], cost: 1
      3: f1 -> f300 : D'=free_1, [ B>=1+A && B>=C ], cost: 1
      4: f1 -> f300 : D'=free_2, [ A>=B ], cost: 1


Removed unsatisfiable initial transitions:
  Start location: f1
      0: f2 -> f2 : A'=1+A, B'=1+B, C'=-1+C, [], cost: 1
      2: f1 -> f300 : D'=free, [ C>=1+B && B>=1+A && C>=1+A ], cost: 1
      3: f1 -> f300 : D'=free_1, [ B>=1+A && B>=C ], cost: 1
      4: f1 -> f300 : D'=free_2, [ A>=B ], cost: 1


Simplified the transitions:
  Start location: f1
    <empty>


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f1
    <empty>


Computing complexity for remaining 0 transitions.


The final runtime is determined by this resulting transition:
  Final Guard: 
  Final Cost:  1

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: const
  Complexity value: 0

WORST_CASE(Omega(1),?)