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