0.04/0.20	MAYBE
0.04/0.20	
0.04/0.20	Preprocessing Cost Relations
0.04/0.20	=====================================
0.04/0.20	
0.04/0.20	#### Computed strongly connected components 
0.04/0.20	0. recursive  : [f2/6]
0.04/0.20	1. non_recursive  : [exit_location/1]
0.04/0.20	2. non_recursive  : [f300/4]
0.04/0.20	3. non_recursive  : [f2_loop_cont/5]
0.04/0.20	4. non_recursive  : [f3/4]
0.04/0.20	
0.04/0.20	#### Obtained direct recursion through partial evaluation 
0.04/0.20	0. SCC is partially evaluated into f2/6
0.04/0.20	1. SCC is completely evaluated into other SCCs
0.04/0.20	2. SCC is completely evaluated into other SCCs
0.04/0.20	3. SCC is partially evaluated into f2_loop_cont/5
0.04/0.20	4. SCC is partially evaluated into f3/4
0.04/0.20	
0.04/0.20	Control-Flow Refinement of Cost Relations
0.04/0.20	=====================================
0.04/0.20	
0.04/0.20	### Specialization of cost equations f2/6 
0.04/0.20	* CE 9 is refined into CE [12] 
0.04/0.20	* CE 7 is refined into CE [13] 
0.04/0.20	* CE 6 is refined into CE [14] 
0.04/0.20	* CE 8 is refined into CE [15] 
0.04/0.20	* CE 4 is refined into CE [16] 
0.04/0.20	* CE 5 is refined into CE [17] 
0.04/0.20	* CE 3 is refined into CE [18] 
0.04/0.20	* CE 2 is refined into CE [19] 
0.04/0.20	
0.04/0.20	
0.04/0.20	### Cost equations --> "Loop" of f2/6 
0.04/0.20	* CEs [16] --> Loop 12 
0.04/0.20	* CEs [17] --> Loop 13 
0.04/0.20	* CEs [18] --> Loop 14 
0.04/0.20	* CEs [19] --> Loop 15 
0.04/0.20	* CEs [12] --> Loop 16 
0.04/0.20	* CEs [13] --> Loop 17 
0.04/0.20	* CEs [14] --> Loop 18 
0.04/0.20	* CEs [15] --> Loop 19 
0.04/0.20	
0.04/0.20	### Ranking functions of CR f2(A,B,C,F,G,H) 
0.04/0.20	
0.04/0.20	#### Partial ranking functions of CR f2(A,B,C,F,G,H) 
0.04/0.20	
0.04/0.20	
0.04/0.20	### Specialization of cost equations f2_loop_cont/5 
0.04/0.20	* CE 11 is refined into CE [20] 
0.04/0.20	* CE 10 is refined into CE [21] 
0.04/0.20	
0.04/0.20	
0.04/0.20	### Cost equations --> "Loop" of f2_loop_cont/5 
0.04/0.20	* CEs [20] --> Loop 20 
0.04/0.20	* CEs [21] --> Loop 21 
0.04/0.20	
0.04/0.20	### Ranking functions of CR f2_loop_cont(A,B,C,D,E) 
0.04/0.20	
0.04/0.20	#### Partial ranking functions of CR f2_loop_cont(A,B,C,D,E) 
0.04/0.20	
0.04/0.20	
0.04/0.20	### Specialization of cost equations f3/4 
0.04/0.20	* CE 1 is refined into CE [22,23,24,25,26,27,28] 
0.04/0.20	
0.04/0.20	
0.04/0.20	### Cost equations --> "Loop" of f3/4 
0.04/0.20	* CEs [27,28] --> Loop 22 
0.04/0.20	* CEs [25] --> Loop 23 
0.04/0.20	* CEs [24] --> Loop 24 
0.04/0.20	* CEs [22] --> Loop 25 
0.04/0.20	* CEs [23,26] --> Loop 26 
0.04/0.20	
0.04/0.20	### Ranking functions of CR f3(A,B,C,F) 
0.04/0.20	
0.04/0.20	#### Partial ranking functions of CR f3(A,B,C,F) 
0.04/0.20	
0.04/0.20	
0.04/0.20	Computing Bounds
0.04/0.20	=====================================
0.04/0.20	
0.04/0.20	#### Cost of chains of f2(A,B,C,F,G,H):
0.04/0.20	* Chain [[12,13,14,15]]...: 4*it(12)+0
0.04/0.20	  with precondition: [] 
0.04/0.20	
0.04/0.20	* Chain [[12,13,14,15],19]: 4*it(12)+0
0.04/0.20	  with precondition: [F=2,G=0] 
0.04/0.20	
0.04/0.20	* Chain [[12,13,14,15],18]: 4*it(12)+0
0.04/0.20	  with precondition: [F=2,G=0] 
0.04/0.20	
0.04/0.20	* Chain [[12,13,14,15],17]: 4*it(12)+0
0.04/0.20	  with precondition: [F=2,G=0] 
0.04/0.20	
0.04/0.20	* Chain [[12,13,14,15],16]: 4*it(12)+0
0.04/0.20	  with precondition: [F=3] 
0.04/0.20	
0.04/0.20	* Chain [19]: 0
0.04/0.20	  with precondition: [A=0,F=2,G=0] 
0.04/0.20	
0.04/0.20	* Chain [18]: 0
0.04/0.20	  with precondition: [F=2,G=0,0>=A+1] 
0.04/0.20	
0.04/0.20	* Chain [17]: 0
0.04/0.20	  with precondition: [F=2,G=0,A>=1] 
0.04/0.20	
0.04/0.20	* Chain [16]: 0
0.04/0.20	  with precondition: [F=3] 
0.04/0.20	
0.04/0.20	
0.04/0.20	#### Cost of chains of f2_loop_cont(A,B,C,D,E):
0.04/0.20	* Chain [21]: 0
0.04/0.20	  with precondition: [A=2] 
0.04/0.20	
0.04/0.20	* Chain [20]: 0
0.04/0.20	  with precondition: [A=3] 
0.04/0.20	
0.04/0.20	
0.04/0.20	#### Cost of chains of f3(A,B,C,F):
0.04/0.20	* Chain [26]: 1*aux(3)+0
0.04/0.20	  with precondition: [] 
0.04/0.20	
0.04/0.20	* Chain [25]: 0
0.04/0.20	  with precondition: [A=0] 
0.04/0.20	
0.04/0.20	* Chain [24]: 0
0.04/0.20	  with precondition: [0>=A+1] 
0.04/0.20	
0.04/0.20	* Chain [23]: 0
0.04/0.20	  with precondition: [A>=1] 
0.04/0.20	
0.04/0.20	* Chain [22]...: 1*aux(4)+0
0.04/0.20	  with precondition: [] 
0.04/0.20	
0.04/0.20	
0.04/0.20	Closed-form bounds of f3(A,B,C,F): 
0.04/0.20	-------------------------------------
0.04/0.20	* Chain [26] with precondition: [] 
0.04/0.20	    - Upper bound: inf 
0.04/0.20	    - Complexity: infinity 
0.04/0.20	* Chain [25] with precondition: [A=0] 
0.04/0.20	    - Upper bound: 0 
0.04/0.20	    - Complexity: constant 
0.04/0.20	* Chain [24] with precondition: [0>=A+1] 
0.04/0.20	    - Upper bound: 0 
0.04/0.20	    - Complexity: constant 
0.04/0.20	* Chain [23] with precondition: [A>=1] 
0.04/0.20	    - Upper bound: 0 
0.04/0.20	    - Complexity: constant 
0.04/0.20	* Chain [22]... with precondition: [] 
0.04/0.20	    - Upper bound: inf 
0.04/0.20	    - Complexity: infinity 
0.04/0.20	
0.04/0.20	### Maximum cost of f3(A,B,C,F): inf 
0.04/0.20	Asymptotic class: infinity 
0.04/0.20	* Total analysis performed in 139 ms.
0.04/0.20	
0.04/0.30	EOF