0.04/0.11	WORST_CASE(?,O(1))  
0.04/0.11	
0.04/0.11	Preprocessing Cost Relations
0.04/0.11	=====================================
0.04/0.11	
0.04/0.11	#### Computed strongly connected components 
0.04/0.11	0. recursive  : [eval_nd_loop_0/2,eval_nd_loop_1/3,eval_nd_loop_bb1_in/2]
0.04/0.11	1. non_recursive  : [eval_nd_loop_stop/1]
0.04/0.11	2. non_recursive  : [eval_nd_loop_bb2_in/1]
0.04/0.11	3. non_recursive  : [eval_nd_loop_bb1_in_loop_cont/2]
0.04/0.11	4. non_recursive  : [eval_nd_loop_bb0_in/1]
0.04/0.11	5. non_recursive  : [eval_nd_loop_start/1]
0.04/0.11	
0.04/0.11	#### Obtained direct recursion through partial evaluation 
0.04/0.11	0. SCC is partially evaluated into eval_nd_loop_bb1_in/2
0.04/0.11	1. SCC is completely evaluated into other SCCs
0.04/0.11	2. SCC is completely evaluated into other SCCs
0.04/0.11	3. SCC is completely evaluated into other SCCs
0.04/0.11	4. SCC is partially evaluated into eval_nd_loop_bb0_in/1
0.04/0.11	5. SCC is partially evaluated into eval_nd_loop_start/1
0.04/0.11	
0.04/0.11	Control-Flow Refinement of Cost Relations
0.04/0.11	=====================================
0.04/0.11	
0.04/0.11	### Specialization of cost equations eval_nd_loop_bb1_in/2 
0.04/0.11	* CE 4 is refined into CE [5] 
0.04/0.11	* CE 3 is refined into CE [6] 
0.04/0.11	
0.04/0.11	
0.04/0.11	### Cost equations --> "Loop" of eval_nd_loop_bb1_in/2 
0.04/0.11	* CEs [6] --> Loop 5 
0.04/0.11	* CEs [5] --> Loop 6 
0.04/0.11	
0.04/0.11	### Ranking functions of CR eval_nd_loop_bb1_in(V_x_0,B) 
0.04/0.11	* RF of phase [6]: [-V_x_0+9]
0.04/0.11	
0.04/0.11	#### Partial ranking functions of CR eval_nd_loop_bb1_in(V_x_0,B) 
0.04/0.11	* Partial RF of phase [6]:
0.04/0.11	  - RF of loop [6:1]:
0.04/0.11	    -V_x_0+9
0.04/0.11	
0.04/0.11	
0.04/0.11	### Specialization of cost equations eval_nd_loop_bb0_in/1 
0.04/0.11	* CE 2 is refined into CE [7,8] 
0.04/0.11	
0.04/0.11	
0.04/0.11	### Cost equations --> "Loop" of eval_nd_loop_bb0_in/1 
0.04/0.11	* CEs [7,8] --> Loop 7 
0.04/0.11	
0.04/0.11	### Ranking functions of CR eval_nd_loop_bb0_in(B) 
0.04/0.11	
0.04/0.11	#### Partial ranking functions of CR eval_nd_loop_bb0_in(B) 
0.04/0.11	
0.04/0.11	
0.04/0.11	### Specialization of cost equations eval_nd_loop_start/1 
0.04/0.11	* CE 1 is refined into CE [9] 
0.04/0.11	
0.04/0.11	
0.04/0.11	### Cost equations --> "Loop" of eval_nd_loop_start/1 
0.04/0.11	* CEs [9] --> Loop 8 
0.04/0.11	
0.04/0.11	### Ranking functions of CR eval_nd_loop_start(B) 
0.04/0.11	
0.04/0.11	#### Partial ranking functions of CR eval_nd_loop_start(B) 
0.04/0.11	
0.04/0.11	
0.04/0.11	Computing Bounds
0.04/0.11	=====================================
0.04/0.11	
0.04/0.11	#### Cost of chains of eval_nd_loop_bb1_in(V_x_0,B):
0.04/0.11	* Chain [[6],5]: 1*it(6)+0
0.04/0.11	  Such that:it(6) =< -V_x_0+9
0.04/0.11	
0.04/0.11	  with precondition: [B=2,8>=V_x_0,V_x_0>=0] 
0.04/0.11	
0.04/0.11	* Chain [5]: 0
0.04/0.11	  with precondition: [B=2,V_x_0>=0] 
0.04/0.11	
0.04/0.11	
0.04/0.11	#### Cost of chains of eval_nd_loop_bb0_in(B):
0.04/0.11	* Chain [7]: 9
0.04/0.11	  with precondition: [] 
0.04/0.11	
0.04/0.11	
0.04/0.11	#### Cost of chains of eval_nd_loop_start(B):
0.04/0.11	* Chain [8]: 9
0.04/0.11	  with precondition: [] 
0.04/0.11	
0.04/0.11	
0.04/0.11	Closed-form bounds of eval_nd_loop_start(B): 
0.04/0.11	-------------------------------------
0.04/0.11	* Chain [8] with precondition: [] 
0.04/0.11	    - Upper bound: 9 
0.04/0.11	    - Complexity: constant 
0.04/0.11	
0.04/0.11	### Maximum cost of eval_nd_loop_start(B): 9 
0.04/0.11	Asymptotic class: constant 
0.04/0.11	* Total analysis performed in 37 ms.
0.04/0.11	
0.04/0.21	EOF