Trying to load file: main.koat

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

Eliminating 1 self-loops for location eval
  Self-Loop 2 has the metering function: -B+C, resulting in the new transition 5.
  Self-Loop 3 has the metering function: -B+A, resulting in the new transition 6.
  Removing the self-loops: 0 2 3.
Adding an epsilon transition (to model nonexecution of the loops): 7.

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


Applied chaining over branches and pruning:
  Start location: start
      9: start -> [2] : A'=B-C+A, C'=B, [ A>=1+B && C>=1+B && A>C ], cost: 1-B+C
     10: start -> [2] : A'=B, C'=B+C-A, [ A>=1+B && C>=1+B && C>A ], cost: 1-B+A


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


Computing complexity for remaining 2 transitions.

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

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


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

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