Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: start
      0: eval1 -> eval2 : [ A>=1 ], cost: 1
      2: eval2 -> eval1 : A'=-1+A, [ A>=1 && 0>=B ], cost: 1
      1: eval2 -> eval2 : B'=-1+B, [ A>=1 && B>=1 ], cost: 1
      3: start -> eval1 : [], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: start
      0: eval1 -> eval2 : [ A>=1 ], cost: 1
      4: eval2 -> [3] : B'=0, [ A>=1 && B>=1 ], cost: B
      3: start -> eval1 : [], cost: 1
      2: [3] -> eval1 : A'=-1+A, [ A>=1 && 0>=B ], cost: 1


Applied simple chaining:
  Start location: start
      0: eval1 -> eval1 : A'=-1+A, B'=0, [ A>=1 && A>=1 && B>=1 && A>=1 && 0>=0 ], cost: 2+B
      3: start -> eval1 : [], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: start
      5: eval1 -> [4] : A'=-1+A, B'=0, [ A>=1 && B>=1 ], cost: 2+B
      6: eval1 -> [4] : [], cost: 0
      3: start -> eval1 : [], cost: 1


Applied chaining over branches and pruning:
  Start location: start
      7: start -> [4] : A'=-1+A, B'=0, [ A>=1 && B>=1 ], cost: 3+B


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


Computing complexity for remaining 1 transitions.

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

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


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