Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f1 : A'=100, [], cost: 1
      1: f1 -> f1 : A'=-1+A, [ A>=302 ], cost: 1
      2: f1 -> f1 : A'=-1+A, [ 300>=A ], cost: 1

Eliminating 2 self-loops for location f1
  Self-Loop 1 has the metering function: -301+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: f0
      0: f0 -> f1 : A'=100, [], cost: 1
      3: f1 -> [2] : A'=301, [ A>=302 ], cost: -301+A
      4: f1 -> [2] : [ 300>=A ], cost: INF


Applied chaining over branches and pruning:
  Start location: f0
      5: f0 -> [2] : A'=100, [ 300>=100 ], cost: INF


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


Computing complexity for remaining 1 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: 300>=100
  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,?)