NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_New -> f81_0_loop_InvokeMethod : arg1'=arg1P_1, [ arg1P_1>-1 ], cost: 1
      1: f81_0_loop_InvokeMethod -> f81_0_loop_InvokeMethod : arg1'=arg1P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      2: __init -> f1_0_main_New : arg1'=arg1P_3, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      2: __init -> f1_0_main_New : arg1'=arg1P_3, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f81_0_loop_InvokeMethod -> f81_0_loop_InvokeMethod : arg1'=arg1P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1

[test] deduced pseudo-invariant -arg1P_2+arg1<=0, also trying arg1P_2-arg1<=-1
   Accelerated rule 1 with non-termination, yielding the new rule 3.
   Accelerated rule 1 with non-termination, yielding the new rule 4.
   Accelerated rule 1 with backward acceleration, yielding the new rule 5.
[accelerate] Nesting with 0 inner and 1 outer candidates
   Also removing duplicate rules: 4.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_New -> f81_0_loop_InvokeMethod : arg1'=arg1P_1, [ arg1P_1>-1 ], cost: 1
      1: f81_0_loop_InvokeMethod -> f81_0_loop_InvokeMethod : arg1'=arg1P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      3: f81_0_loop_InvokeMethod -> [3] : [ arg1>0 && arg1P_2>0 ], cost: NONTERM
      5: f81_0_loop_InvokeMethod -> [3] : [ arg1>0 && arg1P_2>-1 && -arg1P_2+arg1<=0 ], cost: NONTERM
      2: __init -> f1_0_main_New : arg1'=arg1P_3, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_New -> f81_0_loop_InvokeMethod : arg1'=arg1P_1, [ arg1P_1>-1 ], cost: 1
      6: f1_0_main_New -> f81_0_loop_InvokeMethod : arg1'=arg1P_2, [ arg1P_2>-1 ], cost: 2
      7: f1_0_main_New -> [3] : [], cost: NONTERM
      8: f1_0_main_New -> [3] : [], cost: NONTERM
      2: __init -> f1_0_main_New : arg1'=arg1P_3, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      7: f1_0_main_New -> [3] : [], cost: NONTERM
      8: f1_0_main_New -> [3] : [], cost: NONTERM
      2: __init -> f1_0_main_New : arg1'=arg1P_3, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
      9: __init -> [3] : [], cost: NONTERM
     10: __init -> [3] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     10: __init -> [3] : [], cost: NONTERM

Computing asymptotic complexity for rule 10
   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:  []

NO