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