WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ x5_1>-1 && arg2>0 && arg1P_1<=arg1 && -7+arg2P_1<=arg1 && -5+arg3P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>7 && arg3P_1>5 && 0==arg4P_1 ], cost: 1
      1: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ x12_1>-1 && arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 ], cost: 1
      4: f1_0_main_Load -> f415_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ x33_1>-1 && arg2>1 && x34_1>-1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      8: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ x66_1>-1 && arg2>1 && x67_1>-1 && arg1P_9<=arg1 && arg1>0 && arg1P_9>0 && arg2P_9>6 ], cost: 1
     10: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ x83_1>-1 && arg2>1 && x84_1>-1 && arg1P_11<=arg1 && -5+arg2P_11<=arg1 && arg1>0 && arg1P_11>0 && arg2P_11>5 ], cost: 1
     11: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1P_12>-1 && arg2>0 && arg1>0 && 1==arg2P_12 ], cost: 1
     14: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ x106_1>-1 && arg2>1 && arg1P_15>-1 && arg1>0 && 2==arg2P_15 ], cost: 1
      2: f177_0_appendNewList_Return -> f415_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ x19_1>-1 && x13_1>1 && arg1P_3<=arg1 && 7+arg1P_3<=arg2 && 5+arg1P_3<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_3>0 ], cost: 1
      3: f177_0_appendNewList_Return -> f415_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ x26_1>arg4 && arg4>0 && x27_1>arg4 && x28_1>arg4 && x20_1>1 && x29_1>-1 && arg1P_4<=arg1 && 6+arg1P_4<=arg2 && 4+arg1P_4<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_4>0 ], cost: 1
      5: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ x42_1>arg4 && arg4>0 && x43_1>arg4 && x44_1>arg4 && x35_1>1 && x45_1>-1 && arg1P_6<=arg1 && 6+arg1P_6<=arg2 && 4+arg1P_6<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_6>0 && arg2P_6>6 ], cost: 1
      6: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ x53_1>-1 && x46_1>1 && arg1P_7<=arg1 && 7+arg1P_7<=arg2 && 5+arg1P_7<=arg3 && -5+arg2P_7<=arg1 && 2+arg2P_7<=arg2 && arg2P_7<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_7>0 && arg2P_7>5 ], cost: 1
      7: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x61_1>-1 && x54_1>1 && arg1P_8<=arg1 && 7+arg1P_8<=arg2 && 5+arg1P_8<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_8>0 && arg2P_8>6 ], cost: 1
      9: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ x75_1>arg4 && arg4>0 && x76_1>arg4 && x77_1>arg4 && x68_1>1 && x78_1>-1 && arg1P_10<=arg1 && 6+arg1P_10<=arg2 && 4+arg1P_10<=arg3 && -5+arg2P_10<=arg1 && 1+arg2P_10<=arg2 && -1+arg2P_10<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_10>0 && arg2P_10>5 ], cost: 1
     12: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ x94_1>arg4 && arg4>0 && x95_1>arg4 && x96_1>arg4 && x88_1>1 && arg1P_13>-1 && arg1>0 && arg2>6 && arg3>4 && 2==arg2P_13 ], cost: 1
     13: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1P_14>-1 && x97_1>1 && arg1>0 && arg2>7 && arg3>5 && 2==arg2P_14 ], cost: 1
     16: f415_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ -3+arg1P_17<=arg1 && x110_1>1 && -1+arg2P_17<=arg1 && arg1>0 && arg1P_17>3 && arg2P_17>1 ], cost: 1
     17: f480_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_18<=arg2 && x114_1>1 && 2+arg2P_18<=arg2 && arg1>0 && arg2>4 && arg1P_18>4 && arg2P_18>2 ], cost: 1
     15: f343_0_appendNewList_GT -> f343_0_appendNewList_GT : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ -1+arg1<arg1 && arg2>0 && arg1>1 && -1+arg1==arg1P_16 && arg2==arg2P_16 ], cost: 1
     18: f519_0_length_NONNULL -> f519_0_length_NONNULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ 2+arg1P_19<=arg1 && arg1P_19<=arg2 && 3+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg1>2 && arg2>0 && arg1P_19>0 && arg2P_19>-1 ], cost: 1
     19: __init -> f1_0_main_Load : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     19: __init -> f1_0_main_Load : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=0, [ arg2>0 && arg1P_1<=arg1 && -7+arg2P_1<=arg1 && -5+arg3P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>7 && arg3P_1>5 ], cost: 1
      1: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 ], cost: 1
      4: f1_0_main_Load -> f415_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2>1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      8: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2>1 && arg1P_9<=arg1 && arg1>0 && arg1P_9>0 && arg2P_9>6 ], cost: 1
     10: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg2>1 && arg1P_11<=arg1 && -5+arg2P_11<=arg1 && arg1>0 && arg1P_11>0 && arg2P_11>5 ], cost: 1
     11: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=arg1P_12, arg2'=1, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1P_12>-1 && arg2>0 && arg1>0 ], cost: 1
     14: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=arg1P_15, arg2'=2, arg3'=arg3P_15, arg4'=arg4P_15, [ arg2>1 && arg1P_15>-1 && arg1>0 ], cost: 1
      2: f177_0_appendNewList_Return -> f415_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3<=arg1 && 7+arg1P_3<=arg2 && 5+arg1P_3<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_3>0 ], cost: 1
      3: f177_0_appendNewList_Return -> f415_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg4>0 && arg1P_4<=arg1 && 6+arg1P_4<=arg2 && 4+arg1P_4<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_4>0 ], cost: 1
      5: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4>0 && arg1P_6<=arg1 && 6+arg1P_6<=arg2 && 4+arg1P_6<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_6>0 && arg2P_6>6 ], cost: 1
      6: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && 7+arg1P_7<=arg2 && 5+arg1P_7<=arg3 && -5+arg2P_7<=arg1 && 2+arg2P_7<=arg2 && arg2P_7<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_7>0 && arg2P_7>5 ], cost: 1
      7: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1P_8<=arg1 && 7+arg1P_8<=arg2 && 5+arg1P_8<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_8>0 && arg2P_8>6 ], cost: 1
      9: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg4>0 && arg1P_10<=arg1 && 6+arg1P_10<=arg2 && 4+arg1P_10<=arg3 && -5+arg2P_10<=arg1 && 1+arg2P_10<=arg2 && -1+arg2P_10<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_10>0 && arg2P_10>5 ], cost: 1
     12: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=arg1P_13, arg2'=2, arg3'=arg3P_13, arg4'=arg4P_13, [ arg4>0 && arg1P_13>-1 && arg1>0 && arg2>6 && arg3>4 ], cost: 1
     13: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=arg1P_14, arg2'=2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1P_14>-1 && arg1>0 && arg2>7 && arg3>5 ], cost: 1
     16: f415_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ -3+arg1P_17<=arg1 && -1+arg2P_17<=arg1 && arg1>0 && arg1P_17>3 && arg2P_17>1 ], cost: 1
     17: f480_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_18<=arg2 && 2+arg2P_18<=arg2 && arg1>0 && arg2>4 && arg1P_18>4 && arg2P_18>2 ], cost: 1
     15: f343_0_appendNewList_GT -> f343_0_appendNewList_GT : arg1'=-1+arg1, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2>0 && arg1>1 ], cost: 1
     18: f519_0_length_NONNULL -> f519_0_length_NONNULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ 2+arg1P_19<=arg1 && arg1P_19<=arg2 && 3+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg1>2 && arg2>0 && arg1P_19>0 && arg2P_19>-1 ], cost: 1
     19: __init -> f1_0_main_Load : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 4.
   Accelerating the following rules:
     15: f343_0_appendNewList_GT -> f343_0_appendNewList_GT : arg1'=-1+arg1, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2>0 && arg1>1 ], cost: 1

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

Accelerating simple loops of location 5.
   Accelerating the following rules:
     18: f519_0_length_NONNULL -> f519_0_length_NONNULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ 2+arg1P_19<=arg1 && arg1P_19<=arg2 && 3+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg1>2 && arg2>0 && arg1P_19>0 && arg2P_19>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 18.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=0, [ arg2>0 && arg1P_1<=arg1 && -7+arg2P_1<=arg1 && -5+arg3P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>7 && arg3P_1>5 ], cost: 1
      1: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 ], cost: 1
      4: f1_0_main_Load -> f415_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2>1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      8: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2>1 && arg1P_9<=arg1 && arg1>0 && arg1P_9>0 && arg2P_9>6 ], cost: 1
     10: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg2>1 && arg1P_11<=arg1 && -5+arg2P_11<=arg1 && arg1>0 && arg1P_11>0 && arg2P_11>5 ], cost: 1
     11: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=arg1P_12, arg2'=1, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1P_12>-1 && arg2>0 && arg1>0 ], cost: 1
     14: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=arg1P_15, arg2'=2, arg3'=arg3P_15, arg4'=arg4P_15, [ arg2>1 && arg1P_15>-1 && arg1>0 ], cost: 1
      2: f177_0_appendNewList_Return -> f415_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3<=arg1 && 7+arg1P_3<=arg2 && 5+arg1P_3<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_3>0 ], cost: 1
      3: f177_0_appendNewList_Return -> f415_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg4>0 && arg1P_4<=arg1 && 6+arg1P_4<=arg2 && 4+arg1P_4<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_4>0 ], cost: 1
      5: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4>0 && arg1P_6<=arg1 && 6+arg1P_6<=arg2 && 4+arg1P_6<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_6>0 && arg2P_6>6 ], cost: 1
      6: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && 7+arg1P_7<=arg2 && 5+arg1P_7<=arg3 && -5+arg2P_7<=arg1 && 2+arg2P_7<=arg2 && arg2P_7<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_7>0 && arg2P_7>5 ], cost: 1
      7: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1P_8<=arg1 && 7+arg1P_8<=arg2 && 5+arg1P_8<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_8>0 && arg2P_8>6 ], cost: 1
      9: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg4>0 && arg1P_10<=arg1 && 6+arg1P_10<=arg2 && 4+arg1P_10<=arg3 && -5+arg2P_10<=arg1 && 1+arg2P_10<=arg2 && -1+arg2P_10<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_10>0 && arg2P_10>5 ], cost: 1
     12: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=arg1P_13, arg2'=2, arg3'=arg3P_13, arg4'=arg4P_13, [ arg4>0 && arg1P_13>-1 && arg1>0 && arg2>6 && arg3>4 ], cost: 1
     13: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=arg1P_14, arg2'=2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1P_14>-1 && arg1>0 && arg2>7 && arg3>5 ], cost: 1
     16: f415_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ -3+arg1P_17<=arg1 && -1+arg2P_17<=arg1 && arg1>0 && arg1P_17>3 && arg2P_17>1 ], cost: 1
     17: f480_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_18<=arg2 && 2+arg2P_18<=arg2 && arg1>0 && arg2>4 && arg1P_18>4 && arg2P_18>2 ], cost: 1
     20: f343_0_appendNewList_GT -> f343_0_appendNewList_GT : arg1'=1, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2>0 && -1+arg1>=1 ], cost: -1+arg1
     18: f519_0_length_NONNULL -> f519_0_length_NONNULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ 2+arg1P_19<=arg1 && arg1P_19<=arg2 && 3+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg1>2 && arg2>0 && arg1P_19>0 && arg2P_19>-1 ], cost: 1
     19: __init -> f1_0_main_Load : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=0, [ arg2>0 && arg1P_1<=arg1 && -7+arg2P_1<=arg1 && -5+arg3P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>7 && arg3P_1>5 ], cost: 1
      1: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 ], cost: 1
      4: f1_0_main_Load -> f415_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2>1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      8: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2>1 && arg1P_9<=arg1 && arg1>0 && arg1P_9>0 && arg2P_9>6 ], cost: 1
     10: f1_0_main_Load -> f480_0_main_InvokeMethod : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg2>1 && arg1P_11<=arg1 && -5+arg2P_11<=arg1 && arg1>0 && arg1P_11>0 && arg2P_11>5 ], cost: 1
     11: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=arg1P_12, arg2'=1, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1P_12>-1 && arg2>0 && arg1>0 ], cost: 1
     14: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=arg1P_15, arg2'=2, arg3'=arg3P_15, arg4'=arg4P_15, [ arg2>1 && arg1P_15>-1 && arg1>0 ], cost: 1
     21: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=1, arg2'=1, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2>0 && arg1>0 && -1+arg1P_12>=1 ], cost: arg1P_12
     24: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2>1 && arg1>0 && -1+arg1P_15>=1 ], cost: arg1P_15
      2: f177_0_appendNewList_Return -> f415_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3<=arg1 && 7+arg1P_3<=arg2 && 5+arg1P_3<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_3>0 ], cost: 1
      3: f177_0_appendNewList_Return -> f415_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg4>0 && arg1P_4<=arg1 && 6+arg1P_4<=arg2 && 4+arg1P_4<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_4>0 ], cost: 1
      5: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4>0 && arg1P_6<=arg1 && 6+arg1P_6<=arg2 && 4+arg1P_6<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_6>0 && arg2P_6>6 ], cost: 1
      6: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && 7+arg1P_7<=arg2 && 5+arg1P_7<=arg3 && -5+arg2P_7<=arg1 && 2+arg2P_7<=arg2 && arg2P_7<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_7>0 && arg2P_7>5 ], cost: 1
      7: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1P_8<=arg1 && 7+arg1P_8<=arg2 && 5+arg1P_8<=arg3 && arg1>0 && arg2>7 && arg3>5 && arg1P_8>0 && arg2P_8>6 ], cost: 1
      9: f177_0_appendNewList_Return -> f480_0_main_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg4>0 && arg1P_10<=arg1 && 6+arg1P_10<=arg2 && 4+arg1P_10<=arg3 && -5+arg2P_10<=arg1 && 1+arg2P_10<=arg2 && -1+arg2P_10<=arg3 && arg1>0 && arg2>6 && arg3>4 && arg1P_10>0 && arg2P_10>5 ], cost: 1
     12: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=arg1P_13, arg2'=2, arg3'=arg3P_13, arg4'=arg4P_13, [ arg4>0 && arg1P_13>-1 && arg1>0 && arg2>6 && arg3>4 ], cost: 1
     13: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=arg1P_14, arg2'=2, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1P_14>-1 && arg1>0 && arg2>7 && arg3>5 ], cost: 1
     22: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg4>0 && arg1>0 && arg2>6 && arg3>4 && -1+arg1P_13>=1 ], cost: arg1P_13
     23: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg1>0 && arg2>7 && arg3>5 && -1+arg1P_14>=1 ], cost: arg1P_14
     16: f415_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ -3+arg1P_17<=arg1 && -1+arg2P_17<=arg1 && arg1>0 && arg1P_17>3 && arg2P_17>1 ], cost: 1
     25: f415_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1>0 && arg1P_19>0 && arg2P_19>-1 && 2+arg1P_19<=3+arg1 && 3+arg2P_19<=3+arg1 ], cost: 2
     17: f480_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_18<=arg2 && 2+arg2P_18<=arg2 && arg1>0 && arg2>4 && arg1P_18>4 && arg2P_18>2 ], cost: 1
     26: f480_0_main_InvokeMethod -> f519_0_length_NONNULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1>0 && arg2>4 && arg1P_19>0 && arg2P_19>-1 && 2+arg1P_19<=arg2 && 3+arg2P_19<=arg2 ], cost: 2
     19: __init -> f1_0_main_Load : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=0, [ arg2>0 && arg1P_1<=arg1 && -7+arg2P_1<=arg1 && -5+arg3P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>7 && arg3P_1>5 ], cost: 1
      1: f1_0_main_Load -> f177_0_appendNewList_Return : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 ], cost: 1
     21: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=1, arg2'=1, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2>0 && arg1>0 && -1+arg1P_12>=1 ], cost: arg1P_12
     24: f1_0_main_Load -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2>1 && arg1>0 && -1+arg1P_15>=1 ], cost: arg1P_15
     22: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg4>0 && arg1>0 && arg2>6 && arg3>4 && -1+arg1P_13>=1 ], cost: arg1P_13
     23: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg1>0 && arg2>7 && arg3>5 && -1+arg1P_14>=1 ], cost: arg1P_14
     19: __init -> f1_0_main_Load : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     22: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg4>0 && arg1>0 && arg2>6 && arg3>4 && -1+arg1P_13>=1 ], cost: arg1P_13
     23: f177_0_appendNewList_Return -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg1>0 && arg2>7 && arg3>5 && -1+arg1P_14>=1 ], cost: arg1P_14
     27: __init -> f177_0_appendNewList_Return : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=0, [ arg2P_20>0 && arg1P_1<=arg1P_20 && -7+arg2P_1<=arg1P_20 && -5+arg3P_1<=arg1P_20 && arg1P_20>0 && arg1P_1>0 && arg2P_1>7 && arg3P_1>5 ], cost: 2
     28: __init -> f177_0_appendNewList_Return : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2P_20>0 && arg1P_2<=arg1P_20 && arg1P_20>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 ], cost: 2
     29: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=1, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_20>0 && -1+arg1P_12>=1 ], cost: 1+arg1P_12
     30: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>1 && arg1P_20>0 && -1+arg1P_15>=1 ], cost: 1+arg1P_15

Eliminated locations (on tree-shaped paths):
   Start location: __init
     29: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=1, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_20>0 && -1+arg1P_12>=1 ], cost: 1+arg1P_12
     30: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>1 && arg1P_20>0 && -1+arg1P_15>=1 ], cost: 1+arg1P_15
     31: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_1<=arg1P_20 && -7+arg2P_1<=arg1P_20 && -5+arg3P_1<=arg1P_20 && arg1P_20>0 && arg1P_1>0 && arg2P_1>7 && arg3P_1>5 && -1+arg1P_14>=1 ], cost: 2+arg1P_14
     32: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_2<=arg1P_20 && arg1P_20>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 && arg4P_2>0 && -1+arg1P_13>=1 ], cost: 2+arg1P_13
     33: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_2<=arg1P_20 && arg1P_20>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 && -1+arg1P_14>=1 ], cost: 2+arg1P_14

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     29: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=1, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_20>0 && -1+arg1P_12>=1 ], cost: 1+arg1P_12
     30: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>1 && arg1P_20>0 && -1+arg1P_15>=1 ], cost: 1+arg1P_15
     31: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_1<=arg1P_20 && -7+arg2P_1<=arg1P_20 && -5+arg3P_1<=arg1P_20 && arg1P_20>0 && arg1P_1>0 && arg2P_1>7 && arg3P_1>5 && -1+arg1P_14>=1 ], cost: 2+arg1P_14
     32: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_2<=arg1P_20 && arg1P_20>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 && arg4P_2>0 && -1+arg1P_13>=1 ], cost: 2+arg1P_13
     33: __init -> f343_0_appendNewList_GT : arg1'=1, arg2'=2, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2P_20>0 && arg1P_2<=arg1P_20 && arg1P_20>0 && arg1P_2>0 && arg2P_2>8 && arg3P_2>6 && -1+arg1P_14>=1 ], cost: 2+arg1P_14

Computing asymptotic complexity for rule 29
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 30
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 33
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 32
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 31
   Resulting cost 0 has complexity: Unknown

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  []

WORST_CASE(Omega(1),?)