0.03/0.12	MAYBE
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  : [f4/5]
0.03/0.12	1. non_recursive  : [exit_location/1]
0.03/0.12	2. non_recursive  : [f11/3]
0.03/0.12	3. non_recursive  : [f4_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 f4/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 f4_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 f4/5 
0.03/0.12	* CE 5 is refined into CE [8] 
0.03/0.12	* CE 4 is refined into CE [9] 
0.03/0.12	* CE 2 is refined into CE [10] 
0.03/0.12	* CE 3 is refined into CE [11] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of f4/5 
0.03/0.12	* CEs [10] --> Loop 8 
0.03/0.12	* CEs [11] --> Loop 9 
0.03/0.12	* CEs [8] --> Loop 10 
0.03/0.12	* CEs [9] --> Loop 11 
0.03/0.12	
0.03/0.12	### Ranking functions of CR f4(A,B,F,G,H) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR f4(A,B,F,G,H) 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Specialization of cost equations f4_loop_cont/4 
0.03/0.12	* CE 7 is refined into CE [12] 
0.03/0.12	* CE 6 is refined into CE [13] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of f4_loop_cont/4 
0.03/0.12	* CEs [12] --> Loop 12 
0.03/0.12	* CEs [13] --> Loop 13 
0.03/0.12	
0.03/0.12	### Ranking functions of CR f4_loop_cont(A,B,C,D) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR f4_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 [14,15,16,17,18] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of f0/3 
0.03/0.12	* CEs [17,18] --> Loop 14 
0.03/0.12	* CEs [14,15,16] --> Loop 15 
0.03/0.12	
0.03/0.12	### Ranking functions of CR f0(A,B,F) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR f0(A,B,F) 
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 f4(A,B,F,G,H):
0.03/0.12	* Chain [[8,9]]...: 2*it(8)+0
0.03/0.12	  with precondition: [B>=A+1] 
0.03/0.12	
0.03/0.12	* Chain [[8,9],11]: 2*it(8)+0
0.03/0.12	  with precondition: [F=2,B>=A+1,G>=H] 
0.03/0.12	
0.03/0.12	* Chain [[8,9],10]: 2*it(8)+0
0.03/0.12	  with precondition: [F=3,B>=A+1] 
0.03/0.12	
0.03/0.12	* Chain [10]: 0
0.03/0.12	  with precondition: [F=3] 
0.03/0.12	
0.03/0.12	
0.03/0.12	#### Cost of chains of f4_loop_cont(A,B,C,D):
0.03/0.12	* Chain [13]: 0
0.03/0.12	  with precondition: [A=2] 
0.03/0.12	
0.03/0.12	* Chain [12]: 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,F):
0.03/0.12	* Chain [15]: 1*aux(1)+0
0.03/0.12	  with precondition: [] 
0.03/0.12	
0.03/0.12	* Chain [14]...: 1*aux(2)+0
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,F): 
0.03/0.12	-------------------------------------
0.03/0.12	* Chain [15] with precondition: [] 
0.03/0.12	    - Upper bound: inf 
0.03/0.12	    - Complexity: infinity 
0.03/0.12	* Chain [14]... with precondition: [] 
0.03/0.12	    - Upper bound: inf 
0.03/0.12	    - Complexity: infinity 
0.03/0.12	
0.03/0.12	### Maximum cost of f0(A,B,F): inf 
0.03/0.12	Asymptotic class: infinity 
0.03/0.12	* Total analysis performed in 64 ms.
0.03/0.12	
0.03/0.22	EOF