Trying to load file: main.koat

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

Eliminating 1 self-loops for location eval2
  Self-Loop 1 has the metering function: -B+C, 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+B ], cost: 1
      4: eval2 -> [3] : C'=B, [ A>=1+B && C>=1+B ], cost: -B+C
      3: start -> eval1 : [], cost: 1
      2: [3] -> eval1 : A'=-1+A, [ A>=1+B && B>=C ], cost: 1


Applied simple chaining:
  Start location: start
      0: eval1 -> eval1 : A'=-1+A, C'=B, [ A>=1+B && A>=1+B && C>=1+B && A>=1+B && B>=B ], cost: 2-B+C
      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, C'=B, [ A>=1+B && C>=1+B ], cost: 2-B+C
      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, C'=B, [ A>=1+B && C>=1+B ], cost: 3-B+C


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


Computing complexity for remaining 1 transitions.

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

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
  Final Cost:  3-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),?)