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