NO

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
     16: f3 -> f4 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2<0 && arg1>=0 && arg2>=0 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 ], cost: 1
     17: f3 -> f4 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg2>0 && arg1>=0 && arg2>=0 && arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 ], cost: 1
     19: f3 -> f16 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg2<0 && arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 && arg4==arg4P_20 ], cost: 1
     20: f3 -> f16 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg2==0 && arg1==arg1P_21 && arg2==arg2P_21 && arg3==arg3P_21 && arg4==arg4P_21 ], cost: 1
     21: f3 -> f16 : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg1<0 && arg1==arg1P_22 && arg2==arg2P_22 && arg3==arg3P_22 && arg4==arg4P_22 ], cost: 1
      2: f4 -> f5 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg2==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f5 -> f6 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg1==arg4P_4 ], cost: 1
      9: f6 -> f7 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1==arg2 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     10: f6 -> f8 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1<arg2 && arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f6 -> f8 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>arg2 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
      4: f7 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1==arg1P_5 && 0==arg2P_5 && arg3==arg3P_5 && arg4==arg4P_5 ], cost: 1
     12: f10 -> f9 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
      5: f11 -> f12 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4P_6==-arg2+arg4 && arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 ], cost: 1
      7: f12 -> f8 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      6: f8 -> f11 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg4>arg2 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
      8: f8 -> f13 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg4<=arg2 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
     13: f13 -> f9 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 ], cost: 1
     14: f9 -> f14 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1==arg1P_15 && arg4==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     15: f14 -> f15 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg3==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 ], cost: 1
     18: f15 -> f3 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 ], cost: 1
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
     16: f3 -> f4 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2<0 && arg1>=0 && arg2>=0 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 ], cost: 1
     17: f3 -> f4 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg2>0 && arg1>=0 && arg2>=0 && arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 ], cost: 1
      2: f4 -> f5 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg2==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f5 -> f6 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg1==arg4P_4 ], cost: 1
      9: f6 -> f7 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1==arg2 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     10: f6 -> f8 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1<arg2 && arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f6 -> f8 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>arg2 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
      4: f7 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1==arg1P_5 && 0==arg2P_5 && arg3==arg3P_5 && arg4==arg4P_5 ], cost: 1
     12: f10 -> f9 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
      5: f11 -> f12 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4P_6==-arg2+arg4 && arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 ], cost: 1
      7: f12 -> f8 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      6: f8 -> f11 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg4>arg2 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
      8: f8 -> f13 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg4<=arg2 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
     13: f13 -> f9 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 ], cost: 1
     14: f9 -> f14 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1==arg1P_15 && arg4==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     15: f14 -> f15 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg3==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 ], cost: 1
     18: f15 -> f3 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 ], cost: 1
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 1

Removed rules with unsatisfiable guard:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
     17: f3 -> f4 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg2>0 && arg1>=0 && arg2>=0 && arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 ], cost: 1
      2: f4 -> f5 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg2==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f5 -> f6 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg1==arg4P_4 ], cost: 1
      9: f6 -> f7 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1==arg2 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     10: f6 -> f8 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1<arg2 && arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f6 -> f8 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>arg2 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
      4: f7 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1==arg1P_5 && 0==arg2P_5 && arg3==arg3P_5 && arg4==arg4P_5 ], cost: 1
     12: f10 -> f9 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
      5: f11 -> f12 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4P_6==-arg2+arg4 && arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 ], cost: 1
      7: f12 -> f8 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      6: f8 -> f11 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg4>arg2 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
      8: f8 -> f13 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg4<=arg2 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
     13: f13 -> f9 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 ], cost: 1
     14: f9 -> f14 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1==arg1P_15 && arg4==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     15: f14 -> f15 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg3==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 ], cost: 1
     18: f15 -> f3 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 ], cost: 1
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      1: f2 -> f3 : arg2'=arg2P_2, [], cost: 1
     17: f3 -> f4 : [ arg2>0 && arg1>=0 ], cost: 1
      2: f4 -> f5 : arg3'=arg2, [], cost: 1
      3: f5 -> f6 : arg4'=arg1, [], cost: 1
      9: f6 -> f7 : [ arg1==arg2 ], cost: 1
     10: f6 -> f8 : [ arg1<arg2 ], cost: 1
     11: f6 -> f8 : [ arg1>arg2 ], cost: 1
      4: f7 -> f10 : arg2'=0, [], cost: 1
     12: f10 -> f9 : [], cost: 1
      5: f11 -> f12 : arg4'=-arg2+arg4, [], cost: 1
      7: f12 -> f8 : [], cost: 1
      6: f8 -> f11 : [ arg4>arg2 ], cost: 1
      8: f8 -> f13 : [ arg4<=arg2 ], cost: 1
     13: f13 -> f9 : [], cost: 1
     14: f9 -> f14 : arg2'=arg4, [], cost: 1
     15: f14 -> f15 : arg1'=arg3, [], cost: 1
     18: f15 -> f3 : [], cost: 1
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     26: f3 -> f6 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 ], cost: 3
     10: f6 -> f8 : [ arg1<arg2 ], cost: 1
     11: f6 -> f8 : [ arg1>arg2 ], cost: 1
     28: f6 -> f9 : arg2'=0, [ arg1==arg2 ], cost: 3
     30: f8 -> f9 : [ arg4<=arg2 ], cost: 2
     31: f8 -> f8 : arg4'=-arg2+arg4, [ arg4>arg2 ], cost: 3
     33: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     24: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 3

Accelerating simple loops of location 10.
   Accelerating the following rules:
     31: f8 -> f8 : arg4'=-arg2+arg4, [ arg4>arg2 ], cost: 3

[test] deduced pseudo-invariant arg2<=0, also trying -arg2<=-1
   Accelerated rule 31 with non-termination, yielding the new rule 34.
   Accelerated rule 31 with non-termination, yielding the new rule 35.
   Accelerated rule 31 with backward acceleration, yielding the new rule 36.
   Accelerated rule 31 with backward acceleration, yielding the new rule 37.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Also removing duplicate rules: 35.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     26: f3 -> f6 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 ], cost: 3
     10: f6 -> f8 : [ arg1<arg2 ], cost: 1
     11: f6 -> f8 : [ arg1>arg2 ], cost: 1
     28: f6 -> f9 : arg2'=0, [ arg1==arg2 ], cost: 3
     30: f8 -> f9 : [ arg4<=arg2 ], cost: 2
     31: f8 -> f8 : arg4'=-arg2+arg4, [ arg4>arg2 ], cost: 3
     34: f8 -> [17] : [ arg4>arg2 && arg2==0 && arg4==1 ], cost: NONTERM
     36: f8 -> [17] : [ arg4>arg2 && arg2<=0 ], cost: NONTERM
     37: f8 -> f8 : arg4'=-k*arg2+arg4, [ -arg2<=-1 && k>=0 && -arg2*(-1+k)+arg4>arg2 ], cost: 3*k
     33: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     24: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     26: f3 -> f6 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 ], cost: 3
     10: f6 -> f8 : [ arg1<arg2 ], cost: 1
     11: f6 -> f8 : [ arg1>arg2 ], cost: 1
     28: f6 -> f9 : arg2'=0, [ arg1==arg2 ], cost: 3
     38: f6 -> f8 : arg4'=-arg2+arg4, [ arg1<arg2 && arg4>arg2 ], cost: 4
     39: f6 -> f8 : arg4'=-arg2+arg4, [ arg1>arg2 && arg4>arg2 ], cost: 4
     40: f6 -> [17] : [ arg1<arg2 && arg4>arg2 && arg2==0 && arg4==1 ], cost: NONTERM
     41: f6 -> [17] : [ arg1>arg2 && arg4>arg2 && arg2==0 && arg4==1 ], cost: NONTERM
     42: f6 -> [17] : [ arg1<arg2 && arg4>arg2 && arg2<=0 ], cost: NONTERM
     43: f6 -> [17] : [ arg1>arg2 && arg4>arg2 && arg2<=0 ], cost: NONTERM
     44: f6 -> f8 : arg4'=-k*arg2+arg4, [ arg1<arg2 && -arg2<=-1 && k>=0 && -arg2*(-1+k)+arg4>arg2 ], cost: 1+3*k
     45: f6 -> f8 : arg4'=-k*arg2+arg4, [ arg1>arg2 && -arg2<=-1 && k>=0 && -arg2*(-1+k)+arg4>arg2 ], cost: 1+3*k
     30: f8 -> f9 : [ arg4<=arg2 ], cost: 2
     33: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     24: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     46: f3 -> f8 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1<arg2 ], cost: 4
     47: f3 -> f8 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1>arg2 ], cost: 4
     48: f3 -> f9 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1==arg2 ], cost: 6
     49: f3 -> f8 : arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 ], cost: 7
     50: f3 -> f8 : arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1<arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 ], cost: 4+3*k
     51: f3 -> f8 : arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 ], cost: 4+3*k
     30: f8 -> f9 : [ arg4<=arg2 ], cost: 2
     33: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     24: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 3

Applied pruning (of leafs and parallel rules):
   Start location: __init
     46: f3 -> f8 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1<arg2 ], cost: 4
     47: f3 -> f8 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1>arg2 ], cost: 4
     48: f3 -> f9 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1==arg2 ], cost: 6
     49: f3 -> f8 : arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 ], cost: 7
     50: f3 -> f8 : arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1<arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 ], cost: 4+3*k
     51: f3 -> f8 : arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 ], cost: 4+3*k
     30: f8 -> f9 : [ arg4<=arg2 ], cost: 2
     33: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     24: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     56: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1==arg2 ], cost: 9
     57: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1<arg2 ], cost: 9
     58: f3 -> f3 : arg1'=arg2, arg2'=-arg2+arg1, arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 && -arg2+arg1<=arg2 ], cost: 12
     59: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1<arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 9+3*k
     60: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 9+3*k
     24: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 3

Accelerating simple loops of location 2.
   Accelerating the following rules:
     56: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1==arg2 ], cost: 9
     57: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1<arg2 ], cost: 9
     58: f3 -> f3 : arg1'=arg2, arg2'=-arg2+arg1, arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 && -arg2+arg1<=arg2 ], cost: 12
     59: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1<arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 9+3*k
     60: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 9+3*k

   Accelerated rule 56 with non-termination, yielding the new rule 61.
   Failed to prove monotonicity of the guard of rule 57.
   Found no closed form for 58.
   Failed to prove monotonicity of the guard of rule 59.
   Found no closed form for 60.
[accelerate] Nesting with 2 inner and 4 outer candidates
   Removing the simple loops: 56.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     57: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>=0 && arg1<arg2 ], cost: 9
     58: f3 -> f3 : arg1'=arg2, arg2'=-arg2+arg1, arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 && -arg2+arg1<=arg2 ], cost: 12
     59: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1<arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 9+3*k
     60: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>=0 && arg1>arg2 && k>=0 && -arg2*(-1+k)+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 9+3*k
     61: f3 -> [18] : [ arg2>0 && arg1==arg2 && arg1>0 && arg2==arg1 ], cost: NONTERM
     24: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     24: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_23, arg4'=arg4P_23, [], cost: 3
     62: __init -> f3 : arg1'=arg2P_2, arg2'=arg1P_1, arg3'=arg2P_2, arg4'=arg1P_1, [ arg2P_2>0 && arg1P_1>=0 && arg1P_1<arg2P_2 ], cost: 12
     63: __init -> f3 : arg1'=arg2P_2, arg2'=-arg2P_2+arg1P_1, arg3'=arg2P_2, arg4'=-arg2P_2+arg1P_1, [ arg2P_2>0 && arg1P_1>=0 && arg1P_1>arg2P_2 && -arg2P_2+arg1P_1<=arg2P_2 ], cost: 15
     64: __init -> f3 : arg1'=arg2P_2, arg2'=arg1P_1-k*arg2P_2, arg3'=arg2P_2, arg4'=arg1P_1-k*arg2P_2, [ arg2P_2>0 && arg1P_1>=0 && arg1P_1<arg2P_2 && k>=0 && arg1P_1-arg2P_2*(-1+k)>arg2P_2 && arg1P_1-k*arg2P_2<=arg2P_2 ], cost: 12+3*k
     65: __init -> f3 : arg1'=arg2P_2, arg2'=arg1P_1-k*arg2P_2, arg3'=arg2P_2, arg4'=arg1P_1-k*arg2P_2, [ arg2P_2>0 && arg1P_1>=0 && arg1P_1>arg2P_2 && k>=0 && arg1P_1-arg2P_2*(-1+k)>arg2P_2 && arg1P_1-k*arg2P_2<=arg2P_2 ], cost: 12+3*k
     66: __init -> [18] : [ arg1P_1>0 ], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     64: __init -> f3 : arg1'=arg2P_2, arg2'=arg1P_1-k*arg2P_2, arg3'=arg2P_2, arg4'=arg1P_1-k*arg2P_2, [ arg2P_2>0 && arg1P_1>=0 && arg1P_1<arg2P_2 && k>=0 && arg1P_1-arg2P_2*(-1+k)>arg2P_2 && arg1P_1-k*arg2P_2<=arg2P_2 ], cost: 12+3*k
     65: __init -> f3 : arg1'=arg2P_2, arg2'=arg1P_1-k*arg2P_2, arg3'=arg2P_2, arg4'=arg1P_1-k*arg2P_2, [ arg2P_2>0 && arg1P_1>=0 && arg1P_1>arg2P_2 && k>=0 && arg1P_1-arg2P_2*(-1+k)>arg2P_2 && arg1P_1-k*arg2P_2<=arg2P_2 ], cost: 12+3*k
     66: __init -> [18] : [ arg1P_1>0 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     64: __init -> f3 : arg1'=arg2P_2, arg2'=arg1P_1-k*arg2P_2, arg3'=arg2P_2, arg4'=arg1P_1-k*arg2P_2, [ arg2P_2>0 && arg1P_1>=0 && arg1P_1<arg2P_2 && k>=0 && arg1P_1-arg2P_2*(-1+k)>arg2P_2 && arg1P_1-k*arg2P_2<=arg2P_2 ], cost: 12+3*k
     65: __init -> f3 : arg1'=arg2P_2, arg2'=arg1P_1-k*arg2P_2, arg3'=arg2P_2, arg4'=arg1P_1-k*arg2P_2, [ arg2P_2>0 && arg1P_1>=0 && arg1P_1>arg2P_2 && k>=0 && arg1P_1-arg2P_2*(-1+k)>arg2P_2 && arg1P_1-k*arg2P_2<=arg2P_2 ], cost: 12+3*k
     66: __init -> [18] : [ arg1P_1>0 ], cost: NONTERM

Computing asymptotic complexity for rule 66
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  [ arg1P_1>0 ]

NO