NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg2>-1 && -1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 && 1==arg3P_1 && arg2==arg4P_1 ], cost: 1
      1: f909_0_main_GE -> f1058_0_size_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_2>-1 ], cost: 1
      5: f909_0_main_GE -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4>2+arg3 && arg4>1+arg3 && arg4>-1 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg2P_6>6 && 4+arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      2: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>-1 && arg1P_3>-1 ], cost: 1
      3: f1058_0_size_NULL -> f1058_0_size_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && arg1P_4>-1 ], cost: 1
      4: f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg1P_5>-1 ], cost: 1
      6: __init -> f1_0_main_New : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      6: __init -> f1_0_main_New : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=1, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && -1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 ], cost: 1
      1: f909_0_main_GE -> f1058_0_size_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_2>-1 ], cost: 1
      5: f909_0_main_GE -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=4+arg3, [ arg4>2+arg3 && arg4>-1 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg2P_6>6 ], cost: 1
      2: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>-1 && arg1P_3>-1 ], cost: 1
      3: f1058_0_size_NULL -> f1058_0_size_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && arg1P_4>-1 ], cost: 1
      4: f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg1P_5>-1 ], cost: 1
      6: __init -> f1_0_main_New : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      5: f909_0_main_GE -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=4+arg3, [ arg4>2+arg3 && arg4>-1 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg2P_6>6 ], cost: 1

[test] deduced pseudo-invariant arg1P_6-arg2P_6<=0, also trying -arg1P_6+arg2P_6<=-1
   Accelerated rule 5 with backward acceleration, yielding the new rule 7.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f1058_0_size_NULL -> f1058_0_size_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && arg1P_4>-1 ], cost: 1

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

Accelerating simple loops of location 3.
   Accelerating the following rules:
      4: f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg1P_5>-1 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=1, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && -1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 ], cost: 1
      1: f909_0_main_GE -> f1058_0_size_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_2>-1 ], cost: 1
      5: f909_0_main_GE -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=4+arg3, [ arg4>2+arg3 && arg4>-1 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg2P_6>6 ], cost: 1
      7: f909_0_main_GE -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=4*k+arg3, [ arg4>-1 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg4>-2+4*k+arg3 ], cost: k
      2: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>-1 && arg1P_3>-1 ], cost: 1
      3: f1058_0_size_NULL -> f1058_0_size_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && arg1P_4>-1 ], cost: 1
      8: f1058_0_size_NULL -> [6] : [ arg1>0 && arg1P_4>0 ], cost: NONTERM
     10: f1058_0_size_NULL -> [6] : [ arg1>0 && arg1P_4>-1 && -arg1P_4+arg1<=0 ], cost: NONTERM
      4: f1097_0_outputList_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg1P_5>-1 ], cost: 1
     11: f1097_0_outputList_NULL -> [7] : [ arg1>0 && arg1P_5>0 ], cost: NONTERM
     13: f1097_0_outputList_NULL -> [7] : [ arg1>0 && arg1P_5>-1 && -arg1P_5+arg1<=0 ], cost: NONTERM
      6: __init -> f1_0_main_New : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=1, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && -1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 ], cost: 1
     14: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=5, arg4'=arg2, [ arg1>0 && arg2>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1 ], cost: 2
     15: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=1+4*k, arg4'=arg2, [ arg2>-1 && arg1>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2>-1+4*k && arg1P_6<=arg1 ], cost: 1+k
      1: f909_0_main_GE -> f1058_0_size_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_2>-1 ], cost: 1
     16: f909_0_main_GE -> f1058_0_size_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_4>-1 ], cost: 2
     17: f909_0_main_GE -> [6] : [ arg1>0 && arg4<=arg3 && arg2>0 ], cost: NONTERM
     18: f909_0_main_GE -> [6] : [ arg1>0 && arg4<=arg3 && arg2>0 ], cost: NONTERM
      2: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>-1 && arg1P_3>-1 ], cost: 1
     19: f1058_0_size_NULL -> f1097_0_outputList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>-1 && arg1P_5>-1 ], cost: 2
     20: f1058_0_size_NULL -> [7] : [ arg1>-1 ], cost: NONTERM
     21: f1058_0_size_NULL -> [7] : [ arg1>-1 ], cost: NONTERM
      6: __init -> f1_0_main_New : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=1, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && -1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 ], cost: 1
     14: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=5, arg4'=arg2, [ arg1>0 && arg2>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1 ], cost: 2
     15: f1_0_main_New -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=1+4*k, arg4'=arg2, [ arg2>-1 && arg1>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2>-1+4*k && arg1P_6<=arg1 ], cost: 1+k
      1: f909_0_main_GE -> f1058_0_size_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_2>-1 ], cost: 1
     16: f909_0_main_GE -> f1058_0_size_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_4>-1 ], cost: 2
     17: f909_0_main_GE -> [6] : [ arg1>0 && arg4<=arg3 && arg2>0 ], cost: NONTERM
     18: f909_0_main_GE -> [6] : [ arg1>0 && arg4<=arg3 && arg2>0 ], cost: NONTERM
     20: f1058_0_size_NULL -> [7] : [ arg1>-1 ], cost: NONTERM
     21: f1058_0_size_NULL -> [7] : [ arg1>-1 ], cost: NONTERM
      6: __init -> f1_0_main_New : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     17: f909_0_main_GE -> [6] : [ arg1>0 && arg4<=arg3 && arg2>0 ], cost: NONTERM
     18: f909_0_main_GE -> [6] : [ arg1>0 && arg4<=arg3 && arg2>0 ], cost: NONTERM
     25: f909_0_main_GE -> [7] : [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_2>-1 ], cost: NONTERM
     26: f909_0_main_GE -> [7] : [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_2>-1 ], cost: NONTERM
     27: f909_0_main_GE -> [7] : [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_4>-1 ], cost: NONTERM
     28: f909_0_main_GE -> [7] : [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_4>-1 ], cost: NONTERM
     22: __init -> f909_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=1, arg4'=arg2P_7, [ arg1P_1<=arg1P_7 && arg2P_7>-1 && -1+arg2P_1<=arg1P_7 && arg1P_7>0 && arg1P_1>0 && arg2P_1>1 ], cost: 2
     23: __init -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=5, arg4'=arg2P_7, [ arg1P_7>0 && arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 ], cost: 3
     24: __init -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=1+4*k, arg4'=arg2P_7, [ arg2P_7>-1 && arg1P_7>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2P_7>-1+4*k && arg1P_6<=arg1P_7 ], cost: 2+k

Merged rules:
   Start location: __init
     29: f909_0_main_GE -> [6] : [ arg1>0 && arg4<=arg3 && arg2>0 ], cost: NONTERM
     30: f909_0_main_GE -> [7] : [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_2>-1 ], cost: NONTERM
     31: f909_0_main_GE -> [7] : [ arg1>0 && arg4<=arg3 && arg2>0 && arg1P_4>-1 ], cost: NONTERM
     22: __init -> f909_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=1, arg4'=arg2P_7, [ arg1P_1<=arg1P_7 && arg2P_7>-1 && -1+arg2P_1<=arg1P_7 && arg1P_7>0 && arg1P_1>0 && arg2P_1>1 ], cost: 2
     23: __init -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=5, arg4'=arg2P_7, [ arg1P_7>0 && arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 ], cost: 3
     24: __init -> f909_0_main_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=1+4*k, arg4'=arg2P_7, [ arg2P_7>-1 && arg1P_7>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2P_7>-1+4*k && arg1P_6<=arg1P_7 ], cost: 2+k

Eliminated locations (on tree-shaped paths):
   Start location: __init
     32: __init -> [6] : [ arg1P_1<=arg1P_7 && arg2P_7>-1 && -1+arg2P_1<=arg1P_7 && arg1P_7>0 && arg1P_1>0 && arg2P_1>1 && arg2P_7<=1 ], cost: NONTERM
     33: __init -> [7] : [ arg1P_1<=arg1P_7 && arg2P_7>-1 && -1+arg2P_1<=arg1P_7 && arg1P_7>0 && arg1P_1>0 && arg2P_1>1 && arg2P_7<=1 && arg1P_2>-1 ], cost: NONTERM
     34: __init -> [7] : [ arg1P_1<=arg1P_7 && arg2P_7>-1 && -1+arg2P_1<=arg1P_7 && arg1P_7>0 && arg1P_1>0 && arg2P_1>1 && arg2P_7<=1 && arg1P_4>-1 ], cost: NONTERM
     35: __init -> [6] : [ arg1P_7>0 && arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 && arg2P_7<=5 ], cost: NONTERM
     36: __init -> [7] : [ arg1P_7>0 && arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 && arg2P_7<=5 && arg1P_2>-1 ], cost: NONTERM
     37: __init -> [7] : [ arg1P_7>0 && arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 && arg2P_7<=5 && arg1P_4>-1 ], cost: NONTERM
     38: __init -> [6] : [ arg2P_7>-1 && arg1P_7>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2P_7>-1+4*k && arg1P_6<=arg1P_7 && arg2P_7<=1+4*k ], cost: NONTERM
     39: __init -> [7] : [ arg2P_7>-1 && arg1P_7>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2P_7>-1+4*k && arg1P_6<=arg1P_7 && arg2P_7<=1+4*k && arg1P_2>-1 ], cost: NONTERM
     40: __init -> [7] : [ arg2P_7>-1 && arg1P_7>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2P_7>-1+4*k && arg1P_6<=arg1P_7 && arg2P_7<=1+4*k && arg1P_4>-1 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     32: __init -> [6] : [ arg1P_1<=arg1P_7 && arg2P_7>-1 && -1+arg2P_1<=arg1P_7 && arg1P_7>0 && arg1P_1>0 && arg2P_1>1 && arg2P_7<=1 ], cost: NONTERM
     33: __init -> [7] : [ arg1P_1<=arg1P_7 && arg2P_7>-1 && -1+arg2P_1<=arg1P_7 && arg1P_7>0 && arg1P_1>0 && arg2P_1>1 && arg2P_7<=1 && arg1P_2>-1 ], cost: NONTERM
     34: __init -> [7] : [ arg1P_1<=arg1P_7 && arg2P_7>-1 && -1+arg2P_1<=arg1P_7 && arg1P_7>0 && arg1P_1>0 && arg2P_1>1 && arg2P_7<=1 && arg1P_4>-1 ], cost: NONTERM
     35: __init -> [6] : [ arg1P_7>0 && arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 && arg2P_7<=5 ], cost: NONTERM
     36: __init -> [7] : [ arg1P_7>0 && arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 && arg2P_7<=5 && arg1P_2>-1 ], cost: NONTERM
     37: __init -> [7] : [ arg1P_7>0 && arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 && arg2P_7<=5 && arg1P_4>-1 ], cost: NONTERM
     38: __init -> [6] : [ arg2P_7>-1 && arg1P_7>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2P_7>-1+4*k && arg1P_6<=arg1P_7 && arg2P_7<=1+4*k ], cost: NONTERM
     39: __init -> [7] : [ arg2P_7>-1 && arg1P_7>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2P_7>-1+4*k && arg1P_6<=arg1P_7 && arg2P_7<=1+4*k && arg1P_2>-1 ], cost: NONTERM
     40: __init -> [7] : [ arg2P_7>-1 && arg1P_7>0 && arg1P_6>0 && arg2P_6>6 && arg1P_6-arg2P_6<=0 && k>=1 && arg2P_7>-1+4*k && arg1P_6<=arg1P_7 && arg2P_7<=1+4*k && arg1P_4>-1 ], cost: NONTERM

Computing asymptotic complexity for rule 35
   Simplified the guard:
     35: __init -> [6] : [ arg2P_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 && arg2P_7<=5 ], cost: NONTERM
   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_7>3 && arg1P_6>0 && arg2P_6>6 && arg1P_6<=arg1P_7 && arg2P_7<=5 ]

NO