0.02/0.14	MAYBE
0.02/0.14	
0.02/0.14	Preprocessing Cost Relations
0.02/0.14	=====================================
0.02/0.14	
0.02/0.14	#### Computed strongly connected components 
0.02/0.14	0. recursive  : [f4/9,f5/9]
0.02/0.14	1. non_recursive  : [exit_location/1]
0.02/0.14	2. non_recursive  : [f3/6]
0.02/0.14	3. non_recursive  : [f4_loop_cont/7]
0.02/0.14	4. non_recursive  : [f30/6]
0.02/0.14	
0.02/0.14	#### Obtained direct recursion through partial evaluation 
0.02/0.14	0. SCC is partially evaluated into f4/9
0.02/0.14	1. SCC is completely evaluated into other SCCs
0.02/0.14	2. SCC is completely evaluated into other SCCs
0.02/0.14	3. SCC is partially evaluated into f4_loop_cont/7
0.02/0.14	4. SCC is partially evaluated into f30/6
0.02/0.14	
0.02/0.14	Control-Flow Refinement of Cost Relations
0.02/0.14	=====================================
0.02/0.14	
0.02/0.14	### Specialization of cost equations f4/9 
0.02/0.14	* CE 2 is discarded (unfeasible) 
0.02/0.14	* CE 5 is refined into CE [8] 
0.02/0.14	* CE 4 is refined into CE [9] 
0.02/0.14	* CE 3 is discarded (unfeasible) 
0.02/0.14	
0.02/0.14	
0.02/0.14	### Cost equations --> "Loop" of f4/9 
0.02/0.14	* CEs [9] --> Loop 8 
0.02/0.14	* CEs [8] --> Loop 9 
0.02/0.14	
0.02/0.14	### Ranking functions of CR f4(A,B,D,E,G,H,I,J,K) 
0.02/0.14	
0.02/0.14	#### Partial ranking functions of CR f4(A,B,D,E,G,H,I,J,K) 
0.02/0.14	
0.02/0.14	
0.02/0.14	### Specialization of cost equations f4_loop_cont/7 
0.02/0.14	* CE 7 is refined into CE [10] 
0.02/0.14	* CE 6 is refined into CE [11] 
0.02/0.14	
0.02/0.14	
0.02/0.14	### Cost equations --> "Loop" of f4_loop_cont/7 
0.02/0.14	* CEs [10] --> Loop 10 
0.02/0.14	* CEs [11] --> Loop 11 
0.02/0.14	
0.02/0.14	### Ranking functions of CR f4_loop_cont(A,B,C,D,E,F,G) 
0.02/0.14	
0.02/0.14	#### Partial ranking functions of CR f4_loop_cont(A,B,C,D,E,F,G) 
0.02/0.14	
0.02/0.14	
0.02/0.14	### Specialization of cost equations f30/6 
0.02/0.14	* CE 1 is refined into CE [12,13,14] 
0.02/0.14	
0.02/0.14	
0.02/0.14	### Cost equations --> "Loop" of f30/6 
0.02/0.14	* CEs [13,14] --> Loop 12 
0.02/0.14	* CEs [12] --> Loop 13 
0.02/0.14	
0.02/0.14	### Ranking functions of CR f30(A,B,C,D,E,G) 
0.02/0.14	
0.02/0.14	#### Partial ranking functions of CR f30(A,B,C,D,E,G) 
0.02/0.14	
0.02/0.14	
0.02/0.14	Computing Bounds
0.02/0.14	=====================================
0.02/0.14	
0.02/0.14	#### Cost of chains of f4(A,B,D,E,G,H,I,J,K):
0.02/0.14	* Chain [[8]]...: 1*it(8)+0
0.02/0.14	  with precondition: [A>=2] 
0.02/0.14	
0.02/0.14	* Chain [[8],9]: 1*it(8)+0
0.02/0.14	  with precondition: [G=2,A>=2] 
0.02/0.14	
0.02/0.14	* Chain [9]: 0
0.02/0.14	  with precondition: [G=2,A>=2] 
0.02/0.14	
0.02/0.14	
0.02/0.14	#### Cost of chains of f4_loop_cont(A,B,C,D,E,F,G):
0.02/0.14	* Chain [11]: 0
0.02/0.14	  with precondition: [A=2,D=2] 
0.02/0.14	
0.02/0.14	* Chain [10]: 0
0.02/0.14	  with precondition: [A=3,D=2] 
0.02/0.14	
0.02/0.14	
0.02/0.14	#### Cost of chains of f30(A,B,C,D,E,G):
0.02/0.14	* Chain [13]: 1*s(2)+0
0.02/0.14	  with precondition: [] 
0.02/0.14	
0.02/0.14	* Chain [12]...: 1*aux(2)+0
0.02/0.14	  with precondition: [] 
0.02/0.14	
0.02/0.14	
0.02/0.14	Closed-form bounds of f30(A,B,C,D,E,G): 
0.02/0.14	-------------------------------------
0.02/0.14	* Chain [13] with precondition: [] 
0.02/0.14	    - Upper bound: inf 
0.02/0.14	    - Complexity: infinity 
0.02/0.14	* Chain [12]... with precondition: [] 
0.02/0.14	    - Upper bound: inf 
0.02/0.14	    - Complexity: infinity 
0.02/0.14	
0.02/0.14	### Maximum cost of f30(A,B,C,D,E,G): inf 
0.02/0.14	Asymptotic class: infinity 
0.02/0.14	* Total analysis performed in 86 ms.
0.02/0.14	
0.02/0.25	EOF