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