Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: start
      0: start -> a : [ A>=1 ], cost: 1
      1: start -> a : [ A>=2 ], cost: 1
      2: start -> a : [ A>=4 ], cost: 1
      3: a -> a : A'=free, [ 2*free>=2 && A==2*free ], cost: 1
      4: a -> a : A'=free_1, [ 2*free_1>=1 && A==1+2*free_1 ], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: start
      0: start -> a : [ A>=1 ], cost: 1
      1: start -> a : [ A>=2 ], cost: 1
      2: start -> a : [ A>=4 ], cost: 1
      5: a -> [2] : A'=free, [ 2*free>=2 && A==2*free ], cost: 1
      6: a -> [2] : A'=free_1, [ 2*free_1>=1 && A==1+2*free_1 ], cost: 1
      7: a -> [2] : [], cost: 0


Applied chaining over branches and pruning:
  Start location: start
    <empty>


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: start
    <empty>


Computing complexity for remaining 0 transitions.


The final runtime is determined by this resulting transition:
  Final Guard: 
  Final Cost:  1

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

WORST_CASE(Omega(1),?)