Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f300
      0: f2 -> f2 : B'=free_1, C'=free_2, D'=free, E'=F, [ A>=2 ], cost: 1
      1: f2 -> f1 : B'=free_4, C'=free_5, G'=free_3, [ 1>=A ], cost: 1
      2: f300 -> f2 : B'=free_9, C'=free_11, D'=free_7, E'=free_10, F'=free_10, Q'=free_12, J'=free_6, K'=free_8, [ H>=1 ], cost: 1
      3: f300 -> f1 : B'=free_16, C'=free_18, E'=free_14, F'=free_19, G'=free_17, Q'=free_13, J'=free_14, K'=free_15, [ 0>=H ], cost: 1


Simplified the transitions:
  Start location: f300
      0: f2 -> f2 : B'=free_1, C'=free_2, D'=free, E'=F, [ A>=2 ], cost: 1
      2: f300 -> f2 : B'=free_9, C'=free_11, D'=free_7, E'=free_10, F'=free_10, Q'=free_12, J'=free_6, K'=free_8, [ H>=1 ], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f300
      4: f2 -> [3] : [ A>=2 ], cost: INF
      2: f300 -> f2 : B'=free_9, C'=free_11, D'=free_7, E'=free_10, F'=free_10, Q'=free_12, J'=free_6, K'=free_8, [ H>=1 ], cost: 1


Applied simple chaining:
  Start location: f300
      2: f300 -> [3] : B'=free_9, C'=free_11, D'=free_7, E'=free_10, F'=free_10, Q'=free_12, J'=free_6, K'=free_8, [ H>=1 && A>=2 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f300
      2: f300 -> [3] : B'=free_9, C'=free_11, D'=free_7, E'=free_10, F'=free_10, Q'=free_12, J'=free_6, K'=free_8, [ H>=1 && A>=2 ], 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: H>=1 && A>=2
  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,?)