Trying to load file: main.koat

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


Simplified the transitions:
  Start location: f3
      0: f3 -> f1 : A'=0, [], cost: 1
      3: f1 -> f1 : A'=0, B'=1+B, C'=1+C, [ C>=2+B && A==0 ], cost: 1

Eliminating 1 self-loops for location f1
  Self-Loop 3 has unbounded runtime, resulting in the new transition 4.
  Removing the self-loops: 3.

Removed all Self-loops using metering functions (where possible):
  Start location: f3
      0: f3 -> f1 : A'=0, [], cost: 1
      4: f1 -> [3] : [ C>=2+B && A==0 ], cost: INF


Applied simple chaining:
  Start location: f3
      0: f3 -> [3] : A'=0, [ C>=2+B && 0==0 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f3
      0: f3 -> [3] : A'=0, [ C>=2+B && 0==0 ], cost: INF


Computing complexity for remaining 1 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: C>=2+B && 0==0
  Final Cost:  INF

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

WORST_CASE(INF,?)