Trying to load file: main.koat

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


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

Eliminating 3 self-loops for location f2
  Self-Loop 1 has the metering function: 1+A, resulting in the new transition 5.
  Self-Loop 2 has the metering function: 1+A, resulting in the new transition 6.
  Self-Loop 3 has unbounded runtime, resulting in the new transition 7.
  Removing the self-loops: 1 2 3.

Removed all Self-loops using metering functions (where possible):
  Start location: f3
      0: f3 -> f2 : [], cost: 1
      5: f2 -> [3] : A'=-1, B'=free, [ free>=1 && A>=0 ], cost: 1+A
      6: f2 -> [3] : A'=-1, B'=free_1, [ 0>=1+free_1 && A>=0 ], cost: 1+A
      7: f2 -> [3] : [ A>=0 ], cost: INF


Applied chaining over branches and pruning:
  Start location: f3
      8: f3 -> [3] : A'=-1, B'=free, [ free>=1 && A>=0 ], cost: 2+A
      9: f3 -> [3] : A'=-1, B'=free_1, [ 0>=1+free_1 && A>=0 ], cost: 2+A
     10: f3 -> [3] : [ A>=0 ], cost: INF


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


Computing complexity for remaining 3 transitions.

  Found configuration with infinitely models for cost: 2+A
  and guard: free>=1 && A>=0:
  free: Pos, A: Pos

Found new complexity n^1, because: Found infinity configuration.

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,?)