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