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