0.03/0.09	MAYBE
0.03/0.09	
0.03/0.09	Preprocessing Cost Relations
0.03/0.09	=====================================
0.03/0.09	
0.03/0.09	#### Computed strongly connected components 
0.03/0.09	0. recursive  : [f2/2]
0.03/0.09	1. non_recursive  : [exit_location/1]
0.03/0.09	2. non_recursive  : [f2_loop_cont/2]
0.03/0.09	3. non_recursive  : [f0/2]
0.03/0.09	
0.03/0.09	#### Obtained direct recursion through partial evaluation 
0.03/0.09	0. SCC is partially evaluated into f2/2
0.03/0.09	1. SCC is completely evaluated into other SCCs
0.03/0.09	2. SCC is completely evaluated into other SCCs
0.03/0.09	3. SCC is partially evaluated into f0/2
0.03/0.09	
0.03/0.09	Control-Flow Refinement of Cost Relations
0.03/0.09	=====================================
0.03/0.09	
0.03/0.09	### Specialization of cost equations f2/2 
0.03/0.09	* CE 4 is refined into CE [5] 
0.03/0.09	* CE 3 is refined into CE [6] 
0.03/0.09	
0.03/0.09	
0.03/0.09	### Cost equations --> "Loop" of f2/2 
0.03/0.09	* CEs [6] --> Loop 5 
0.03/0.09	* CEs [5] --> Loop 6 
0.03/0.09	
0.03/0.09	### Ranking functions of CR f2(A,B) 
0.03/0.09	
0.03/0.09	#### Partial ranking functions of CR f2(A,B) 
0.03/0.09	
0.03/0.09	
0.03/0.09	### Specialization of cost equations f0/2 
0.03/0.09	* CE 2 is refined into CE [7,8] 
0.03/0.09	* CE 1 is refined into CE [9,10] 
0.03/0.09	
0.03/0.09	
0.03/0.09	### Cost equations --> "Loop" of f0/2 
0.03/0.09	* CEs [8] --> Loop 7 
0.03/0.09	* CEs [10] --> Loop 8 
0.03/0.09	* CEs [7] --> Loop 9 
0.03/0.09	* CEs [9] --> Loop 10 
0.03/0.09	
0.03/0.09	### Ranking functions of CR f0(A,B) 
0.03/0.09	
0.03/0.09	#### Partial ranking functions of CR f0(A,B) 
0.03/0.09	
0.03/0.09	
0.03/0.09	Computing Bounds
0.03/0.09	=====================================
0.03/0.09	
0.03/0.09	#### Cost of chains of f2(A,B):
0.03/0.09	* Chain [[5]]...: 1*it(5)+0
0.03/0.09	  with precondition: [A>=101,B=2] 
0.03/0.09	
0.03/0.09	* Chain [[5],6]: 1*it(5)+0
0.03/0.09	  with precondition: [B=2,A>=101] 
0.03/0.09	
0.03/0.09	* Chain [6]: 0
0.03/0.09	  with precondition: [B=2,A>=101] 
0.03/0.09	
0.03/0.09	
0.03/0.09	#### Cost of chains of f0(A,B):
0.03/0.09	* Chain [10]: 1*s(2)+0
0.03/0.09	  with precondition: [A+99>=0] 
0.03/0.09	
0.03/0.09	* Chain [9]: 1*s(3)+0
0.03/0.09	  with precondition: [A>=1] 
0.03/0.09	
0.03/0.09	* Chain [8]...: 1*s(4)+0
0.03/0.09	  with precondition: [A+99>=0] 
0.03/0.09	
0.03/0.09	* Chain [7]...: 1*s(5)+0
0.03/0.09	  with precondition: [A>=1] 
0.03/0.09	
0.03/0.09	
0.03/0.09	Closed-form bounds of f0(A,B): 
0.03/0.09	-------------------------------------
0.03/0.09	* Chain [10] with precondition: [A+99>=0] 
0.03/0.09	    - Upper bound: inf 
0.03/0.09	    - Complexity: infinity 
0.03/0.09	* Chain [9] with precondition: [A>=1] 
0.03/0.09	    - Upper bound: inf 
0.03/0.09	    - Complexity: infinity 
0.03/0.09	* Chain [8]... with precondition: [A+99>=0] 
0.03/0.09	    - Upper bound: inf 
0.03/0.09	    - Complexity: infinity 
0.03/0.09	* Chain [7]... with precondition: [A>=1] 
0.03/0.09	    - Upper bound: inf 
0.03/0.09	    - Complexity: infinity 
0.03/0.09	
0.03/0.09	### Maximum cost of f0(A,B): inf 
0.03/0.09	Asymptotic class: infinity 
0.03/0.09	* Total analysis performed in 32 ms.
0.03/0.09	
0.03/0.19	EOF