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