WORST_CASE(INF,?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, [ arg2<=arg1 && arg2>0 && arg1>0 && arg2==arg1P_2 && arg1==arg2P_2 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>arg1 && arg2>0 && arg1>0 && arg1==arg1P_3 && arg2==arg2P_3 ], cost: 1
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, [ 0==arg2 && 0==arg1P_4 && arg1==arg2P_4 ], cost: 1
      4: f194_0_main_LE -> f194_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, [ arg2>0 && arg1==arg1P_5 && -1+arg2==arg2P_5 ], cost: 1
      5: f209_0_main_LE -> f142_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, [ 0==arg2 && arg1==arg1P_6 && 0==arg2P_6 ], cost: 1
      6: f209_0_main_LE -> f209_0_main_LE : arg1'=arg1P_7, arg2'=arg2P_7, [ arg2>0 && arg1==arg1P_7 && -1+arg2==arg2P_7 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=arg1, [ arg2<=arg1 && arg2>0 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg1, [ 0==arg2 ], cost: 1
      4: f194_0_main_LE -> f194_0_main_LE : arg2'=-1+arg2, [ arg2>0 ], cost: 1
      5: f209_0_main_LE -> f142_0_main_LE : arg2'=0, [ 0==arg2 ], cost: 1
      6: f209_0_main_LE -> f209_0_main_LE : arg2'=-1+arg2, [ arg2>0 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      4: f194_0_main_LE -> f194_0_main_LE : arg2'=-1+arg2, [ arg2>0 ], cost: 1

   Accelerated rule 4 with metering function arg2, yielding the new rule 8.
   Removing the simple loops: 4.

Accelerating simple loops of location 3.
   Accelerating the following rules:
      6: f209_0_main_LE -> f209_0_main_LE : arg2'=-1+arg2, [ arg2>0 ], cost: 1

   Accelerated rule 6 with metering function arg2, yielding the new rule 9.
   Removing the simple loops: 6.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=arg1, [ arg2<=arg1 && arg2>0 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg1, [ 0==arg2 ], cost: 1
      8: f194_0_main_LE -> f194_0_main_LE : arg2'=0, [ arg2>0 ], cost: arg2
      5: f209_0_main_LE -> f142_0_main_LE : arg2'=0, [ 0==arg2 ], cost: 1
      9: f209_0_main_LE -> f209_0_main_LE : arg2'=0, [ arg2>0 ], cost: arg2
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=arg1, [ arg2<=arg1 && arg2>0 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1
     10: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=0, [ arg2<=arg1 && arg2>0 && arg1>0 ], cost: 1+arg1
     11: f142_0_main_LE -> f209_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1+arg2
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg1, [ 0==arg2 ], cost: 1
      5: f209_0_main_LE -> f142_0_main_LE : arg2'=0, [ 0==arg2 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      1: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=arg1, [ arg2<=arg1 && arg2>0 ], cost: 1
      2: f142_0_main_LE -> f209_0_main_LE : [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1
     10: f142_0_main_LE -> f194_0_main_LE : arg1'=arg2, arg2'=0, [ arg2<=arg1 && arg2>0 && arg1>0 ], cost: 1+arg1
     11: f142_0_main_LE -> f209_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 1+arg2
      3: f194_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg1, [ 0==arg2 ], cost: 1
      5: f209_0_main_LE -> f142_0_main_LE : arg2'=0, [ 0==arg2 ], cost: 1
     12: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_8>-1 && arg2P_1>-1 && arg1P_8>0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     13: f142_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=arg2, [ arg2<=arg1 && arg2>0 && arg1>0 ], cost: 2+arg1
     14: f142_0_main_LE -> f142_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 2+arg2
     12: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_8>-1 && arg2P_1>-1 && arg1P_8>0 ], cost: 2

Accelerating simple loops of location 1.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     13: f142_0_main_LE -> f142_0_main_LE : arg1'=0, [ arg2<=arg1 && arg2>0 && arg1>0 ], cost: 2+arg1
     14: f142_0_main_LE -> f142_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 2+arg2

   Accelerated rule 13 with NONTERM (after strengthening guard), yielding the new rule 15.
   Accelerated rule 14 with NONTERM (after strengthening guard), yielding the new rule 16.
   Removing the simple loops:.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     13: f142_0_main_LE -> f142_0_main_LE : arg1'=0, [ arg2<=arg1 && arg2>0 && arg1>0 ], cost: 2+arg1
     14: f142_0_main_LE -> f142_0_main_LE : arg2'=0, [ arg2>arg1 && arg2>0 && arg1>0 ], cost: 2+arg2
     15: f142_0_main_LE -> [7] : [ arg2<=arg1 && arg2>0 && arg1>0 && arg2<=0 ], cost: NONTERM
     16: f142_0_main_LE -> [7] : [ arg2>arg1 && arg2>0 && arg1>0 && 0>arg1 ], cost: NONTERM
     12: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_8>-1 && arg2P_1>-1 && arg1P_8>0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     12: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2P_8>-1 && arg2P_1>-1 && arg1P_8>0 ], cost: 2
     17: __init -> f142_0_main_LE : arg1'=0, arg2'=arg2P_1, [ arg2P_1<=arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg1P_1
     18: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=0, [ arg2P_1>arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg2P_1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     17: __init -> f142_0_main_LE : arg1'=0, arg2'=arg2P_1, [ arg2P_1<=arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg1P_1
     18: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=0, [ arg2P_1>arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg2P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     17: __init -> f142_0_main_LE : arg1'=0, arg2'=arg2P_1, [ arg2P_1<=arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg1P_1
     18: __init -> f142_0_main_LE : arg1'=arg1P_1, arg2'=0, [ arg2P_1>arg1P_1 && arg2P_1>0 && arg1P_1>0 ], cost: 4+arg2P_1

Computing asymptotic complexity for rule 17
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      arg2P_1 (+/+!), 1-arg2P_1+arg1P_1 (+/+!), 4+arg1P_1 (+) [not solved]

      removing all constraints (solved by SMT)
      resulting limit problem: [solved]

      applying transformation rule (C) using substitution {arg2P_1==n,arg1P_1==2*n}
      resulting limit problem:
      [solved]

   Solution:
      arg2P_1 / n
      arg1P_1 / 2*n
   Resulting cost 4+2*n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 4+2*n
   Rule cost:   4+arg1P_1
   Rule guard:  [ arg2P_1<=arg1P_1 && arg2P_1>0 ]

WORST_CASE(INF,?)