0.03/0.17	WORST_CASE(?,O(1))  
0.03/0.17	
0.03/0.17	Preprocessing Cost Relations
0.03/0.17	=====================================
0.03/0.17	
0.03/0.17	#### Computed strongly connected components 
0.03/0.17	0. recursive  : [f8/9]
0.03/0.17	1. non_recursive  : [exit_location/1]
0.03/0.17	2. non_recursive  : [f23/5]
0.03/0.17	3. non_recursive  : [f8_loop_cont/6]
0.03/0.17	4. non_recursive  : [f0/5]
0.03/0.17	
0.03/0.17	#### Obtained direct recursion through partial evaluation 
0.03/0.17	0. SCC is partially evaluated into f8/9
0.03/0.17	1. SCC is completely evaluated into other SCCs
0.03/0.17	2. SCC is completely evaluated into other SCCs
0.03/0.17	3. SCC is partially evaluated into f8_loop_cont/6
0.03/0.17	4. SCC is partially evaluated into f0/5
0.03/0.17	
0.03/0.17	Control-Flow Refinement of Cost Relations
0.03/0.17	=====================================
0.03/0.17	
0.03/0.17	### Specialization of cost equations f8/9 
0.03/0.17	* CE 5 is refined into CE [8] 
0.03/0.17	* CE 4 is refined into CE [9] 
0.03/0.17	* CE 2 is refined into CE [10] 
0.03/0.17	* CE 3 is refined into CE [11] 
0.03/0.17	
0.03/0.17	
0.03/0.17	### Cost equations --> "Loop" of f8/9 
0.03/0.17	* CEs [10] --> Loop 8 
0.03/0.17	* CEs [11] --> Loop 9 
0.03/0.17	* CEs [8] --> Loop 10 
0.03/0.17	* CEs [9] --> Loop 11 
0.03/0.17	
0.03/0.17	### Ranking functions of CR f8(A,B,C,D,F,G,H,I,J) 
0.03/0.17	* RF of phase [8,9]: [-A+4]
0.03/0.17	
0.03/0.17	#### Partial ranking functions of CR f8(A,B,C,D,F,G,H,I,J) 
0.03/0.17	* Partial RF of phase [8,9]:
0.03/0.17	  - RF of loop [8:1,9:1]:
0.03/0.17	    -A+4
0.03/0.17	
0.03/0.17	
0.03/0.17	### Specialization of cost equations f8_loop_cont/6 
0.03/0.17	* CE 7 is refined into CE [12] 
0.03/0.17	* CE 6 is refined into CE [13] 
0.03/0.17	
0.03/0.17	
0.03/0.17	### Cost equations --> "Loop" of f8_loop_cont/6 
0.03/0.17	* CEs [12] --> Loop 12 
0.03/0.17	* CEs [13] --> Loop 13 
0.03/0.17	
0.03/0.17	### Ranking functions of CR f8_loop_cont(A,B,C,D,E,F) 
0.03/0.17	
0.03/0.17	#### Partial ranking functions of CR f8_loop_cont(A,B,C,D,E,F) 
0.03/0.17	
0.03/0.17	
0.03/0.17	### Specialization of cost equations f0/5 
0.03/0.17	* CE 1 is refined into CE [14,15,16] 
0.03/0.17	
0.03/0.17	
0.03/0.17	### Cost equations --> "Loop" of f0/5 
0.03/0.17	* CEs [14,15,16] --> Loop 14 
0.03/0.17	
0.03/0.17	### Ranking functions of CR f0(A,B,C,D,F) 
0.03/0.17	
0.03/0.17	#### Partial ranking functions of CR f0(A,B,C,D,F) 
0.03/0.17	
0.03/0.17	
0.03/0.17	Computing Bounds
0.03/0.17	=====================================
0.03/0.17	
0.03/0.17	#### Cost of chains of f8(A,B,C,D,F,G,H,I,J):
0.03/0.17	* Chain [[8,9],11]: 2*it(8)+0
0.03/0.17	  Such that:aux(3) =< -A+4
0.03/0.17	it(8) =< aux(3)
0.03/0.17	
0.03/0.17	  with precondition: [F=2,G=4,3>=A,A>=0] 
0.03/0.17	
0.03/0.17	* Chain [[8,9],10]: 2*it(8)+0
0.03/0.17	  Such that:aux(4) =< -A+4
0.03/0.17	it(8) =< aux(4)
0.03/0.17	
0.03/0.17	  with precondition: [F=3,3>=A,A>=0] 
0.03/0.17	
0.03/0.17	* Chain [10]: 0
0.03/0.17	  with precondition: [F=3,A>=0] 
0.03/0.17	
0.03/0.17	
0.03/0.17	#### Cost of chains of f8_loop_cont(A,B,C,D,E,F):
0.03/0.17	* Chain [13]: 0
0.03/0.17	  with precondition: [A=2] 
0.03/0.17	
0.03/0.17	* Chain [12]: 0
0.03/0.17	  with precondition: [A=3] 
0.03/0.17	
0.03/0.17	
0.03/0.17	#### Cost of chains of f0(A,B,C,D,F):
0.03/0.17	* Chain [14]: 16
0.03/0.17	  with precondition: [] 
0.03/0.17	
0.03/0.17	
0.03/0.17	Closed-form bounds of f0(A,B,C,D,F): 
0.03/0.17	-------------------------------------
0.03/0.17	* Chain [14] with precondition: [] 
0.03/0.17	    - Upper bound: 16 
0.03/0.17	    - Complexity: constant 
0.03/0.17	
0.03/0.17	### Maximum cost of f0(A,B,C,D,F): 16 
0.03/0.17	Asymptotic class: constant 
0.03/0.17	* Total analysis performed in 108 ms.
0.03/0.17	
0.03/0.27	EOF