Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f300
      0: f5 -> f5 : A'=-1+A, [ A>=1 ], cost: 1
      1: f5 -> f1 : B'=free, [ 0>=A ], cost: 1
      2: f300 -> f5 : A'=-1+A, [ A>=1 ], cost: 1
      3: f300 -> f1 : B'=free_1, [ 0>=A ], cost: 1


Simplified the transitions:
  Start location: f300
      0: f5 -> f5 : A'=-1+A, [ A>=1 ], cost: 1
      2: f300 -> f5 : A'=-1+A, [ A>=1 ], cost: 1

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

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


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


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


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: A
  and guard: A>=1 && -1+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 && -1+A>=1
  Final Cost:  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),?)