Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f10
      0: f10 -> f4 : A'=4, B'=0, C'=0, [], cost: 1
      3: f4 -> f4 : B'=1+B, C'=free_3, D'=free_2, F'=free_3, [], cost: 1
      1: f4 -> f9 : D'=C, E'=C, [], cost: 1
      2: f7 -> f4 : B'=1+B, C'=free_1, D'=free, F'=free_1, [], cost: 1
      4: f6 -> f4 : B'=1+B, C'=free_5, D'=free_4, F'=free_5, [], cost: 1


Simplified the transitions:
  Start location: f10
      0: f10 -> f4 : A'=4, B'=0, C'=0, [], cost: 1
      3: f4 -> f4 : B'=1+B, C'=free_3, D'=free_2, F'=free_3, [], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f10
      0: f10 -> f4 : A'=4, B'=0, C'=0, [], cost: 1
      5: f4 -> [5] : [], cost: INF


Applied simple chaining:
  Start location: f10
      0: f10 -> [5] : A'=4, B'=0, C'=0, [], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f10
      0: f10 -> [5] : A'=4, B'=0, C'=0, [], 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: 
  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,?)