Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f2
      0: f1 -> f1 : C'=free_1, D'=free_2, E'=free, [ A>=1+B ], cost: 1
      1: f1 -> f1 : C'=free_4, D'=free_5, E'=free_3, [ B>=1+A ], cost: 1
      2: f1 -> f300 : B'=A, C'=free_7, D'=free_8, F'=free_6, [ A==B ], cost: 1
      3: f2 -> f1 : G'=free_9, H'=free_10, [], cost: 1


Simplified the transitions:
  Start location: f2
      0: f1 -> f1 : C'=free_1, D'=free_2, E'=free, [ A>=1+B ], cost: 1
      1: f1 -> f1 : C'=free_4, D'=free_5, E'=free_3, [ B>=1+A ], cost: 1
      3: f2 -> f1 : G'=free_9, H'=free_10, [], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f2
      4: f1 -> [3] : [ A>=1+B ], cost: INF
      5: f1 -> [3] : [ B>=1+A ], cost: INF
      3: f2 -> f1 : G'=free_9, H'=free_10, [], cost: 1


Applied chaining over branches and pruning:
  Start location: f2
      6: f2 -> [3] : G'=free_9, H'=free_10, [ A>=1+B ], cost: INF
      7: f2 -> [3] : G'=free_9, H'=free_10, [ B>=1+A ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f2
      6: f2 -> [3] : G'=free_9, H'=free_10, [ A>=1+B ], cost: INF
      7: f2 -> [3] : G'=free_9, H'=free_10, [ B>=1+A ], 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: A>=1+B
  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,?)