0.05/0.12	WORST_CASE(?,O(n^1))  
0.05/0.12	
0.05/0.12	Preprocessing Cost Relations
0.05/0.12	=====================================
0.05/0.12	
0.05/0.12	#### Computed strongly connected components 
0.05/0.12	0. recursive  : [eval_render_ht_LeafBlock_in/4,eval_render_ht_NewDefault_in/4,eval_render_ht_bb1_in/3,eval_render_ht_bb3_in/4]
0.05/0.12	1. non_recursive  : [eval_render_ht_stop/1]
0.05/0.12	2. non_recursive  : [eval_render_ht_bb2_in/1]
0.05/0.12	3. non_recursive  : [eval_render_ht_bb1_in_loop_cont/2]
0.05/0.12	4. non_recursive  : [eval_render_ht_bb0_in/3]
0.05/0.12	5. non_recursive  : [eval_render_ht_start/3]
0.05/0.12	
0.05/0.12	#### Obtained direct recursion through partial evaluation 
0.05/0.12	0. SCC is partially evaluated into eval_render_ht_bb1_in/3
0.05/0.12	1. SCC is completely evaluated into other SCCs
0.05/0.12	2. SCC is completely evaluated into other SCCs
0.05/0.12	3. SCC is completely evaluated into other SCCs
0.05/0.12	4. SCC is partially evaluated into eval_render_ht_bb0_in/3
0.05/0.12	5. SCC is partially evaluated into eval_render_ht_start/3
0.05/0.12	
0.05/0.12	Control-Flow Refinement of Cost Relations
0.05/0.12	=====================================
0.05/0.12	
0.05/0.12	### Specialization of cost equations eval_render_ht_bb1_in/3 
0.05/0.12	* CE 4 is refined into CE [5] 
0.05/0.12	* CE 3 is refined into CE [6] 
0.05/0.12	
0.05/0.12	
0.05/0.12	### Cost equations --> "Loop" of eval_render_ht_bb1_in/3 
0.05/0.12	* CEs [6] --> Loop 5 
0.05/0.12	* CEs [5] --> Loop 6 
0.05/0.12	
0.05/0.12	### Ranking functions of CR eval_render_ht_bb1_in(V_level,V__0,B) 
0.05/0.12	* RF of phase [6]: [V_level-V__0-7]
0.05/0.12	
0.05/0.12	#### Partial ranking functions of CR eval_render_ht_bb1_in(V_level,V__0,B) 
0.05/0.12	* Partial RF of phase [6]:
0.05/0.12	  - RF of loop [6:1]:
0.05/0.12	    V_level-V__0-7
0.05/0.12	
0.05/0.12	
0.05/0.12	### Specialization of cost equations eval_render_ht_bb0_in/3 
0.05/0.12	* CE 2 is refined into CE [7,8] 
0.05/0.12	
0.05/0.12	
0.05/0.12	### Cost equations --> "Loop" of eval_render_ht_bb0_in/3 
0.05/0.12	* CEs [8] --> Loop 7 
0.05/0.12	* CEs [7] --> Loop 8 
0.05/0.12	
0.05/0.12	### Ranking functions of CR eval_render_ht_bb0_in(V_level,V_old_level,B) 
0.05/0.12	
0.05/0.12	#### Partial ranking functions of CR eval_render_ht_bb0_in(V_level,V_old_level,B) 
0.05/0.12	
0.05/0.12	
0.05/0.12	### Specialization of cost equations eval_render_ht_start/3 
0.05/0.12	* CE 1 is refined into CE [9,10] 
0.05/0.12	
0.05/0.12	
0.05/0.12	### Cost equations --> "Loop" of eval_render_ht_start/3 
0.05/0.12	* CEs [10] --> Loop 9 
0.05/0.12	* CEs [9] --> Loop 10 
0.05/0.12	
0.05/0.12	### Ranking functions of CR eval_render_ht_start(V_level,V_old_level,B) 
0.05/0.12	
0.05/0.12	#### Partial ranking functions of CR eval_render_ht_start(V_level,V_old_level,B) 
0.05/0.12	
0.05/0.12	
0.05/0.12	Computing Bounds
0.05/0.12	=====================================
0.05/0.12	
0.05/0.12	#### Cost of chains of eval_render_ht_bb1_in(V_level,V__0,B):
0.05/0.12	* Chain [[6],5]: 1*it(6)+0
0.05/0.12	  Such that:it(6) =< V_level-V__0
0.05/0.12	
0.05/0.12	  with precondition: [B=2,V_level>=V__0+8] 
0.05/0.12	
0.05/0.12	* Chain [5]: 0
0.05/0.12	  with precondition: [B=2,V__0+7>=V_level] 
0.05/0.12	
0.05/0.12	
0.05/0.12	#### Cost of chains of eval_render_ht_bb0_in(V_level,V_old_level,B):
0.05/0.12	* Chain [8]: 0
0.05/0.12	  with precondition: [V_old_level+7>=V_level] 
0.05/0.12	
0.05/0.12	* Chain [7]: 1*s(1)+0
0.05/0.12	  Such that:s(1) =< V_level-V_old_level
0.05/0.12	
0.05/0.12	  with precondition: [V_level>=V_old_level+8] 
0.05/0.12	
0.05/0.12	
0.05/0.12	#### Cost of chains of eval_render_ht_start(V_level,V_old_level,B):
0.05/0.12	* Chain [10]: 0
0.05/0.12	  with precondition: [V_old_level+7>=V_level] 
0.05/0.12	
0.05/0.12	* Chain [9]: 1*s(2)+0
0.05/0.12	  Such that:s(2) =< V_level-V_old_level
0.05/0.12	
0.05/0.12	  with precondition: [V_level>=V_old_level+8] 
0.05/0.12	
0.05/0.12	
0.05/0.12	Closed-form bounds of eval_render_ht_start(V_level,V_old_level,B): 
0.05/0.12	-------------------------------------
0.05/0.12	* Chain [10] with precondition: [V_old_level+7>=V_level] 
0.05/0.12	    - Upper bound: 0 
0.05/0.12	    - Complexity: constant 
0.05/0.12	* Chain [9] with precondition: [V_level>=V_old_level+8] 
0.05/0.12	    - Upper bound: V_level-V_old_level 
0.05/0.12	    - Complexity: n 
0.05/0.12	
0.05/0.12	### Maximum cost of eval_render_ht_start(V_level,V_old_level,B): nat(V_level-V_old_level) 
0.05/0.12	Asymptotic class: n 
0.05/0.12	* Total analysis performed in 47 ms.
0.05/0.12	
0.05/0.22	EOF