Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f2 -> f2 : A'=B+A, B'=-2+B, C'=1+C, [], cost: 1
      1: f2 -> f2 : A'=C+A, C'=-2+C, [], cost: 1
      2: f0 -> f2 : [ A>=0 ], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      4: f2 -> [2] : [], cost: INF
      2: f0 -> f2 : [ A>=0 ], cost: 1


Applied simple chaining:
  Start location: f0
      2: f0 -> [2] : [ A>=0 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      2: f0 -> [2] : [ A>=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: A>=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,?)