Trying to load file: main.koat

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


Simplified the transitions:
  Start location: f300
      0: f2 -> f2 : B'=C, D'=free_1, E'=free_2, F'=free, [ A>=1 ], cost: 1
      2: f300 -> f2 : B'=free_11, C'=free_11, D'=free_16, E'=free_10, F'=free_12, H'=free_13, Q'=free_15, J'=free_14, [ A>=1 && G>=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>=1 ], cost: INF
      2: f300 -> f2 : B'=free_11, C'=free_11, D'=free_16, E'=free_10, F'=free_12, H'=free_13, Q'=free_15, J'=free_14, [ A>=1 && G>=1 ], cost: 1


Applied simple chaining:
  Start location: f300
      2: f300 -> [3] : B'=free_11, C'=free_11, D'=free_16, E'=free_10, F'=free_12, H'=free_13, Q'=free_15, J'=free_14, [ A>=1 && G>=1 && A>=1 ], cost: INF


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