Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f21 -> f29 : [ 0>=A ], cost: 1
      6: f21 -> f29 : A'=0, C'=free_5, H'=0, Q'=free_5, J'=free_5, [ A>=1 ], cost: 1
      3: f29 -> f41 : B'=free, [ A>=1 ], cost: 1
      4: f29 -> f41 : B'=free_2, D'=0, E'=free_1, F'=free_1, G'=free_1, [ 0>=A && 999+C>=free_1 ], cost: 1
      5: f29 -> f41 : A'=1, B'=free_4, D'=0, E'=free_3, F'=free_3, G'=free_3, [ 0>=A && free_3>=1000+C ], cost: 1
      1: f41 -> f41 : [], cost: 1
      2: f43 -> f46 : [], cost: 1
      7: f0 -> f21 : A'=1, L'=free_6, M'=K, [ 0>=K ], cost: 1
      8: f0 -> f21 : A'=1, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 ], cost: 1
      9: f0 -> f41 : A'=1, K'=free_10, L'=free_9, M'=0, N'=1, O'=free_10, P'=free_10, Q_1'=free_10, [ 0>=free_10 && K>=1 ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f21 -> f29 : [ 0>=A ], cost: 1
      6: f21 -> f29 : A'=0, C'=free_5, H'=0, Q'=free_5, J'=free_5, [ A>=1 ], cost: 1
      3: f29 -> f41 : B'=free, [ A>=1 ], cost: 1
      4: f29 -> f41 : B'=free_2, D'=0, E'=free_1, F'=free_1, G'=free_1, [ 0>=A && 999+C>=free_1 ], cost: 1
      5: f29 -> f41 : A'=1, B'=free_4, D'=0, E'=free_3, F'=free_3, G'=free_3, [ 0>=A && free_3>=1000+C ], cost: 1
      1: f41 -> f41 : [], cost: 1
      7: f0 -> f21 : A'=1, L'=free_6, M'=K, [ 0>=K ], cost: 1
      8: f0 -> f21 : A'=1, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 ], cost: 1
      9: f0 -> f41 : A'=1, K'=free_10, L'=free_9, M'=0, N'=1, O'=free_10, P'=free_10, Q_1'=free_10, [ 0>=free_10 && K>=1 ], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f21 -> f29 : [ 0>=A ], cost: 1
      6: f21 -> f29 : A'=0, C'=free_5, H'=0, Q'=free_5, J'=free_5, [ A>=1 ], cost: 1
      3: f29 -> f41 : B'=free, [ A>=1 ], cost: 1
      4: f29 -> f41 : B'=free_2, D'=0, E'=free_1, F'=free_1, G'=free_1, [ 0>=A && 999+C>=free_1 ], cost: 1
      5: f29 -> f41 : A'=1, B'=free_4, D'=0, E'=free_3, F'=free_3, G'=free_3, [ 0>=A && free_3>=1000+C ], cost: 1
     10: f41 -> [6] : [], cost: INF
      7: f0 -> f21 : A'=1, L'=free_6, M'=K, [ 0>=K ], cost: 1
      8: f0 -> f21 : A'=1, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 ], cost: 1
      9: f0 -> f41 : A'=1, K'=free_10, L'=free_9, M'=0, N'=1, O'=free_10, P'=free_10, Q_1'=free_10, [ 0>=free_10 && K>=1 ], cost: 1


Applied chaining over branches and pruning:
  Start location: f0
      3: f29 -> f41 : B'=free, [ A>=1 ], cost: 1
      4: f29 -> f41 : B'=free_2, D'=0, E'=free_1, F'=free_1, G'=free_1, [ 0>=A && 999+C>=free_1 ], cost: 1
      5: f29 -> f41 : A'=1, B'=free_4, D'=0, E'=free_3, F'=free_3, G'=free_3, [ 0>=A && free_3>=1000+C ], cost: 1
     10: f41 -> [6] : [], cost: INF
     11: f0 -> f29 : A'=0, C'=free_5, H'=0, Q'=free_5, J'=free_5, L'=free_6, M'=K, [ 0>=K && 1>=1 ], cost: 2
     12: f0 -> f29 : A'=0, C'=free_5, H'=0, Q'=free_5, J'=free_5, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 && 1>=1 ], cost: 2
      9: f0 -> f41 : A'=1, K'=free_10, L'=free_9, M'=0, N'=1, O'=free_10, P'=free_10, Q_1'=free_10, [ 0>=free_10 && K>=1 ], cost: 1


Applied chaining over branches and pruning:
  Start location: f0
     10: f41 -> [6] : [], cost: INF
      9: f0 -> f41 : A'=1, K'=free_10, L'=free_9, M'=0, N'=1, O'=free_10, P'=free_10, Q_1'=free_10, [ 0>=free_10 && K>=1 ], cost: 1
     13: f0 -> f41 : A'=0, B'=free_2, C'=free_5, D'=0, E'=free_1, F'=free_1, G'=free_1, H'=0, Q'=free_5, J'=free_5, L'=free_6, M'=K, [ 0>=K && 1>=1 && 0>=0 && 999+free_5>=free_1 ], cost: 3
     14: f0 -> f41 : A'=1, B'=free_4, C'=free_5, D'=0, E'=free_3, F'=free_3, G'=free_3, H'=0, Q'=free_5, J'=free_5, L'=free_6, M'=K, [ 0>=K && 1>=1 && 0>=0 && free_3>=1000+free_5 ], cost: 3
     15: f0 -> f41 : A'=0, B'=free_2, C'=free_5, D'=0, E'=free_1, F'=free_1, G'=free_1, H'=0, Q'=free_5, J'=free_5, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 && 1>=1 && 0>=0 && 999+free_5>=free_1 ], cost: 3
     16: f0 -> f41 : A'=1, B'=free_4, C'=free_5, D'=0, E'=free_3, F'=free_3, G'=free_3, H'=0, Q'=free_5, J'=free_5, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 && 1>=1 && 0>=0 && free_3>=1000+free_5 ], cost: 3


Applied chaining over branches and pruning:
  Start location: f0
     17: f0 -> [6] : A'=1, K'=free_10, L'=free_9, M'=0, N'=1, O'=free_10, P'=free_10, Q_1'=free_10, [ 0>=free_10 && K>=1 ], cost: INF
     18: f0 -> [6] : A'=0, B'=free_2, C'=free_5, D'=0, E'=free_1, F'=free_1, G'=free_1, H'=0, Q'=free_5, J'=free_5, L'=free_6, M'=K, [ 0>=K && 1>=1 && 0>=0 && 999+free_5>=free_1 ], cost: INF
     19: f0 -> [6] : A'=1, B'=free_4, C'=free_5, D'=0, E'=free_3, F'=free_3, G'=free_3, H'=0, Q'=free_5, J'=free_5, L'=free_6, M'=K, [ 0>=K && 1>=1 && 0>=0 && free_3>=1000+free_5 ], cost: INF
     20: f0 -> [6] : A'=0, B'=free_2, C'=free_5, D'=0, E'=free_1, F'=free_1, G'=free_1, H'=0, Q'=free_5, J'=free_5, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 && 1>=1 && 0>=0 && 999+free_5>=free_1 ], cost: INF
     21: f0 -> [6] : A'=1, B'=free_4, C'=free_5, D'=0, E'=free_3, F'=free_3, G'=free_3, H'=0, Q'=free_5, J'=free_5, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 && 1>=1 && 0>=0 && free_3>=1000+free_5 ], cost: INF


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
     17: f0 -> [6] : A'=1, K'=free_10, L'=free_9, M'=0, N'=1, O'=free_10, P'=free_10, Q_1'=free_10, [ 0>=free_10 && K>=1 ], cost: INF
     18: f0 -> [6] : A'=0, B'=free_2, C'=free_5, D'=0, E'=free_1, F'=free_1, G'=free_1, H'=0, Q'=free_5, J'=free_5, L'=free_6, M'=K, [ 0>=K && 1>=1 && 0>=0 && 999+free_5>=free_1 ], cost: INF
     19: f0 -> [6] : A'=1, B'=free_4, C'=free_5, D'=0, E'=free_3, F'=free_3, G'=free_3, H'=0, Q'=free_5, J'=free_5, L'=free_6, M'=K, [ 0>=K && 1>=1 && 0>=0 && free_3>=1000+free_5 ], cost: INF
     20: f0 -> [6] : A'=0, B'=free_2, C'=free_5, D'=0, E'=free_1, F'=free_1, G'=free_1, H'=0, Q'=free_5, J'=free_5, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 && 1>=1 && 0>=0 && 999+free_5>=free_1 ], cost: INF
     21: f0 -> [6] : A'=1, B'=free_4, C'=free_5, D'=0, E'=free_3, F'=free_3, G'=free_3, H'=0, Q'=free_5, J'=free_5, K'=free_8, L'=free_7, M'=0, N'=1, O'=free_8, P'=free_8, Q_1'=free_8, [ free_8>=1 && K>=1 && 1>=1 && 0>=0 && free_3>=1000+free_5 ], cost: INF


Computing complexity for remaining 5 transitions.

Found new complexity INF, because: INF sat.


The final runtime is determined by this resulting transition:
  Final Guard: 0>=free_10 && K>=1
  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,?)