6.60/6.61	MAYBE
6.60/6.61	
6.60/6.61	Preprocessing Cost Relations
6.60/6.61	=====================================
6.60/6.61	
6.60/6.61	#### Computed strongly connected components 
6.60/6.61	0. recursive  : [f31/23,f42/23]
6.60/6.61	1. non_recursive  : [exit_location/1]
6.60/6.61	2. recursive  : [f67/17,f77/17,f81/17,f83/17]
6.60/6.61	3. recursive  : [f104/23]
6.60/6.61	4. recursive  : [f144/57,f172/57]
6.60/6.61	5. recursive  : [f211/19]
6.60/6.61	6. recursive  : [f235/1]
6.60/6.61	7. non_recursive  : [f235_loop_cont/2]
6.60/6.61	8. non_recursive  : [f211_loop_cont/65]
6.60/6.61	9. non_recursive  : [f144_loop_cont/65]
6.60/6.61	10. non_recursive  : [f104_loop_cont/65]
6.60/6.61	11. non_recursive  : [f67_loop_cont/65]
6.60/6.61	12. non_recursive  : [f31_loop_cont/65]
6.60/6.61	13. non_recursive  : [f0/64]
6.60/6.61	
6.60/6.61	#### Obtained direct recursion through partial evaluation 
6.60/6.61	0. SCC is partially evaluated into f31/23
6.60/6.61	1. SCC is completely evaluated into other SCCs
6.60/6.61	2. SCC is partially evaluated into f67/17
6.60/6.61	3. SCC is partially evaluated into f104/23
6.60/6.61	4. SCC is partially evaluated into f144/57
6.60/6.61	5. SCC is partially evaluated into f211/19
6.60/6.61	6. SCC is partially evaluated into f235/1
6.60/6.61	7. SCC is completely evaluated into other SCCs
6.60/6.61	8. SCC is partially evaluated into f211_loop_cont/65
6.60/6.61	9. SCC is partially evaluated into f144_loop_cont/65
6.60/6.61	10. SCC is partially evaluated into f104_loop_cont/65
6.60/6.61	11. SCC is partially evaluated into f67_loop_cont/65
6.60/6.61	12. SCC is partially evaluated into f31_loop_cont/65
6.60/6.61	13. SCC is partially evaluated into f0/64
6.60/6.61	
6.60/6.61	Control-Flow Refinement of Cost Relations
6.60/6.61	=====================================
6.60/6.61	
6.60/6.61	### Specialization of cost equations f31/23 
6.60/6.61	* CE 8 is refined into CE [52] 
6.60/6.61	* CE 9 is refined into CE [53] 
6.60/6.61	* CE 3 is refined into CE [54] 
6.60/6.61	* CE 5 is refined into CE [55] 
6.60/6.61	* CE 4 is refined into CE [56] 
6.60/6.61	* CE 6 is refined into CE [57] 
6.60/6.61	* CE 7 is refined into CE [58] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f31/23 
6.60/6.61	* CEs [54] --> Loop 51 
6.60/6.61	* CEs [55] --> Loop 52 
6.60/6.61	* CEs [56] --> Loop 53 
6.60/6.61	* CEs [57] --> Loop 54 
6.60/6.61	* CEs [58] --> Loop 55 
6.60/6.61	* CEs [52] --> Loop 56 
6.60/6.61	* CEs [53] --> Loop 57 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f31(B,C,D,E,F,H,R,U,C2,D2,E2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3) 
6.60/6.61	* RF of phase [51,52,53,54,55]: [B]
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f31(B,C,D,E,F,H,R,U,C2,D2,E2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3) 
6.60/6.61	* Partial RF of phase [51,52,53,54,55]:
6.60/6.61	  - RF of loop [51:1,52:1,53:1,54:1,55:1]:
6.60/6.61	    B
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f67/17 
6.60/6.61	* CE 28 is refined into CE [59] 
6.60/6.61	* CE 29 is refined into CE [60] 
6.60/6.61	* CE 24 is refined into CE [61] 
6.60/6.61	* CE 26 is refined into CE [62] 
6.60/6.61	* CE 25 is refined into CE [63] 
6.60/6.61	* CE 27 is refined into CE [64] 
6.60/6.61	* CE 16 is refined into CE [65] 
6.60/6.61	* CE 18 is refined into CE [66] 
6.60/6.61	* CE 17 is refined into CE [67] 
6.60/6.61	* CE 19 is refined into CE [68] 
6.60/6.61	* CE 20 is refined into CE [69] 
6.60/6.61	* CE 22 is refined into CE [70] 
6.60/6.61	* CE 21 is refined into CE [71] 
6.60/6.61	* CE 23 is refined into CE [72] 
6.60/6.61	* CE 12 is refined into CE [73] 
6.60/6.61	* CE 14 is refined into CE [74] 
6.60/6.61	* CE 13 is refined into CE [75] 
6.60/6.61	* CE 15 is refined into CE [76] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f67/17 
6.60/6.61	* CEs [61] --> Loop 58 
6.60/6.61	* CEs [62] --> Loop 59 
6.60/6.61	* CEs [63] --> Loop 60 
6.60/6.61	* CEs [64] --> Loop 61 
6.60/6.61	* CEs [65] --> Loop 62 
6.60/6.61	* CEs [66] --> Loop 63 
6.60/6.61	* CEs [67] --> Loop 64 
6.60/6.61	* CEs [68] --> Loop 65 
6.60/6.61	* CEs [69] --> Loop 66 
6.60/6.61	* CEs [70] --> Loop 67 
6.60/6.61	* CEs [71] --> Loop 68 
6.60/6.61	* CEs [72] --> Loop 69 
6.60/6.61	* CEs [73] --> Loop 70 
6.60/6.61	* CEs [74] --> Loop 71 
6.60/6.61	* CEs [75] --> Loop 72 
6.60/6.61	* CEs [76] --> Loop 73 
6.60/6.61	* CEs [59] --> Loop 74 
6.60/6.61	* CEs [60] --> Loop 75 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f67(A,G,H,I,J,R,U,B2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 
6.60/6.61	* RF of phase [58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73]: [H]
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f67(A,G,H,I,J,R,U,B2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 
6.60/6.61	* Partial RF of phase [58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73]:
6.60/6.61	  - RF of loop [58:1,59:1,60:1,61:1,62:1,63:1,64:1,65:1,66:1,67:1,68:1,69:1,70:1,71:1,72:1,73:1]:
6.60/6.61	    H
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f104/23 
6.60/6.61	* CE 32 is refined into CE [77] 
6.60/6.61	* CE 34 is refined into CE [78] 
6.60/6.61	* CE 33 is refined into CE [79] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f104/23 
6.60/6.61	* CEs [79] --> Loop 76 
6.60/6.61	* CEs [77] --> Loop 77 
6.60/6.61	* CEs [78] --> Loop 78 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f104(R,T,U,T1,U1,V1,W1,X1,Y1,Z1,A2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3) 
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f104(R,T,U,T1,U1,V1,W1,X1,Y1,Z1,A2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3) 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f144/57 
6.60/6.61	* CE 39 is refined into CE [80] 
6.60/6.61	* CE 42 is refined into CE [81] 
6.60/6.61	* CE 40 is refined into CE [82] 
6.60/6.61	* CE 41 is refined into CE [83] 
6.60/6.61	* CE 37 is refined into CE [84] 
6.60/6.61	* CE 38 is refined into CE [85] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f144/57 
6.60/6.61	* CEs [82] --> Loop 79 
6.60/6.61	* CEs [83] --> Loop 80 
6.60/6.61	* CEs [84] --> Loop 81 
6.60/6.61	* CEs [85] --> Loop 82 
6.60/6.61	* CEs [80] --> Loop 83 
6.60/6.61	* CEs [81] --> Loop 84 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f144(K,R,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3) 
6.60/6.61	* RF of phase [79,80,81,82]: [T]
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f144(K,R,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3) 
6.60/6.61	* Partial RF of phase [79,80,81,82]:
6.60/6.61	  - RF of loop [79:1,80:1,81:1,82:1]:
6.60/6.61	    T
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f211/19 
6.60/6.61	* CE 46 is refined into CE [86] 
6.60/6.61	* CE 47 is refined into CE [87] 
6.60/6.61	* CE 45 is refined into CE [88] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f211/19 
6.60/6.61	* CEs [88] --> Loop 85 
6.60/6.61	* CEs [86] --> Loop 86 
6.60/6.61	* CEs [87] --> Loop 87 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f211(K,L,M,N,O,P,Q,R,S,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2) 
6.60/6.61	* RF of phase [85]: [K]
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f211(K,L,M,N,O,P,Q,R,S,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2) 
6.60/6.61	* Partial RF of phase [85]:
6.60/6.61	  - RF of loop [85:1]:
6.60/6.61	    K
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f235/1 
6.60/6.61	* CE 51 is refined into CE [89] 
6.60/6.61	* CE 50 is refined into CE [90] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f235/1 
6.60/6.61	* CEs [90] --> Loop 88 
6.60/6.61	* CEs [89] --> Loop 89 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f235(Q2) 
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f235(Q2) 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f211_loop_cont/65 
6.60/6.61	* CE 49 is refined into CE [91,92] 
6.60/6.61	* CE 48 is refined into CE [93] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f211_loop_cont/65 
6.60/6.61	* CEs [91] --> Loop 90 
6.60/6.61	* CEs [93] --> Loop 91 
6.60/6.61	* CEs [92] --> Loop 92 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f211_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f211_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f144_loop_cont/65 
6.60/6.61	* CE 44 is refined into CE [94,95,96,97,98,99] 
6.60/6.61	* CE 43 is refined into CE [100] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f144_loop_cont/65 
6.60/6.61	* CEs [95,96] --> Loop 93 
6.60/6.61	* CEs [98] --> Loop 94 
6.60/6.61	* CEs [94] --> Loop 95 
6.60/6.61	* CEs [100] --> Loop 96 
6.60/6.61	* CEs [97] --> Loop 97 
6.60/6.61	* CEs [99] --> Loop 98 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f144_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f144_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f104_loop_cont/65 
6.60/6.61	* CE 36 is refined into CE [101,102,103,104,105,106,107,108,109,110,111,112] 
6.60/6.61	* CE 35 is refined into CE [113] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f104_loop_cont/65 
6.60/6.61	* CEs [102,103,104,105] --> Loop 99 
6.60/6.61	* CEs [108,109,110] --> Loop 100 
6.60/6.61	* CEs [101] --> Loop 101 
6.60/6.61	* CEs [113] --> Loop 102 
6.60/6.61	* CEs [106,107] --> Loop 103 
6.60/6.61	* CEs [111,112] --> Loop 104 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f104_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f104_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f67_loop_cont/65 
6.60/6.61	* CE 31 is refined into CE [114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130] 
6.60/6.61	* CE 30 is refined into CE [131] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f67_loop_cont/65 
6.60/6.61	* CEs [114,115,116,117,120,121,122] --> Loop 105 
6.60/6.61	* CEs [131] --> Loop 106 
6.60/6.61	* CEs [118,119,123,124,125,126,127,128,129,130] --> Loop 107 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f67_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f67_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f31_loop_cont/65 
6.60/6.61	* CE 11 is refined into CE [132,133,134,135,136,137] 
6.60/6.61	* CE 10 is refined into CE [138] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f31_loop_cont/65 
6.60/6.61	* CEs [133,134] --> Loop 108 
6.60/6.61	* CEs [136] --> Loop 109 
6.60/6.61	* CEs [132] --> Loop 110 
6.60/6.61	* CEs [138] --> Loop 111 
6.60/6.61	* CEs [135] --> Loop 112 
6.60/6.61	* CEs [137] --> Loop 113 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f31_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f31_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2) 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Specialization of cost equations f0/64 
6.60/6.61	* CE 1 is refined into CE [139,140,141,142,143,144,145,146,147,148,149,150] 
6.60/6.61	* CE 2 is refined into CE [151,152,153,154,155,156,157,158,159,160,161,162] 
6.60/6.61	
6.60/6.61	
6.60/6.61	### Cost equations --> "Loop" of f0/64 
6.60/6.61	* CEs [144,145,149,150,156,157,161,162] --> Loop 114 
6.60/6.61	* CEs [139,140,141,142,143,146,147,148,151,152,153,154,155,158,159,160] --> Loop 115 
6.60/6.61	
6.60/6.61	### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,Q2) 
6.60/6.61	
6.60/6.61	#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,Q2) 
6.60/6.61	
6.60/6.61	
6.60/6.61	Computing Bounds
6.60/6.61	=====================================
6.60/6.61	
6.60/6.61	#### Cost of chains of f31(B,C,D,E,F,H,R,U,C2,D2,E2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3):
6.60/6.61	* Chain [[51,52,53,54,55],57]: 5*it(51)+0
6.60/6.61	  Such that:aux(3) =< B
6.60/6.61	it(51) =< aux(3)
6.60/6.61	
6.60/6.61	  with precondition: [R=0,U=0,Q2=2,B>=1] 
6.60/6.61	
6.60/6.61	* Chain [[51,52,53,54,55],56]: 5*it(51)+0
6.60/6.61	  Such that:aux(4) =< B
6.60/6.61	it(51) =< aux(4)
6.60/6.61	
6.60/6.61	  with precondition: [R=0,U=0,Q2=7,R2=0,X2=0,Y2=0,S2=T2,W2=B3,B>=1] 
6.60/6.61	
6.60/6.61	* Chain [57]: 0
6.60/6.61	  with precondition: [R=0,U=0,Q2=2] 
6.60/6.61	
6.60/6.61	* Chain [56]: 0
6.60/6.61	  with precondition: [R=0,U=0,Q2=7,X2=0,Y2=0,S2=C,T2=D,U2=E,V2=F,Z2=C2,B=R2,B3=W2,0>=B] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f67(A,G,H,I,J,R,U,B2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2):
6.60/6.61	* Chain [[58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73],75]: 16*it(58)+0
6.60/6.61	  Such that:aux(7) =< H
6.60/6.61	it(58) =< aux(7)
6.60/6.61	
6.60/6.61	  with precondition: [Q2=2,H>=1] 
6.60/6.61	
6.60/6.61	* Chain [[58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73],74]: 16*it(58)+0
6.60/6.61	  Such that:aux(8) =< H
6.60/6.61	it(58) =< aux(8)
6.60/6.61	
6.60/6.61	  with precondition: [Q2=6,T2=0,W2=0,X2=0,H>=1] 
6.60/6.61	
6.60/6.61	* Chain [75]: 0
6.60/6.61	  with precondition: [Q2=2] 
6.60/6.61	
6.60/6.61	* Chain [74]: 0
6.60/6.61	  with precondition: [Q2=6,W2=0,X2=0,R2=A,S2=G,U2=I,V2=J,H=T2,0>=H] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f104(R,T,U,T1,U1,V1,W1,X1,Y1,Z1,A2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3):
6.60/6.61	* Chain [[76]]...: 1*it(76)+0
6.60/6.61	  with precondition: [] 
6.60/6.61	
6.60/6.61	* Chain [[76],78]: 1*it(76)+0
6.60/6.61	  with precondition: [Q2=2] 
6.60/6.61	
6.60/6.61	* Chain [[76],77]: 1*it(76)+0
6.60/6.61	  with precondition: [Q2=5,R2=0,T2=0,U2=V2,S2=X2,Y2=B3,0>=U2] 
6.60/6.61	
6.60/6.61	* Chain [78]: 0
6.60/6.61	  with precondition: [Q2=2] 
6.60/6.61	
6.60/6.61	* Chain [77]: 0
6.60/6.61	  with precondition: [Q2=5,R2=0,T2=0,Y2=X1,Z2=Y1,A3=Z1,B3=A2,X2=S2,U2=V2,0>=U2] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f144(K,R,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3):
6.60/6.61	* Chain [[79,80,81,82],84]: 4*it(79)+0
6.60/6.61	  Such that:aux(12) =< T
6.60/6.61	it(79) =< aux(12)
6.60/6.61	
6.60/6.61	  with precondition: [Y=0,Q2=2,T>=1] 
6.60/6.61	
6.60/6.61	* Chain [[79,80,81,82],83]: 4*it(79)+0
6.60/6.61	  Such that:aux(13) =< T
6.60/6.61	it(79) =< aux(13)
6.60/6.61	
6.60/6.61	  with precondition: [Y=0,Q2=4,S2=0,T2=0,U2=0,Y2=0,R2=W2,A1=A3,B1=B3,C1=C3,E1=E3,F1=F3,G1=G3,H1=H3,J3=K3,T>=1] 
6.60/6.61	
6.60/6.61	* Chain [84]: 0
6.60/6.61	  with precondition: [Y=0,Q2=2] 
6.60/6.61	
6.60/6.61	* Chain [83]: 0
6.60/6.61	  with precondition: [Y=0,Q2=4,S2=0,U2=0,Y2=0,X2=X,Z2=Z,A3=A1,B3=B1,C3=C1,D3=D1,E3=E1,F3=F1,G3=G1,H3=H1,I3=I1,J3=J1,K3=K1,L3=L1,M3=M1,N3=N1,O3=O1,P3=P1,Q3=Q1,R3=R1,S3=S1,W2=R2,T=T2,0>=T] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f211(K,L,M,N,O,P,Q,R,S,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2):
6.60/6.61	* Chain [[85],87]: 1*it(85)+0
6.60/6.61	  Such that:it(85) =< K
6.60/6.61	
6.60/6.61	  with precondition: [Q2=2,K>=1] 
6.60/6.61	
6.60/6.61	* Chain [[85],86]: 1*it(85)+0
6.60/6.61	  Such that:it(85) =< K
6.60/6.61	
6.60/6.61	  with precondition: [Q2=3,R2=0,S2=0,U2=0,V2=0,W2=2,Y2=0,T2=X2,K>=1] 
6.60/6.61	
6.60/6.61	* Chain [87]: 0
6.60/6.61	  with precondition: [Q2=2] 
6.60/6.61	
6.60/6.61	* Chain [86]: 0
6.60/6.61	  with precondition: [Q2=3,Y2=0,S2=L,T2=M,U2=N,V2=O,W2=P,X2=Q,K=R2,0>=K] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f235(Q2):
6.60/6.61	* Chain [[88]]...: 1*it(88)+0
6.60/6.61	  with precondition: [Q2=2] 
6.60/6.61	
6.60/6.61	* Chain [[88],89]: 1*it(88)+0
6.60/6.61	  with precondition: [Q2=2] 
6.60/6.61	
6.60/6.61	* Chain [89]: 0
6.60/6.61	  with precondition: [Q2=2] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f211_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2):
6.60/6.61	* Chain [92]...: 1*s(3)+0
6.60/6.61	  with precondition: [A=3,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [91]: 0
6.60/6.61	  with precondition: [A=2,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [90]: 1*s(4)+0
6.60/6.61	  with precondition: [A=3,H2=0] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f144_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2):
6.60/6.61	* Chain [98]...: 1*s(5)+0
6.60/6.61	  with precondition: [A=4,H2=0,0>=L] 
6.60/6.61	
6.60/6.61	* Chain [97]...: 1*s(6)+1*s(7)+0
6.60/6.61	  Such that:s(6) =< L
6.60/6.61	
6.60/6.61	  with precondition: [A=4,H2=0,L>=1] 
6.60/6.61	
6.60/6.61	* Chain [96]: 0
6.60/6.61	  with precondition: [A=2,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [95]: 0
6.60/6.61	  with precondition: [A=4,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [94]: 1*s(8)+0
6.60/6.61	  with precondition: [A=4,H2=0,0>=L] 
6.60/6.61	
6.60/6.61	* Chain [93]: 2*s(9)+1*s(11)+0
6.60/6.61	  Such that:aux(15) =< L
6.60/6.61	s(9) =< aux(15)
6.60/6.61	
6.60/6.61	  with precondition: [A=4,H2=0,L>=1] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f104_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2):
6.60/6.61	* Chain [104]...: 1*aux(16)+0
6.60/6.61	  with precondition: [A=5,Z=0,H2=0,0>=U] 
6.60/6.61	
6.60/6.61	* Chain [103]...: 8*s(16)+3*s(17)+0
6.60/6.61	  Such that:aux(17) =< U
6.60/6.61	s(16) =< aux(17)
6.60/6.61	
6.60/6.61	  with precondition: [A=5,Z=0,H2=0,U>=1] 
6.60/6.61	
6.60/6.61	* Chain [102]: 0
6.60/6.61	  with precondition: [A=2,Z=0,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [101]: 0
6.60/6.61	  with precondition: [A=5,Z=0,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [100]: 1*aux(18)+0
6.60/6.61	  with precondition: [A=5,Z=0,H2=0,0>=U] 
6.60/6.61	
6.60/6.61	* Chain [99]: 16*s(27)+4*s(32)+0
6.60/6.61	  Such that:aux(19) =< U
6.60/6.61	s(27) =< aux(19)
6.60/6.61	
6.60/6.61	  with precondition: [A=5,Z=0,H2=0,U>=1] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f67_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2):
6.60/6.61	* Chain [107]...: 1*aux(20)+0
6.60/6.61	  with precondition: [A=6,Z=0,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [106]: 0
6.60/6.61	  with precondition: [A=2,Z=0,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [105]: 1*aux(21)+0
6.60/6.61	  with precondition: [A=6,Z=0,H2=0] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f31_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2):
6.60/6.61	* Chain [113]...: 1*s(74)+0
6.60/6.61	  with precondition: [A=7,Z=0,H2=0,0>=I] 
6.60/6.61	
6.60/6.61	* Chain [112]...: 16*s(76)+1*s(77)+0
6.60/6.61	  Such that:s(75) =< I
6.60/6.61	s(76) =< s(75)
6.60/6.61	
6.60/6.61	  with precondition: [A=7,Z=0,H2=0,I>=1] 
6.60/6.61	
6.60/6.61	* Chain [111]: 0
6.60/6.61	  with precondition: [A=2,Z=0,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [110]: 0
6.60/6.61	  with precondition: [A=7,Z=0,H2=0] 
6.60/6.61	
6.60/6.61	* Chain [109]: 1*s(78)+0
6.60/6.61	  with precondition: [A=7,Z=0,H2=0,0>=I] 
6.60/6.61	
6.60/6.61	* Chain [108]: 32*s(80)+1*s(83)+0
6.60/6.61	  Such that:aux(22) =< I
6.60/6.61	s(80) =< aux(22)
6.60/6.61	
6.60/6.61	  with precondition: [A=7,Z=0,H2=0,I>=1] 
6.60/6.61	
6.60/6.61	
6.60/6.61	#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,Q2):
6.60/6.61	* Chain [115]: 1*aux(23)+0
6.60/6.61	  with precondition: [] 
6.60/6.61	
6.60/6.61	* Chain [114]...: 1*aux(24)+0
6.60/6.61	  with precondition: [] 
6.60/6.61	
6.60/6.61	
6.60/6.61	Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,Q2): 
6.60/6.61	-------------------------------------
6.60/6.61	* Chain [115] with precondition: [] 
6.60/6.61	    - Upper bound: inf 
6.60/6.61	    - Complexity: infinity 
6.60/6.61	* Chain [114]... with precondition: [] 
6.60/6.61	    - Upper bound: inf 
6.60/6.61	    - Complexity: infinity 
6.60/6.61	
6.60/6.61	### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,Q2): inf 
6.60/6.61	Asymptotic class: infinity 
6.60/6.61	* Total analysis performed in 6077 ms.
6.60/6.61	
6.62/6.71	EOF