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