0.03/0.30	WORST_CASE(?,O(1))  
0.03/0.30	
0.03/0.30	Preprocessing Cost Relations
0.03/0.30	=====================================
0.03/0.30	
0.03/0.30	#### Computed strongly connected components 
0.03/0.30	0. recursive  : [f18/4]
0.03/0.30	1. non_recursive  : [exit_location/1]
0.03/0.30	2. recursive  : [f24/4]
0.03/0.30	3. recursive  : [f31/4]
0.03/0.30	4. non_recursive  : [f39/7]
0.03/0.30	5. non_recursive  : [f31_loop_cont/8]
0.03/0.30	6. non_recursive  : [f24_loop_cont/8]
0.03/0.30	7. non_recursive  : [f18_loop_cont/8]
0.03/0.30	8. non_recursive  : [f0/7]
0.03/0.30	
0.03/0.30	#### Obtained direct recursion through partial evaluation 
0.03/0.30	0. SCC is partially evaluated into f18/4
0.03/0.30	1. SCC is completely evaluated into other SCCs
0.03/0.30	2. SCC is partially evaluated into f24/4
0.03/0.30	3. SCC is partially evaluated into f31/4
0.03/0.30	4. SCC is completely evaluated into other SCCs
0.03/0.30	5. SCC is partially evaluated into f31_loop_cont/8
0.03/0.30	6. SCC is partially evaluated into f24_loop_cont/8
0.03/0.30	7. SCC is partially evaluated into f18_loop_cont/8
0.03/0.30	8. SCC is partially evaluated into f0/7
0.03/0.30	
0.03/0.30	Control-Flow Refinement of Cost Relations
0.03/0.30	=====================================
0.03/0.30	
0.03/0.30	### Specialization of cost equations f18/4 
0.03/0.30	* CE 3 is refined into CE [17] 
0.03/0.30	* CE 4 is refined into CE [18] 
0.03/0.30	* CE 2 is refined into CE [19] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f18/4 
0.03/0.30	* CEs [19] --> Loop 17 
0.03/0.30	* CEs [17] --> Loop 18 
0.03/0.30	* CEs [18] --> Loop 19 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f18(A,B,I,J) 
0.03/0.30	* RF of phase [17]: [-B+10]
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f18(A,B,I,J) 
0.03/0.30	* Partial RF of phase [17]:
0.03/0.30	  - RF of loop [17:1]:
0.03/0.30	    -B+10
0.03/0.30	
0.03/0.30	
0.03/0.30	### Specialization of cost equations f24/4 
0.03/0.30	* CE 8 is refined into CE [20] 
0.03/0.30	* CE 9 is refined into CE [21] 
0.03/0.30	* CE 7 is refined into CE [22] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f24/4 
0.03/0.30	* CEs [22] --> Loop 20 
0.03/0.30	* CEs [20] --> Loop 21 
0.03/0.30	* CEs [21] --> Loop 22 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f24(A,B,I,J) 
0.03/0.30	* RF of phase [20]: [-B+10]
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f24(A,B,I,J) 
0.03/0.30	* Partial RF of phase [20]:
0.03/0.30	  - RF of loop [20:1]:
0.03/0.30	    -B+10
0.03/0.30	
0.03/0.30	
0.03/0.30	### Specialization of cost equations f31/4 
0.03/0.30	* CE 14 is refined into CE [23] 
0.03/0.30	* CE 13 is refined into CE [24] 
0.03/0.30	* CE 12 is refined into CE [25] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f31/4 
0.03/0.30	* CEs [25] --> Loop 23 
0.03/0.30	* CEs [23] --> Loop 24 
0.03/0.30	* CEs [24] --> Loop 25 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f31(A,B,I,J) 
0.03/0.30	* RF of phase [23]: [-B+10]
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f31(A,B,I,J) 
0.03/0.30	* Partial RF of phase [23]:
0.03/0.30	  - RF of loop [23:1]:
0.03/0.30	    -B+10
0.03/0.30	
0.03/0.30	
0.03/0.30	### Specialization of cost equations f31_loop_cont/8 
0.03/0.30	* CE 16 is refined into CE [26] 
0.03/0.30	* CE 15 is refined into CE [27] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f31_loop_cont/8 
0.03/0.30	* CEs [26] --> Loop 26 
0.03/0.30	* CEs [27] --> Loop 27 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f31_loop_cont(A,B,C,D,E,F,G,H) 
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f31_loop_cont(A,B,C,D,E,F,G,H) 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Specialization of cost equations f24_loop_cont/8 
0.03/0.30	* CE 11 is refined into CE [28,29,30,31] 
0.03/0.30	* CE 10 is refined into CE [32] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f24_loop_cont/8 
0.03/0.30	* CEs [29] --> Loop 28 
0.03/0.30	* CEs [28,31] --> Loop 29 
0.03/0.30	* CEs [30] --> Loop 30 
0.03/0.30	* CEs [32] --> Loop 31 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f24_loop_cont(A,B,C,D,E,F,G,H) 
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f24_loop_cont(A,B,C,D,E,F,G,H) 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Specialization of cost equations f18_loop_cont/8 
0.03/0.30	* CE 6 is refined into CE [33,34,35,36,37,38] 
0.03/0.30	* CE 5 is refined into CE [39] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f18_loop_cont/8 
0.03/0.30	* CEs [37,38] --> Loop 32 
0.03/0.30	* CEs [34,35,36] --> Loop 33 
0.03/0.30	* CEs [33] --> Loop 34 
0.03/0.30	* CEs [39] --> Loop 35 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f18_loop_cont(A,B,C,D,E,F,G,H) 
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f18_loop_cont(A,B,C,D,E,F,G,H) 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Specialization of cost equations f0/7 
0.03/0.30	* CE 1 is refined into CE [40,41,42,43] 
0.03/0.30	
0.03/0.30	
0.03/0.30	### Cost equations --> "Loop" of f0/7 
0.03/0.30	* CEs [40,41,42,43] --> Loop 36 
0.03/0.30	
0.03/0.30	### Ranking functions of CR f0(A,B,C,D,E,F,I) 
0.03/0.30	
0.03/0.30	#### Partial ranking functions of CR f0(A,B,C,D,E,F,I) 
0.03/0.30	
0.03/0.30	
0.03/0.30	Computing Bounds
0.03/0.30	=====================================
0.03/0.30	
0.03/0.30	#### Cost of chains of f18(A,B,I,J):
0.03/0.30	* Chain [[17],19]: 1*it(17)+0
0.03/0.30	  Such that:it(17) =< -B+10
0.03/0.30	
0.03/0.30	  with precondition: [A=10,I=3,9>=B,B>=0] 
0.03/0.30	
0.03/0.30	* Chain [[17],18]: 1*it(17)+0
0.03/0.30	  Such that:it(17) =< -B+10
0.03/0.30	
0.03/0.30	  with precondition: [A=10,I=5,J=0,9>=B,B>=0] 
0.03/0.30	
0.03/0.30	* Chain [19]: 0
0.03/0.30	  with precondition: [A=10,I=3,B>=0] 
0.03/0.30	
0.03/0.30	
0.03/0.30	#### Cost of chains of f24(A,B,I,J):
0.03/0.30	* Chain [[20],22]: 1*it(20)+0
0.03/0.30	  Such that:it(20) =< -B+10
0.03/0.30	
0.03/0.30	  with precondition: [A=10,I=3,9>=B] 
0.03/0.30	
0.03/0.30	* Chain [[20],21]: 1*it(20)+0
0.03/0.30	  Such that:it(20) =< -B+10
0.03/0.30	
0.03/0.30	  with precondition: [A=10,I=4,J=0,9>=B] 
0.03/0.30	
0.03/0.30	* Chain [22]: 0
0.03/0.30	  with precondition: [A=10,I=3] 
0.03/0.30	
0.03/0.30	* Chain [21]: 0
0.03/0.30	  with precondition: [A=10,I=4,J=0,B>=10] 
0.03/0.30	
0.03/0.30	
0.03/0.30	#### Cost of chains of f31(A,B,I,J):
0.03/0.30	* Chain [[23],25]: 1*it(23)+0
0.03/0.30	  Such that:it(23) =< -B+10
0.03/0.30	
0.03/0.30	  with precondition: [A=10,I=2,J=10,9>=B] 
0.03/0.30	
0.03/0.30	* Chain [[23],24]: 1*it(23)+0
0.03/0.30	  Such that:it(23) =< -B+10
0.03/0.30	
0.03/0.30	  with precondition: [A=10,I=3,9>=B] 
0.03/0.30	
0.03/0.30	* Chain [25]: 0
0.03/0.30	  with precondition: [A=10,I=2,B=J,B>=10] 
0.03/0.30	
0.03/0.30	* Chain [24]: 0
0.03/0.30	  with precondition: [A=10,I=3] 
0.03/0.30	
0.03/0.30	
0.03/0.30	#### Cost of chains of f31_loop_cont(A,B,C,D,E,F,G,H):
0.03/0.30	* Chain [27]: 0
0.03/0.30	  with precondition: [A=2,B=10,D=10,F=10] 
0.03/0.30	
0.03/0.30	* Chain [26]: 0
0.03/0.30	  with precondition: [A=3,B=10,D=10,F=10] 
0.03/0.30	
0.03/0.30	
0.03/0.30	#### Cost of chains of f24_loop_cont(A,B,C,D,E,F,G,H):
0.03/0.30	* Chain [31]: 0
0.03/0.30	  with precondition: [A=3,B=10,D=10,F=10] 
0.03/0.30	
0.03/0.30	* Chain [30]: 0
0.03/0.30	  with precondition: [A=4,B=10,D=10,F=10] 
0.03/0.30	
0.03/0.30	* Chain [29]: 2*s(1)+0
0.03/0.30	  Such that:aux(1) =< -C+10
0.03/0.30	s(1) =< aux(1)
0.03/0.30	
0.03/0.30	  with precondition: [A=4,B=10,D=10,F=10,9>=C] 
0.03/0.30	
0.03/0.30	* Chain [28]: 0
0.03/0.30	  with precondition: [A=4,B=10,D=10,F=10,C>=10] 
0.03/0.30	
0.03/0.30	
0.03/0.30	#### Cost of chains of f18_loop_cont(A,B,C,D,E,F,G,H):
0.03/0.30	* Chain [35]: 0
0.03/0.30	  with precondition: [A=3,B=10,D=10,F=10] 
0.03/0.30	
0.03/0.30	* Chain [34]: 0
0.03/0.30	  with precondition: [A=5,B=10,D=10,F=10] 
0.03/0.30	
0.03/0.30	* Chain [33]: 3*s(3)+2*s(7)+0
0.03/0.30	  Such that:s(6) =< 10
0.03/0.30	aux(2) =< -C+10
0.03/0.30	s(3) =< aux(2)
0.03/0.30	s(7) =< s(6)
0.03/0.30	
0.03/0.30	  with precondition: [A=5,B=10,D=10,F=10,9>=C] 
0.03/0.30	
0.03/0.30	* Chain [32]: 20
0.03/0.30	  with precondition: [A=5,B=10,D=10,F=10,C>=10] 
0.03/0.30	
0.03/0.30	
0.03/0.30	#### Cost of chains of f0(A,B,C,D,E,F,I):
0.03/0.30	* Chain [36]: 80
0.03/0.30	  with precondition: [] 
0.03/0.30	
0.03/0.30	
0.03/0.30	Closed-form bounds of f0(A,B,C,D,E,F,I): 
0.03/0.30	-------------------------------------
0.03/0.30	* Chain [36] with precondition: [] 
0.03/0.30	    - Upper bound: 80 
0.03/0.30	    - Complexity: constant 
0.03/0.30	
0.03/0.30	### Maximum cost of f0(A,B,C,D,E,F,I): 80 
0.03/0.30	Asymptotic class: constant 
0.03/0.30	* Total analysis performed in 231 ms.
0.03/0.30	
0.03/0.40	EOF