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