Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f11 : A'=100, B'=free, C'=1, [], cost: 1
      1: f0 -> f11 : A'=100, B'=free_1, C'=0, [], cost: 1
      2: f11 -> f23 : C'=1, D'=1, E'=1, F'=100, G'=free_2, H'=1, [ C==1 ], cost: 1
      3: f11 -> f23 : C'=1, D'=1, E'=1, F'=100, G'=free_3, H'=0, [ C==1 ], cost: 1
      6: f11 -> f36 : D'=C, E'=C, J'=100, [ 0>=C ], cost: 1
      7: f11 -> f36 : D'=C, E'=C, J'=100, [ C>=2 ], cost: 1
      4: f23 -> f26 : E'=H, Q'=100, [ 0>=H ], cost: 1
      5: f23 -> f26 : E'=H, Q'=100, [ H>=2 ], cost: 1
      8: f23 -> f32 : E'=1, H'=1, K'=free_4, L'=free_5, [ 0>=2+free_4 && H==1 ], cost: 1
      9: f23 -> f32 : E'=1, H'=1, K'=free_6, L'=free_7, [ free_6>=0 && H==1 ], cost: 1
     10: f23 -> f32 : E'=1, H'=1, K'=-1, M'=100, N'=free_8, [ H==1 ], cost: 1
     13: f26 -> f32 : [ 0>=1+free_10 ], cost: 1
     14: f26 -> f32 : [], cost: 1
     11: f36 -> f32 : [ 0>=1+free_9 ], cost: 1
     12: f36 -> f32 : [], cost: 1


Simplified the transitions:
  Start location: f0
    <empty>


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
    <empty>


Computing complexity for remaining 0 transitions.


The final runtime is determined by this resulting transition:
  Final Guard: 
  Final Cost:  1

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

WORST_CASE(Omega(1),?)