Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: evalSimpleSinglestart
      0: evalSimpleSinglestart -> evalSimpleSingleentryin : [], cost: 1
      1: evalSimpleSingleentryin -> evalSimpleSinglebb3in : A'=0, [], cost: 1
      2: evalSimpleSinglebb3in -> evalSimpleSinglebbin : [ B>=1+A ], cost: 1
      3: evalSimpleSinglebb3in -> evalSimpleSinglereturnin : [ A>=B ], cost: 1
      4: evalSimpleSinglebbin -> evalSimpleSinglebb3in : A'=1+A, [], cost: 1
      5: evalSimpleSinglereturnin -> evalSimpleSinglestop : [], cost: 1


Simplified the transitions:
  Start location: evalSimpleSinglestart
      0: evalSimpleSinglestart -> evalSimpleSingleentryin : [], cost: 1
      1: evalSimpleSingleentryin -> evalSimpleSinglebb3in : A'=0, [], cost: 1
      2: evalSimpleSinglebb3in -> evalSimpleSinglebbin : [ B>=1+A ], cost: 1
      4: evalSimpleSinglebbin -> evalSimpleSinglebb3in : A'=1+A, [], cost: 1


Applied simple chaining:
  Start location: evalSimpleSinglestart
      0: evalSimpleSinglestart -> evalSimpleSinglebb3in : A'=0, [], cost: 2
      2: evalSimpleSinglebb3in -> evalSimpleSinglebb3in : A'=1+A, [ B>=1+A ], cost: 2

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

Removed all Self-loops using metering functions (where possible):
  Start location: evalSimpleSinglestart
      0: evalSimpleSinglestart -> evalSimpleSinglebb3in : A'=0, [], cost: 2
      6: evalSimpleSinglebb3in -> [6] : A'=B, [ B>=1+A ], cost: 2*B-2*A


Applied simple chaining:
  Start location: evalSimpleSinglestart
      0: evalSimpleSinglestart -> [6] : A'=B, [ B>=1 ], cost: 2+2*B


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: evalSimpleSinglestart
      0: evalSimpleSinglestart -> [6] : A'=B, [ B>=1 ], cost: 2+2*B


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 2+2*B
  and guard: B>=1:
  B: Pos

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


The final runtime is determined by this resulting transition:
  Final Guard: B>=1
  Final Cost:  2+2*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),?)