NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f162_0_main_LT : arg1'=arg1P_1, arg2'=arg2P_1, [ arg2P_1>-1 && arg2>1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f162_0_main_LT -> f162_0_main_LT : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>-1 && arg2>-1 && arg2<=arg1 && -arg2+arg1>0 && -1+arg1==arg1P_2 && arg2==arg2P_2 ], cost: 1
      2: f162_0_main_LT -> f162_0_main_LT : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1>-1 && arg2>-1 && arg2<=arg1 && -arg2+arg1==0 && 2*arg1>=0 && 1+2*arg1==arg1P_3 && 1+arg2==arg2P_3 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f162_0_main_LT : arg1'=arg1P_1, arg2'=arg2P_1, [ arg2P_1>-1 && arg2>1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f162_0_main_LT -> f162_0_main_LT : arg1'=-1+arg1, [ arg2>-1 && -arg2+arg1>0 ], cost: 1
      2: f162_0_main_LT -> f162_0_main_LT : arg1'=1+2*arg1, arg2'=1+arg2, [ arg2>-1 && -arg2+arg1==0 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f162_0_main_LT -> f162_0_main_LT : arg1'=-1+arg1, [ arg2>-1 && -arg2+arg1>0 ], cost: 1
      2: f162_0_main_LT -> f162_0_main_LT : arg1'=1+2*arg1, arg2'=1+arg2, [ arg2>-1 && -arg2+arg1==0 ], cost: 1

   Accelerated rule 1 with backward acceleration, yielding the new rule 4.
   Failed to prove monotonicity of the guard of rule 2.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Nested simple loops 2 (outer loop) and 4 (inner loop) with Rule(1 | arg2>-1, -arg2+arg1>=0, | NONTERM || 3 | ), resulting in the new rules: 5, 6.
   Removing the simple loops: 1 2.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f162_0_main_LT : arg1'=arg1P_1, arg2'=arg2P_1, [ arg2P_1>-1 && arg2>1 && arg1P_1>-1 && arg1>0 ], cost: 1
      4: f162_0_main_LT -> f162_0_main_LT : arg1'=arg2, [ arg2>-1 && -arg2+arg1>=0 ], cost: -arg2+arg1
      5: f162_0_main_LT -> [3] : [ arg2>-1 && -arg2+arg1>=0 ], cost: NONTERM
      6: f162_0_main_LT -> [3] : [ arg2>-1 && -arg2+arg1==0 && -arg2+2*arg1>=0 ], cost: NONTERM
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f162_0_main_LT : arg1'=arg1P_1, arg2'=arg2P_1, [ arg2P_1>-1 && arg2>1 && arg1P_1>-1 && arg1>0 ], cost: 1
      7: f1_0_main_Load -> f162_0_main_LT : arg1'=arg2P_1, arg2'=arg2P_1, [ arg2P_1>-1 && arg2>1 && arg1P_1>-1 && arg1>0 && arg1P_1-arg2P_1>=0 ], cost: 1+arg1P_1-arg2P_1
      8: f1_0_main_Load -> [3] : [ arg2>1 && arg1>0 ], cost: NONTERM
      9: f1_0_main_Load -> [3] : [ arg2>1 && arg1>0 ], cost: NONTERM
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      7: f1_0_main_Load -> f162_0_main_LT : arg1'=arg2P_1, arg2'=arg2P_1, [ arg2P_1>-1 && arg2>1 && arg1P_1>-1 && arg1>0 && arg1P_1-arg2P_1>=0 ], cost: 1+arg1P_1-arg2P_1
      8: f1_0_main_Load -> [3] : [ arg2>1 && arg1>0 ], cost: NONTERM
      9: f1_0_main_Load -> [3] : [ arg2>1 && arg1>0 ], cost: NONTERM
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     10: __init -> f162_0_main_LT : arg1'=arg2P_1, arg2'=arg2P_1, [ arg2P_1>-1 && arg2P_4>1 && arg1P_1>-1 && arg1P_4>0 && arg1P_1-arg2P_1>=0 ], cost: 2+arg1P_1-arg2P_1
     11: __init -> [3] : [ arg2P_4>1 && arg1P_4>0 ], cost: NONTERM
     12: __init -> [3] : [ arg2P_4>1 && arg1P_4>0 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     10: __init -> f162_0_main_LT : arg1'=arg2P_1, arg2'=arg2P_1, [ arg2P_1>-1 && arg2P_4>1 && arg1P_1>-1 && arg1P_4>0 && arg1P_1-arg2P_1>=0 ], cost: 2+arg1P_1-arg2P_1
     12: __init -> [3] : [ arg2P_4>1 && arg1P_4>0 ], cost: NONTERM

Computing asymptotic complexity for rule 12
   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:  [ arg2P_4>1 && arg1P_4>0 ]

NO