Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f4 -> f5 : [ 0>=1+free ], cost: 1
      1: f4 -> f5 : [], cost: 1
      4: f4 -> f11 : [], cost: 1
      5: f5 -> f4 : A'=1+A, [ 2>=A ], cost: 1
      3: f5 -> f11 : [ A>=3 ], cost: 1
      2: f0 -> f4 : A'=0, [], cost: 1
      6: f11 -> f14 : [ 1>=A ], cost: 1
      7: f11 -> f14 : [ A>=2 ], cost: 1

Removing duplicate transition: 0.

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


Applied simple chaining:
  Start location: f0
      1: f4 -> f4 : A'=1+A, [ 2>=A ], cost: 2
      2: f0 -> f4 : A'=0, [], cost: 1

Eliminating 1 self-loops for location f4
  Self-Loop 1 has the metering function: 3-A, resulting in the new transition 8.
  Removing the self-loops: 1.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      8: f4 -> [5] : A'=3, [ 2>=A ], cost: 6-2*A
      2: f0 -> f4 : A'=0, [], cost: 1


Applied simple chaining:
  Start location: f0
      2: f0 -> [5] : A'=3, [ 2>=0 ], cost: 7


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      2: f0 -> [5] : A'=3, [ 2>=0 ], cost: 7


Computing complexity for remaining 1 transitions.

Found new complexity const, because: const cost.


The final runtime is determined by this resulting transition:
  Final Guard: 2>=0
  Final Cost:  7

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: const
  Complexity value: 0

WORST_CASE(Omega(1),?)