WORST_CASE(INF,?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg4P_1>-1 && arg2>1 && arg6P_1>-1 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 && 0==arg3P_1 && 2==arg5P_1 ], cost: 1
      1: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg5>-1 && arg4>arg3 && arg4>0 && x6_1>1 && x16_1>-1 && arg5<x6_1 && arg1>=arg1P_2 && arg2>=arg1P_2 && arg1>0 && arg2>0 && arg1P_2>0 && arg2P_2>3 && arg2>=2+arg6 && 1+arg3==arg3P_2 && arg4==arg4P_2 && 1+arg5==arg5P_2 ], cost: 1
      2: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg5>-1 && arg4>arg3 && arg4>0 && x17_1>1 && x27_1>-1 && arg5<x17_1 && arg1P_3<=arg1 && arg1P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>3 && 2+arg6<=arg2 && 1+arg3==arg3P_3 && arg4==arg4P_3 && 1+arg5==arg5P_3 ], cost: 1
      3: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg5>-1 && arg4>arg3 && arg4>0 && x28_1>1 && x38_1>-1 && arg5<x28_1 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>2 && 2+arg6<=arg2 && 1+arg3==arg3P_4 && arg4==arg4P_4 && 1+arg5==arg5P_4 ], cost: 1
      4: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg5>-1 && arg4>arg3 && arg4>0 && x39_1>1 && x49_1>-1 && arg5<x39_1 && arg1P_5<=arg1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 && arg2P_5>2 && 2+arg6<=arg2 && 1+arg3==arg3P_5 && arg4==arg4P_5 && 1+arg5==arg5P_5 ], cost: 1
      5: f672_0_main_GE -> f765_0_insert_GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg5>-1 && arg4>arg3 && arg4>0 && x50_1>1 && arg2P_6>-1 && arg5<x50_1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && 2+arg6<=arg2 && arg6==arg3P_6 ], cost: 1
      6: f765_0_insert_GT -> f765_0_insert_GT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 2+arg1P_7<=arg1 && arg3<arg2 && arg1>2 && arg1P_7>0 && 2+arg3<=arg1 && 4+arg3P_7<=arg1 && arg2==arg2P_7 ], cost: 1
      7: f765_0_insert_GT -> f765_0_insert_GT : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ 2+arg1P_8<=arg1 && arg3>=arg2 && arg1>2 && arg1P_8>0 && 2+arg3<=arg1 && 4+arg3P_8<=arg1 && arg2==arg2P_8 ], cost: 1
      8: __init -> f1_0_main_Load : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      8: __init -> f1_0_main_Load : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, arg5'=2, arg6'=arg6P_1, [ arg4P_1>-1 && arg2>1 && arg6P_1>-1 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 ], cost: 1
      1: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_2, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1>=arg1P_2 && arg2>=arg1P_2 && arg1>0 && arg2>0 && arg1P_2>0 && arg2P_2>3 && arg2>=2+arg6 ], cost: 1
      2: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_3, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_3<=arg1 && arg1P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>3 && 2+arg6<=arg2 ], cost: 1
      3: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_4, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>2 && 2+arg6<=arg2 ], cost: 1
      4: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_5, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_5<=arg1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 && arg2P_5>2 && 2+arg6<=arg2 ], cost: 1
      5: f672_0_main_GE -> f765_0_insert_GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg5>-1 && arg4>arg3 && arg4>0 && arg2P_6>-1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && 2+arg6<=arg2 ], cost: 1
      6: f765_0_insert_GT -> f765_0_insert_GT : arg1'=arg1P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 2+arg1P_7<=arg1 && arg3<arg2 && arg1>2 && arg1P_7>0 && 2+arg3<=arg1 && 4+arg3P_7<=arg1 ], cost: 1
      7: f765_0_insert_GT -> f765_0_insert_GT : arg1'=arg1P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ 2+arg1P_8<=arg1 && arg3>=arg2 && arg1>2 && arg1P_8>0 && 2+arg3<=arg1 && 4+arg3P_8<=arg1 ], cost: 1
      8: __init -> f1_0_main_Load : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_2, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1>=arg1P_2 && arg2>=arg1P_2 && arg1>0 && arg2>0 && arg1P_2>0 && arg2P_2>3 && arg2>=2+arg6 ], cost: 1
      2: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_3, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_3<=arg1 && arg1P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>3 && 2+arg6<=arg2 ], cost: 1
      3: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_4, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>2 && 2+arg6<=arg2 ], cost: 1
      4: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_5, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_5<=arg1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 && arg2P_5>2 && 2+arg6<=arg2 ], cost: 1

   Accelerated rule 1 with metering function -arg3+arg4 (after strengthening guard), yielding the new rule 9.
   Accelerated rule 2 with metering function -arg3+arg4 (after strengthening guard), yielding the new rule 10.
   Accelerated rule 3 with metering function -arg3+arg4 (after strengthening guard), yielding the new rule 11.
   Accelerated rule 4 with metering function -arg3+arg4 (after strengthening guard), yielding the new rule 12.
   Removing the simple loops:.

Accelerating simple loops of location 2.
   Accelerating the following rules:
      6: f765_0_insert_GT -> f765_0_insert_GT : arg1'=arg1P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 2+arg1P_7<=arg1 && arg3<arg2 && arg1>2 && arg1P_7>0 && 2+arg3<=arg1 && 4+arg3P_7<=arg1 ], cost: 1
      7: f765_0_insert_GT -> f765_0_insert_GT : arg1'=arg1P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ 2+arg1P_8<=arg1 && arg3>=arg2 && arg1>2 && arg1P_8>0 && 2+arg3<=arg1 && 4+arg3P_8<=arg1 ], cost: 1

   Found no metering function for rule 6.
   Found no metering function for rule 7.
   Removing the simple loops:.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, arg5'=2, arg6'=arg6P_1, [ arg4P_1>-1 && arg2>1 && arg6P_1>-1 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 ], cost: 1
      1: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_2, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1>=arg1P_2 && arg2>=arg1P_2 && arg1>0 && arg2>0 && arg1P_2>0 && arg2P_2>3 && arg2>=2+arg6 ], cost: 1
      2: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_3, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_3<=arg1 && arg1P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>3 && 2+arg6<=arg2 ], cost: 1
      3: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_4, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>2 && 2+arg6<=arg2 ], cost: 1
      4: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=1+arg3, arg5'=1+arg5, arg6'=arg6P_5, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_5<=arg1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 && arg2P_5>2 && 2+arg6<=arg2 ], cost: 1
      5: f672_0_main_GE -> f765_0_insert_GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg5>-1 && arg4>arg3 && arg4>0 && arg2P_6>-1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && 2+arg6<=arg2 ], cost: 1
      9: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4, arg5'=-arg3+arg4+arg5, arg6'=arg6P_2, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1>=arg1P_2 && arg2>=arg1P_2 && arg1>0 && arg2>0 && arg1P_2>0 && arg2P_2>3 && arg2>=2+arg6 && arg2P_2>=arg1P_2 && arg2P_2>=2+arg6P_2 ], cost: -arg3+arg4
     10: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg4, arg5'=-arg3+arg4+arg5, arg6'=arg6P_3, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_3<=arg1 && arg1P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>3 && 2+arg6<=arg2 && arg1P_3<=arg2P_3 && 2+arg6P_3<=arg2P_3 ], cost: -arg3+arg4
     11: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg4, arg5'=-arg3+arg4+arg5, arg6'=arg6P_4, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>2 && 2+arg6<=arg2 && arg1P_4<=arg2P_4 && 2+arg6P_4<=arg2P_4 ], cost: -arg3+arg4
     12: f672_0_main_GE -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg4, arg5'=-arg3+arg4+arg5, arg6'=arg6P_5, [ arg5>-1 && arg4>arg3 && arg4>0 && arg1P_5<=arg1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 && arg2P_5>2 && 2+arg6<=arg2 && arg1P_5<=arg2P_5 && 2+arg6P_5<=arg2P_5 ], cost: -arg3+arg4
      6: f765_0_insert_GT -> f765_0_insert_GT : arg1'=arg1P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 2+arg1P_7<=arg1 && arg3<arg2 && arg1>2 && arg1P_7>0 && 2+arg3<=arg1 && 4+arg3P_7<=arg1 ], cost: 1
      7: f765_0_insert_GT -> f765_0_insert_GT : arg1'=arg1P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ 2+arg1P_8<=arg1 && arg3>=arg2 && arg1>2 && arg1P_8>0 && 2+arg3<=arg1 && 4+arg3P_8<=arg1 ], cost: 1
      8: __init -> f1_0_main_Load : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, arg5'=2, arg6'=arg6P_1, [ arg4P_1>-1 && arg2>1 && arg6P_1>-1 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>1 ], cost: 1
     13: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=1, arg4'=arg4P_1, arg5'=3, arg6'=arg6P_2, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_2>0 && arg2P_2>3 && arg1P_2<=arg1 ], cost: 2
     14: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=1, arg4'=arg4P_1, arg5'=3, arg6'=arg6P_3, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_3>0 && arg2P_3>3 && arg1P_3<=arg1 ], cost: 2
     15: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=1, arg4'=arg4P_1, arg5'=3, arg6'=arg6P_4, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_4>0 && arg2P_4>2 && arg1P_4<=arg1 ], cost: 2
     16: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=1, arg4'=arg4P_1, arg5'=3, arg6'=arg6P_5, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_5>0 && arg2P_5>2 && arg1P_5<=arg1 ], cost: 2
     17: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_2, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_2>0 && arg2P_2>3 && arg2P_2>=arg1P_2 && arg2P_2>=2+arg6P_2 && arg1P_2<=arg1 ], cost: 1+arg4P_1
     18: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_3, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_3>0 && arg2P_3>3 && arg1P_3<=arg2P_3 && 2+arg6P_3<=arg2P_3 && arg1P_3<=arg1 ], cost: 1+arg4P_1
     19: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_4, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_4>0 && arg2P_4>2 && arg1P_4<=arg2P_4 && 2+arg6P_4<=arg2P_4 && arg1P_4<=arg1 ], cost: 1+arg4P_1
     20: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_5, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_5>0 && arg2P_5>2 && arg1P_5<=arg2P_5 && 2+arg6P_5<=arg2P_5 && arg1P_5<=arg1 ], cost: 1+arg4P_1
      5: f672_0_main_GE -> f765_0_insert_GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg5>-1 && arg4>arg3 && arg4>0 && arg2P_6>-1 && arg1P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && 2+arg6<=arg2 ], cost: 1
     21: f672_0_main_GE -> f765_0_insert_GT : arg1'=arg1P_7, arg2'=arg2P_6, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg5>-1 && arg4>arg3 && arg4>0 && arg2P_6>-1 && arg1>0 && 2+arg6<=arg2 && arg6<arg2P_6 && arg1P_7>0 && 2+arg1P_7<=arg2 && 3<=arg2 && 4+arg3P_7<=arg2 ], cost: 2
     22: f672_0_main_GE -> f765_0_insert_GT : arg1'=arg1P_8, arg2'=arg2P_6, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg5>-1 && arg4>arg3 && arg4>0 && arg2P_6>-1 && arg1>0 && 2+arg6<=arg2 && arg6>=arg2P_6 && arg1P_8>0 && 2+arg1P_8<=arg2 && 3<=arg2 && 4+arg3P_8<=arg2 ], cost: 2
      8: __init -> f1_0_main_Load : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     17: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_2, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_2>0 && arg2P_2>3 && arg2P_2>=arg1P_2 && arg2P_2>=2+arg6P_2 && arg1P_2<=arg1 ], cost: 1+arg4P_1
     18: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_3, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_3>0 && arg2P_3>3 && arg1P_3<=arg2P_3 && 2+arg6P_3<=arg2P_3 && arg1P_3<=arg1 ], cost: 1+arg4P_1
     19: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_4, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_4>0 && arg2P_4>2 && arg1P_4<=arg2P_4 && 2+arg6P_4<=arg2P_4 && arg1P_4<=arg1 ], cost: 1+arg4P_1
     20: f1_0_main_Load -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_5, [ arg2>1 && arg1>0 && arg4P_1>0 && arg1P_5>0 && arg2P_5>2 && arg1P_5<=arg2P_5 && 2+arg6P_5<=arg2P_5 && arg1P_5<=arg1 ], cost: 1+arg4P_1
      8: __init -> f1_0_main_Load : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     23: __init -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_2, [ arg2P_9>1 && arg1P_9>0 && arg4P_1>0 && arg1P_2>0 && arg2P_2>3 && arg2P_2>=arg1P_2 && arg2P_2>=2+arg6P_2 && arg1P_2<=arg1P_9 ], cost: 2+arg4P_1
     24: __init -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_3, [ arg2P_9>1 && arg1P_9>0 && arg4P_1>0 && arg1P_3>0 && arg2P_3>3 && arg1P_3<=arg2P_3 && 2+arg6P_3<=arg2P_3 && arg1P_3<=arg1P_9 ], cost: 2+arg4P_1
     25: __init -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_4, [ arg2P_9>1 && arg1P_9>0 && arg4P_1>0 && arg1P_4>0 && arg2P_4>2 && arg1P_4<=arg2P_4 && 2+arg6P_4<=arg2P_4 && arg1P_4<=arg1P_9 ], cost: 2+arg4P_1
     26: __init -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_5, [ arg2P_9>1 && arg1P_9>0 && arg4P_1>0 && arg1P_5>0 && arg2P_5>2 && arg1P_5<=arg2P_5 && 2+arg6P_5<=arg2P_5 && arg1P_5<=arg1P_9 ], cost: 2+arg4P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     23: __init -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_2, [ arg2P_9>1 && arg1P_9>0 && arg4P_1>0 && arg1P_2>0 && arg2P_2>3 && arg2P_2>=arg1P_2 && arg2P_2>=2+arg6P_2 && arg1P_2<=arg1P_9 ], cost: 2+arg4P_1
     24: __init -> f672_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_3, [ arg2P_9>1 && arg1P_9>0 && arg4P_1>0 && arg1P_3>0 && arg2P_3>3 && arg1P_3<=arg2P_3 && 2+arg6P_3<=arg2P_3 && arg1P_3<=arg1P_9 ], cost: 2+arg4P_1
     25: __init -> f672_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_4, [ arg2P_9>1 && arg1P_9>0 && arg4P_1>0 && arg1P_4>0 && arg2P_4>2 && arg1P_4<=arg2P_4 && 2+arg6P_4<=arg2P_4 && arg1P_4<=arg1P_9 ], cost: 2+arg4P_1
     26: __init -> f672_0_main_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_5, [ arg2P_9>1 && arg1P_9>0 && arg4P_1>0 && arg1P_5>0 && arg2P_5>2 && arg1P_5<=arg2P_5 && 2+arg6P_5<=arg2P_5 && arg1P_5<=arg1P_9 ], cost: 2+arg4P_1

Computing asymptotic complexity for rule 23
   Simplified the guard:
     23: __init -> f672_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4P_1, arg4'=arg4P_1, arg5'=2+arg4P_1, arg6'=arg6P_2, [ arg2P_9>1 && arg4P_1>0 && arg1P_2>0 && arg2P_2>3 && arg2P_2>=arg1P_2 && arg2P_2>=2+arg6P_2 && arg1P_2<=arg1P_9 ], cost: 2+arg4P_1
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      1+arg2P_2-arg1P_2 (+/+!), -3+arg2P_2 (+/+!), arg4P_1 (+/+!), 2+arg4P_1 (+), -1+arg2P_2-arg6P_2 (+/+!), arg1P_2 (+/+!), -1+arg2P_9 (+/+!), 1-arg1P_2+arg1P_9 (+/+!) [not solved]

      removing all constraints (solved by SMT)
      resulting limit problem: [solved]

      applying transformation rule (C) using substitution {arg4P_1==n,arg2P_2==4,arg1P_2==1,arg2P_9==n,arg6P_2==2,arg1P_9==1}
      resulting limit problem:
      [solved]

   Solution:
      arg4P_1 / n
      arg2P_2 / 4
      arg1P_2 / 1
      arg2P_9 / n
      arg6P_2 / 2
      arg1P_9 / 1
   Resulting cost 2+n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 2+n
   Rule cost:   2+arg4P_1
   Rule guard:  [ arg2P_9>1 && arg4P_1>0 && arg1P_2>0 && arg2P_2>3 && arg2P_2>=arg1P_2 && arg2P_2>=2+arg6P_2 && arg1P_2<=arg1P_9 ]

WORST_CASE(INF,?)