Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f7 : A'=30, B'=30, C'=1, D'=0, E'=2, [], cost: 1
      1: f7 -> f7 : C'=C+D, D'=C, E'=1+E, F'=C, [ B>=E ], cost: 1
      2: f7 -> f19 : G'=C, H'=C, Q'=C, [ E>=1+B ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f0 -> f7 : A'=30, B'=30, C'=1, D'=0, E'=2, [], cost: 1
      1: f7 -> f7 : C'=C+D, D'=C, E'=1+E, F'=C, [ B>=E ], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f0 -> f7 : A'=30, B'=30, C'=1, D'=0, E'=2, [], cost: 1
      3: f7 -> [3] : C'=C*2^(1-E+B), D'=1/2*C*2^(1-E+B), E'=1+B, F'=1/2*C*2^(1-E+B), [ B>=E && C==D && C==F ], cost: 1-E+B


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),?)