Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      2: f4 -> f4 : B'=-1+B, [ B>=1 ], cost: 1
      0: f4 -> f5 : C'=1, [ 0>=A && 0>=B ], cost: 1
      3: f0 -> f4 : C'=0, [ 0>=A ], cost: 1
      1: f0 -> f2 : C'=1, [ A>=1 ], cost: 1


Simplified the transitions:
  Start location: f0
      2: f4 -> f4 : B'=-1+B, [ B>=1 ], cost: 1
      3: f0 -> f4 : C'=0, [ 0>=A ], cost: 1

Eliminating 1 self-loops for location f4
  Self-Loop 2 has the metering function: B, resulting in the new transition 4.
  Removing the self-loops: 2.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      4: f4 -> [4] : B'=0, [ B>=1 ], cost: B
      3: f0 -> f4 : C'=0, [ 0>=A ], cost: 1


Applied simple chaining:
  Start location: f0
      3: f0 -> [4] : B'=0, C'=0, [ 0>=A && B>=1 ], cost: 1+B


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      3: f0 -> [4] : B'=0, C'=0, [ 0>=A && B>=1 ], cost: 1+B


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 1+B
  and guard: 0>=A && B>=1:
  B: Pos, A: Neg

Found new complexity n^1, because: Found infinity configuration.


The final runtime is determined by this resulting transition:
  Final Guard: 0>=A && B>=1
  Final Cost:  1+B

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

WORST_CASE(Omega(n^1),?)