WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f1612_0_main_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
      3: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg2>0 && arg3P_4>0 && -1+arg1P_4<=arg1 && -1+arg2P_4<=arg1 && arg1>0 && arg1P_4>1 && arg2P_4>1 && arg2==arg4P_4 && 1==arg5P_4 ], cost: 1
      2: f1612_0_main_NULL -> f1612_0_main_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1>=-2+arg1P_3 && arg1>=3+arg2P_3 && arg2>=1+arg2P_3 && arg1>2 && arg2>0 && arg1P_3>2 && arg2P_3>-1 ], cost: 1
      1: f408_0_createTree_Return -> f1612_0_main_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ arg1P_2<=arg1 && 2+arg2P_2<=arg1 && arg1>1 && arg1P_2>1 && arg2P_2>-1 && 2+arg2<=arg1 ], cost: 1
      4: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 && -1+arg3==arg3P_5 && arg4==arg4P_5 && 1+arg5==arg5P_5 ], cost: 1
      5: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg5>-1 && x31_1>0 && arg3>0 && arg5<arg4 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>0 && arg2>2 && arg1P_6>0 && arg2P_6>0 && -1+arg3==arg3P_6 && arg4==arg4P_6 && 1+arg5==arg5P_6 ], cost: 1
      6: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg5>-1 && x39_1>0 && arg3>0 && arg5<arg4 && arg1>0 && arg2>1 && arg1P_7>0 && arg2P_7>0 && -1+arg3==arg3P_7 && arg4==arg4P_7 && 1+arg5==arg5P_7 ], cost: 1
      7: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1>0 && arg2>1 && arg1P_8>0 && arg2P_8>0 && -1+arg3==arg3P_8 && arg4==arg4P_8 && 1+arg5==arg5P_8 ], cost: 1
      8: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>0 && arg5>-1 && arg5<arg4 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 && -1+arg3==arg3P_9 && arg4==arg4P_9 && 1+arg5==arg5P_9 ], cost: 1
      9: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ arg5>-1 && x61_1>0 && arg3>0 && arg5<arg4 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>1 && arg2>1 && arg1P_10>3 && arg2P_10>3 && -1+arg3==arg3P_10 && arg4==arg4P_10 && 1+arg5==arg5P_10 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_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, arg5'=arg5P_11, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f1612_0_main_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
      3: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg2>0 && arg3P_4>0 && -1+arg1P_4<=arg1 && -1+arg2P_4<=arg1 && arg1>0 && arg1P_4>1 && arg2P_4>1 && arg2==arg4P_4 && 1==arg5P_4 ], cost: 1
      2: f1612_0_main_NULL -> f1612_0_main_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1>=-2+arg1P_3 && arg1>=3+arg2P_3 && arg2>=1+arg2P_3 && arg1>2 && arg2>0 && arg1P_3>2 && arg2P_3>-1 ], cost: 1
      4: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 && -1+arg3==arg3P_5 && arg4==arg4P_5 && 1+arg5==arg5P_5 ], cost: 1
      5: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg5>-1 && x31_1>0 && arg3>0 && arg5<arg4 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>0 && arg2>2 && arg1P_6>0 && arg2P_6>0 && -1+arg3==arg3P_6 && arg4==arg4P_6 && 1+arg5==arg5P_6 ], cost: 1
      6: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg5>-1 && x39_1>0 && arg3>0 && arg5<arg4 && arg1>0 && arg2>1 && arg1P_7>0 && arg2P_7>0 && -1+arg3==arg3P_7 && arg4==arg4P_7 && 1+arg5==arg5P_7 ], cost: 1
      7: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1>0 && arg2>1 && arg1P_8>0 && arg2P_8>0 && -1+arg3==arg3P_8 && arg4==arg4P_8 && 1+arg5==arg5P_8 ], cost: 1
      8: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>0 && arg5>-1 && arg5<arg4 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 && -1+arg3==arg3P_9 && arg4==arg4P_9 && 1+arg5==arg5P_9 ], cost: 1
      9: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ arg5>-1 && x61_1>0 && arg3>0 && arg5<arg4 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>1 && arg2>1 && arg1P_10>3 && arg2P_10>3 && -1+arg3==arg3P_10 && arg4==arg4P_10 && 1+arg5==arg5P_10 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f1612_0_main_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
      3: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg2, arg5'=1, [ arg2>0 && arg3P_4>0 && -1+arg1P_4<=arg1 && -1+arg2P_4<=arg1 && arg1>0 && arg1P_4>1 && arg2P_4>1 ], cost: 1
      2: f1612_0_main_NULL -> f1612_0_main_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1>=-2+arg1P_3 && arg1>=3+arg2P_3 && arg2>=1+arg2P_3 && arg1>2 && arg2>0 && arg1P_3>2 && arg2P_3>-1 ], cost: 1
      4: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg5'=1+arg5, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      5: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg5'=1+arg5, [ arg5>-1 && arg3>0 && arg5<arg4 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>0 && arg2>2 && arg1P_6>0 && arg2P_6>0 ], cost: 1
      6: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg5'=1+arg5, [ arg5>-1 && arg3>0 && arg5<arg4 && arg1>0 && arg2>1 && arg1P_7>0 && arg2P_7>0 ], cost: 1
      7: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg5'=1+arg5, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1>0 && arg2>1 && arg1P_8>0 && arg2P_8>0 ], cost: 1
      8: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg5'=1+arg5, [ arg3>0 && arg5>-1 && arg5<arg4 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 ], cost: 1
      9: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg5'=1+arg5, [ arg5>-1 && arg3>0 && arg5<arg4 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>1 && arg2>1 && arg1P_10>3 && arg2P_10>3 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      2: f1612_0_main_NULL -> f1612_0_main_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1>=-2+arg1P_3 && arg1>=3+arg2P_3 && arg2>=1+arg2P_3 && arg1>2 && arg2>0 && arg1P_3>2 && arg2P_3>-1 ], cost: 1

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

Accelerating simple loops of location 3.
   Accelerating the following rules:
      4: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg5'=1+arg5, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      5: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg5'=1+arg5, [ arg5>-1 && arg3>0 && arg5<arg4 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>0 && arg2>2 && arg1P_6>0 && arg2P_6>0 ], cost: 1
      6: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg5'=1+arg5, [ arg5>-1 && arg3>0 && arg5<arg4 && arg1>0 && arg2>1 && arg1P_7>0 && arg2P_7>0 ], cost: 1
      7: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg5'=1+arg5, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1>0 && arg2>1 && arg1P_8>0 && arg2P_8>0 ], cost: 1
      8: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg5'=1+arg5, [ arg3>0 && arg5>-1 && arg5<arg4 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 ], cost: 1
      9: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg5'=1+arg5, [ arg5>-1 && arg3>0 && arg5<arg4 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>1 && arg2>1 && arg1P_10>3 && arg2P_10>3 ], cost: 1

   Failed to prove monotonicity of the guard of rule 4.
   Failed to prove monotonicity of the guard of rule 5.
[test] deduced pseudo-invariant -arg2+arg2P_7<=0, also trying arg2-arg2P_7<=-1
   Accelerated rule 6 with backward acceleration, yielding the new rule 11.
   Accelerated rule 6 with backward acceleration, yielding the new rule 12.
[test] deduced pseudo-invariant arg2-arg2P_8<=0, also trying -arg2+arg2P_8<=-1
   Accelerated rule 7 with backward acceleration, yielding the new rule 13.
   Accelerated rule 7 with backward acceleration, yielding the new rule 14.
   Failed to prove monotonicity of the guard of rule 8.
[test] deduced invariant 1-arg2-arg1<=0
[test] deduced pseudo-invariant -4+arg2P_10<=0, also trying 4-arg2P_10<=-1
   Failed to prove monotonicity of the guard of rule 9.
[accelerate] Nesting with 8 inner and 6 outer candidates
   Nested simple loops 6 (outer loop) and 8 (inner loop) with Rule(3 | arg5>-1, arg1>0, arg2>1, arg1P_9>3, arg2P_9>3, k_9>=1, 1+arg3-2*k_9>0, -1+arg5+2*k_9<arg4, | 2*k_9 || 3 | 0=arg1P_9, 1=arg2P_9, 2=arg3-2*k_9, 4=arg5+2*k_9, ), resulting in the new rules: 15, 16.
   Nested simple loops 7 (outer loop) and 8 (inner loop) with Rule(3 | arg5>-1, arg1>0, arg2>1, arg1P_9>3, arg2P_9>3, k_10>=1, 1+arg3-2*k_10>0, -1+arg5+2*k_10<arg4, | 2*k_10 || 3 | 0=arg1P_9, 1=arg2P_9, 2=arg3-2*k_10, 4=arg5+2*k_10, ), resulting in the new rules: 17, 18.
   Nested simple loops 6 (outer loop) and 9 (inner loop) with Rule(3 | arg5>-1, arg1>0, arg2>1, arg1P_10>3, arg2P_10>3, k_11>=1, 1+arg3-2*k_11>0, -1+arg5+2*k_11<arg4, | 2*k_11 || 3 | 0=arg1P_10, 1=arg2P_10, 2=arg3-2*k_11, 4=arg5+2*k_11, ), resulting in the new rules: 19, 20.
   Nested simple loops 7 (outer loop) and 9 (inner loop) with Rule(3 | arg5>-1, arg1>0, arg2>1, arg1P_10>3, arg2P_10>3, k_12>=1, 1+arg3-2*k_12>0, -1+arg5+2*k_12<arg4, | 2*k_12 || 3 | 0=arg1P_10, 1=arg2P_10, 2=arg3-2*k_12, 4=arg5+2*k_12, ), resulting in the new rules: 21, 22.
   Removing the simple loops: 6 7.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f1612_0_main_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
      3: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg2, arg5'=1, [ arg2>0 && arg3P_4>0 && -1+arg1P_4<=arg1 && -1+arg2P_4<=arg1 && arg1>0 && arg1P_4>1 && arg2P_4>1 ], cost: 1
      2: f1612_0_main_NULL -> f1612_0_main_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1>=-2+arg1P_3 && arg1>=3+arg2P_3 && arg2>=1+arg2P_3 && arg1>2 && arg2>0 && arg1P_3>2 && arg2P_3>-1 ], cost: 1
      4: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg5'=1+arg5, [ arg3>0 && arg5>-1 && arg5<arg4 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      5: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg5'=1+arg5, [ arg5>-1 && arg3>0 && arg5<arg4 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>0 && arg2>2 && arg1P_6>0 && arg2P_6>0 ], cost: 1
      8: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg5'=1+arg5, [ arg3>0 && arg5>-1 && arg5<arg4 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 ], cost: 1
      9: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg5'=1+arg5, [ arg5>-1 && arg3>0 && arg5<arg4 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>1 && arg2>1 && arg1P_10>3 && arg2P_10>3 ], cost: 1
     11: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg5'=arg5+arg3, [ arg5>-1 && arg1>0 && arg1P_7>0 && -arg2+arg2P_7<=0 && arg3>=1 && -1+arg5+arg3<arg4 && arg2P_7>1 ], cost: arg3
     12: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg5+arg3-arg4, arg5'=arg4, [ arg5>-1 && arg1>0 && arg1P_7>0 && -arg2+arg2P_7<=0 && -arg5+arg4>=1 && 1+arg5+arg3-arg4>0 && arg2P_7>1 ], cost: -arg5+arg4
     13: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg5'=arg5+arg3, [ arg5>-1 && arg1>0 && arg2>1 && arg1P_8>0 && arg2P_8>0 && arg2-arg2P_8<=0 && arg3>=1 && -1+arg5+arg3<arg4 ], cost: arg3
     14: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg5+arg3-arg4, arg5'=arg4, [ arg5>-1 && arg1>0 && arg2>1 && arg1P_8>0 && arg2P_8>0 && arg2-arg2P_8<=0 && -arg5+arg4>=1 && 1+arg5+arg3-arg4>0 ], cost: -arg5+arg4
     15: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3-2*k_9, arg5'=arg5+2*k_9, [ arg5>-1 && arg1>0 && arg2>1 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && 1+arg3-2*k_9>0 && -1+arg5+2*k_9<arg4 ], cost: 2*k_9
     16: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3-2*k_9, arg5'=1+arg5+2*k_9, [ arg3>0 && arg5>-1 && arg5<arg4 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && arg3-2*k_9>0 && arg5+2*k_9<arg4 ], cost: 1+2*k_9
     17: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3-2*k_10, arg5'=arg5+2*k_10, [ arg5>-1 && arg1>0 && arg2>1 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && 1+arg3-2*k_10>0 && -1+arg5+2*k_10<arg4 ], cost: 2*k_10
     18: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3-2*k_10, arg5'=1+arg5+2*k_10, [ arg3>0 && arg5>-1 && arg5<arg4 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && arg3-2*k_10>0 && arg5+2*k_10<arg4 ], cost: 1+2*k_10
     19: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3-2*k_11, arg5'=arg5+2*k_11, [ arg5>-1 && arg1>0 && arg2>1 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && 1+arg3-2*k_11>0 && -1+arg5+2*k_11<arg4 ], cost: 2*k_11
     20: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3-2*k_11, arg5'=1+arg5+2*k_11, [ arg5>-1 && arg3>0 && arg5<arg4 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>1 && arg2>1 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && arg3-2*k_11>0 && arg5+2*k_11<arg4 ], cost: 1+2*k_11
     21: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3-2*k_12, arg5'=arg5+2*k_12, [ arg5>-1 && arg1>0 && arg2>1 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && 1+arg3-2*k_12>0 && -1+arg5+2*k_12<arg4 ], cost: 2*k_12
     22: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3-2*k_12, arg5'=1+arg5+2*k_12, [ arg5>-1 && arg3>0 && arg5<arg4 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>1 && arg2>1 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && arg3-2*k_12>0 && arg5+2*k_12<arg4 ], cost: 1+2*k_12
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f1612_0_main_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
      3: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg2, arg5'=1, [ arg2>0 && arg3P_4>0 && -1+arg1P_4<=arg1 && -1+arg2P_4<=arg1 && arg1>0 && arg1P_4>1 && arg2P_4>1 ], cost: 1
     23: f1_0_main_Load -> f1612_0_main_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1>0 && arg1P_3>2 && arg2P_3>-1 ], cost: 2
     24: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3P_4, arg4'=arg2, arg5'=2, [ arg3P_4>0 && 1<arg2 && arg1P_5>0 && arg2P_5>0 && 2+arg2P_5<=1+arg1 && 3<=1+arg1 && arg1P_5<=1+arg1 ], cost: 2
     25: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_4, arg4'=arg2, arg5'=2, [ arg3P_4>0 && 1<arg2 && arg1P_6>0 && arg2P_6>0 && 2+arg2P_6<=1+arg1 && 3<=1+arg1 && arg1P_6<=1+arg1 ], cost: 2
     26: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4, arg4'=arg2, arg5'=2, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_9>3 && arg2P_9>3 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2
     27: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4, arg4'=arg2, arg5'=2, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_10>3 && arg2P_10>3 && -2+arg1P_10<=1+arg1 && -2+arg2P_10<=1+arg1 ], cost: 2
     28: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=arg2, arg5'=1+arg3P_4, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_7>0 && arg3P_4<arg2 && arg2P_7>1 && arg2P_7<=1+arg1 ], cost: 1+arg3P_4
     29: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=1-arg2+arg3P_4, arg4'=arg2, arg5'=arg2, [ arg3P_4>0 && arg1>0 && arg1P_7>0 && -1+arg2>=1 && 2-arg2+arg3P_4>0 && arg2P_7>1 && arg2P_7<=1+arg1 ], cost: arg2
     30: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=arg2, arg5'=1+arg3P_4, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_8>0 && arg3P_4<arg2 && 2<=arg2P_8 ], cost: 1+arg3P_4
     31: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=1-arg2+arg3P_4, arg4'=arg2, arg5'=arg2, [ arg3P_4>0 && arg1>0 && arg1P_8>0 && -1+arg2>=1 && 2-arg2+arg3P_4>0 && 2<=arg2P_8 ], cost: arg2
     32: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_9, arg4'=arg2, arg5'=1+2*k_9, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && 1+arg3P_4-2*k_9>0 && 2*k_9<arg2 ], cost: 1+2*k_9
     33: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_9, arg4'=arg2, arg5'=2+2*k_9, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && arg3P_4-2*k_9>0 && 1+2*k_9<arg2 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2+2*k_9
     34: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_10, arg4'=arg2, arg5'=1+2*k_10, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && 1+arg3P_4-2*k_10>0 && 2*k_10<arg2 ], cost: 1+2*k_10
     35: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_10, arg4'=arg2, arg5'=2+2*k_10, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && arg3P_4-2*k_10>0 && 1+2*k_10<arg2 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2+2*k_10
     36: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_11, arg4'=arg2, arg5'=1+2*k_11, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && 1+arg3P_4-2*k_11>0 && 2*k_11<arg2 ], cost: 1+2*k_11
     37: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_11, arg4'=arg2, arg5'=2+2*k_11, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && arg3P_4-2*k_11>0 && 1+2*k_11<arg2 && -2+arg1P_10<=1+arg1 && -2+arg2P_10<=1+arg1 ], cost: 2+2*k_11
     38: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_12, arg4'=arg2, arg5'=1+2*k_12, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && 1+arg3P_4-2*k_12>0 && 2*k_12<arg2 ], cost: 1+2*k_12
     39: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_12, arg4'=arg2, arg5'=2+2*k_12, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && arg3P_4-2*k_12>0 && 1+2*k_12<arg2 && -2+arg1P_10<=1+arg1 && -2+arg2P_10<=1+arg1 ], cost: 2+2*k_12
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     28: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=arg2, arg5'=1+arg3P_4, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_7>0 && arg3P_4<arg2 && arg2P_7>1 && arg2P_7<=1+arg1 ], cost: 1+arg3P_4
     29: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=1-arg2+arg3P_4, arg4'=arg2, arg5'=arg2, [ arg3P_4>0 && arg1>0 && arg1P_7>0 && -1+arg2>=1 && 2-arg2+arg3P_4>0 && arg2P_7>1 && arg2P_7<=1+arg1 ], cost: arg2
     30: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=arg2, arg5'=1+arg3P_4, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_8>0 && arg3P_4<arg2 && 2<=arg2P_8 ], cost: 1+arg3P_4
     31: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=1-arg2+arg3P_4, arg4'=arg2, arg5'=arg2, [ arg3P_4>0 && arg1>0 && arg1P_8>0 && -1+arg2>=1 && 2-arg2+arg3P_4>0 && 2<=arg2P_8 ], cost: arg2
     32: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_9, arg4'=arg2, arg5'=1+2*k_9, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && 1+arg3P_4-2*k_9>0 && 2*k_9<arg2 ], cost: 1+2*k_9
     33: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_9, arg4'=arg2, arg5'=2+2*k_9, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && arg3P_4-2*k_9>0 && 1+2*k_9<arg2 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2+2*k_9
     34: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_10, arg4'=arg2, arg5'=1+2*k_10, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && 1+arg3P_4-2*k_10>0 && 2*k_10<arg2 ], cost: 1+2*k_10
     35: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_10, arg4'=arg2, arg5'=2+2*k_10, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && arg3P_4-2*k_10>0 && 1+2*k_10<arg2 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2+2*k_10
     36: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_11, arg4'=arg2, arg5'=1+2*k_11, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && 1+arg3P_4-2*k_11>0 && 2*k_11<arg2 ], cost: 1+2*k_11
     37: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_11, arg4'=arg2, arg5'=2+2*k_11, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && arg3P_4-2*k_11>0 && 1+2*k_11<arg2 && -2+arg1P_10<=1+arg1 && -2+arg2P_10<=1+arg1 ], cost: 2+2*k_11
     38: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_12, arg4'=arg2, arg5'=1+2*k_12, [ arg2>0 && arg3P_4>0 && arg1>0 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && 1+arg3P_4-2*k_12>0 && 2*k_12<arg2 ], cost: 1+2*k_12
     39: f1_0_main_Load -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_12, arg4'=arg2, arg5'=2+2*k_12, [ arg3P_4>0 && arg1>0 && 1<arg2 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && arg3P_4-2*k_12>0 && 1+2*k_12<arg2 && -2+arg1P_10<=1+arg1 && -2+arg2P_10<=1+arg1 ], cost: 2+2*k_12
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     40: __init -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=arg2P_11, arg5'=1+arg3P_4, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_7>0 && arg3P_4<arg2P_11 && arg2P_7>1 && arg2P_7<=1+arg1P_11 ], cost: 2+arg3P_4
     41: __init -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=1+arg3P_4-arg2P_11, arg4'=arg2P_11, arg5'=arg2P_11, [ arg3P_4>0 && arg1P_11>0 && arg1P_7>0 && -1+arg2P_11>=1 && 2+arg3P_4-arg2P_11>0 && arg2P_7>1 && arg2P_7<=1+arg1P_11 ], cost: 1+arg2P_11
     42: __init -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=arg2P_11, arg5'=1+arg3P_4, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_8>0 && arg3P_4<arg2P_11 && 2<=arg2P_8 ], cost: 2+arg3P_4
     43: __init -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=1+arg3P_4-arg2P_11, arg4'=arg2P_11, arg5'=arg2P_11, [ arg3P_4>0 && arg1P_11>0 && arg1P_8>0 && -1+arg2P_11>=1 && 2+arg3P_4-arg2P_11>0 && 2<=arg2P_8 ], cost: 1+arg2P_11
     44: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_9, arg4'=arg2P_11, arg5'=1+2*k_9, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && 1+arg3P_4-2*k_9>0 && 2*k_9<arg2P_11 ], cost: 2+2*k_9
     45: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_9, arg4'=arg2P_11, arg5'=2+2*k_9, [ arg3P_4>0 && arg1P_11>0 && 1<arg2P_11 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && arg3P_4-2*k_9>0 && 1+2*k_9<arg2P_11 && -2+arg1P_9<=1+arg1P_11 && -2+arg2P_9<=1+arg1P_11 ], cost: 3+2*k_9
     46: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_10, arg4'=arg2P_11, arg5'=1+2*k_10, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && 1+arg3P_4-2*k_10>0 && 2*k_10<arg2P_11 ], cost: 2+2*k_10
     47: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_10, arg4'=arg2P_11, arg5'=2+2*k_10, [ arg3P_4>0 && arg1P_11>0 && 1<arg2P_11 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && arg3P_4-2*k_10>0 && 1+2*k_10<arg2P_11 && -2+arg1P_9<=1+arg1P_11 && -2+arg2P_9<=1+arg1P_11 ], cost: 3+2*k_10
     48: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_11, arg4'=arg2P_11, arg5'=1+2*k_11, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && 1+arg3P_4-2*k_11>0 && 2*k_11<arg2P_11 ], cost: 2+2*k_11
     49: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_11, arg4'=arg2P_11, arg5'=2+2*k_11, [ arg3P_4>0 && arg1P_11>0 && 1<arg2P_11 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && arg3P_4-2*k_11>0 && 1+2*k_11<arg2P_11 && -2+arg1P_10<=1+arg1P_11 && -2+arg2P_10<=1+arg1P_11 ], cost: 3+2*k_11
     50: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_12, arg4'=arg2P_11, arg5'=1+2*k_12, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && 1+arg3P_4-2*k_12>0 && 2*k_12<arg2P_11 ], cost: 2+2*k_12
     51: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_12, arg4'=arg2P_11, arg5'=2+2*k_12, [ arg3P_4>0 && arg1P_11>0 && 1<arg2P_11 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && arg3P_4-2*k_12>0 && 1+2*k_12<arg2P_11 && -2+arg1P_10<=1+arg1P_11 && -2+arg2P_10<=1+arg1P_11 ], cost: 3+2*k_12

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     40: __init -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=arg2P_11, arg5'=1+arg3P_4, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_7>0 && arg3P_4<arg2P_11 && arg2P_7>1 && arg2P_7<=1+arg1P_11 ], cost: 2+arg3P_4
     41: __init -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=1+arg3P_4-arg2P_11, arg4'=arg2P_11, arg5'=arg2P_11, [ arg3P_4>0 && arg1P_11>0 && arg1P_7>0 && -1+arg2P_11>=1 && 2+arg3P_4-arg2P_11>0 && arg2P_7>1 && arg2P_7<=1+arg1P_11 ], cost: 1+arg2P_11
     42: __init -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=arg2P_11, arg5'=1+arg3P_4, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_8>0 && arg3P_4<arg2P_11 && 2<=arg2P_8 ], cost: 2+arg3P_4
     43: __init -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=1+arg3P_4-arg2P_11, arg4'=arg2P_11, arg5'=arg2P_11, [ arg3P_4>0 && arg1P_11>0 && arg1P_8>0 && -1+arg2P_11>=1 && 2+arg3P_4-arg2P_11>0 && 2<=arg2P_8 ], cost: 1+arg2P_11
     44: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_9, arg4'=arg2P_11, arg5'=1+2*k_9, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && 1+arg3P_4-2*k_9>0 && 2*k_9<arg2P_11 ], cost: 2+2*k_9
     45: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_9, arg4'=arg2P_11, arg5'=2+2*k_9, [ arg3P_4>0 && arg1P_11>0 && 1<arg2P_11 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && arg3P_4-2*k_9>0 && 1+2*k_9<arg2P_11 && -2+arg1P_9<=1+arg1P_11 && -2+arg2P_9<=1+arg1P_11 ], cost: 3+2*k_9
     46: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_10, arg4'=arg2P_11, arg5'=1+2*k_10, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && 1+arg3P_4-2*k_10>0 && 2*k_10<arg2P_11 ], cost: 2+2*k_10
     47: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_10, arg4'=arg2P_11, arg5'=2+2*k_10, [ arg3P_4>0 && arg1P_11>0 && 1<arg2P_11 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && arg3P_4-2*k_10>0 && 1+2*k_10<arg2P_11 && -2+arg1P_9<=1+arg1P_11 && -2+arg2P_9<=1+arg1P_11 ], cost: 3+2*k_10
     48: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_11, arg4'=arg2P_11, arg5'=1+2*k_11, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && 1+arg3P_4-2*k_11>0 && 2*k_11<arg2P_11 ], cost: 2+2*k_11
     49: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_11, arg4'=arg2P_11, arg5'=2+2*k_11, [ arg3P_4>0 && arg1P_11>0 && 1<arg2P_11 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && arg3P_4-2*k_11>0 && 1+2*k_11<arg2P_11 && -2+arg1P_10<=1+arg1P_11 && -2+arg2P_10<=1+arg1P_11 ], cost: 3+2*k_11
     50: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_12, arg4'=arg2P_11, arg5'=1+2*k_12, [ arg2P_11>0 && arg3P_4>0 && arg1P_11>0 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && 1+arg3P_4-2*k_12>0 && 2*k_12<arg2P_11 ], cost: 2+2*k_12
     51: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_12, arg4'=arg2P_11, arg5'=2+2*k_12, [ arg3P_4>0 && arg1P_11>0 && 1<arg2P_11 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && arg3P_4-2*k_12>0 && 1+2*k_12<arg2P_11 && -2+arg1P_10<=1+arg1P_11 && -2+arg2P_10<=1+arg1P_11 ], cost: 3+2*k_12

Computing asymptotic complexity for rule 42
   Simplified the guard:
     42: __init -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=arg2P_11, arg5'=1+arg3P_4, [ arg3P_4>0 && arg1P_11>0 && arg1P_8>0 && arg3P_4<arg2P_11 && 2<=arg2P_8 ], cost: 2+arg3P_4
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 43
   Simplified the guard:
     43: __init -> f1301_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=1+arg3P_4-arg2P_11, arg4'=arg2P_11, arg5'=arg2P_11, [ arg1P_11>0 && arg1P_8>0 && -1+arg2P_11>=1 && 2+arg3P_4-arg2P_11>0 && 2<=arg2P_8 ], cost: 1+arg2P_11
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 40
   Simplified the guard:
     40: __init -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=arg2P_11, arg5'=1+arg3P_4, [ arg3P_4>0 && arg1P_7>0 && arg3P_4<arg2P_11 && arg2P_7>1 && arg2P_7<=1+arg1P_11 ], cost: 2+arg3P_4
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 41
   Simplified the guard:
     41: __init -> f1301_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=1+arg3P_4-arg2P_11, arg4'=arg2P_11, arg5'=arg2P_11, [ arg1P_7>0 && -1+arg2P_11>=1 && 2+arg3P_4-arg2P_11>0 && arg2P_7>1 && arg2P_7<=1+arg1P_11 ], cost: 1+arg2P_11
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 44
   Simplified the guard:
     44: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_9, arg4'=arg2P_11, arg5'=1+2*k_9, [ arg1P_11>0 && arg1P_9>3 && arg2P_9>3 && k_9>=1 && 1+arg3P_4-2*k_9>0 && 2*k_9<arg2P_11 ], cost: 2+2*k_9
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 46
   Simplified the guard:
     46: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_4-2*k_10, arg4'=arg2P_11, arg5'=1+2*k_10, [ arg1P_11>0 && arg1P_9>3 && arg2P_9>3 && k_10>=1 && 1+arg3P_4-2*k_10>0 && 2*k_10<arg2P_11 ], cost: 2+2*k_10
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 48
   Simplified the guard:
     48: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_11, arg4'=arg2P_11, arg5'=1+2*k_11, [ arg1P_11>0 && arg1P_10>3 && arg2P_10>3 && k_11>=1 && 1+arg3P_4-2*k_11>0 && 2*k_11<arg2P_11 ], cost: 2+2*k_11
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 50
   Simplified the guard:
     50: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_4-2*k_12, arg4'=arg2P_11, arg5'=1+2*k_12, [ arg1P_11>0 && arg1P_10>3 && arg2P_10>3 && k_12>=1 && 1+arg3P_4-2*k_12>0 && 2*k_12<arg2P_11 ], cost: 2+2*k_12
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 45
   Simplified the guard:
     45: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_9, arg4'=arg2P_11, arg5'=2+2*k_9, [ arg1P_9>3 && arg2P_9>3 && k_9>=1 && arg3P_4-2*k_9>0 && 1+2*k_9<arg2P_11 && -2+arg1P_9<=1+arg1P_11 && -2+arg2P_9<=1+arg1P_11 ], cost: 3+2*k_9
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 47
   Simplified the guard:
     47: __init -> f1301_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_4-2*k_10, arg4'=arg2P_11, arg5'=2+2*k_10, [ arg1P_9>3 && arg2P_9>3 && k_10>=1 && arg3P_4-2*k_10>0 && 1+2*k_10<arg2P_11 && -2+arg1P_9<=1+arg1P_11 && -2+arg2P_9<=1+arg1P_11 ], cost: 3+2*k_10
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 49
   Simplified the guard:
     49: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_11, arg4'=arg2P_11, arg5'=2+2*k_11, [ arg1P_10>3 && arg2P_10>3 && k_11>=1 && arg3P_4-2*k_11>0 && 1+2*k_11<arg2P_11 && -2+arg1P_10<=1+arg1P_11 && -2+arg2P_10<=1+arg1P_11 ], cost: 3+2*k_11
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 51
   Simplified the guard:
     51: __init -> f1301_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_4-2*k_12, arg4'=arg2P_11, arg5'=2+2*k_12, [ arg1P_10>3 && arg2P_10>3 && k_12>=1 && arg3P_4-2*k_12>0 && 1+2*k_12<arg2P_11 && -2+arg1P_10<=1+arg1P_11 && -2+arg2P_10<=1+arg1P_11 ], cost: 3+2*k_12
   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),?)