Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f3
      1: f0 -> f0 : A'=-1+A, B'=C, C'=-1+C, D'=A, [ A>=1 ], cost: 1
      0: f0 -> f2 : [ 0>=A ], cost: 1
      4: f2 -> f0 : A'=free_1, [ free_1>=1 && C>=1 ], cost: 1
      3: f2 -> f4 : G'=free, [ 0>=C ], cost: 1
      2: f1 -> f0 : A'=-1+A, C'=-1+C, E'=C, F'=A, [ A>=1 && C>=1 ], cost: 1
      5: f3 -> f2 : A'=free_2, C'=free_3, [], cost: 1


Simplified the transitions:
  Start location: f3
      1: f0 -> f0 : A'=-1+A, B'=C, C'=-1+C, D'=A, [ A>=1 ], cost: 1
      0: f0 -> f2 : [ 0>=A ], cost: 1
      4: f2 -> f0 : A'=free_1, [ free_1>=1 && C>=1 ], cost: 1
      5: f3 -> f2 : A'=free_2, C'=free_3, [], cost: 1

Eliminating 1 self-loops for location f0
  Self-Loop 1 has the metering function: A, resulting in the new transition 6.
  Removing the self-loops: 1.

Removed all Self-loops using metering functions (where possible):
  Start location: f3
      6: f0 -> [5] : A'=0, B'=1+C-A, C'=C-A, D'=1, [ A>=1 ], cost: A
      4: f2 -> f0 : A'=free_1, [ free_1>=1 && C>=1 ], cost: 1
      5: f3 -> f2 : A'=free_2, C'=free_3, [], cost: 1
      0: [5] -> f2 : [ 0>=A ], cost: 1


Applied simple chaining:
  Start location: f3
      4: f2 -> f2 : A'=0, B'=1-free_1+C, C'=-free_1+C, D'=1, [ free_1>=1 && C>=1 && free_1>=1 && 0>=0 ], cost: 2+free_1
      5: f3 -> f2 : A'=free_2, C'=free_3, [], cost: 1

Eliminating 1 self-loops for location f2
  Self-Loop 4 has the metering function: C, resulting in the new transition 7.
  Removing the self-loops: 4.

Removed all Self-loops using metering functions (where possible):
  Start location: f3
      7: f2 -> [6] : A'=0, B'=1, C'=0, D'=1, [ 1>=1 && C>=1 ], cost: 3*C
      5: f3 -> f2 : A'=free_2, C'=free_3, [], cost: 1


Applied simple chaining:
  Start location: f3
      5: f3 -> [6] : A'=0, B'=1, C'=0, D'=1, [ 1>=1 && free_3>=1 ], cost: 1+3*free_3


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f3
      5: f3 -> [6] : A'=0, B'=1, C'=0, D'=1, [ 1>=1 && free_3>=1 ], cost: 1+3*free_3


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 1+3*free_3
  and guard: 1>=1 && free_3>=1:
  free_3: Pos

Found new complexity INF, because: Found infinity configuration.


The final runtime is determined by this resulting transition:
  Final Guard: 1>=1 && free_3>=1
  Final Cost:  1+3*free_3

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: INF
  Complexity value: INF

WORST_CASE(INF,?)