Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f300
      0: f300 -> f3 : [], cost: 1
      1: f3 -> f3 : A'=-1+A, [ A>=2 ], cost: 1
      2: f3 -> f3 : A'=-1+A, [ 1>=A ], cost: 1

Eliminating 2 self-loops for location f3
  Self-Loop 1 has the metering function: -1+A, resulting in the new transition 3.
  Self-Loop 2 has unbounded runtime, resulting in the new transition 4.
  Removing the self-loops: 1 2.

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


Applied chaining over branches and pruning:
  Start location: f300
      5: f300 -> [2] : A'=1, [ A>=2 ], cost: A
      6: f300 -> [2] : [ 1>=A ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f300
      5: f300 -> [2] : A'=1, [ A>=2 ], cost: A
      6: f300 -> [2] : [ 1>=A ], cost: INF


Computing complexity for remaining 2 transitions.

  Found configuration with infinitely models for cost: A
  and guard: A>=2:
  A: Pos

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

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: 1>=A
  Final Cost:  INF

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

WORST_CASE(INF,?)