Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f3
      0: f2 -> f2 : A'=-1+A, [ A>=31 ], cost: 1
      1: f2 -> f300 : B'=-1+B, [ 30>=A ], cost: 1
      2: f300 -> f2 : [ B>=21 ], cost: 1
      3: f300 -> f1 : C'=free, [ 20>=B ], cost: 1
      4: f3 -> f300 : [], cost: 1


Simplified the transitions:
  Start location: f3
      0: f2 -> f2 : A'=-1+A, [ A>=31 ], cost: 1
      1: f2 -> f300 : B'=-1+B, [ 30>=A ], cost: 1
      2: f300 -> f2 : [ B>=21 ], cost: 1
      4: f3 -> f300 : [], cost: 1

Eliminating 1 self-loops for location f2
  Self-Loop 0 has the metering function: -30+A, resulting in the new transition 5.
  Removing the self-loops: 0.

Removed all Self-loops using metering functions (where possible):
  Start location: f3
      5: f2 -> [4] : A'=30, [ A>=31 ], cost: -30+A
      2: f300 -> f2 : [ B>=21 ], cost: 1
      4: f3 -> f300 : [], cost: 1
      1: [4] -> f300 : B'=-1+B, [ 30>=A ], cost: 1


Applied simple chaining:
  Start location: f3
      2: f300 -> f300 : A'=30, B'=-1+B, [ B>=21 && A>=31 && 30>=30 ], cost: -28+A
      4: f3 -> f300 : [], cost: 1

Eliminating 1 self-loops for location f300
  Removing the self-loops: 2.
Adding an epsilon transition (to model nonexecution of the loops): 7.

Removed all Self-loops using metering functions (where possible):
  Start location: f3
      6: f300 -> [5] : A'=30, B'=-1+B, [ B>=21 && A>=31 ], cost: -28+A
      7: f300 -> [5] : [], cost: 0
      4: f3 -> f300 : [], cost: 1


Applied chaining over branches and pruning:
  Start location: f3
      8: f3 -> [5] : A'=30, B'=-1+B, [ B>=21 && A>=31 ], cost: -27+A


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f3
      8: f3 -> [5] : A'=30, B'=-1+B, [ B>=21 && A>=31 ], cost: -27+A


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: -27+A
  and guard: B>=21 && A>=31:
  B: Pos, A: Pos

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


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