0.04/0.16	WORST_CASE(?,O(n^1))  
0.04/0.16	
0.04/0.16	Preprocessing Cost Relations
0.04/0.16	=====================================
0.04/0.16	
0.04/0.16	#### Computed strongly connected components 
0.04/0.16	0. recursive  : [eval_speed_pldi10_ex4_bb2_in/7,eval_speed_pldi10_ex4_bb3_in/7]
0.04/0.16	1. recursive  : [eval_speed_pldi10_ex4_bb1_in/3,eval_speed_pldi10_ex4_bb2_in_loop_cont/4]
0.04/0.16	2. non_recursive  : [eval_speed_pldi10_ex4_stop/1]
0.04/0.16	3. non_recursive  : [eval_speed_pldi10_ex4_bb4_in/1]
0.04/0.16	4. non_recursive  : [eval_speed_pldi10_ex4_bb1_in_loop_cont/2]
0.04/0.16	5. non_recursive  : [eval_speed_pldi10_ex4_bb0_in/2]
0.04/0.16	6. non_recursive  : [eval_speed_pldi10_ex4_start/2]
0.04/0.16	
0.04/0.16	#### Obtained direct recursion through partial evaluation 
0.04/0.16	0. SCC is partially evaluated into eval_speed_pldi10_ex4_bb2_in/7
0.04/0.16	1. SCC is partially evaluated into eval_speed_pldi10_ex4_bb1_in/3
0.04/0.16	2. SCC is completely evaluated into other SCCs
0.04/0.16	3. SCC is completely evaluated into other SCCs
0.04/0.16	4. SCC is completely evaluated into other SCCs
0.04/0.16	5. SCC is partially evaluated into eval_speed_pldi10_ex4_bb0_in/2
0.04/0.16	6. SCC is partially evaluated into eval_speed_pldi10_ex4_start/2
0.04/0.16	
0.04/0.16	Control-Flow Refinement of Cost Relations
0.04/0.16	=====================================
0.04/0.16	
0.04/0.16	### Specialization of cost equations eval_speed_pldi10_ex4_bb2_in/7 
0.04/0.16	* CE 6 is refined into CE [7] 
0.04/0.16	* CE 5 is refined into CE [8] 
0.04/0.16	
0.04/0.16	
0.04/0.16	### Cost equations --> "Loop" of eval_speed_pldi10_ex4_bb2_in/7 
0.04/0.16	* CEs [8] --> Loop 7 
0.04/0.16	* CEs [7] --> Loop 8 
0.04/0.16	
0.04/0.16	### Ranking functions of CR eval_speed_pldi10_ex4_bb2_in(V_flag_0,V__0,V_flag_1,V__1,B,C,D) 
0.04/0.16	* RF of phase [7]: [V__1]
0.04/0.16	
0.04/0.16	#### Partial ranking functions of CR eval_speed_pldi10_ex4_bb2_in(V_flag_0,V__0,V_flag_1,V__1,B,C,D) 
0.04/0.16	* Partial RF of phase [7]:
0.04/0.16	  - RF of loop [7:1]:
0.04/0.16	    V__1
0.04/0.16	
0.04/0.16	
0.04/0.16	### Specialization of cost equations eval_speed_pldi10_ex4_bb1_in/3 
0.04/0.16	* CE 4 is refined into CE [9] 
0.04/0.16	* CE 3 is refined into CE [10,11] 
0.04/0.16	
0.04/0.16	
0.04/0.16	### Cost equations --> "Loop" of eval_speed_pldi10_ex4_bb1_in/3 
0.04/0.16	* CEs [10] --> Loop 9 
0.04/0.16	* CEs [11] --> Loop 10 
0.04/0.16	* CEs [9] --> Loop 11 
0.04/0.16	
0.04/0.16	### Ranking functions of CR eval_speed_pldi10_ex4_bb1_in(V_flag_0,V__0,B) 
0.04/0.16	
0.04/0.16	#### Partial ranking functions of CR eval_speed_pldi10_ex4_bb1_in(V_flag_0,V__0,B) 
0.04/0.16	
0.04/0.16	
0.04/0.16	### Specialization of cost equations eval_speed_pldi10_ex4_bb0_in/2 
0.04/0.16	* CE 2 is refined into CE [12,13] 
0.04/0.16	
0.04/0.16	
0.04/0.16	### Cost equations --> "Loop" of eval_speed_pldi10_ex4_bb0_in/2 
0.04/0.16	* CEs [13] --> Loop 12 
0.04/0.16	* CEs [12] --> Loop 13 
0.04/0.16	
0.04/0.16	### Ranking functions of CR eval_speed_pldi10_ex4_bb0_in(V_n,B) 
0.04/0.16	
0.04/0.16	#### Partial ranking functions of CR eval_speed_pldi10_ex4_bb0_in(V_n,B) 
0.04/0.16	
0.04/0.16	
0.04/0.16	### Specialization of cost equations eval_speed_pldi10_ex4_start/2 
0.04/0.16	* CE 1 is refined into CE [14,15] 
0.04/0.16	
0.04/0.16	
0.04/0.16	### Cost equations --> "Loop" of eval_speed_pldi10_ex4_start/2 
0.04/0.16	* CEs [15] --> Loop 14 
0.04/0.16	* CEs [14] --> Loop 15 
0.04/0.16	
0.04/0.16	### Ranking functions of CR eval_speed_pldi10_ex4_start(V_n,B) 
0.04/0.16	
0.04/0.16	#### Partial ranking functions of CR eval_speed_pldi10_ex4_start(V_n,B) 
0.04/0.16	
0.04/0.16	
0.04/0.16	Computing Bounds
0.04/0.16	=====================================
0.04/0.16	
0.04/0.16	#### Cost of chains of eval_speed_pldi10_ex4_bb2_in(V_flag_0,V__0,V_flag_1,V__1,B,C,D):
0.04/0.16	* Chain [[7],8]: 1*it(7)+0
0.04/0.16	  Such that:it(7) =< V__1
0.04/0.16	
0.04/0.16	  with precondition: [B=2,C=1,D=0,1>=V_flag_1,V_flag_0>=1,V__1>=1] 
0.04/0.16	
0.04/0.16	* Chain [8]: 0
0.04/0.16	  with precondition: [B=2,V_flag_1=C,V__1=D,1>=V_flag_1,0>=V__1,V_flag_0>=1] 
0.04/0.16	
0.04/0.16	
0.04/0.16	#### Cost of chains of eval_speed_pldi10_ex4_bb1_in(V_flag_0,V__0,B):
0.04/0.16	* Chain [10,11]: 1
0.04/0.16	  with precondition: [V_flag_0=1,B=3,0>=V__0] 
0.04/0.16	
0.04/0.16	* Chain [9,10,11]: 1*s(1)+2
0.04/0.16	  Such that:s(1) =< V__0
0.04/0.16	
0.04/0.16	  with precondition: [V_flag_0=1,B=3,V__0>=1] 
0.04/0.16	
0.04/0.16	
0.04/0.16	#### Cost of chains of eval_speed_pldi10_ex4_bb0_in(V_n,B):
0.04/0.16	* Chain [13]: 1
0.04/0.16	  with precondition: [0>=V_n] 
0.04/0.16	
0.04/0.16	* Chain [12]: 1*s(2)+2
0.04/0.16	  Such that:s(2) =< V_n
0.04/0.16	
0.04/0.16	  with precondition: [V_n>=1] 
0.04/0.16	
0.04/0.16	
0.04/0.16	#### Cost of chains of eval_speed_pldi10_ex4_start(V_n,B):
0.04/0.16	* Chain [15]: 1
0.04/0.16	  with precondition: [0>=V_n] 
0.04/0.16	
0.04/0.16	* Chain [14]: 1*s(3)+2
0.04/0.16	  Such that:s(3) =< V_n
0.04/0.16	
0.04/0.16	  with precondition: [V_n>=1] 
0.04/0.16	
0.04/0.16	
0.04/0.16	Closed-form bounds of eval_speed_pldi10_ex4_start(V_n,B): 
0.04/0.16	-------------------------------------
0.04/0.16	* Chain [15] with precondition: [0>=V_n] 
0.04/0.16	    - Upper bound: 1 
0.04/0.16	    - Complexity: constant 
0.04/0.16	* Chain [14] with precondition: [V_n>=1] 
0.04/0.16	    - Upper bound: V_n+2 
0.04/0.16	    - Complexity: n 
0.04/0.16	
0.04/0.16	### Maximum cost of eval_speed_pldi10_ex4_start(V_n,B): nat(V_n)+1+1 
0.04/0.16	Asymptotic class: n 
0.04/0.16	* Total analysis performed in 93 ms.
0.04/0.16	
0.04/0.27	EOF