WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ x7_1>-1 && arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 && arg2==arg2P_3 && 1==arg3P_3 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ x34_1>0 && arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg3==arg3P_7 ], cost: 1
      1: f1220_0_create_Return -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ arg1P_2<=arg1 && 3+arg1P_2<=arg2 && arg2P_2<=arg2 && arg1>0 && arg2>3 && arg1P_2>0 && arg2P_2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg3==arg3P_2 && arg4==arg4P_2 && arg5==arg5P_2 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg2>-1 && arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 && arg1==arg1P_4 && 0==arg2P_4 && arg2==arg4P_4 && 1+arg3==arg5P_4 ], cost: 1
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && -1+arg1<arg1 && -1+arg1==arg1P_5 && arg4==arg2P_5 && arg5==arg3P_5 ], cost: 1
      5: f2072_0_create_GE -> f2072_0_create_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && -1+arg1<arg1 && arg1==arg1P_6 && 1+arg2==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      7: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && 3+arg2P_8<=arg2 && arg1>0 && arg2>2 && arg1P_8>0 && arg2P_8>-1 && arg3==arg3P_8 ], cost: 1
      8: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ 2+arg2P_9<=arg2 && arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && arg2P_9>-1 && arg3==arg3P_9 ], cost: 1
      9: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>2 && arg2P_10>-1 && arg3==arg3P_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 -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ x7_1>-1 && arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 && arg2==arg2P_3 && 1==arg3P_3 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ x34_1>0 && arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg3==arg3P_7 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg2>-1 && arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 && arg1==arg1P_4 && 0==arg2P_4 && arg2==arg4P_4 && 1+arg3==arg5P_4 ], cost: 1
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && -1+arg1<arg1 && -1+arg1==arg1P_5 && arg4==arg2P_5 && arg5==arg3P_5 ], cost: 1
      5: f2072_0_create_GE -> f2072_0_create_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && -1+arg1<arg1 && arg1==arg1P_6 && 1+arg2==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      7: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && 3+arg2P_8<=arg2 && arg1>0 && arg2>2 && arg1P_8>0 && arg2P_8>-1 && arg3==arg3P_8 ], cost: 1
      8: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ 2+arg2P_9<=arg2 && arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && arg2P_9>-1 && arg3==arg3P_9 ], cost: 1
      9: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>2 && arg2P_10>-1 && arg3==arg3P_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 -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
      5: f2072_0_create_GE -> f2072_0_create_GE : arg2'=1+arg2, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
      7: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && 3+arg2P_8<=arg2 && arg1>0 && arg2>2 && arg1P_8>0 && arg2P_8>-1 ], cost: 1
      8: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ 2+arg2P_9<=arg2 && arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && arg2P_9>-1 ], cost: 1
      9: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>2 && arg2P_10>-1 ], 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 4.
   Accelerating the following rules:
      5: f2072_0_create_GE -> f2072_0_create_GE : arg2'=1+arg2, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1

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

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

   Failed to prove monotonicity of the guard of rule 7.
   Failed to prove monotonicity of the guard of rule 8.
   Failed to prove monotonicity of the guard of rule 9.
[accelerate] Nesting with 3 inner and 3 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
      5: f2072_0_create_GE -> f2072_0_create_GE : arg2'=1+arg2, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
      7: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && 3+arg2P_8<=arg2 && arg1>0 && arg2>2 && arg1P_8>0 && arg2P_8>-1 ], cost: 1
      8: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ 2+arg2P_9<=arg2 && arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && arg2P_9>-1 ], cost: 1
      9: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>2 && arg2P_10>-1 ], 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

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 ], cost: 1
     12: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>1 && arg1>0 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg1P_8>0 && arg2P_8>-1 && arg1P_8<=1+arg1 && arg1P_8<=-2+arg2 && 3+arg2P_8<=-3+arg2 && 3<=-3+arg2 ], cost: 2
     13: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>1 && arg1>0 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg1P_9>0 && arg2P_9>-1 && 2+arg2P_9<=-3+arg2 && 3<=-3+arg2 ], cost: 2
     14: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ arg3>1 && arg1>0 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg1P_10>2 && arg2P_10>-1 && 2+arg2P_10<=-3+arg2 && 3<=-3+arg2 ], cost: 2
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
     11: f804_0_create_GT -> f2072_0_create_GE : arg2'=1, arg3'=arg3P_4, arg4'=arg2, arg5'=arg5P_6, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 ], cost: 2
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], 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

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
     11: f804_0_create_GT -> f2072_0_create_GE : arg2'=1, arg3'=arg3P_4, arg4'=arg2, arg5'=arg5P_6, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 ], cost: 2
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], 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

Eliminated locations (on linear paths):
   Start location: __init
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
     11: f804_0_create_GT -> f2072_0_create_GE : arg2'=1, arg3'=arg3P_4, arg4'=arg2, arg5'=arg5P_6, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 ], cost: 2
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
     15: __init -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2P_11>0 && arg1P_11>0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     16: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 ], cost: 2
     17: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg2, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>1 && arg5P_6>1 ], cost: 3
     15: __init -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2P_11>0 && arg1P_11>0 ], cost: 2

Accelerating simple loops of location 3.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     16: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg3'=1+arg3, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 ], cost: 2
     17: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg5P_6>1 ], cost: 3

   Accelerated rule 16 with backward acceleration, yielding the new rule 18.
   Accelerated rule 16 with backward acceleration, yielding the new rule 19.
[test] deduced pseudo-invariant -arg5P_6+arg3<=0, also trying arg5P_6-arg3<=-1
   Accelerated rule 17 with backward acceleration, yielding the new rule 20.
[accelerate] Nesting with 3 inner and 2 outer candidates
   Removing the simple loops: 16.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     17: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg5P_6>1 ], cost: 3
     18: f804_0_create_GT -> f804_0_create_GT : arg1'=1, arg3'=-1+arg3+arg1, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>0 && -1+arg1>=1 && -2+arg3+arg1<arg2 ], cost: -2+2*arg1
     19: f804_0_create_GT -> f804_0_create_GT : arg1'=-arg2+arg3+arg1, arg3'=arg2, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>0 && arg2-arg3>=1 && 1-arg2+arg3+arg1>1 ], cost: 2*arg2-2*arg3
     20: f804_0_create_GT -> f804_0_create_GT : arg1'=1, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>0 && arg5P_6>1 && -arg5P_6+arg3<=0 && -1+arg1>=1 && arg5P_6<arg2 ], cost: -3+3*arg1
     15: __init -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2P_11>0 && arg1P_11>0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     15: __init -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2P_11>0 && arg1P_11>0 ], cost: 2
     21: __init -> f804_0_create_GT : arg1'=-1+arg1P_3, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_3>1 && 1<arg2P_11 && arg5P_6>1 ], cost: 5
     22: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg1P_3, arg4'=arg4P_5, arg5'=arg5P_5, [ arg2P_11>0 && -1+arg1P_3>=1 && -1+arg1P_3<arg2P_11 ], cost: 2*arg1P_3
     23: __init -> f804_0_create_GT : arg1'=1+arg1P_3-arg2P_11, arg2'=arg2P_11, arg3'=arg2P_11, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_3>-1 && -1+arg2P_11>=1 && 2+arg1P_3-arg2P_11>1 ], cost: 2*arg2P_11
     24: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg2P_11>0 && arg5P_6>1 && -1+arg1P_3>=1 && arg5P_6<arg2P_11 ], cost: -1+3*arg1P_3

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     22: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg1P_3, arg4'=arg4P_5, arg5'=arg5P_5, [ arg2P_11>0 && -1+arg1P_3>=1 && -1+arg1P_3<arg2P_11 ], cost: 2*arg1P_3
     23: __init -> f804_0_create_GT : arg1'=1+arg1P_3-arg2P_11, arg2'=arg2P_11, arg3'=arg2P_11, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_3>-1 && -1+arg2P_11>=1 && 2+arg1P_3-arg2P_11>1 ], cost: 2*arg2P_11
     24: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg2P_11>0 && arg5P_6>1 && -1+arg1P_3>=1 && arg5P_6<arg2P_11 ], cost: -1+3*arg1P_3

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     22: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg1P_3, arg4'=arg4P_5, arg5'=arg5P_5, [ arg2P_11>0 && -1+arg1P_3>=1 && -1+arg1P_3<arg2P_11 ], cost: 2*arg1P_3
     23: __init -> f804_0_create_GT : arg1'=1+arg1P_3-arg2P_11, arg2'=arg2P_11, arg3'=arg2P_11, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_3>-1 && -1+arg2P_11>=1 && 2+arg1P_3-arg2P_11>1 ], cost: 2*arg2P_11
     24: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg2P_11>0 && arg5P_6>1 && -1+arg1P_3>=1 && arg5P_6<arg2P_11 ], cost: -1+3*arg1P_3

Computing asymptotic complexity for rule 22
   Simplified the guard:
     22: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg1P_3, arg4'=arg4P_5, arg5'=arg5P_5, [ -1+arg1P_3>=1 && -1+arg1P_3<arg2P_11 ], cost: 2*arg1P_3
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 23
   Simplified the guard:
     23: __init -> f804_0_create_GT : arg1'=1+arg1P_3-arg2P_11, arg2'=arg2P_11, arg3'=arg2P_11, arg4'=arg4P_5, arg5'=arg5P_5, [ -1+arg2P_11>=1 && 2+arg1P_3-arg2P_11>1 ], cost: 2*arg2P_11
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 24
   Simplified the guard:
     24: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg5P_6>1 && -1+arg1P_3>=1 && arg5P_6<arg2P_11 ], cost: -1+3*arg1P_3
   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),?)