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