0.04/0.39	MAYBE
0.04/0.39	
0.04/0.39	Preprocessing Cost Relations
0.04/0.39	=====================================
0.04/0.39	
0.04/0.39	#### Computed strongly connected components 
0.04/0.39	0. recursive  : [f12/23,f20/23]
0.04/0.39	1. non_recursive  : [exit_location/1]
0.04/0.39	2. non_recursive  : [f5/12]
0.04/0.39	3. non_recursive  : [f12_loop_cont/13]
0.04/0.39	4. non_recursive  : [f0/12]
0.04/0.39	
0.04/0.39	#### Obtained direct recursion through partial evaluation 
0.04/0.39	0. SCC is partially evaluated into f12/23
0.04/0.39	1. SCC is completely evaluated into other SCCs
0.04/0.39	2. SCC is completely evaluated into other SCCs
0.04/0.39	3. SCC is partially evaluated into f12_loop_cont/13
0.04/0.39	4. SCC is partially evaluated into f0/12
0.04/0.39	
0.04/0.39	Control-Flow Refinement of Cost Relations
0.04/0.39	=====================================
0.04/0.39	
0.04/0.39	### Specialization of cost equations f12/23 
0.04/0.39	* CE 6 is refined into CE [9] 
0.04/0.39	* CE 5 is refined into CE [10] 
0.04/0.39	* CE 3 is refined into CE [11] 
0.04/0.39	* CE 4 is refined into CE [12] 
0.04/0.39	
0.04/0.39	
0.04/0.39	### Cost equations --> "Loop" of f12/23 
0.04/0.39	* CEs [11] --> Loop 8 
0.04/0.39	* CEs [12] --> Loop 9 
0.04/0.39	* CEs [9] --> Loop 10 
0.04/0.39	* CEs [10] --> Loop 11 
0.04/0.39	
0.04/0.39	### Ranking functions of CR f12(A,B,C,D,E,F,G,H,I,J,K,N,O,P,Q,R,S,T,U,V,W,X,Y) 
0.04/0.39	* RF of phase [8]: [A]
0.04/0.39	
0.04/0.39	#### Partial ranking functions of CR f12(A,B,C,D,E,F,G,H,I,J,K,N,O,P,Q,R,S,T,U,V,W,X,Y) 
0.04/0.39	* Partial RF of phase [8]:
0.04/0.39	  - RF of loop [8:1]:
0.04/0.39	    A
0.04/0.39	
0.04/0.39	
0.04/0.39	### Specialization of cost equations f12_loop_cont/13 
0.04/0.39	* CE 8 is refined into CE [13] 
0.04/0.39	* CE 7 is refined into CE [14] 
0.04/0.39	
0.04/0.39	
0.04/0.39	### Cost equations --> "Loop" of f12_loop_cont/13 
0.04/0.39	* CEs [13] --> Loop 12 
0.04/0.39	* CEs [14] --> Loop 13 
0.04/0.39	
0.04/0.39	### Ranking functions of CR f12_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M) 
0.04/0.39	
0.04/0.39	#### Partial ranking functions of CR f12_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M) 
0.04/0.39	
0.04/0.39	
0.04/0.39	### Specialization of cost equations f0/12 
0.04/0.39	* CE 1 is refined into CE [15] 
0.04/0.39	* CE 2 is refined into CE [16,17,18,19,20,21,22] 
0.04/0.39	
0.04/0.39	
0.04/0.39	### Cost equations --> "Loop" of f0/12 
0.04/0.39	* CEs [21,22] --> Loop 14 
0.04/0.39	* CEs [15,16,17,18,19,20] --> Loop 15 
0.04/0.39	
0.04/0.39	### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,N) 
0.04/0.39	
0.04/0.39	#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,N) 
0.04/0.39	
0.04/0.39	
0.04/0.39	Computing Bounds
0.04/0.39	=====================================
0.04/0.39	
0.04/0.39	#### Cost of chains of f12(A,B,C,D,E,F,G,H,I,J,K,N,O,P,Q,R,S,T,U,V,W,X,Y):
0.04/0.39	* Chain [[9]]...: 1*it(9)+0
0.04/0.39	  with precondition: [0>=A+1] 
0.04/0.39	
0.04/0.39	* Chain [[9],10]: 1*it(9)+0
0.04/0.39	  with precondition: [N=3,0>=A+1] 
0.04/0.39	
0.04/0.39	* Chain [[8],11]: 1*it(8)+0
0.04/0.39	  Such that:it(8) =< A
0.04/0.39	
0.04/0.39	  with precondition: [N=2,O=0,R=0,S=0,T=0,U=0,X=0,Y=0,P=Q,V=W,A>=1] 
0.04/0.39	
0.04/0.39	* Chain [[8],10]: 1*it(8)+0
0.04/0.39	  Such that:it(8) =< A
0.04/0.39	
0.04/0.39	  with precondition: [N=3,A>=1] 
0.04/0.39	
0.04/0.39	* Chain [11]: 0
0.04/0.39	  with precondition: [A=0,N=2,O=0,R=0,S=0,X=0,Y=0,P=B,Q=C,T=F,U=G,W=V] 
0.04/0.39	
0.04/0.39	* Chain [10]: 0
0.04/0.39	  with precondition: [N=3] 
0.04/0.39	
0.04/0.39	
0.04/0.39	#### Cost of chains of f12_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M):
0.04/0.39	* Chain [13]: 0
0.04/0.39	  with precondition: [A=2] 
0.04/0.39	
0.04/0.39	* Chain [12]: 0
0.04/0.39	  with precondition: [A=3] 
0.04/0.39	
0.04/0.39	
0.04/0.39	#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,N):
0.04/0.39	* Chain [15]: 1*aux(1)+0
0.04/0.39	  with precondition: [] 
0.04/0.39	
0.04/0.39	* Chain [14]...: 1*aux(2)+0
0.04/0.39	  with precondition: [] 
0.04/0.39	
0.04/0.39	
0.04/0.39	Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,N): 
0.04/0.39	-------------------------------------
0.04/0.39	* Chain [15] with precondition: [] 
0.04/0.39	    - Upper bound: inf 
0.04/0.39	    - Complexity: infinity 
0.04/0.39	* Chain [14]... with precondition: [] 
0.04/0.39	    - Upper bound: inf 
0.04/0.39	    - Complexity: infinity 
0.04/0.39	
0.04/0.39	### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,N): inf 
0.04/0.39	Asymptotic class: infinity 
0.04/0.39	* Total analysis performed in 311 ms.
0.04/0.39	
0.04/0.50	EOF