Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f7 : A'=free, B'=0, C'=0, [ 0>=1+free ], cost: 1
      1: f0 -> f7 : A'=free_1, B'=0, C'=0, [ free_1>=1 ], cost: 1
      2: f0 -> f7 : A'=0, B'=1023, C'=0, [], cost: 1
      3: f7 -> f7 : C'=1+C, D'=2+D, [ B>=C ], cost: 1
      4: f7 -> f21 : [ E>=0 && C>=1+B && 1022>=E ], cost: 1
      5: f7 -> f21 : [ C>=1+B && E>=1023 ], cost: 1
      6: f7 -> f21 : [ C>=1+B && 0>=1+E ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f0 -> f7 : A'=free, B'=0, C'=0, [ 0>=1+free ], cost: 1
      1: f0 -> f7 : A'=free_1, B'=0, C'=0, [ free_1>=1 ], cost: 1
      2: f0 -> f7 : A'=0, B'=1023, C'=0, [], cost: 1
      3: f7 -> f7 : C'=1+C, D'=2+D, [ B>=C ], cost: 1

Eliminating 1 self-loops for location f7
  Self-Loop 3 has the metering function: 1+B-C, resulting in the new transition 7.
  Removing the self-loops: 3.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f0 -> f7 : A'=free, B'=0, C'=0, [ 0>=1+free ], cost: 1
      1: f0 -> f7 : A'=free_1, B'=0, C'=0, [ free_1>=1 ], cost: 1
      2: f0 -> f7 : A'=0, B'=1023, C'=0, [], cost: 1
      7: f7 -> [3] : C'=1+B, D'=2+2*B-2*C+D, [ B>=C ], cost: 1+B-C


Applied chaining over branches and pruning:
  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),?)