WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f563_0_mk_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && 0==arg2 && -1==arg1P_1 && 0==arg2P_1 && 0==arg3P_1 && 0==arg4P_1 ], cost: 1
      1: f1_0_main_Load -> f563_0_mk_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ x3_1>-1 && arg2>0 && arg1>0 && -1+3*x3_1==arg1P_2 && 3*x3_1==arg2P_2 && arg2==arg3P_2 && 1==arg4P_2 ], cost: 1
      2: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg2>0 && arg4>=arg3 && arg3>-1 && -1+arg1==arg1P_3 && arg1==arg2P_3 && arg3==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f563_0_mk_LE -> f563_0_mk_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2>0 && arg3>-1 && arg4>-1 && arg4<arg3 && -1+arg1==arg1P_4 && arg1==arg2P_4 && arg3==arg3P_4 && 1+arg4==arg4P_4 ], cost: 1
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_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, arg3'=arg3P_5, arg4'=arg4P_5, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=0, arg4'=0, [ arg1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1+3*x3_1, arg2'=3*x3_1, arg3'=arg2, arg4'=1, [ x3_1>-1 && arg2>0 && arg1>0 ], cost: 1
      2: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, [ arg2>0 && arg4>=arg3 && arg3>-1 ], cost: 1
      3: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg4'=1+arg4, [ arg2>0 && arg4>-1 && arg4<arg3 ], cost: 1
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [], cost: 1

### Simplification by acceleration and chaining ###

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

[test] deduced invariant 1-arg2+arg1<=0
   Accelerated rule 2 with backward acceleration, yielding the new rule 5.
[test] deduced invariant 1-arg2+arg1<=0
   Accelerated rule 3 with backward acceleration, yielding the new rule 6.
   Accelerated rule 3 with backward acceleration, yielding the new rule 7.
[accelerate] Nesting with 3 inner and 2 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=0, arg4'=0, [ arg1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1+3*x3_1, arg2'=3*x3_1, arg3'=arg2, arg4'=1, [ x3_1>-1 && arg2>0 && arg1>0 ], cost: 1
      2: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, [ arg2>0 && arg4>=arg3 && arg3>-1 ], cost: 1
      3: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1+arg1, arg2'=arg1, arg4'=1+arg4, [ arg2>0 && arg4>-1 && arg4<arg3 ], cost: 1
      5: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, [ arg4>=arg3 && arg3>-1 && 1-arg2+arg1<=0 && 1+arg1>=1 ], cost: 1+arg1
      6: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg4'=1+arg4+arg1, [ arg4>-1 && 1-arg2+arg1<=0 && 1+arg1>=1 && arg4+arg1<arg3 ], cost: 1+arg1
      7: f563_0_mk_LE -> f563_0_mk_LE : arg1'=-arg3+arg4+arg1, arg2'=1-arg3+arg4+arg1, arg4'=arg3, [ arg4>-1 && 1-arg2+arg1<=0 && arg3-arg4>=1 && 2-arg3+arg4+arg1>0 ], cost: arg3-arg4
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=0, arg4'=0, [ arg1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1+3*x3_1, arg2'=3*x3_1, arg3'=arg2, arg4'=1, [ x3_1>-1 && arg2>0 && arg1>0 ], cost: 1
      8: f1_0_main_Load -> f563_0_mk_LE : arg1'=-2+3*x3_1, arg2'=-1+3*x3_1, arg3'=arg2, arg4'=1, [ x3_1>-1 && 1-arg2==0 && arg1>0 && 3*x3_1>0 ], cost: 2
      9: f1_0_main_Load -> f563_0_mk_LE : arg1'=-2+3*x3_1, arg2'=-1+3*x3_1, arg3'=arg2, arg4'=2, [ x3_1>-1 && arg1>0 && 3*x3_1>0 && 1<arg2 ], cost: 2
     10: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2, arg4'=1, [ x3_1>-1 && 1-arg2==0 && arg1>0 && 3*x3_1>=1 ], cost: 1+3*x3_1
     11: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2, arg4'=1+3*x3_1, [ x3_1>-1 && arg2>0 && arg1>0 && 3*x3_1>=1 && 3*x3_1<arg2 ], cost: 1+3*x3_1
     12: f1_0_main_Load -> f563_0_mk_LE : arg1'=-arg2+3*x3_1, arg2'=1-arg2+3*x3_1, arg3'=arg2, arg4'=arg2, [ x3_1>-1 && arg1>0 && -1+arg2>=1 && 2-arg2+3*x3_1>0 ], cost: arg2
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     10: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2, arg4'=1, [ x3_1>-1 && 1-arg2==0 && arg1>0 && 3*x3_1>=1 ], cost: 1+3*x3_1
     11: f1_0_main_Load -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2, arg4'=1+3*x3_1, [ x3_1>-1 && arg2>0 && arg1>0 && 3*x3_1>=1 && 3*x3_1<arg2 ], cost: 1+3*x3_1
     12: f1_0_main_Load -> f563_0_mk_LE : arg1'=-arg2+3*x3_1, arg2'=1-arg2+3*x3_1, arg3'=arg2, arg4'=arg2, [ x3_1>-1 && arg1>0 && -1+arg2>=1 && 2-arg2+3*x3_1>0 ], cost: arg2
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     13: __init -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2P_5, arg4'=1, [ x3_1>-1 && 1-arg2P_5==0 && arg1P_5>0 && 3*x3_1>=1 ], cost: 2+3*x3_1
     14: __init -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2P_5, arg4'=1+3*x3_1, [ x3_1>-1 && arg2P_5>0 && arg1P_5>0 && 3*x3_1>=1 && 3*x3_1<arg2P_5 ], cost: 2+3*x3_1
     15: __init -> f563_0_mk_LE : arg1'=-arg2P_5+3*x3_1, arg2'=1-arg2P_5+3*x3_1, arg3'=arg2P_5, arg4'=arg2P_5, [ x3_1>-1 && arg1P_5>0 && -1+arg2P_5>=1 && 2-arg2P_5+3*x3_1>0 ], cost: 1+arg2P_5

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     13: __init -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2P_5, arg4'=1, [ x3_1>-1 && 1-arg2P_5==0 && arg1P_5>0 && 3*x3_1>=1 ], cost: 2+3*x3_1
     14: __init -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2P_5, arg4'=1+3*x3_1, [ x3_1>-1 && arg2P_5>0 && arg1P_5>0 && 3*x3_1>=1 && 3*x3_1<arg2P_5 ], cost: 2+3*x3_1
     15: __init -> f563_0_mk_LE : arg1'=-arg2P_5+3*x3_1, arg2'=1-arg2P_5+3*x3_1, arg3'=arg2P_5, arg4'=arg2P_5, [ x3_1>-1 && arg1P_5>0 && -1+arg2P_5>=1 && 2-arg2P_5+3*x3_1>0 ], cost: 1+arg2P_5

Computing asymptotic complexity for rule 13
   Simplified the guard:
     13: __init -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2P_5, arg4'=1, [ 1-arg2P_5==0 && arg1P_5>0 && 3*x3_1>=1 ], cost: 2+3*x3_1
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 15
   Simplified the guard:
     15: __init -> f563_0_mk_LE : arg1'=-arg2P_5+3*x3_1, arg2'=1-arg2P_5+3*x3_1, arg3'=arg2P_5, arg4'=arg2P_5, [ arg1P_5>0 && -1+arg2P_5>=1 && 2-arg2P_5+3*x3_1>0 ], cost: 1+arg2P_5
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 14
   Simplified the guard:
     14: __init -> f563_0_mk_LE : arg1'=-1, arg2'=0, arg3'=arg2P_5, arg4'=1+3*x3_1, [ arg1P_5>0 && 3*x3_1>=1 && 3*x3_1<arg2P_5 ], cost: 2+3*x3_1
   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),?)