Trying to load file: main.koat

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


Simplified the transitions:
  Start location: f2
      0: f2 -> f300 : A'=free, B'=free_2, C'=free_3, D'=free_1, [], cost: 1
      1: f300 -> f300 : G'=free_4, H'=free_5, Q'=free_6, [ F>=1+E ], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f2
      0: f2 -> f300 : A'=free, B'=free_2, C'=free_3, D'=free_1, [], cost: 1
      3: f300 -> [3] : [ F>=1+E ], cost: INF


Applied simple chaining:
  Start location: f2
      0: f2 -> [3] : A'=free, B'=free_2, C'=free_3, D'=free_1, [ F>=1+E ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f2
      0: f2 -> [3] : A'=free, B'=free_2, C'=free_3, D'=free_1, [ F>=1+E ], 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: F>=1+E
  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,?)