WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1>0 && arg2>-1 && arg2==arg1P_1 ], cost: 1
      1: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1<0 && arg1<5 && 1-arg1==arg1P_2 ], cost: 1
      2: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1>0 && arg1<5 && 1-arg1==arg1P_3 ], cost: 1
      3: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1>4 && 2>-arg1 && -1-arg1==arg1P_4 ], cost: 1
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P_2, [ arg1<0 ], cost: 1
      2: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P_3, [ arg1>0 && arg1<5 ], cost: 1
      3: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P_4, [ arg1>4 ], cost: 1
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P_2, [ arg1<0 ], cost: 1
      2: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P_3, [ arg1>0 && arg1<5 ], cost: 1
      3: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P_4, [ arg1>4 ], cost: 1

   Found no metering function for rule 1.
   Accelerated rule 2 with metering function meter (where 7*meter==arg1), yielding the new rule 5.
   Found no metering function for rule 3.
   Removing the simple loops: 2.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1-arg1, arg2'=arg2P_2, [ arg1<0 ], cost: 1
      3: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=-1-arg1, arg2'=arg2P_4, [ arg1>4 ], cost: 1
      5: f104_0_loop_EQ -> f104_0_loop_EQ : arg1'=1/2+(-1)^meter*arg1-1/2*(-1)^meter, arg2'=arg2P_3, [ arg1>0 && arg1<5 && 7*meter==arg1 && meter>=1 ], cost: meter
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f104_0_loop_EQ : arg1'=arg2, arg2'=arg2P_1, [ arg1>0 && arg2>-1 ], cost: 1
      6: f1_0_main_Load -> f104_0_loop_EQ : arg1'=-1-arg2, arg2'=arg2P_4, [ arg1>0 && arg2>4 ], cost: 2
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, [], cost: 1

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