Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f3
      0: f2 -> f2 : B'=-1+B, [ 29>=A ], cost: 1
      1: f2 -> f300 : B'=-1+B, [ A>=30 ], cost: 1
      2: f300 -> f2 : [ 19>=B ], cost: 1
      3: f300 -> f1 : C'=free, [ B>=20 ], cost: 1
      4: f3 -> f300 : [], cost: 1


Simplified the transitions:
  Start location: f3
      0: f2 -> f2 : B'=-1+B, [ 29>=A ], cost: 1
      1: f2 -> f300 : B'=-1+B, [ A>=30 ], cost: 1
      2: f300 -> f2 : [ 19>=B ], cost: 1
      4: f3 -> f300 : [], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f3
      5: f2 -> [4] : [ 29>=A ], cost: INF
      2: f300 -> f2 : [ 19>=B ], cost: 1
      4: f3 -> f300 : [], cost: 1
      1: [4] -> f300 : B'=-1+B, [ A>=30 ], cost: 1


Applied simple chaining:
  Start location: f3
      2: f300 -> [4] : [ 19>=B && 29>=A ], cost: INF
      4: f3 -> f300 : [], cost: 1
      1: [4] -> f300 : B'=-1+B, [ A>=30 ], cost: 1


Applied chaining over branches and pruning:
  Start location: f3
      6: f300 -> [5] : [ 19>=B && 29>=A ], cost: INF
      4: f3 -> f300 : [], cost: 1


Applied simple chaining:
  Start location: f3
      4: f3 -> [5] : [ 19>=B && 29>=A ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f3
      4: f3 -> [5] : [ 19>=B && 29>=A ], 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: 19>=B && 29>=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,?)