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