Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f1 : [ A>=1 && 0>=1+B ], cost: 1
      1: f1 -> f1 : A'=-B+A, [ A>=1+B && 0>=1+B ], cost: 1

Eliminating 1 self-loops for location f1
  Self-Loop 1 has unbounded runtime, resulting in the new transition 2.
  Removing the self-loops: 1.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f0 -> f1 : [ A>=1 && 0>=1+B ], cost: 1
      2: f1 -> [2] : [ A>=1+B && 0>=1+B ], cost: INF


Applied simple chaining:
  Start location: f0
      0: f0 -> [2] : [ A>=1 && 0>=1+B && A>=1+B && 0>=1+B ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      0: f0 -> [2] : [ A>=1 && 0>=1+B && A>=1+B && 0>=1+B ], 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: A>=1 && 0>=1+B && A>=1+B && 0>=1+B
  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,?)