NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f49_0_loop_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1>0 && arg2>-1 && arg2==arg1P_1 ], cost: 1
      1: f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P_2, arg2'=arg2P_2, [ -5*x5_1+arg1==0 && arg1>2 && arg1==arg1P_2 ], cost: 1
      3: f49_0_loop_LE -> f49_0_loop_LE\' : arg1'=arg1P_4, arg2'=arg2P_4, [ -5*x9_1+arg1>0 && arg1>2 && arg1==arg1P_4 ], cost: 1
      2: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1>2 && arg1-5*x7_1==0 && arg1-5*x7_1<5 && arg1-5*x7_1>=0 && arg1==arg1P_3 ], cost: 1
      4: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=arg1P_5, arg2'=arg2P_5, [ -5*x11_1+arg1>0 && -5*x11_1+arg1<5 && arg1>2 && -1+arg1==arg1P_5 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f49_0_loop_LE : arg1'=arg2, arg2'=arg2P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P_2, [ -5*x5_1+arg1==0 && arg1>2 ], cost: 1
      3: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P_4, [ -5*x9_1+arg1>0 && arg1>2 ], cost: 1
      2: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P_3, [ arg1>2 && arg1-5*x7_1==0 ], cost: 1
      4: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P_5, [ -5*x11_1+arg1>0 && -5*x11_1+arg1<5 && arg1>2 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
      1: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P_2, [ -5*x5_1+arg1==0 && arg1>2 ], cost: 1
      3: f49_0_loop_LE -> f49_0_loop_LE\' : arg2'=arg2P_4, [ -5*x9_1+arg1>0 && arg1>2 ], cost: 1
      2: f49_0_loop_LE\' -> f49_0_loop_LE : arg2'=arg2P_3, [ arg1>2 && arg1-5*x7_1==0 ], cost: 1
      4: f49_0_loop_LE\' -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P_5, [ -5*x11_1+arg1>0 && -5*x11_1+arg1<5 && arg1>2 ], cost: 1
      6: __init -> f49_0_loop_LE : arg1'=arg2P_6, arg2'=arg2P_1, [ arg1P_6>0 && arg2P_6>-1 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
      7: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P_3, [ -5*x5_1+arg1==0 && arg1>2 && arg1-5*x7_1==0 ], cost: 2
      8: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P_3, [ -5*x9_1+arg1>0 && arg1>2 && arg1-5*x7_1==0 ], cost: 2
      9: f49_0_loop_LE -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P_5, [ -5*x9_1+arg1>0 && arg1>2 && -5*x11_1+arg1>0 && -5*x11_1+arg1<5 ], cost: 2
      6: __init -> f49_0_loop_LE : arg1'=arg2P_6, arg2'=arg2P_1, [ arg1P_6>0 && arg2P_6>-1 ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      7: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P_3, [ -5*x5_1+arg1==0 && arg1>2 && arg1-5*x7_1==0 ], cost: 2
      8: f49_0_loop_LE -> f49_0_loop_LE : arg2'=arg2P_3, [ -5*x9_1+arg1>0 && arg1>2 && arg1-5*x7_1==0 ], cost: 2
      9: f49_0_loop_LE -> f49_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P_5, [ -5*x9_1+arg1>0 && arg1>2 && -5*x11_1+arg1>0 && -5*x11_1+arg1<5 ], cost: 2

   Accelerated rule 7 with non-termination, yielding the new rule 10.
   Accelerated rule 8 with non-termination, yielding the new rule 11.
   Accelerated rule 9 with backward acceleration, yielding the new rule 12.
   Accelerated rule 9 with backward acceleration, yielding the new rule 13.
   Accelerated rule 9 with backward acceleration, yielding the new rule 14.
[accelerate] Nesting with 3 inner and 1 outer candidates
   Removing the simple loops: 7 8 9.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     10: f49_0_loop_LE -> [4] : [ -5*x5_1+arg1==0 && arg1>2 && arg1-5*x7_1==0 ], cost: NONTERM
     11: f49_0_loop_LE -> [4] : [ -5*x9_1+arg1>0 && arg1>2 && arg1-5*x7_1==0 ], cost: NONTERM
     12: f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x9_1, arg2'=arg2P_5, [ -5*x11_1+arg1<5 && -5*x9_1+arg1>=1 && 1+5*x9_1>2 && 1+5*x9_1-5*x11_1>0 ], cost: -10*x9_1+2*arg1
     13: f49_0_loop_LE -> f49_0_loop_LE : arg1'=2, arg2'=arg2P_5, [ -5*x11_1+arg1<5 && -2+arg1>=1 && 3-5*x9_1>0 && 3-5*x11_1>0 ], cost: -4+2*arg1
     14: f49_0_loop_LE -> f49_0_loop_LE : arg1'=5*x11_1, arg2'=arg2P_5, [ -5*x11_1+arg1<5 && -5*x11_1+arg1>=1 && 1-5*x9_1+5*x11_1>0 && 1+5*x11_1>2 ], cost: -10*x11_1+2*arg1
      6: __init -> f49_0_loop_LE : arg1'=arg2P_6, arg2'=arg2P_1, [ arg1P_6>0 && arg2P_6>-1 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
      6: __init -> f49_0_loop_LE : arg1'=arg2P_6, arg2'=arg2P_1, [ arg1P_6>0 && arg2P_6>-1 ], cost: 2
     15: __init -> [4] : [ 5*x7_1>2 ], cost: NONTERM
     16: __init -> [4] : [ -5*x9_1+5*x7_1>0 && 5*x7_1>2 ], cost: NONTERM
     17: __init -> f49_0_loop_LE : arg1'=5*x9_1, arg2'=arg2P_5, [ arg2P_6>-1 && arg2P_6-5*x11_1<5 && arg2P_6-5*x9_1>=1 && 1+5*x9_1>2 && 1+5*x9_1-5*x11_1>0 ], cost: 2+2*arg2P_6-10*x9_1
     18: __init -> f49_0_loop_LE : arg1'=2, arg2'=arg2P_5, [ arg2P_6-5*x11_1<5 && -2+arg2P_6>=1 && 3-5*x9_1>0 && 3-5*x11_1>0 ], cost: -2+2*arg2P_6
     19: __init -> f49_0_loop_LE : arg1'=5*x11_1, arg2'=arg2P_5, [ arg2P_6>-1 && arg2P_6-5*x11_1<5 && arg2P_6-5*x11_1>=1 && 1-5*x9_1+5*x11_1>0 && 1+5*x11_1>2 ], cost: 2+2*arg2P_6-10*x11_1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     15: __init -> [4] : [ 5*x7_1>2 ], cost: NONTERM
     16: __init -> [4] : [ -5*x9_1+5*x7_1>0 && 5*x7_1>2 ], cost: NONTERM
     17: __init -> f49_0_loop_LE : arg1'=5*x9_1, arg2'=arg2P_5, [ arg2P_6>-1 && arg2P_6-5*x11_1<5 && arg2P_6-5*x9_1>=1 && 1+5*x9_1>2 && 1+5*x9_1-5*x11_1>0 ], cost: 2+2*arg2P_6-10*x9_1
     18: __init -> f49_0_loop_LE : arg1'=2, arg2'=arg2P_5, [ arg2P_6-5*x11_1<5 && -2+arg2P_6>=1 && 3-5*x9_1>0 && 3-5*x11_1>0 ], cost: -2+2*arg2P_6
     19: __init -> f49_0_loop_LE : arg1'=5*x11_1, arg2'=arg2P_5, [ arg2P_6>-1 && arg2P_6-5*x11_1<5 && arg2P_6-5*x11_1>=1 && 1-5*x9_1+5*x11_1>0 && 1+5*x11_1>2 ], cost: 2+2*arg2P_6-10*x11_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     15: __init -> [4] : [ 5*x7_1>2 ], cost: NONTERM
     16: __init -> [4] : [ -5*x9_1+5*x7_1>0 && 5*x7_1>2 ], cost: NONTERM
     17: __init -> f49_0_loop_LE : arg1'=5*x9_1, arg2'=arg2P_5, [ arg2P_6>-1 && arg2P_6-5*x11_1<5 && arg2P_6-5*x9_1>=1 && 1+5*x9_1>2 && 1+5*x9_1-5*x11_1>0 ], cost: 2+2*arg2P_6-10*x9_1
     18: __init -> f49_0_loop_LE : arg1'=2, arg2'=arg2P_5, [ arg2P_6-5*x11_1<5 && -2+arg2P_6>=1 && 3-5*x9_1>0 && 3-5*x11_1>0 ], cost: -2+2*arg2P_6
     19: __init -> f49_0_loop_LE : arg1'=5*x11_1, arg2'=arg2P_5, [ arg2P_6>-1 && arg2P_6-5*x11_1<5 && arg2P_6-5*x11_1>=1 && 1-5*x9_1+5*x11_1>0 && 1+5*x11_1>2 ], cost: 2+2*arg2P_6-10*x11_1

Computing asymptotic complexity for rule 15
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  [ 5*x7_1>2 ]

NO