Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f12
      0: f12 -> f5 : A'=400, B'=0, C'=0, [], cost: 1
      6: f5 -> f5 : B'=1+B, C'=free_5, D'=free_4, F'=free_5, [ A>=1+B && C==0 ], cost: 1
      1: f5 -> f11 : C'=0, D'=0, E'=0, [ B>=A && C==0 ], cost: 1
      2: f5 -> f10 : D'=C, E'=C, [ C>=1 ], cost: 1
      3: f5 -> f10 : D'=C, E'=C, [ 0>=1+C ], cost: 1
      4: f7 -> f5 : B'=1+B, C'=free_1, D'=free, F'=free_1, [], cost: 1
      5: f8 -> f5 : B'=1+B, C'=free_3, D'=free_2, F'=free_3, [], cost: 1


Simplified the transitions:
  Start location: f12
      0: f12 -> f5 : A'=400, B'=0, C'=0, [], cost: 1
      6: f5 -> f5 : B'=1+B, C'=free_5, D'=free_4, F'=free_5, [ A>=1+B && C==0 ], cost: 1

Eliminating 1 self-loops for location f5
  Removing the self-loops: 6.
Adding an epsilon transition (to model nonexecution of the loops): 8.

Removed all Self-loops using metering functions (where possible):
  Start location: f12
      0: f12 -> f5 : A'=400, B'=0, C'=0, [], cost: 1
      7: f5 -> [6] : B'=1+B, C'=free_5, D'=free_4, F'=free_5, [ A>=1+B && C==0 ], cost: 1
      8: f5 -> [6] : [], cost: 0


Applied chaining over branches and pruning:
  Start location: f12
    <empty>


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f12
    <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),?)