Trying to load file: main.koat

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

Eliminating 6 self-loops for location eval
  Self-Loop 0 has the metering function: A, resulting in the new transition 7.
  Self-Loop 1 has the metering function: A, resulting in the new transition 8.
  Self-Loop 2 has unbounded runtime, resulting in the new transition 9.
  Self-Loop 3 has the metering function: B, resulting in the new transition 10.
  Self-Loop 4 has unbounded runtime, resulting in the new transition 11.
  Self-Loop 5 has unbounded runtime, resulting in the new transition 12.
  Found this metering function when nesting loops: -1+A,
  Found this metering function when nesting loops: -1+A,
  Removing the self-loops: 0 1 2 3 4 5.

Removed all Self-loops using metering functions (where possible):
  Start location: start
      7: eval -> [2] : A'=0, [ A>=1 ], cost: A
      8: eval -> [2] : A'=0, [ B>=1 && A>=1 ], cost: A
      9: eval -> [2] : [ A>=1 && 0>=A && B>=1 ], cost: INF
     10: eval -> [2] : B'=0, [ B>=1 && 0>=A ], cost: B
     11: eval -> [2] : [ A>=1 && 0>=A && 0>=B ], cost: INF
     12: eval -> [2] : [ B>=1 && 0>=A && 0>=B ], cost: INF
      6: start -> eval : [], cost: 1


Applied chaining over branches and pruning:
  Start location: start
     13: start -> [2] : A'=0, [ A>=1 ], cost: 1+A
     14: start -> [2] : A'=0, [ B>=1 && A>=1 ], cost: 1+A
     15: start -> [2] : B'=0, [ B>=1 && 0>=A ], cost: 1+B


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


Computing complexity for remaining 3 transitions.

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

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


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

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