0.05/0.18	WORST_CASE(?,O(n^1))  
0.05/0.18	
0.05/0.18	Preprocessing Cost Relations
0.05/0.18	=====================================
0.05/0.18	
0.05/0.18	#### Computed strongly connected components 
0.05/0.18	0. recursive  : [eval_speedSimpleMultiple_bb1_in/5,eval_speedSimpleMultiple_bb2_in/5]
0.05/0.18	1. non_recursive  : [eval_speedSimpleMultiple_stop/1]
0.05/0.18	2. non_recursive  : [eval_speedSimpleMultiple_bb3_in/1]
0.05/0.18	3. non_recursive  : [eval_speedSimpleMultiple_bb1_in_loop_cont/2]
0.05/0.18	4. non_recursive  : [eval_speedSimpleMultiple_bb0_in/3]
0.05/0.18	5. non_recursive  : [eval_speedSimpleMultiple_start/3]
0.05/0.18	
0.05/0.18	#### Obtained direct recursion through partial evaluation 
0.05/0.18	0. SCC is partially evaluated into eval_speedSimpleMultiple_bb1_in/5
0.05/0.18	1. SCC is completely evaluated into other SCCs
0.05/0.18	2. SCC is completely evaluated into other SCCs
0.05/0.18	3. SCC is completely evaluated into other SCCs
0.05/0.18	4. SCC is partially evaluated into eval_speedSimpleMultiple_bb0_in/3
0.05/0.18	5. SCC is partially evaluated into eval_speedSimpleMultiple_start/3
0.05/0.18	
0.05/0.18	Control-Flow Refinement of Cost Relations
0.05/0.18	=====================================
0.05/0.18	
0.05/0.18	### Specialization of cost equations eval_speedSimpleMultiple_bb1_in/5 
0.05/0.18	* CE 5 is refined into CE [6] 
0.05/0.18	* CE 3 is refined into CE [7] 
0.05/0.18	* CE 4 is refined into CE [8] 
0.05/0.18	
0.05/0.18	
0.05/0.18	### Cost equations --> "Loop" of eval_speedSimpleMultiple_bb1_in/5 
0.05/0.18	* CEs [7] --> Loop 6 
0.05/0.18	* CEs [8] --> Loop 7 
0.05/0.18	* CEs [6] --> Loop 8 
0.05/0.18	
0.05/0.18	### Ranking functions of CR eval_speedSimpleMultiple_bb1_in(V_n,V_m,V_y_0,V_x_0,B) 
0.05/0.18	* RF of phase [6]: [V_n-V_x_0]
0.05/0.18	* RF of phase [7]: [V_m-V_y_0]
0.05/0.18	
0.05/0.18	#### Partial ranking functions of CR eval_speedSimpleMultiple_bb1_in(V_n,V_m,V_y_0,V_x_0,B) 
0.05/0.18	* Partial RF of phase [6]:
0.05/0.18	  - RF of loop [6:1]:
0.05/0.18	    V_n-V_x_0
0.05/0.18	* Partial RF of phase [7]:
0.05/0.18	  - RF of loop [7:1]:
0.05/0.18	    V_m-V_y_0
0.05/0.18	
0.05/0.18	
0.05/0.18	### Specialization of cost equations eval_speedSimpleMultiple_bb0_in/3 
0.05/0.18	* CE 2 is refined into CE [9,10,11] 
0.05/0.18	
0.05/0.18	
0.05/0.18	### Cost equations --> "Loop" of eval_speedSimpleMultiple_bb0_in/3 
0.05/0.18	* CEs [9] --> Loop 9 
0.05/0.18	* CEs [11] --> Loop 10 
0.05/0.18	* CEs [10] --> Loop 11 
0.05/0.18	
0.05/0.18	### Ranking functions of CR eval_speedSimpleMultiple_bb0_in(V_n,V_m,B) 
0.05/0.18	
0.05/0.18	#### Partial ranking functions of CR eval_speedSimpleMultiple_bb0_in(V_n,V_m,B) 
0.05/0.18	
0.05/0.18	
0.05/0.18	### Specialization of cost equations eval_speedSimpleMultiple_start/3 
0.05/0.18	* CE 1 is refined into CE [12,13,14] 
0.05/0.18	
0.05/0.18	
0.05/0.18	### Cost equations --> "Loop" of eval_speedSimpleMultiple_start/3 
0.05/0.18	* CEs [14] --> Loop 12 
0.05/0.18	* CEs [13] --> Loop 13 
0.05/0.18	* CEs [12] --> Loop 14 
0.05/0.18	
0.05/0.18	### Ranking functions of CR eval_speedSimpleMultiple_start(V_n,V_m,B) 
0.05/0.18	
0.05/0.18	#### Partial ranking functions of CR eval_speedSimpleMultiple_start(V_n,V_m,B) 
0.05/0.18	
0.05/0.18	
0.05/0.18	Computing Bounds
0.05/0.18	=====================================
0.05/0.18	
0.05/0.18	#### Cost of chains of eval_speedSimpleMultiple_bb1_in(V_n,V_m,V_y_0,V_x_0,B):
0.05/0.18	* Chain [[7],[6],8]: 1*it(6)+1*it(7)+0
0.05/0.18	  Such that:it(6) =< V_n
0.05/0.18	it(7) =< V_m-V_y_0
0.05/0.18	
0.05/0.18	  with precondition: [V_x_0=0,B=2,V_n>=1,V_y_0>=0,V_m>=V_y_0+1] 
0.05/0.18	
0.05/0.18	* Chain [[6],8]: 1*it(6)+0
0.05/0.18	  Such that:it(6) =< V_n-V_x_0
0.05/0.18	
0.05/0.18	  with precondition: [B=2,V_y_0>=0,V_x_0>=0,V_y_0>=V_m,V_n>=V_x_0+1] 
0.05/0.18	
0.05/0.18	* Chain [8]: 0
0.05/0.18	  with precondition: [B=2,V_y_0>=0,V_x_0>=0,V_x_0>=V_n] 
0.05/0.18	
0.05/0.18	
0.05/0.18	#### Cost of chains of eval_speedSimpleMultiple_bb0_in(V_n,V_m,B):
0.05/0.18	* Chain [11]: 0
0.05/0.18	  with precondition: [0>=V_n] 
0.05/0.18	
0.05/0.18	* Chain [10]: 1*s(1)+0
0.05/0.18	  Such that:s(1) =< V_n
0.05/0.18	
0.05/0.18	  with precondition: [0>=V_m,V_n>=1] 
0.05/0.18	
0.05/0.18	* Chain [9]: 1*s(2)+1*s(3)+0
0.05/0.18	  Such that:s(2) =< V_n
0.05/0.18	s(3) =< V_m
0.05/0.18	
0.05/0.18	  with precondition: [V_n>=1,V_m>=1] 
0.05/0.18	
0.05/0.18	
0.05/0.18	#### Cost of chains of eval_speedSimpleMultiple_start(V_n,V_m,B):
0.05/0.18	* Chain [14]: 0
0.05/0.18	  with precondition: [0>=V_n] 
0.05/0.18	
0.05/0.18	* Chain [13]: 1*s(4)+0
0.05/0.18	  Such that:s(4) =< V_n
0.05/0.18	
0.05/0.18	  with precondition: [0>=V_m,V_n>=1] 
0.05/0.18	
0.05/0.18	* Chain [12]: 1*s(5)+1*s(6)+0
0.05/0.18	  Such that:s(5) =< V_n
0.05/0.18	s(6) =< V_m
0.05/0.18	
0.05/0.18	  with precondition: [V_n>=1,V_m>=1] 
0.05/0.18	
0.05/0.18	
0.05/0.18	Closed-form bounds of eval_speedSimpleMultiple_start(V_n,V_m,B): 
0.05/0.18	-------------------------------------
0.05/0.18	* Chain [14] with precondition: [0>=V_n] 
0.05/0.18	    - Upper bound: 0 
0.05/0.18	    - Complexity: constant 
0.05/0.18	* Chain [13] with precondition: [0>=V_m,V_n>=1] 
0.05/0.18	    - Upper bound: V_n 
0.05/0.18	    - Complexity: n 
0.05/0.18	* Chain [12] with precondition: [V_n>=1,V_m>=1] 
0.05/0.18	    - Upper bound: V_n+V_m 
0.05/0.18	    - Complexity: n 
0.05/0.18	
0.05/0.18	### Maximum cost of eval_speedSimpleMultiple_start(V_n,V_m,B): nat(V_m)+nat(V_n) 
0.05/0.18	Asymptotic class: n 
0.05/0.18	* Total analysis performed in 106 ms.
0.05/0.18	
0.05/0.28	EOF