0.00/0.06	WORST_CASE(?,O(1))  
0.00/0.06	
0.00/0.06	Preprocessing Cost Relations
0.00/0.06	=====================================
0.00/0.06	
0.00/0.07	#### Computed strongly connected components 
0.00/0.07	0. non_recursive  : [f11/4]
0.00/0.07	1. non_recursive  : [f0/4]
0.00/0.07	
0.00/0.07	#### Obtained direct recursion through partial evaluation 
0.00/0.07	0. SCC is completely evaluated into other SCCs
0.00/0.07	1. SCC is partially evaluated into f0/4
0.00/0.07	
0.00/0.07	Control-Flow Refinement of Cost Relations
0.00/0.07	=====================================
0.00/0.07	
0.00/0.07	### Specialization of cost equations f0/4 
0.00/0.07	* CE 1 is refined into CE [2] 
0.00/0.07	
0.00/0.07	
0.00/0.07	### Cost equations --> "Loop" of f0/4 
0.00/0.07	* CEs [2] --> Loop 2 
0.00/0.07	
0.00/0.07	### Ranking functions of CR f0(A,B,C,F) 
0.00/0.07	
0.00/0.07	#### Partial ranking functions of CR f0(A,B,C,F) 
0.00/0.07	
0.00/0.07	
0.00/0.07	Computing Bounds
0.00/0.07	=====================================
0.00/0.07	
0.00/0.07	#### Cost of chains of f0(A,B,C,F):
0.00/0.07	* Chain [2]: 0
0.00/0.07	  with precondition: [] 
0.00/0.07	
0.00/0.07	
0.00/0.07	Closed-form bounds of f0(A,B,C,F): 
0.00/0.07	-------------------------------------
0.00/0.07	* Chain [2] with precondition: [] 
0.00/0.07	    - Upper bound: 0 
0.00/0.07	    - Complexity: constant 
0.00/0.07	
0.00/0.07	### Maximum cost of f0(A,B,C,F): 0 
0.00/0.07	Asymptotic class: constant 
0.00/0.07	* Total analysis performed in 3 ms.
0.00/0.07	
0.00/0.07	EOF