0.03/0.23	MAYBE
0.03/0.23	
0.03/0.23	Preprocessing Cost Relations
0.03/0.23	=====================================
0.03/0.23	
0.03/0.23	#### Computed strongly connected components 
0.03/0.23	0. recursive  : [f20/5]
0.03/0.23	1. recursive  : [f11/3,f14/3,f20_loop_cont/4]
0.03/0.23	2. non_recursive  : [exit_location/1]
0.03/0.23	3. non_recursive  : [f11_loop_cont/2]
0.03/0.23	4. non_recursive  : [f0/4]
0.03/0.23	
0.03/0.23	#### Obtained direct recursion through partial evaluation 
0.03/0.23	0. SCC is partially evaluated into f20/5
0.03/0.23	1. SCC is partially evaluated into f11/3
0.03/0.23	2. SCC is completely evaluated into other SCCs
0.03/0.23	3. SCC is completely evaluated into other SCCs
0.03/0.23	4. SCC is partially evaluated into f0/4
0.03/0.23	
0.03/0.23	Control-Flow Refinement of Cost Relations
0.03/0.23	=====================================
0.03/0.23	
0.03/0.23	### Specialization of cost equations f20/5 
0.03/0.23	* CE 9 is refined into CE [10] 
0.03/0.23	* CE 8 is refined into CE [11] 
0.03/0.23	* CE 7 is refined into CE [12] 
0.03/0.23	
0.03/0.23	
0.03/0.23	### Cost equations --> "Loop" of f20/5 
0.03/0.23	* CEs [12] --> Loop 10 
0.03/0.23	* CEs [10] --> Loop 11 
0.03/0.23	* CEs [11] --> Loop 12 
0.03/0.23	
0.03/0.23	### Ranking functions of CR f20(A,B,F,G,H) 
0.03/0.23	* RF of phase [10]: [A-2]
0.03/0.23	
0.03/0.23	#### Partial ranking functions of CR f20(A,B,F,G,H) 
0.03/0.23	* Partial RF of phase [10]:
0.03/0.23	  - RF of loop [10:1]:
0.03/0.23	    A-2
0.03/0.23	
0.03/0.23	
0.03/0.23	### Specialization of cost equations f11/3 
0.03/0.23	* CE 4 is refined into CE [13,14] 
0.03/0.23	* CE 6 is refined into CE [15] 
0.03/0.23	* CE 5 is refined into CE [16,17] 
0.03/0.23	* CE 3 is refined into CE [18] 
0.03/0.23	* CE 2 is refined into CE [19] 
0.03/0.23	
0.03/0.23	
0.03/0.23	### Cost equations --> "Loop" of f11/3 
0.03/0.23	* CEs [17] --> Loop 13 
0.03/0.23	* CEs [18] --> Loop 14 
0.03/0.23	* CEs [19] --> Loop 15 
0.03/0.23	* CEs [16] --> Loop 16 
0.03/0.23	* CEs [14] --> Loop 17 
0.03/0.23	* CEs [13] --> Loop 18 
0.03/0.23	* CEs [15] --> Loop 19 
0.03/0.23	
0.03/0.23	### Ranking functions of CR f11(A,B,F) 
0.03/0.23	
0.03/0.23	#### Partial ranking functions of CR f11(A,B,F) 
0.03/0.23	* Partial RF of phase [13,15,16]:
0.03/0.23	  - RF of loop [15:1]:
0.03/0.23	    -A+6 depends on loops [16:1] 
0.03/0.23	  - RF of loop [16:1]:
0.03/0.23	    A-2 depends on loops [15:1] 
0.03/0.23	
0.03/0.23	
0.03/0.23	### Specialization of cost equations f0/4 
0.03/0.23	* CE 1 is refined into CE [20,21,22,23,24,25,26,27] 
0.03/0.23	
0.03/0.23	
0.03/0.23	### Cost equations --> "Loop" of f0/4 
0.03/0.23	* CEs [25,26,27] --> Loop 20 
0.03/0.23	* CEs [20,21,22,23,24] --> Loop 21 
0.03/0.23	
0.03/0.23	### Ranking functions of CR f0(A,B,C,F) 
0.03/0.23	
0.03/0.23	#### Partial ranking functions of CR f0(A,B,C,F) 
0.03/0.23	
0.03/0.23	
0.03/0.23	Computing Bounds
0.03/0.23	=====================================
0.03/0.23	
0.03/0.24	#### Cost of chains of f20(A,B,F,G,H):
0.03/0.24	* Chain [[10],12]: 1*it(10)+0
0.03/0.24	  Such that:it(10) =< A
0.03/0.24	
0.03/0.24	  with precondition: [F=2,G=2,5>=A,A>=3,B>=1] 
0.03/0.24	
0.03/0.24	* Chain [[10],11]: 1*it(10)+0
0.03/0.24	  Such that:it(10) =< A
0.03/0.24	
0.03/0.24	  with precondition: [F=3,5>=A,A>=3,B>=1] 
0.03/0.24	
0.03/0.24	* Chain [12]: 0
0.03/0.24	  with precondition: [F=2,A=G,2>=A,B>=1] 
0.03/0.24	
0.03/0.24	* Chain [11]: 0
0.03/0.24	  with precondition: [F=3,5>=A,B>=1] 
0.03/0.24	
0.03/0.24	
0.03/0.24	#### Cost of chains of f11(A,B,F):
0.03/0.24	* Chain [[14]]...: 1*it(14)+0
0.03/0.24	  with precondition: [A>=6,F=3] 
0.03/0.24	
0.03/0.24	* Chain [[14],19]: 1*it(14)+0
0.03/0.24	  with precondition: [F=3,A>=6] 
0.03/0.24	
0.03/0.24	* Chain [[13,15,16]]...: 4*it(13)+0
0.03/0.24	  with precondition: [5>=A,F=3] 
0.03/0.24	
0.03/0.24	* Chain [[13,15,16],[14]]...: 5*it(13)+0
0.03/0.24	  with precondition: [F=3,5>=A] 
0.03/0.24	
0.03/0.24	* Chain [[13,15,16],[14],19]: 5*it(13)+0
0.03/0.24	  with precondition: [F=3,5>=A] 
0.03/0.24	
0.03/0.24	* Chain [[13,15,16],19]: 4*it(13)+0
0.03/0.24	  with precondition: [F=3,5>=A] 
0.03/0.24	
0.03/0.24	* Chain [[13,15,16],18]: 4*it(13)+1*s(4)+0
0.03/0.24	  Such that:s(4) =< 5
0.03/0.24	
0.03/0.24	  with precondition: [F=3,5>=A] 
0.03/0.24	
0.03/0.24	* Chain [[13,15,16],17]: 4*it(13)+0
0.03/0.24	  with precondition: [F=3,5>=A] 
0.03/0.24	
0.03/0.24	* Chain [19]: 0
0.03/0.24	  with precondition: [F=3] 
0.03/0.24	
0.03/0.24	* Chain [18]: 1*s(4)+0
0.03/0.24	  Such that:s(4) =< A
0.03/0.24	
0.03/0.24	  with precondition: [F=3,5>=A,A>=3,B>=1] 
0.03/0.24	
0.03/0.24	* Chain [17]: 0
0.03/0.24	  with precondition: [F=3,5>=A,B>=1] 
0.03/0.24	
0.03/0.24	
0.03/0.24	#### Cost of chains of f0(A,B,C,F):
0.03/0.24	* Chain [21]: 1*aux(9)+0
0.03/0.24	  with precondition: [] 
0.03/0.24	
0.03/0.24	* Chain [20]...: 1*aux(10)+0
0.03/0.24	  with precondition: [] 
0.03/0.24	
0.03/0.24	
0.03/0.24	Closed-form bounds of f0(A,B,C,F): 
0.03/0.24	-------------------------------------
0.03/0.24	* Chain [21] with precondition: [] 
0.03/0.24	    - Upper bound: inf 
0.03/0.24	    - Complexity: infinity 
0.03/0.24	* Chain [20]... with precondition: [] 
0.03/0.24	    - Upper bound: inf 
0.03/0.24	    - Complexity: infinity 
0.03/0.24	
0.03/0.24	### Maximum cost of f0(A,B,C,F): inf 
0.03/0.24	Asymptotic class: infinity 
0.03/0.24	* Total analysis performed in 172 ms.
0.03/0.24	
0.03/0.34	EOF