WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f74_0_loop_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 && 0==arg2P_1 && arg2==arg3P_1 && arg2==arg4P_1 ], cost: 1
      1: f74_0_loop_LE -> f74_0_loop_LE\' : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg4>-1 && arg3>0 && x7_1<=arg1 && arg1>0 && x7_1>0 && arg1==arg1P_2 && arg2==arg2P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
      2: f74_0_loop_LE\' -> f74_0_loop_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg4>-1 && arg3>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg4-2*x13_1-arg2<2 && arg4-2*x13_1-arg2>=0 && x13_1+arg2==arg2P_3 && arg4-x13_1-arg2==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f74_0_loop_LE : arg1'=arg1P_1, arg2'=0, arg3'=arg2, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f74_0_loop_LE -> f74_0_loop_LE\' : [ arg4>-1 && arg3>0 && arg1>0 ], cost: 1
      2: f74_0_loop_LE\' -> f74_0_loop_LE : arg1'=arg1P_3, arg2'=x13_1+arg2, arg3'=arg4-x13_1-arg2, [ arg4>-1 && arg3>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg4-2*x13_1-arg2<2 && arg4-2*x13_1-arg2>=0 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
      5: f74_0_loop_LE -> f74_0_loop_LE : arg1'=arg1P_3, arg2'=x13_1+arg2, arg3'=arg4-x13_1-arg2, [ arg4>-1 && arg3>0 && arg1>0 && arg1P_3<=arg1 && arg1P_3>0 && arg4-2*x13_1-arg2<2 && arg4-2*x13_1-arg2>=0 ], cost: 2
      4: __init -> f74_0_loop_LE : arg1'=arg1P_1, arg2'=0, arg3'=arg2P_4, arg4'=arg2P_4, [ arg1P_1<=arg1P_4 && arg2P_4>-1 && arg1P_4>0 && arg1P_1>0 ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      5: f74_0_loop_LE -> f74_0_loop_LE : arg1'=arg1P_3, arg2'=x13_1+arg2, arg3'=arg4-x13_1-arg2, [ arg4>-1 && arg3>0 && arg1>0 && arg1P_3<=arg1 && arg1P_3>0 && arg4-2*x13_1-arg2<2 && arg4-2*x13_1-arg2>=0 ], cost: 2

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      5: f74_0_loop_LE -> f74_0_loop_LE : arg1'=arg1P_3, arg2'=x13_1+arg2, arg3'=arg4-x13_1-arg2, [ arg4>-1 && arg3>0 && arg1>0 && arg1P_3<=arg1 && arg1P_3>0 && arg4-2*x13_1-arg2<2 && arg4-2*x13_1-arg2>=0 ], cost: 2
      4: __init -> f74_0_loop_LE : arg1'=arg1P_1, arg2'=0, arg3'=arg2P_4, arg4'=arg2P_4, [ arg1P_1<=arg1P_4 && arg2P_4>-1 && arg1P_4>0 && arg1P_1>0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
      4: __init -> f74_0_loop_LE : arg1'=arg1P_1, arg2'=0, arg3'=arg2P_4, arg4'=arg2P_4, [ arg1P_1<=arg1P_4 && arg2P_4>-1 && arg1P_4>0 && arg1P_1>0 ], cost: 2
      6: __init -> f74_0_loop_LE : arg1'=arg1P_3, arg2'=x13_1, arg3'=-x13_1+arg2P_4, arg4'=arg2P_4, [ arg2P_4>0 && arg1P_3>0 && -2*x13_1+arg2P_4<2 && -2*x13_1+arg2P_4>=0 ], cost: 4

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     <empty>

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),?)