Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f3
      1: f0 -> f0 : A'=1+A, C'=A, [ 9>=A ], cost: 1
      0: f0 -> f4 : B'=free, [ A>=10 ], cost: 1
      2: f1 -> f0 : A'=1, [ 9>=free_1 && A==0 ], cost: 1
      3: f2 -> f0 : A'=2, D'=2, [ 9>=A ], cost: 1
      4: f3 -> f0 : A'=0, [], cost: 1


Simplified the transitions:
  Start location: f3
      1: f0 -> f0 : A'=1+A, C'=A, [ 9>=A ], cost: 1
      4: f3 -> f0 : A'=0, [], cost: 1

Eliminating 1 self-loops for location f0
  Self-Loop 1 has the metering function: 10-A, resulting in the new transition 5.
  Removing the self-loops: 1.

Removed all Self-loops using metering functions (where possible):
  Start location: f3
      5: f0 -> [5] : A'=10, C'=9, [ 9>=A ], cost: 10-A
      4: f3 -> f0 : A'=0, [], cost: 1


Applied simple chaining:
  Start location: f3
      4: f3 -> [5] : A'=10, C'=9, [ 9>=0 ], cost: 11


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f3
      4: f3 -> [5] : A'=10, C'=9, [ 9>=0 ], cost: 11


Computing complexity for remaining 1 transitions.

Found new complexity const, because: const cost.


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

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

WORST_CASE(Omega(1),?)