Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: evalfstart
      0: evalfstart -> evalfentryin : [], cost: 1
      1: evalfentryin -> evalfbb3in : A'=0, B'=0, [], cost: 1
      2: evalfbb3in -> evalfbbin : [ 99>=B ], cost: 1
      3: evalfbb3in -> evalfreturnin : [ B>=100 ], cost: 1
      4: evalfbbin -> evalfbb1in : [ C>=1+A ], cost: 1
      5: evalfbbin -> evalfbb2in : [ A>=C ], cost: 1
      8: evalfreturnin -> evalfstop : [], cost: 1
      6: evalfbb1in -> evalfbb3in : A'=1+A, [], cost: 1
      7: evalfbb2in -> evalfbb3in : B'=1+B, [], cost: 1


Simplified the transitions:
  Start location: evalfstart
      0: evalfstart -> evalfentryin : [], cost: 1
      1: evalfentryin -> evalfbb3in : A'=0, B'=0, [], cost: 1
      2: evalfbb3in -> evalfbbin : [ 99>=B ], cost: 1
      4: evalfbbin -> evalfbb1in : [ C>=1+A ], cost: 1
      5: evalfbbin -> evalfbb2in : [ A>=C ], cost: 1
      6: evalfbb1in -> evalfbb3in : A'=1+A, [], cost: 1
      7: evalfbb2in -> evalfbb3in : B'=1+B, [], cost: 1


Applied simple chaining:
  Start location: evalfstart
      0: evalfstart -> evalfbb3in : A'=0, B'=0, [], cost: 2
      2: evalfbb3in -> evalfbbin : [ 99>=B ], cost: 1
      4: evalfbbin -> evalfbb3in : A'=1+A, [ C>=1+A ], cost: 2
      5: evalfbbin -> evalfbb3in : B'=1+B, [ A>=C ], cost: 2


Applied chaining over branches and pruning:
  Start location: evalfstart
      0: evalfstart -> evalfbb3in : A'=0, B'=0, [], cost: 2
      9: evalfbb3in -> evalfbb3in : A'=1+A, [ 99>=B && C>=1+A ], cost: 3
     10: evalfbb3in -> evalfbb3in : B'=1+B, [ 99>=B && A>=C ], cost: 3

Eliminating 2 self-loops for location evalfbb3in
  Self-Loop 9 has the metering function: C-A, resulting in the new transition 11.
  Self-Loop 10 has the metering function: 100-B, resulting in the new transition 12.
  Found this metering function when nesting loops: -1+C-A,
  Removing the self-loops: 9 10.

Removed all Self-loops using metering functions (where possible):
  Start location: evalfstart
      0: evalfstart -> evalfbb3in : A'=0, B'=0, [], cost: 2
     11: evalfbb3in -> [8] : A'=C, [ 99>=B && C>=1+A ], cost: 3*C-3*A
     12: evalfbb3in -> [8] : B'=100, [ 99>=B && A>=C ], cost: 300-3*B


Applied chaining over branches and pruning:
  Start location: evalfstart
     13: evalfstart -> [8] : A'=C, B'=0, [ 99>=0 && C>=1 ], cost: 2+3*C


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: evalfstart
     13: evalfstart -> [8] : A'=C, B'=0, [ 99>=0 && C>=1 ], cost: 2+3*C


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 2+3*C
  and guard: 99>=0 && C>=1:
  C: Pos

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


The final runtime is determined by this resulting transition:
  Final Guard: 99>=0 && C>=1
  Final Cost:  2+3*C

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

WORST_CASE(Omega(n^1),?)