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