312.10/291.56	KILLED
312.15/291.57	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
312.15/291.57	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
312.15/291.57	
312.15/291.57	
312.15/291.57	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
312.15/291.57	
312.15/291.57	(0) CpxIntTrs
312.15/291.57	(1) Loat Proof [FINISHED, 6685 ms]
312.15/291.57	(2) BOUNDS(1, INF)
312.15/291.57	
312.15/291.57	
312.15/291.57	----------------------------------------
312.15/291.57	
312.15/291.57	(0)
312.15/291.57	Obligation:
312.15/291.57	Complexity Int TRS consisting of the following rules:
312.15/291.57	f4(A, B, C, D, E, F) -> Com_1(f14(A, B, C, D, E, F)) :|: 0 >= A
312.15/291.57	f13(A, B, C, D, E, F) -> Com_1(f4(A, B, C, D, E, F)) :|: TRUE
312.15/291.57	f13(A, B, C, D, E, F) -> Com_1(f400(A, B, C, D, E, F)) :|: B >= A + 1
312.15/291.57	f2(A, B, C, D, E, F) -> Com_1(f23(G, I, H, J, 1, F)) :|: G >= 1 && H >= 1 && 0 >= I
312.15/291.57	f2(A, B, C, D, E, F) -> Com_1(f23(G, I, H, J, 1, 0)) :|: G >= 1 && H >= 1 && I >= 1
312.15/291.57	f23(A, B, C, D, E, F) -> Com_1(f4(A, B, C, D, E, F)) :|: E >= C
312.15/291.57	f23(A, B, C, D, E, F) -> Com_1(f4(A, B, C, D, E, 1)) :|: C >= E + 1
312.15/291.57	f4(A, B, C, D, E, F) -> Com_1(f33(A - 1, B, H, J, C, F)) :|: H >= C && 0 >= B && A >= 1
312.15/291.57	f4(A, B, C, D, E, F) -> Com_1(f33(A - 1, B, H, J, C, 0)) :|: H >= C && B >= 1 && A >= 1
312.15/291.57	f33(A, B, C, D, E, F) -> Com_1(f6(A, B, C, D, E, F)) :|: E >= C
312.15/291.57	f33(A, B, C, D, E, F) -> Com_1(f6(A, B, C, D, E, 1)) :|: C >= E + 1
312.15/291.57	f6(A, B, C, D, E, F) -> Com_1(f43(A, B, H, J, C, F)) :|: H >= C && 0 >= C && 0 >= B
312.15/291.57	f6(A, B, C, D, E, F) -> Com_1(f43(A, B, H, J, C, 0)) :|: H >= C && 0 >= C && B >= 1
312.15/291.57	f43(A, B, C, D, E, F) -> Com_1(f6(A, B, C, D, C, F)) :|: C >= E && C <= E
312.15/291.57	f43(A, B, C, D, E, F) -> Com_1(f6(A, B, C, D, E, 1)) :|: C >= E + 1
312.15/291.57	f6(A, B, C, D, E, F) -> Com_1(f53(A, B, H, J, C - 1, F)) :|: H + 1 >= C && C >= 1 && 0 >= B
312.15/291.57	f6(A, B, C, D, E, F) -> Com_1(f53(A, B, H, J, C - 1, 0)) :|: H + 1 >= C && C >= 1 && B >= 1
312.15/291.57	f53(A, B, C, D, E, F) -> Com_1(f61(A, A, C, D, C, F)) :|: E >= C
312.15/291.57	f53(A, B, C, D, E, F) -> Com_1(f61(A, A, C, D, C, 1)) :|: C >= E + 1
312.15/291.57	f61(A, B, C, D, E, F) -> Com_1(f63(A, B, H, J, E, F)) :|: 0 >= B && H >= E
312.15/291.57	f61(A, B, C, D, E, F) -> Com_1(f63(A, B, H, J, E, 0)) :|: B >= 1 && H >= E
312.15/291.57	f63(A, B, C, D, E, F) -> Com_1(f71(A, B, C, D + 1, C, F)) :|: E >= C
312.15/291.57	f63(A, B, C, D, E, F) -> Com_1(f71(A, B, C, D + 1, C, 1)) :|: C >= E + 1
312.15/291.57	f71(A, B, C, D, E, F) -> Com_1(f73(A, B, H, J, E, F)) :|: 0 >= B && H >= E
312.15/291.57	f71(A, B, C, D, E, F) -> Com_1(f73(A, B, H, J, E, 0)) :|: B >= 1 && H >= E
312.15/291.57	f73(A, B, C, D, E, F) -> Com_1(f13(A, B, C, D, E, F)) :|: E >= C
312.15/291.57	f73(A, B, C, D, E, F) -> Com_1(f13(A, B, C, D, E, 1)) :|: C >= E + 1
312.15/291.57	
312.15/291.57	The start-symbols are:[f2_6]
312.15/291.57	
312.15/291.57	
312.15/291.57	----------------------------------------
312.15/291.57	
312.15/291.57	(1) Loat Proof (FINISHED)
312.15/291.57	
312.15/291.57	
312.15/291.57	### Pre-processing the ITS problem ###
312.15/291.57	
312.15/291.57	
312.15/291.57	
312.15/291.57	Initial linear ITS problem
312.15/291.57	
312.15/291.57	   Start location: f2
312.15/291.57	
312.15/291.57	      0: f4 -> f14 : [ 0>=A ], cost: 1
312.15/291.57	
312.15/291.57	      7: f4 -> f33 : A'=-1+A, C'=free_9, D'=free_8, E'=C, [ free_9>=C && 0>=B && A>=1 ], cost: 1
312.15/291.57	
312.15/291.57	      8: f4 -> f33 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=0, [ free_11>=C && B>=1 && A>=1 ], cost: 1
312.15/291.57	
312.15/291.57	      1: f13 -> f4 : [], cost: 1
312.15/291.57	
312.15/291.57	      2: f13 -> f400 : [ B>=1+A ], cost: 1
312.15/291.57	
312.15/291.57	      3: f2 -> f23 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free ], cost: 1
312.15/291.57	
312.15/291.57	      4: f2 -> f23 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 ], cost: 1
312.15/291.57	
312.15/291.57	      5: f23 -> f4 : [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	      6: f23 -> f4 : F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	      9: f33 -> f6 : [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	     10: f33 -> f6 : F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	     11: f6 -> f43 : C'=free_13, D'=free_12, E'=C, [ free_13>=C && 0>=C && 0>=B ], cost: 1
312.15/291.57	
312.15/291.57	     12: f6 -> f43 : C'=free_15, D'=free_14, E'=C, F'=0, [ free_15>=C && 0>=C && B>=1 ], cost: 1
312.15/291.57	
312.15/291.57	     15: f6 -> f53 : C'=free_17, D'=free_16, E'=-1+C, [ 1+free_17>=C && C>=1 && 0>=B ], cost: 1
312.15/291.57	
312.15/291.57	     16: f6 -> f53 : C'=free_19, D'=free_18, E'=-1+C, F'=0, [ 1+free_19>=C && C>=1 && B>=1 ], cost: 1
312.15/291.57	
312.15/291.57	     13: f43 -> f6 : E'=C, [ C==E ], cost: 1
312.15/291.57	
312.15/291.57	     14: f43 -> f6 : F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	     17: f53 -> f61 : B'=A, E'=C, [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	     18: f53 -> f61 : B'=A, E'=C, F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	     19: f61 -> f63 : C'=free_21, D'=free_20, [ 0>=B && free_21>=E ], cost: 1
312.15/291.57	
312.15/291.57	     20: f61 -> f63 : C'=free_23, D'=free_22, F'=0, [ B>=1 && free_23>=E ], cost: 1
312.15/291.57	
312.15/291.57	     21: f63 -> f71 : D'=1+D, E'=C, [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	     22: f63 -> f71 : D'=1+D, E'=C, F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	     23: f71 -> f73 : C'=free_25, D'=free_24, [ 0>=B && free_25>=E ], cost: 1
312.15/291.57	
312.15/291.57	     24: f71 -> f73 : C'=free_27, D'=free_26, F'=0, [ B>=1 && free_27>=E ], cost: 1
312.15/291.57	
312.15/291.57	     25: f73 -> f13 : [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	     26: f73 -> f13 : F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	
312.15/291.57	
312.15/291.57	Removed unreachable and leaf rules:
312.15/291.57	
312.15/291.57	   Start location: f2
312.15/291.57	
312.15/291.57	      7: f4 -> f33 : A'=-1+A, C'=free_9, D'=free_8, E'=C, [ free_9>=C && 0>=B && A>=1 ], cost: 1
312.15/291.57	
312.15/291.57	      8: f4 -> f33 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=0, [ free_11>=C && B>=1 && A>=1 ], cost: 1
312.15/291.57	
312.15/291.57	      1: f13 -> f4 : [], cost: 1
312.15/291.57	
312.15/291.57	      3: f2 -> f23 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free ], cost: 1
312.15/291.57	
312.15/291.57	      4: f2 -> f23 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 ], cost: 1
312.15/291.57	
312.15/291.57	      5: f23 -> f4 : [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	      6: f23 -> f4 : F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	      9: f33 -> f6 : [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	     10: f33 -> f6 : F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	     11: f6 -> f43 : C'=free_13, D'=free_12, E'=C, [ free_13>=C && 0>=C && 0>=B ], cost: 1
312.15/291.57	
312.15/291.57	     12: f6 -> f43 : C'=free_15, D'=free_14, E'=C, F'=0, [ free_15>=C && 0>=C && B>=1 ], cost: 1
312.15/291.57	
312.15/291.57	     15: f6 -> f53 : C'=free_17, D'=free_16, E'=-1+C, [ 1+free_17>=C && C>=1 && 0>=B ], cost: 1
312.15/291.57	
312.15/291.57	     16: f6 -> f53 : C'=free_19, D'=free_18, E'=-1+C, F'=0, [ 1+free_19>=C && C>=1 && B>=1 ], cost: 1
312.15/291.57	
312.15/291.57	     13: f43 -> f6 : E'=C, [ C==E ], cost: 1
312.15/291.57	
312.15/291.57	     14: f43 -> f6 : F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	     17: f53 -> f61 : B'=A, E'=C, [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	     18: f53 -> f61 : B'=A, E'=C, F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	     19: f61 -> f63 : C'=free_21, D'=free_20, [ 0>=B && free_21>=E ], cost: 1
312.15/291.57	
312.15/291.57	     20: f61 -> f63 : C'=free_23, D'=free_22, F'=0, [ B>=1 && free_23>=E ], cost: 1
312.15/291.57	
312.15/291.57	     21: f63 -> f71 : D'=1+D, E'=C, [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	     22: f63 -> f71 : D'=1+D, E'=C, F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	     23: f71 -> f73 : C'=free_25, D'=free_24, [ 0>=B && free_25>=E ], cost: 1
312.15/291.57	
312.15/291.57	     24: f71 -> f73 : C'=free_27, D'=free_26, F'=0, [ B>=1 && free_27>=E ], cost: 1
312.15/291.57	
312.15/291.57	     25: f73 -> f13 : [ E>=C ], cost: 1
312.15/291.57	
312.15/291.57	     26: f73 -> f13 : F'=1, [ C>=1+E ], cost: 1
312.15/291.57	
312.15/291.57	
312.15/291.57	
312.15/291.57	### Simplification by acceleration and chaining ###
312.15/291.57	
312.15/291.57	
312.15/291.57	
312.15/291.57	Eliminated locations (on tree-shaped paths):
312.15/291.57	
312.15/291.57	   Start location: f2
312.15/291.57	
312.15/291.57	     31: f4 -> f6 : A'=-1+A, C'=free_9, D'=free_8, E'=C, [ free_9>=C && 0>=B && A>=1 && C>=free_9 ], cost: 2
312.15/291.57	
312.15/291.57	     32: f4 -> f6 : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	     33: f4 -> f6 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=0, [ free_11>=C && B>=1 && A>=1 && C>=free_11 ], cost: 2
312.15/291.57	
312.15/291.57	     34: f4 -> f6 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	      1: f13 -> f4 : [], cost: 1
312.15/291.57	
312.15/291.57	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.57	
312.15/291.57	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.57	
312.15/291.57	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.57	
312.15/291.57	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.57	
312.15/291.57	     35: f6 -> f6 : C'=free_13, D'=free_12, E'=free_13, [ 0>=C && 0>=B && free_13==C ], cost: 2
312.15/291.57	
312.15/291.57	     36: f6 -> f6 : C'=free_13, D'=free_12, E'=C, F'=1, [ 0>=C && 0>=B && free_13>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	     37: f6 -> f6 : C'=free_15, D'=free_14, E'=free_15, F'=0, [ 0>=C && B>=1 && free_15==C ], cost: 2
312.15/291.57	
312.15/291.57	     38: f6 -> f6 : C'=free_15, D'=free_14, E'=C, F'=1, [ 0>=C && B>=1 && free_15>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	     39: f6 -> f61 : B'=A, C'=free_17, D'=free_16, E'=free_17, [ 1+free_17>=C && C>=1 && 0>=B && -1+C>=free_17 ], cost: 2
312.15/291.57	
312.15/291.57	     40: f6 -> f61 : B'=A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ C>=1 && 0>=B && free_17>=C ], cost: 2
312.15/291.57	
312.15/291.57	     41: f6 -> f61 : B'=A, C'=free_19, D'=free_18, E'=free_19, F'=0, [ 1+free_19>=C && C>=1 && B>=1 && -1+C>=free_19 ], cost: 2
312.15/291.57	
312.15/291.57	     42: f6 -> f61 : B'=A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ C>=1 && B>=1 && free_19>=C ], cost: 2
312.15/291.57	
312.15/291.57	     43: f61 -> f71 : C'=free_21, D'=1+free_20, E'=free_21, [ 0>=B && free_21>=E && E>=free_21 ], cost: 2
312.15/291.57	
312.15/291.57	     44: f61 -> f71 : C'=free_21, D'=1+free_20, E'=free_21, F'=1, [ 0>=B && free_21>=1+E ], cost: 2
312.15/291.57	
312.15/291.57	     45: f61 -> f71 : C'=free_23, D'=1+free_22, E'=free_23, F'=0, [ B>=1 && free_23>=E && E>=free_23 ], cost: 2
312.15/291.57	
312.15/291.57	     46: f61 -> f71 : C'=free_23, D'=1+free_22, E'=free_23, F'=1, [ B>=1 && free_23>=1+E ], cost: 2
312.15/291.57	
312.15/291.57	     47: f71 -> f13 : C'=free_25, D'=free_24, [ 0>=B && free_25>=E && E>=free_25 ], cost: 2
312.15/291.57	
312.15/291.57	     48: f71 -> f13 : C'=free_25, D'=free_24, F'=1, [ 0>=B && free_25>=1+E ], cost: 2
312.15/291.57	
312.15/291.57	     49: f71 -> f13 : C'=free_27, D'=free_26, F'=0, [ B>=1 && free_27>=E && E>=free_27 ], cost: 2
312.15/291.57	
312.15/291.57	     50: f71 -> f13 : C'=free_27, D'=free_26, F'=1, [ B>=1 && free_27>=1+E ], cost: 2
312.15/291.57	
312.15/291.57	
312.15/291.57	
312.15/291.57	Accelerating simple loops of location 5.
312.15/291.57	
312.15/291.57	   Simplified some of the simple loops (and removed duplicate rules).
312.15/291.57	
312.15/291.57	   Accelerating the following rules:
312.15/291.57	
312.15/291.57	     35: f6 -> f6 : D'=free_12, E'=C, [ 0>=C && 0>=B ], cost: 2
312.15/291.57	
312.15/291.57	     36: f6 -> f6 : C'=free_13, D'=free_12, E'=C, F'=1, [ 0>=C && 0>=B && free_13>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	     37: f6 -> f6 : D'=free_14, E'=C, F'=0, [ 0>=C && B>=1 ], cost: 2
312.15/291.57	
312.15/291.57	     38: f6 -> f6 : C'=free_15, D'=free_14, E'=C, F'=1, [ 0>=C && B>=1 && free_15>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	
312.15/291.57	
312.15/291.57	   Accelerated rule 35 with NONTERM, yielding the new rule 51.
312.15/291.57	
312.15/291.57	      During metering: Instantiating temporary variables by {free_13==1+C}
312.15/291.57	
312.15/291.57	   Accelerated rule 36 with metering function 1-C, yielding the new rule 52.
312.15/291.57	
312.15/291.57	   Accelerated rule 37 with NONTERM, yielding the new rule 53.
312.15/291.57	
312.15/291.57	      During metering: Instantiating temporary variables by {free_15==1+C}
312.15/291.57	
312.15/291.57	   Accelerated rule 38 with metering function 1-C, yielding the new rule 54.
312.15/291.57	
312.15/291.57	   Removing the simple loops: 35 36 37 38.
312.15/291.57	
312.15/291.57	
312.15/291.57	
312.15/291.57	Accelerated all simple loops using metering functions (where possible):
312.15/291.57	
312.15/291.57	   Start location: f2
312.15/291.57	
312.15/291.57	     31: f4 -> f6 : A'=-1+A, C'=free_9, D'=free_8, E'=C, [ free_9>=C && 0>=B && A>=1 && C>=free_9 ], cost: 2
312.15/291.57	
312.15/291.57	     32: f4 -> f6 : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	     33: f4 -> f6 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=0, [ free_11>=C && B>=1 && A>=1 && C>=free_11 ], cost: 2
312.15/291.57	
312.15/291.57	     34: f4 -> f6 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	      1: f13 -> f4 : [], cost: 1
312.15/291.57	
312.15/291.57	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.57	
312.15/291.57	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.57	
312.15/291.57	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.57	
312.15/291.57	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.57	
312.15/291.57	     39: f6 -> f61 : B'=A, C'=free_17, D'=free_16, E'=free_17, [ 1+free_17>=C && C>=1 && 0>=B && -1+C>=free_17 ], cost: 2
312.15/291.57	
312.15/291.57	     40: f6 -> f61 : B'=A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ C>=1 && 0>=B && free_17>=C ], cost: 2
312.15/291.57	
312.15/291.57	     41: f6 -> f61 : B'=A, C'=free_19, D'=free_18, E'=free_19, F'=0, [ 1+free_19>=C && C>=1 && B>=1 && -1+C>=free_19 ], cost: 2
312.15/291.57	
312.15/291.57	     42: f6 -> f61 : B'=A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ C>=1 && B>=1 && free_19>=C ], cost: 2
312.15/291.57	
312.15/291.57	     51: f6 -> [14] : [ 0>=C && 0>=B ], cost: INF
312.15/291.57	
312.15/291.57	     52: f6 -> f6 : C'=1, D'=free_12, E'=0, F'=1, [ 0>=C && 0>=B ], cost: 2-2*C
312.15/291.57	
312.15/291.57	     53: f6 -> [14] : [ 0>=C && B>=1 ], cost: INF
312.15/291.57	
312.15/291.57	     54: f6 -> f6 : C'=1, D'=free_14, E'=0, F'=1, [ 0>=C && B>=1 ], cost: 2-2*C
312.15/291.57	
312.15/291.57	     43: f61 -> f71 : C'=free_21, D'=1+free_20, E'=free_21, [ 0>=B && free_21>=E && E>=free_21 ], cost: 2
312.15/291.57	
312.15/291.57	     44: f61 -> f71 : C'=free_21, D'=1+free_20, E'=free_21, F'=1, [ 0>=B && free_21>=1+E ], cost: 2
312.15/291.57	
312.15/291.57	     45: f61 -> f71 : C'=free_23, D'=1+free_22, E'=free_23, F'=0, [ B>=1 && free_23>=E && E>=free_23 ], cost: 2
312.15/291.57	
312.15/291.57	     46: f61 -> f71 : C'=free_23, D'=1+free_22, E'=free_23, F'=1, [ B>=1 && free_23>=1+E ], cost: 2
312.15/291.57	
312.15/291.57	     47: f71 -> f13 : C'=free_25, D'=free_24, [ 0>=B && free_25>=E && E>=free_25 ], cost: 2
312.15/291.57	
312.15/291.57	     48: f71 -> f13 : C'=free_25, D'=free_24, F'=1, [ 0>=B && free_25>=1+E ], cost: 2
312.15/291.57	
312.15/291.57	     49: f71 -> f13 : C'=free_27, D'=free_26, F'=0, [ B>=1 && free_27>=E && E>=free_27 ], cost: 2
312.15/291.57	
312.15/291.57	     50: f71 -> f13 : C'=free_27, D'=free_26, F'=1, [ B>=1 && free_27>=1+E ], cost: 2
312.15/291.57	
312.15/291.57	
312.15/291.57	
312.15/291.57	Chained accelerated rules (with incoming rules):
312.15/291.57	
312.15/291.57	   Start location: f2
312.15/291.57	
312.15/291.57	     31: f4 -> f6 : A'=-1+A, C'=free_9, D'=free_8, E'=C, [ free_9>=C && 0>=B && A>=1 && C>=free_9 ], cost: 2
312.15/291.57	
312.15/291.57	     32: f4 -> f6 : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	     33: f4 -> f6 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=0, [ free_11>=C && B>=1 && A>=1 && C>=free_11 ], cost: 2
312.15/291.57	
312.15/291.57	     34: f4 -> f6 : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C ], cost: 2
312.15/291.57	
312.15/291.57	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     57: f4 -> f6 : A'=-1+A, C'=1, D'=free_12, E'=0, F'=1, [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     58: f4 -> f6 : A'=-1+A, C'=1, D'=free_12, E'=0, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     61: f4 -> f6 : A'=-1+A, C'=1, D'=free_14, E'=0, F'=1, [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     62: f4 -> f6 : A'=-1+A, C'=1, D'=free_14, E'=0, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	      1: f13 -> f4 : [], cost: 1
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     39: f6 -> f61 : B'=A, C'=free_17, D'=free_16, E'=free_17, [ 1+free_17>=C && C>=1 && 0>=B && -1+C>=free_17 ], cost: 2
312.15/291.58	
312.15/291.58	     40: f6 -> f61 : B'=A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ C>=1 && 0>=B && free_17>=C ], cost: 2
312.15/291.58	
312.15/291.58	     41: f6 -> f61 : B'=A, C'=free_19, D'=free_18, E'=free_19, F'=0, [ 1+free_19>=C && C>=1 && B>=1 && -1+C>=free_19 ], cost: 2
312.15/291.58	
312.15/291.58	     42: f6 -> f61 : B'=A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ C>=1 && B>=1 && free_19>=C ], cost: 2
312.15/291.58	
312.15/291.58	     43: f61 -> f71 : C'=free_21, D'=1+free_20, E'=free_21, [ 0>=B && free_21>=E && E>=free_21 ], cost: 2
312.15/291.58	
312.15/291.58	     44: f61 -> f71 : C'=free_21, D'=1+free_20, E'=free_21, F'=1, [ 0>=B && free_21>=1+E ], cost: 2
312.15/291.58	
312.15/291.58	     45: f61 -> f71 : C'=free_23, D'=1+free_22, E'=free_23, F'=0, [ B>=1 && free_23>=E && E>=free_23 ], cost: 2
312.15/291.58	
312.15/291.58	     46: f61 -> f71 : C'=free_23, D'=1+free_22, E'=free_23, F'=1, [ B>=1 && free_23>=1+E ], cost: 2
312.15/291.58	
312.15/291.58	     47: f71 -> f13 : C'=free_25, D'=free_24, [ 0>=B && free_25>=E && E>=free_25 ], cost: 2
312.15/291.58	
312.15/291.58	     48: f71 -> f13 : C'=free_25, D'=free_24, F'=1, [ 0>=B && free_25>=1+E ], cost: 2
312.15/291.58	
312.15/291.58	     49: f71 -> f13 : C'=free_27, D'=free_26, F'=0, [ B>=1 && free_27>=E && E>=free_27 ], cost: 2
312.15/291.58	
312.15/291.58	     50: f71 -> f13 : C'=free_27, D'=free_26, F'=1, [ B>=1 && free_27>=1+E ], cost: 2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Eliminated locations (on tree-shaped paths):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     63: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, [ free_9>=C && 0>=B && A>=1 && C>=free_9 && 1+free_17>=free_9 && free_9>=1 && -1+free_9>=free_17 ], cost: 4
312.15/291.58	
312.15/291.58	     64: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ free_9>=C && 0>=B && A>=1 && C>=free_9 && free_9>=1 && free_17>=free_9 ], cost: 4
312.15/291.58	
312.15/291.58	     65: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 1+free_17>=free_9 && free_9>=1 && -1+free_9>=free_17 ], cost: 4
312.15/291.58	
312.15/291.58	     66: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && free_9>=1+C && free_9>=1 && free_17>=free_9 ], cost: 4
312.15/291.58	
312.15/291.58	     67: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=0, [ free_11>=C && B>=1 && A>=1 && C>=free_11 && 1+free_19>=free_11 && free_11>=1 && -1+free_11>=free_19 ], cost: 4
312.15/291.58	
312.15/291.58	     68: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ free_11>=C && B>=1 && A>=1 && C>=free_11 && free_11>=1 && free_19>=free_11 ], cost: 4
312.15/291.58	
312.15/291.58	     69: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=0, [ B>=1 && A>=1 && free_11>=1+C && 1+free_19>=free_11 && free_11>=1 && -1+free_11>=free_19 ], cost: 4
312.15/291.58	
312.15/291.58	     70: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ B>=1 && A>=1 && free_11>=1+C && free_11>=1 && free_19>=free_11 ], cost: 4
312.15/291.58	
312.15/291.58	     71: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && 0>=C && 1+free_17>=1 && 0>=free_17 ], cost: 6-2*C
312.15/291.58	
312.15/291.58	     72: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && 0>=C && free_17>=1 ], cost: 6-2*C
312.15/291.58	
312.15/291.58	     73: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && 1+free_17>=1 && 0>=free_17 ], cost: 6-2*free_9
312.15/291.58	
312.15/291.58	     74: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && free_17>=1 ], cost: 6-2*free_9
312.15/291.58	
312.15/291.58	     75: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=0, [ B>=1 && A>=1 && 0>=C && 1+free_19>=1 && 0>=free_19 ], cost: 6-2*C
312.15/291.58	
312.15/291.58	     76: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ B>=1 && A>=1 && 0>=C && free_19>=1 ], cost: 6-2*C
312.15/291.58	
312.15/291.58	     77: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=0, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 && 1+free_19>=1 && 0>=free_19 ], cost: 6-2*free_11
312.15/291.58	
312.15/291.58	     78: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 ], cost: 6-2*free_11
312.15/291.58	
312.15/291.58	     79: f4 -> [15] : [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     80: f4 -> [15] : [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     81: f4 -> [15] : [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     82: f4 -> [15] : [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	      1: f13 -> f4 : [], cost: 1
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     83: f61 -> f13 : C'=free_25, D'=free_24, E'=free_21, [ 0>=B && free_21>=E && E>=free_21 && free_25>=free_21 && free_21>=free_25 ], cost: 4
312.15/291.58	
312.15/291.58	     84: f61 -> f13 : C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && free_21>=E && E>=free_21 && free_25>=1+free_21 ], cost: 4
312.15/291.58	
312.15/291.58	     85: f61 -> f13 : C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && free_21>=1+E && free_25>=free_21 && free_21>=free_25 ], cost: 4
312.15/291.58	
312.15/291.58	     86: f61 -> f13 : C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && free_21>=1+E && free_25>=1+free_21 ], cost: 4
312.15/291.58	
312.15/291.58	     87: f61 -> f13 : C'=free_27, D'=free_26, E'=free_23, F'=0, [ B>=1 && free_23>=E && E>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 4
312.15/291.58	
312.15/291.58	     88: f61 -> f13 : C'=free_27, D'=free_26, E'=free_23, F'=1, [ B>=1 && free_23>=E && E>=free_23 && free_27>=1+free_23 ], cost: 4
312.15/291.58	
312.15/291.58	     89: f61 -> f13 : C'=free_27, D'=free_26, E'=free_23, F'=0, [ B>=1 && free_23>=1+E && free_27>=free_23 && free_23>=free_27 ], cost: 4
312.15/291.58	
312.15/291.58	     90: f61 -> f13 : C'=free_27, D'=free_26, E'=free_23, F'=1, [ B>=1 && free_23>=1+E && free_27>=1+free_23 ], cost: 4
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Applied pruning (of leafs and parallel rules):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     72: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && 0>=C && free_17>=1 ], cost: 6-2*C
312.15/291.58	
312.15/291.58	     73: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && 1+free_17>=1 && 0>=free_17 ], cost: 6-2*free_9
312.15/291.58	
312.15/291.58	     74: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_16, E'=free_17, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && free_17>=1 ], cost: 6-2*free_9
312.15/291.58	
312.15/291.58	     76: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ B>=1 && A>=1 && 0>=C && free_19>=1 ], cost: 6-2*C
312.15/291.58	
312.15/291.58	     78: f4 -> f61 : A'=-1+A, B'=-1+A, C'=free_19, D'=free_18, E'=free_19, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 ], cost: 6-2*free_11
312.15/291.58	
312.15/291.58	     79: f4 -> [15] : [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     80: f4 -> [15] : [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     81: f4 -> [15] : [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     82: f4 -> [15] : [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	      1: f13 -> f4 : [], cost: 1
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     83: f61 -> f13 : C'=free_25, D'=free_24, E'=free_21, [ 0>=B && free_21>=E && E>=free_21 && free_25>=free_21 && free_21>=free_25 ], cost: 4
312.15/291.58	
312.15/291.58	     84: f61 -> f13 : C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && free_21>=E && E>=free_21 && free_25>=1+free_21 ], cost: 4
312.15/291.58	
312.15/291.58	     86: f61 -> f13 : C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && free_21>=1+E && free_25>=1+free_21 ], cost: 4
312.15/291.58	
312.15/291.58	     87: f61 -> f13 : C'=free_27, D'=free_26, E'=free_23, F'=0, [ B>=1 && free_23>=E && E>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 4
312.15/291.58	
312.15/291.58	     88: f61 -> f13 : C'=free_27, D'=free_26, E'=free_23, F'=1, [ B>=1 && free_23>=E && E>=free_23 && free_27>=1+free_23 ], cost: 4
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Eliminated locations (on tree-shaped paths):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     79: f4 -> [15] : [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     80: f4 -> [15] : [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     81: f4 -> [15] : [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     82: f4 -> [15] : [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	     91: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && 0>=C && free_17>=1 && 0>=-1+A && free_21>=free_17 && free_17>=free_21 && free_25>=free_21 && free_21>=free_25 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	     92: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && 0>=C && free_17>=1 && 0>=-1+A && free_21>=free_17 && free_17>=free_21 && free_25>=1+free_21 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	     93: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && 0>=C && free_17>=1 && 0>=-1+A && free_21>=1+free_17 && free_25>=1+free_21 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	     94: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ 0>=B && 0>=C && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	     95: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=1, [ 0>=B && 0>=C && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=1+free_23 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	     96: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && 1+free_17>=1 && 0>=free_17 && 0>=-1+A && free_21>=free_17 && free_17>=free_21 && free_25>=free_21 && free_21>=free_25 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	     97: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && 1+free_17>=1 && 0>=free_17 && 0>=-1+A && free_21>=free_17 && free_17>=free_21 && free_25>=1+free_21 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	     98: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && 1+free_17>=1 && 0>=free_17 && 0>=-1+A && free_21>=1+free_17 && free_25>=1+free_21 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	     99: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ 0>=B && free_9>=1+C && 0>=free_9 && 1+free_17>=1 && 0>=free_17 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    100: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=1, [ 0>=B && free_9>=1+C && 0>=free_9 && 1+free_17>=1 && 0>=free_17 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=1+free_23 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    101: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && free_17>=1 && 0>=-1+A && free_21>=free_17 && free_17>=free_21 && free_25>=free_21 && free_21>=free_25 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    102: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && free_17>=1 && 0>=-1+A && free_21>=free_17 && free_17>=free_21 && free_25>=1+free_21 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    103: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && free_17>=1 && 0>=-1+A && free_21>=1+free_17 && free_25>=1+free_21 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    104: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ 0>=B && free_9>=1+C && 0>=free_9 && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    105: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=1, [ 0>=B && free_9>=1+C && 0>=free_9 && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=1+free_23 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    106: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && A>=1 && 0>=C && free_19>=1 && 0>=-1+A && free_21>=free_19 && free_19>=free_21 && free_25>=free_21 && free_21>=free_25 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	    107: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && A>=1 && 0>=C && free_19>=1 && 0>=-1+A && free_21>=free_19 && free_19>=free_21 && free_25>=1+free_21 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	    108: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && A>=1 && 0>=C && free_19>=1 && 0>=-1+A && free_21>=1+free_19 && free_25>=1+free_21 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	    109: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ B>=1 && 0>=C && free_19>=1 && -1+A>=1 && free_23>=free_19 && free_19>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	    110: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=1, [ B>=1 && 0>=C && free_19>=1 && -1+A>=1 && free_23>=free_19 && free_19>=free_23 && free_27>=1+free_23 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	    111: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 && 0>=-1+A && free_21>=free_19 && free_19>=free_21 && free_25>=free_21 && free_21>=free_25 ], cost: 10-2*free_11
312.15/291.58	
312.15/291.58	    112: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 && 0>=-1+A && free_21>=free_19 && free_19>=free_21 && free_25>=1+free_21 ], cost: 10-2*free_11
312.15/291.58	
312.15/291.58	    113: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 && 0>=-1+A && free_21>=1+free_19 && free_25>=1+free_21 ], cost: 10-2*free_11
312.15/291.58	
312.15/291.58	    114: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ B>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 && -1+A>=1 && free_23>=free_19 && free_19>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 10-2*free_11
312.15/291.58	
312.15/291.58	    115: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=1, [ B>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 && -1+A>=1 && free_23>=free_19 && free_19>=free_23 && free_27>=1+free_23 ], cost: 10-2*free_11
312.15/291.58	
312.15/291.58	      1: f13 -> f4 : [], cost: 1
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Applied pruning (of leafs and parallel rules):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     79: f4 -> [15] : [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     80: f4 -> [15] : [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     81: f4 -> [15] : [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     82: f4 -> [15] : [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	     94: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ 0>=B && 0>=C && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 10-2*C
312.15/291.58	
312.15/291.58	    103: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && free_17>=1 && 0>=-1+A && free_21>=1+free_17 && free_25>=1+free_21 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    104: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ 0>=B && free_9>=1+C && 0>=free_9 && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    105: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=1, [ 0>=B && free_9>=1+C && 0>=free_9 && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=1+free_23 ], cost: 10-2*free_9
312.15/291.58	
312.15/291.58	    113: f4 -> f13 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 && 0>=-1+A && free_21>=1+free_19 && free_25>=1+free_21 ], cost: 10-2*free_11
312.15/291.58	
312.15/291.58	      1: f13 -> f4 : [], cost: 1
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Eliminated locations (on tree-shaped paths):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     79: f4 -> [15] : [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     80: f4 -> [15] : [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     81: f4 -> [15] : [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     82: f4 -> [15] : [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	    116: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ 0>=B && 0>=C && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 11-2*C
312.15/291.58	
312.15/291.58	    117: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 && free_17>=1 && 0>=-1+A && free_21>=1+free_17 && free_25>=1+free_21 ], cost: 11-2*free_9
312.15/291.58	
312.15/291.58	    118: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=0, [ 0>=B && free_9>=1+C && 0>=free_9 && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=free_23 && free_23>=free_27 ], cost: 11-2*free_9
312.15/291.58	
312.15/291.58	    119: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_23, F'=1, [ 0>=B && free_9>=1+C && 0>=free_9 && free_17>=1 && -1+A>=1 && free_23>=free_17 && free_17>=free_23 && free_27>=1+free_23 ], cost: 11-2*free_9
312.15/291.58	
312.15/291.58	    120: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 && free_19>=1 && 0>=-1+A && free_21>=1+free_19 && free_25>=1+free_21 ], cost: 11-2*free_11
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Accelerating simple loops of location 0.
312.15/291.58	
312.15/291.58	   Simplified some of the simple loops (and removed duplicate rules).
312.15/291.58	
312.15/291.58	   Accelerating the following rules:
312.15/291.58	
312.15/291.58	    116: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_26, E'=free_17, F'=0, [ 0>=B && 0>=C && -1+A>=1 ], cost: 11-2*C
312.15/291.58	
312.15/291.58	    117: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && 1-A==0 && free_9>=1+C && 0>=free_9 && free_25>=1+free_21 && 1<=-1+free_21 ], cost: 11-2*free_9
312.15/291.58	
312.15/291.58	    118: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_26, E'=free_17, F'=0, [ 0>=B && free_9>=1+C && 0>=free_9 && -1+A>=1 ], cost: 11-2*free_9
312.15/291.58	
312.15/291.58	    119: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_17, F'=1, [ 0>=B && free_9>=1+C && 0>=free_9 && -1+A>=1 && 1<=-1+free_27 ], cost: 11-2*free_9
312.15/291.58	
312.15/291.58	    120: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && 1-A==0 && free_11>=1+C && 0>=free_11 && free_25>=1+free_21 && 1<=-1+free_21 ], cost: 11-2*free_11
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	   Found no metering function for rule 116.
312.15/291.58	
312.15/291.58	   Accelerated rule 117 with metering function -1+A, yielding the new rule 121.
312.15/291.58	
312.15/291.58	   Found no metering function for rule 118.
312.15/291.58	
312.15/291.58	   Accelerated rule 119 with NONTERM (after strengthening guard), yielding the new rule 122.
312.15/291.58	
312.15/291.58	   Accelerated rule 120 with metering function -1+A, yielding the new rule 123.
312.15/291.58	
312.15/291.58	   Removing the simple loops: 117 120.
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Accelerated all simple loops using metering functions (where possible):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     79: f4 -> [15] : [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     80: f4 -> [15] : [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     81: f4 -> [15] : [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     82: f4 -> [15] : [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	    116: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_26, E'=free_17, F'=0, [ 0>=B && 0>=C && -1+A>=1 ], cost: 11-2*C
312.15/291.58	
312.15/291.58	    118: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_17, D'=free_26, E'=free_17, F'=0, [ 0>=B && free_9>=1+C && 0>=free_9 && -1+A>=1 ], cost: 11-2*free_9
312.15/291.58	
312.15/291.58	    119: f4 -> f4 : A'=-1+A, B'=-1+A, C'=free_27, D'=free_26, E'=free_17, F'=1, [ 0>=B && free_9>=1+C && 0>=free_9 && -1+A>=1 && 1<=-1+free_27 ], cost: 11-2*free_9
312.15/291.58	
312.15/291.58	    121: f4 -> f4 : A'=1, B'=1, C'=free_25, D'=free_24, E'=free_21, F'=1, [ 0>=B && 1-A==0 && free_9>=1+C && 0>=free_9 && free_25>=1+free_21 && 1<=-1+free_21 && -1+A>=1 ], cost: -11-2*(-1+A)*free_9+11*A
312.15/291.58	
312.15/291.58	    122: f4 -> [16] : [ 0>=B && free_9>=1+C && 0>=free_9 && -1+A>=1 && 1<=-1+free_27 && free_9>=1+free_27 && 11-2*free_9>=1 ], cost: INF
312.15/291.58	
312.15/291.58	    123: f4 -> f4 : A'=1, B'=1, C'=free_25, D'=free_24, E'=free_21, F'=1, [ B>=1 && 1-A==0 && free_11>=1+C && 0>=free_11 && free_25>=1+free_21 && 1<=-1+free_21 && -1+A>=1 ], cost: -11-2*free_11*(-1+A)+11*A
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Chained accelerated rules (with incoming rules):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     79: f4 -> [15] : [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     80: f4 -> [15] : [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     81: f4 -> [15] : [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     82: f4 -> [15] : [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Removed unreachable locations (and leaf rules with constant cost):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	     55: f4 -> [14] : A'=-1+A, D'=free_8, E'=C, [ 0>=B && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     56: f4 -> [14] : A'=-1+A, C'=free_9, D'=free_8, E'=C, F'=1, [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: INF
312.15/291.58	
312.15/291.58	     59: f4 -> [14] : A'=-1+A, D'=free_10, E'=C, F'=0, [ B>=1 && A>=1 && 0>=C ], cost: INF
312.15/291.58	
312.15/291.58	     60: f4 -> [14] : A'=-1+A, C'=free_11, D'=free_10, E'=C, F'=1, [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: INF
312.15/291.58	
312.15/291.58	     79: f4 -> [15] : [ 0>=B && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     80: f4 -> [15] : [ 0>=B && A>=1 && free_9>=1+C && 0>=free_9 ], cost: 4-2*free_9
312.15/291.58	
312.15/291.58	     81: f4 -> [15] : [ B>=1 && A>=1 && 0>=C ], cost: 4-2*C
312.15/291.58	
312.15/291.58	     82: f4 -> [15] : [ B>=1 && A>=1 && free_11>=1+C && 0>=free_11 ], cost: 4-2*free_11
312.15/291.58	
312.15/291.58	     27: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, [ free_2>=1 && free_3>=1 && 0>=free && 1>=free_3 ], cost: 2
312.15/291.58	
312.15/291.58	     28: f2 -> f4 : A'=free_2, B'=free, C'=free_3, D'=free_1, E'=1, F'=1, [ free_2>=1 && 0>=free && free_3>=2 ], cost: 2
312.15/291.58	
312.15/291.58	     29: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=0, [ free_6>=1 && free_7>=1 && free_4>=1 && 1>=free_7 ], cost: 2
312.15/291.58	
312.15/291.58	     30: f2 -> f4 : A'=free_6, B'=free_4, C'=free_7, D'=free_5, E'=1, F'=1, [ free_6>=1 && free_4>=1 && free_7>=2 ], cost: 2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Eliminated locations (on tree-shaped paths):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Applied pruning (of leafs and parallel rules):
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	### Computing asymptotic complexity ###
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Fully simplified ITS problem
312.15/291.58	
312.15/291.58	   Start location: f2
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	Obtained the following overall complexity (w.r.t. the length of the input n):
312.15/291.58	
312.15/291.58	   Complexity:  Unknown
312.15/291.58	
312.15/291.58	   Cpx degree:  ?
312.15/291.58	
312.15/291.58	   Solved cost: 0
312.15/291.58	
312.15/291.58	   Rule cost:   0
312.15/291.58	
312.15/291.58	   Rule guard:  []
312.15/291.58	
312.15/291.58	
312.15/291.58	
312.15/291.58	WORST_CASE(Omega(0),?)
312.15/291.58	
312.15/291.58	
312.15/291.58	----------------------------------------
312.15/291.58	
312.15/291.58	(2)
312.15/291.58	BOUNDS(1, INF)
312.15/291.58	EOF