Trying to load file: main.koat

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

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

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


Applied chaining over branches and pruning:
  Start location: f3
      5: f3 -> [2] : A'=2, [ free>=1 ], cost: INF
      6: f3 -> [2] : A'=2, [ 0>=free_1 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f3
      5: f3 -> [2] : A'=2, [ free>=1 ], cost: INF
      6: f3 -> [2] : A'=2, [ 0>=free_1 ], cost: INF


Computing complexity for remaining 2 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: free>=1
  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,?)