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