NO

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

Initial linear ITS problem
   Start location: __init
      0: f269_0_createMetaList_Return -> f462_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && -1+arg1P_1<=arg2 && arg2P_1<=arg2 && arg1>0 && arg2>-1 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
      2: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ x9_1>0 && x13_1>0 && arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 ], cost: 1
      1: f1_0_main_Load -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f703_0_createMetaList_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2>-1 && arg2P_4>-1 && arg1>0 && 0==arg1P_4 && 1==arg3P_4 ], cost: 1
      7: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && x31_1>0 && arg1>1 && arg1P_8>-1 ], cost: 1
      8: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ 2+arg1P_9<=arg1 && x35_1>0 && arg1>2 && arg1P_9>-1 ], cost: 1
      9: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10<=arg1 && x39_1>0 && arg1>2 && arg1P_10>0 ], cost: 1
      4: f703_0_createMetaList_GE -> f922_0_createMetaList_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3P_5>-1 && arg2>arg1 && arg3>0 && arg2==arg1P_5 && arg1==arg2P_5 && 1+arg3==arg4P_5 ], cost: 1
      5: f922_0_createMetaList_LE -> f703_0_createMetaList_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ 0==arg3 && 1+arg2==arg1P_6 && arg1==arg2P_6 && arg4==arg3P_6 ], cost: 1
      6: f922_0_createMetaList_LE -> f922_0_createMetaList_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3>0 && arg1==arg1P_7 && arg2==arg2P_7 && -1+arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      2: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ x9_1>0 && x13_1>0 && arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 ], cost: 1
      1: f1_0_main_Load -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f703_0_createMetaList_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2>-1 && arg2P_4>-1 && arg1>0 && 0==arg1P_4 && 1==arg3P_4 ], cost: 1
      7: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && x31_1>0 && arg1>1 && arg1P_8>-1 ], cost: 1
      8: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ 2+arg1P_9<=arg1 && x35_1>0 && arg1>2 && arg1P_9>-1 ], cost: 1
      9: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10<=arg1 && x39_1>0 && arg1>2 && arg1P_10>0 ], cost: 1
      4: f703_0_createMetaList_GE -> f922_0_createMetaList_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3P_5>-1 && arg2>arg1 && arg3>0 && arg2==arg1P_5 && arg1==arg2P_5 && 1+arg3==arg4P_5 ], cost: 1
      5: f922_0_createMetaList_LE -> f703_0_createMetaList_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ 0==arg3 && 1+arg2==arg1P_6 && arg1==arg2P_6 && arg4==arg3P_6 ], cost: 1
      6: f922_0_createMetaList_LE -> f922_0_createMetaList_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3>0 && arg1==arg1P_7 && arg2==arg2P_7 && -1+arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      2: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 ], cost: 1
      1: f1_0_main_Load -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f703_0_createMetaList_GE : arg1'=0, arg2'=arg2P_4, arg3'=1, arg4'=arg4P_4, [ arg2>-1 && arg2P_4>-1 && arg1>0 ], cost: 1
      7: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && arg1>1 && arg1P_8>-1 ], cost: 1
      8: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ 2+arg1P_9<=arg1 && arg1>2 && arg1P_9>-1 ], cost: 1
      9: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10<=arg1 && arg1>2 && arg1P_10>0 ], cost: 1
      4: f703_0_createMetaList_GE -> f922_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=arg3P_5, arg4'=1+arg3, [ arg3P_5>-1 && arg2>arg1 && arg3>0 ], cost: 1
      5: f922_0_createMetaList_LE -> f703_0_createMetaList_GE : arg1'=1+arg2, arg2'=arg1, arg3'=arg4, arg4'=arg4P_6, [ 0==arg3 ], cost: 1
      6: f922_0_createMetaList_LE -> f922_0_createMetaList_LE : arg3'=-1+arg3, [ arg3>0 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 3.
   Accelerating the following rules:
      7: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && arg1>1 && arg1P_8>-1 ], cost: 1
      8: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ 2+arg1P_9<=arg1 && arg1>2 && arg1P_9>-1 ], cost: 1
      9: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10<=arg1 && arg1>2 && arg1P_10>0 ], cost: 1

   Failed to prove monotonicity of the guard of rule 7.
   Failed to prove monotonicity of the guard of rule 8.
   Accelerated rule 9 with non-termination, yielding the new rule 11.
   Accelerated rule 9 with backward acceleration, yielding the new rule 12.
[accelerate] Nesting with 3 inner and 2 outer candidates
   Removing the simple loops: 9.

Accelerating simple loops of location 5.
   Accelerating the following rules:
      6: f922_0_createMetaList_LE -> f922_0_createMetaList_LE : arg3'=-1+arg3, [ arg3>0 ], cost: 1

   Accelerated rule 6 with backward acceleration, yielding the new rule 13.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 6.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      2: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 ], cost: 1
      1: f1_0_main_Load -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f703_0_createMetaList_GE : arg1'=0, arg2'=arg2P_4, arg3'=1, arg4'=arg4P_4, [ arg2>-1 && arg2P_4>-1 && arg1>0 ], cost: 1
      7: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && arg1>1 && arg1P_8>-1 ], cost: 1
      8: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ 2+arg1P_9<=arg1 && arg1>2 && arg1P_9>-1 ], cost: 1
     11: f479_0_countMetaList_NONNULL -> [7] : [ arg1P_10<=arg1 && arg1>2 && arg1P_10>2 ], cost: NONTERM
     12: f479_0_countMetaList_NONNULL -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10<=arg1 && k>=1 && arg1P_10>2 ], cost: k
      4: f703_0_createMetaList_GE -> f922_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=arg3P_5, arg4'=1+arg3, [ arg3P_5>-1 && arg2>arg1 && arg3>0 ], cost: 1
      5: f922_0_createMetaList_LE -> f703_0_createMetaList_GE : arg1'=1+arg2, arg2'=arg1, arg3'=arg4, arg4'=arg4P_6, [ 0==arg3 ], cost: 1
     13: f922_0_createMetaList_LE -> f922_0_createMetaList_LE : arg3'=0, [ arg3>=0 ], cost: arg3
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      2: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 ], cost: 1
     14: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>0 && arg1P_8>-1 && 2+arg1P_8<=arg2 && 2<=arg2 ], cost: 2
     15: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg1P_9>-1 && 2+arg1P_9<=arg2 && 3<=arg2 ], cost: 2
     16: f462_0_main_InvokeMethod -> [7] : [ arg1>0 && 3<=arg2 ], cost: NONTERM
     17: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>0 && arg2>-1 && k>=1 && arg1P_10>2 && arg1P_10<=arg2 ], cost: 1+k
      1: f1_0_main_Load -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f703_0_createMetaList_GE : arg1'=0, arg2'=arg2P_4, arg3'=1, arg4'=arg4P_4, [ arg2>-1 && arg2P_4>-1 && arg1>0 ], cost: 1
      4: f703_0_createMetaList_GE -> f922_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=arg3P_5, arg4'=1+arg3, [ arg3P_5>-1 && arg2>arg1 && arg3>0 ], cost: 1
     18: f703_0_createMetaList_GE -> f922_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=0, arg4'=1+arg3, [ arg3P_5>-1 && arg2>arg1 && arg3>0 ], cost: 1+arg3P_5
      5: f922_0_createMetaList_LE -> f703_0_createMetaList_GE : arg1'=1+arg2, arg2'=arg1, arg3'=arg4, arg4'=arg4P_6, [ 0==arg3 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     16: f462_0_main_InvokeMethod -> [7] : [ arg1>0 && 3<=arg2 ], cost: NONTERM
     17: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>0 && arg2>-1 && k>=1 && arg1P_10>2 && arg1P_10<=arg2 ], cost: 1+k
      1: f1_0_main_Load -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f703_0_createMetaList_GE : arg1'=0, arg2'=arg2P_4, arg3'=1, arg4'=arg4P_4, [ arg2>-1 && arg2P_4>-1 && arg1>0 ], cost: 1
      4: f703_0_createMetaList_GE -> f922_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=arg3P_5, arg4'=1+arg3, [ arg3P_5>-1 && arg2>arg1 && arg3>0 ], cost: 1
     18: f703_0_createMetaList_GE -> f922_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=0, arg4'=1+arg3, [ arg3P_5>-1 && arg2>arg1 && arg3>0 ], cost: 1+arg3P_5
      5: f922_0_createMetaList_LE -> f703_0_createMetaList_GE : arg1'=1+arg2, arg2'=arg1, arg3'=arg4, arg4'=arg4P_6, [ 0==arg3 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     16: f462_0_main_InvokeMethod -> [7] : [ arg1>0 && 3<=arg2 ], cost: NONTERM
     17: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>0 && arg2>-1 && k>=1 && arg1P_10>2 && arg1P_10<=arg2 ], cost: 1+k
     21: f703_0_createMetaList_GE -> f703_0_createMetaList_GE : arg1'=1+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_6, [ arg2>arg1 && arg3>0 && 0==arg3P_5 ], cost: 2
     22: f703_0_createMetaList_GE -> f703_0_createMetaList_GE : arg1'=1+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_6, [ arg3P_5>-1 && arg2>arg1 && arg3>0 ], cost: 2+arg3P_5
     19: __init -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2
     20: __init -> f703_0_createMetaList_GE : arg1'=0, arg2'=arg2P_4, arg3'=1, arg4'=arg4P_4, [ arg2P_11>-1 && arg2P_4>-1 && arg1P_11>0 ], cost: 2

Accelerating simple loops of location 4.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     21: f703_0_createMetaList_GE -> f703_0_createMetaList_GE : arg1'=1+arg1, arg3'=1+arg3, arg4'=arg4P_6, [ arg2>arg1 && arg3>0 ], cost: 2
     22: f703_0_createMetaList_GE -> f703_0_createMetaList_GE : arg1'=1+arg1, arg3'=1+arg3, arg4'=arg4P_6, [ arg3P_5>-1 && arg2>arg1 && arg3>0 ], cost: 2+arg3P_5

   Accelerated rule 21 with backward acceleration, yielding the new rule 23.
   Accelerated rule 22 with backward acceleration, yielding the new rule 24.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Removing the simple loops: 21 22.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     16: f462_0_main_InvokeMethod -> [7] : [ arg1>0 && 3<=arg2 ], cost: NONTERM
     17: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>0 && arg2>-1 && k>=1 && arg1P_10>2 && arg1P_10<=arg2 ], cost: 1+k
     23: f703_0_createMetaList_GE -> f703_0_createMetaList_GE : arg1'=arg2, arg3'=arg2+arg3-arg1, arg4'=arg4P_6, [ arg3>0 && arg2-arg1>=1 ], cost: 2*arg2-2*arg1
     24: f703_0_createMetaList_GE -> f703_0_createMetaList_GE : arg1'=arg2, arg3'=arg2+arg3-arg1, arg4'=arg4P_6, [ arg3P_5>-1 && arg3>0 && arg2-arg1>=1 ], cost: 2*arg2-2*arg1+(arg2-arg1)*arg3P_5
     19: __init -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2
     20: __init -> f703_0_createMetaList_GE : arg1'=0, arg2'=arg2P_4, arg3'=1, arg4'=arg4P_4, [ arg2P_11>-1 && arg2P_4>-1 && arg1P_11>0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     16: f462_0_main_InvokeMethod -> [7] : [ arg1>0 && 3<=arg2 ], cost: NONTERM
     17: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>0 && arg2>-1 && k>=1 && arg1P_10>2 && arg1P_10<=arg2 ], cost: 1+k
     19: __init -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2
     20: __init -> f703_0_createMetaList_GE : arg1'=0, arg2'=arg2P_4, arg3'=1, arg4'=arg4P_4, [ arg2P_11>-1 && arg2P_4>-1 && arg1P_11>0 ], cost: 2
     25: __init -> f703_0_createMetaList_GE : arg1'=arg2P_4, arg2'=arg2P_4, arg3'=1+arg2P_4, arg4'=arg4P_6, [ arg2P_4>=1 ], cost: 2+2*arg2P_4
     26: __init -> f703_0_createMetaList_GE : arg1'=arg2P_4, arg2'=arg2P_4, arg3'=1+arg2P_4, arg4'=arg4P_6, [ arg3P_5>-1 && arg2P_4>=1 ], cost: 2+arg3P_5*arg2P_4+2*arg2P_4

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     16: f462_0_main_InvokeMethod -> [7] : [ arg1>0 && 3<=arg2 ], cost: NONTERM
     17: f462_0_main_InvokeMethod -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1>0 && arg2>-1 && k>=1 && arg1P_10>2 && arg1P_10<=arg2 ], cost: 1+k
     19: __init -> f462_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2
     25: __init -> f703_0_createMetaList_GE : arg1'=arg2P_4, arg2'=arg2P_4, arg3'=1+arg2P_4, arg4'=arg4P_6, [ arg2P_4>=1 ], cost: 2+2*arg2P_4
     26: __init -> f703_0_createMetaList_GE : arg1'=arg2P_4, arg2'=arg2P_4, arg3'=1+arg2P_4, arg4'=arg4P_6, [ arg3P_5>-1 && arg2P_4>=1 ], cost: 2+arg3P_5*arg2P_4+2*arg2P_4

Eliminated locations (on tree-shaped paths):
   Start location: __init
     25: __init -> f703_0_createMetaList_GE : arg1'=arg2P_4, arg2'=arg2P_4, arg3'=1+arg2P_4, arg4'=arg4P_6, [ arg2P_4>=1 ], cost: 2+2*arg2P_4
     26: __init -> f703_0_createMetaList_GE : arg1'=arg2P_4, arg2'=arg2P_4, arg3'=1+arg2P_4, arg4'=arg4P_6, [ arg3P_5>-1 && arg2P_4>=1 ], cost: 2+arg3P_5*arg2P_4+2*arg2P_4
     27: __init -> [7] : [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && 3<=arg2P_2 ], cost: NONTERM
     28: __init -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg2P_2>-1 && k>=1 && arg1P_10>2 && arg1P_10<=arg2P_2 ], cost: 3+k

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     25: __init -> f703_0_createMetaList_GE : arg1'=arg2P_4, arg2'=arg2P_4, arg3'=1+arg2P_4, arg4'=arg4P_6, [ arg2P_4>=1 ], cost: 2+2*arg2P_4
     26: __init -> f703_0_createMetaList_GE : arg1'=arg2P_4, arg2'=arg2P_4, arg3'=1+arg2P_4, arg4'=arg4P_6, [ arg3P_5>-1 && arg2P_4>=1 ], cost: 2+arg3P_5*arg2P_4+2*arg2P_4
     27: __init -> [7] : [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && 3<=arg2P_2 ], cost: NONTERM
     28: __init -> f479_0_countMetaList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg2P_2>-1 && k>=1 && arg1P_10>2 && arg1P_10<=arg2P_2 ], cost: 3+k

Computing asymptotic complexity for rule 27
   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:  [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && 3<=arg2P_2 ]

NO