0.04/0.22	WORST_CASE(?,O(1))  
0.04/0.22	
0.04/0.22	Preprocessing Cost Relations
0.04/0.22	=====================================
0.04/0.22	
0.04/0.22	#### Computed strongly connected components 
0.04/0.22	0. recursive  : [f5/7]
0.04/0.22	1. non_recursive  : [exit_location/1]
0.04/0.22	2. non_recursive  : [f13/8]
0.04/0.22	3. recursive  : [f17/11]
0.04/0.22	4. recursive  : [f32/7]
0.04/0.22	5. non_recursive  : [f32_loop_cont/9]
0.04/0.22	6. non_recursive  : [f17_loop_cont/9]
0.04/0.22	7. non_recursive  : [f5_loop_cont/9]
0.04/0.22	8. non_recursive  : [f0/8]
0.04/0.22	
0.04/0.22	#### Obtained direct recursion through partial evaluation 
0.04/0.22	0. SCC is partially evaluated into f5/7
0.04/0.22	1. SCC is completely evaluated into other SCCs
0.04/0.22	2. SCC is completely evaluated into other SCCs
0.04/0.22	3. SCC is partially evaluated into f17/11
0.04/0.22	4. SCC is partially evaluated into f32/7
0.04/0.22	5. SCC is partially evaluated into f32_loop_cont/9
0.04/0.22	6. SCC is partially evaluated into f17_loop_cont/9
0.04/0.22	7. SCC is partially evaluated into f5_loop_cont/9
0.04/0.22	8. SCC is partially evaluated into f0/8
0.04/0.22	
0.04/0.22	Control-Flow Refinement of Cost Relations
0.04/0.22	=====================================
0.04/0.22	
0.04/0.22	### Specialization of cost equations f5/7 
0.04/0.22	* CE 4 is refined into CE [21] 
0.04/0.22	* CE 3 is refined into CE [22] 
0.04/0.22	* CE 2 is refined into CE [23] 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of f5/7 
0.04/0.22	* CEs [23] --> Loop 21 
0.04/0.22	* CEs [21] --> Loop 22 
0.04/0.22	* CEs [22] --> Loop 23 
0.04/0.22	
0.04/0.22	### Ranking functions of CR f5(A,B,D,J,K,L,M) 
0.04/0.22	* RF of phase [21]: [-A+100]
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR f5(A,B,D,J,K,L,M) 
0.04/0.22	* Partial RF of phase [21]:
0.04/0.22	  - RF of loop [21:1]:
0.04/0.22	    -A+100
0.04/0.22	
0.04/0.22	
0.04/0.22	### Specialization of cost equations f17/11 
0.04/0.22	* CE 9 is discarded (unfeasible) 
0.04/0.22	* CE 11 is discarded (unfeasible) 
0.04/0.22	* CE 10 is discarded (unfeasible) 
0.04/0.22	* CE 7 is discarded (unfeasible) 
0.04/0.22	* CE 8 is discarded (unfeasible) 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of f17/11 
0.04/0.22	
0.04/0.22	### Ranking functions of CR f17(B,C,D,F,G,J,K,L,M,N,O) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR f17(B,C,D,F,G,J,K,L,M,N,O) 
0.04/0.22	
0.04/0.22	Warning: no base case found for predicate
0.04/0.22	
0.04/0.22	### Specialization of cost equations f32/7 
0.04/0.22	* CE 18 is discarded (unfeasible) 
0.04/0.22	* CE 17 is discarded (unfeasible) 
0.04/0.22	* CE 15 is discarded (unfeasible) 
0.04/0.22	* CE 16 is discarded (unfeasible) 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of f32/7 
0.04/0.22	
0.04/0.22	### Ranking functions of CR f32(C,D,E,J,K,L,M) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR f32(C,D,E,J,K,L,M) 
0.04/0.22	
0.04/0.22	Warning: no base case found for predicate
0.04/0.22	
0.04/0.22	### Specialization of cost equations f32_loop_cont/9 
0.04/0.22	* CE 20 is discarded (unfeasible) 
0.04/0.22	* CE 19 is discarded (unfeasible) 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of f32_loop_cont/9 
0.04/0.22	
0.04/0.22	### Ranking functions of CR f32_loop_cont(A,B,C,D,E,F,G,H,I) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR f32_loop_cont(A,B,C,D,E,F,G,H,I) 
0.04/0.22	
0.04/0.22	Warning: no base case found for predicate
0.04/0.22	
0.04/0.22	### Specialization of cost equations f17_loop_cont/9 
0.04/0.22	* CE 14 is discarded (unfeasible) 
0.04/0.22	* CE 13 is discarded (unfeasible) 
0.04/0.22	* CE 12 is discarded (unfeasible) 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of f17_loop_cont/9 
0.04/0.22	
0.04/0.22	### Ranking functions of CR f17_loop_cont(A,B,C,D,E,F,G,H,I) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR f17_loop_cont(A,B,C,D,E,F,G,H,I) 
0.04/0.22	
0.04/0.22	Warning: no base case found for predicate
0.04/0.22	
0.04/0.22	### Specialization of cost equations f5_loop_cont/9 
0.04/0.22	* CE 6 is refined into CE [24] 
0.04/0.22	* CE 5 is refined into CE [25] 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of f5_loop_cont/9 
0.04/0.22	* CEs [24] --> Loop 24 
0.04/0.22	* CEs [25] --> Loop 25 
0.04/0.22	
0.04/0.22	### Ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H,I) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H,I) 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Specialization of cost equations f0/8 
0.04/0.22	* CE 1 is refined into CE [26,27,28] 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of f0/8 
0.04/0.22	* CEs [26,27,28] --> Loop 26 
0.04/0.22	
0.04/0.22	### Ranking functions of CR f0(A,B,C,D,E,F,G,J) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,J) 
0.04/0.22	
0.04/0.22	
0.04/0.22	Computing Bounds
0.04/0.22	=====================================
0.04/0.22	
0.04/0.22	#### Cost of chains of f5(A,B,D,J,K,L,M):
0.04/0.22	* Chain [[21],23]: 1*it(21)+0
0.04/0.22	  Such that:it(21) =< -A+100
0.04/0.22	
0.04/0.22	  with precondition: [J=2,K=100,M=98,B=L,99>=A,A>=0] 
0.04/0.22	
0.04/0.22	* Chain [[21],22]: 1*it(21)+0
0.04/0.22	  Such that:it(21) =< -A+100
0.04/0.22	
0.04/0.22	  with precondition: [J=3,99>=A,A>=0] 
0.04/0.22	
0.04/0.22	* Chain [22]: 0
0.04/0.22	  with precondition: [J=3,A>=0] 
0.04/0.22	
0.04/0.22	
0.04/0.22	#### Cost of chains of f17(B,C,D,F,G,J,K,L,M,N,O):
0.04/0.22	
0.04/0.22	#### Cost of chains of f32(C,D,E,J,K,L,M):
0.04/0.22	
0.04/0.22	#### Cost of chains of f32_loop_cont(A,B,C,D,E,F,G,H,I):
0.04/0.22	
0.04/0.22	#### Cost of chains of f17_loop_cont(A,B,C,D,E,F,G,H,I):
0.04/0.22	
0.04/0.22	#### Cost of chains of f5_loop_cont(A,B,C,D,E,F,G,H,I):
0.04/0.22	* Chain [25]: 0
0.04/0.22	  with precondition: [A=2] 
0.04/0.22	
0.04/0.22	* Chain [24]: 0
0.04/0.22	  with precondition: [A=3] 
0.04/0.22	
0.04/0.22	
0.04/0.22	#### Cost of chains of f0(A,B,C,D,E,F,G,J):
0.04/0.22	* Chain [26]: 200
0.04/0.22	  with precondition: [] 
0.04/0.22	
0.04/0.22	
0.04/0.22	Closed-form bounds of f0(A,B,C,D,E,F,G,J): 
0.04/0.22	-------------------------------------
0.04/0.22	* Chain [26] with precondition: [] 
0.04/0.22	    - Upper bound: 200 
0.04/0.22	    - Complexity: constant 
0.04/0.22	
0.04/0.22	### Maximum cost of f0(A,B,C,D,E,F,G,J): 200 
0.04/0.22	Asymptotic class: constant 
0.04/0.22	* Total analysis performed in 145 ms.
0.04/0.22	
0.04/0.32	EOF