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  : [f12/14,f6/14]
0.03/0.36	1. non_recursive  : [exit_location/1]
0.03/0.36	2. non_recursive  : [f20/8]
0.03/0.36	3. non_recursive  : [f6_loop_cont/9]
0.03/0.36	4. non_recursive  : [f0/8]
0.03/0.36	
0.03/0.36	#### Obtained direct recursion through partial evaluation 
0.03/0.36	0. SCC is partially evaluated into f6/14
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 f6_loop_cont/9
0.03/0.36	4. SCC is partially evaluated into f0/8
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 f6/14 
0.03/0.36	* CE 6 is refined into CE [9] 
0.03/0.36	* CE 5 is refined into CE [10] 
0.03/0.36	* CE 2 is refined into CE [11] 
0.03/0.36	* CE 3 is refined into CE [12] 
0.03/0.36	* CE 4 is refined into CE [13] 
0.03/0.36	
0.03/0.36	
0.03/0.36	### Cost equations --> "Loop" of f6/14 
0.03/0.36	* CEs [13] --> Loop 9 
0.03/0.36	* CEs [11] --> Loop 10 
0.03/0.36	* CEs [12] --> Loop 11 
0.03/0.36	* CEs [9] --> Loop 12 
0.03/0.36	* CEs [10] --> Loop 13 
0.03/0.36	
0.03/0.36	### Ranking functions of CR f6(A,B,C,D,E,F,G,J,K,L,M,N,O,P) 
0.03/0.36	
0.03/0.36	#### Partial ranking functions of CR f6(A,B,C,D,E,F,G,J,K,L,M,N,O,P) 
0.03/0.36	
0.03/0.36	
0.03/0.36	### Specialization of cost equations f6_loop_cont/9 
0.03/0.36	* CE 8 is refined into CE [14] 
0.03/0.36	* CE 7 is refined into CE [15] 
0.03/0.36	
0.03/0.36	
0.03/0.36	### Cost equations --> "Loop" of f6_loop_cont/9 
0.03/0.36	* CEs [14] --> Loop 14 
0.03/0.36	* CEs [15] --> Loop 15 
0.03/0.36	
0.03/0.36	### Ranking functions of CR f6_loop_cont(A,B,C,D,E,F,G,H,I) 
0.03/0.36	
0.03/0.36	#### Partial ranking functions of CR f6_loop_cont(A,B,C,D,E,F,G,H,I) 
0.03/0.36	
0.03/0.36	
0.03/0.36	### Specialization of cost equations f0/8 
0.03/0.36	* CE 1 is refined into CE [16,17,18,19,20,21,22] 
0.03/0.36	
0.03/0.36	
0.03/0.36	### Cost equations --> "Loop" of f0/8 
0.03/0.36	* CEs [21,22] --> Loop 16 
0.03/0.36	* CEs [16,17,18,19,20] --> Loop 17 
0.03/0.36	
0.03/0.36	### Ranking functions of CR f0(A,B,C,D,E,F,G,J) 
0.03/0.36	
0.03/0.36	#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,J) 
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 f6(A,B,C,D,E,F,G,J,K,L,M,N,O,P):
0.03/0.36	* Chain [[10,11]]...: 2*it(10)+0
0.03/0.36	  with precondition: [A=8,C>=B,D+1=0] 
0.03/0.36	
0.03/0.36	* Chain [[10,11],13]: 2*it(10)+0
0.03/0.36	  with precondition: [A=8,D+1=0,J=2,M+1=0,O+1=0,P+1=0,C>=B,K>=L+1,N>=L,K>=N] 
0.03/0.36	
0.03/0.36	* Chain [[10,11],12]: 2*it(10)+0
0.03/0.36	  with precondition: [A=8,D+1=0,J=3,C>=B] 
0.03/0.36	
0.03/0.36	* Chain [[10,11],9,13]: 2*it(10)+1
0.03/0.36	  with precondition: [A=8,D+1=0,J=2,K=L+1,M=O,M=P,C>=B] 
0.03/0.36	
0.03/0.36	* Chain [[10,11],9,12]: 2*it(10)+1
0.03/0.36	  with precondition: [A=8,D+1=0,J=3,C>=B] 
0.03/0.36	
0.03/0.36	* Chain [12]: 0
0.03/0.36	  with precondition: [A=8,J=3] 
0.03/0.36	
0.03/0.36	* Chain [9,13]: 1
0.03/0.36	  with precondition: [A=8,D+1=0,J=2,B=K,B=L+1,M=O,M=P,C>=B] 
0.03/0.36	
0.03/0.36	* Chain [9,12]: 1
0.03/0.36	  with precondition: [A=8,D+1=0,J=3,C>=B] 
0.03/0.36	
0.03/0.36	
0.03/0.36	#### Cost of chains of f6_loop_cont(A,B,C,D,E,F,G,H,I):
0.03/0.36	* Chain [15]: 0
0.03/0.36	  with precondition: [A=2,B=8] 
0.03/0.36	
0.03/0.36	* Chain [14]: 0
0.03/0.36	  with precondition: [A=3,B=8] 
0.03/0.36	
0.03/0.36	
0.03/0.36	#### Cost of chains of f0(A,B,C,D,E,F,G,J):
0.03/0.36	* Chain [17]: 1*aux(2)+0
0.03/0.36	  with precondition: [] 
0.03/0.36	
0.03/0.36	* Chain [16]...: 1*aux(3)+0
0.03/0.36	  with precondition: [] 
0.03/0.36	
0.03/0.36	
0.03/0.36	Closed-form bounds of f0(A,B,C,D,E,F,G,J): 
0.03/0.36	-------------------------------------
0.03/0.36	* Chain [17] with precondition: [] 
0.03/0.36	    - Upper bound: inf 
0.03/0.36	    - Complexity: infinity 
0.03/0.36	* Chain [16]... with precondition: [] 
0.03/0.36	    - Upper bound: inf 
0.03/0.36	    - Complexity: infinity 
0.03/0.36	
0.03/0.36	### Maximum cost of f0(A,B,C,D,E,F,G,J): inf 
0.03/0.36	Asymptotic class: infinity 
0.03/0.36	* Total analysis performed in 291 ms.
0.03/0.36	
0.03/0.47	EOF