143.63/143.61	MAYBE
143.63/143.61	
143.63/143.61	Preprocessing Cost Relations
143.63/143.61	=====================================
143.63/143.61	
143.63/143.61	#### Computed strongly connected components 
143.63/143.61	0. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3,eval_foo_bb4_in/3,eval_foo_bb5_in/3,eval_foo_bb6_in/4]
143.63/143.61	1. non_recursive  : [eval_foo_stop/1]
143.63/143.61	2. non_recursive  : [eval_foo_bb7_in/1]
143.63/143.61	3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
143.63/143.61	4. non_recursive  : [eval_foo_bb0_in/2]
143.63/143.61	5. non_recursive  : [eval_foo_start/3]
143.63/143.61	
143.63/143.61	#### Obtained direct recursion through partial evaluation 
143.63/143.61	0. SCC is partially evaluated into eval_foo_bb1_in/3
143.63/143.61	1. SCC is completely evaluated into other SCCs
143.63/143.61	2. SCC is completely evaluated into other SCCs
143.63/143.61	3. SCC is completely evaluated into other SCCs
143.63/143.61	4. SCC is partially evaluated into eval_foo_bb0_in/2
143.63/143.61	5. SCC is partially evaluated into eval_foo_start/3
143.63/143.61	
143.63/143.61	Control-Flow Refinement of Cost Relations
143.63/143.61	=====================================
143.63/143.61	
143.63/143.61	### Specialization of cost equations eval_foo_bb1_in/3 
143.63/143.61	* CE 8 is refined into CE [9] 
143.63/143.61	* CE 3 is discarded (unfeasible) 
143.63/143.61	* CE 4 is refined into CE [10] 
143.63/143.61	* CE 5 is refined into CE [11] 
143.63/143.61	* CE 6 is refined into CE [12] 
143.63/143.61	* CE 7 is refined into CE [13] 
143.63/143.61	
143.63/143.61	
143.63/143.61	### Cost equations --> "Loop" of eval_foo_bb1_in/3 
143.63/143.61	* CEs [10] --> Loop 9 
143.63/143.61	* CEs [11] --> Loop 10 
143.63/143.61	* CEs [13] --> Loop 11 
143.63/143.61	* CEs [12] --> Loop 12 
143.63/143.61	* CEs [9] --> Loop 13 
143.63/143.61	
143.63/143.61	### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
143.63/143.61	
143.63/143.61	#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
143.63/143.61	* Partial RF of phase [9,10]:
143.63/143.61	  - RF of loop [9:1]:
143.63/143.61	    -V__0/13-5/13 depends on loops [10:1] 
143.63/143.61	    -V__01/14-V__0/14 depends on loops [10:1] 
143.63/143.61	  - RF of loop [10:1]:
143.63/143.61	    V__0/13-5/13 depends on loops [9:1] 
143.63/143.61	    -V__01/14+V__0/14 depends on loops [9:1] 
143.63/143.61	
143.63/143.61	
143.63/143.61	### Specialization of cost equations eval_foo_bb0_in/2 
143.63/143.61	* CE 2 is refined into CE [14,15,16,17] 
143.63/143.61	
143.63/143.61	
143.63/143.61	### Cost equations --> "Loop" of eval_foo_bb0_in/2 
143.63/143.61	* CEs [17] --> Loop 14 
143.63/143.61	* CEs [15] --> Loop 15 
143.63/143.61	* CEs [14] --> Loop 16 
143.63/143.61	* CEs [16] --> Loop 17 
143.63/143.61	
143.63/143.61	### Ranking functions of CR eval_foo_bb0_in(V_i,B) 
143.63/143.61	
143.63/143.61	#### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 
143.63/143.61	
143.63/143.61	
143.63/143.61	### Specialization of cost equations eval_foo_start/3 
143.63/143.61	* CE 1 is refined into CE [18,19,20,21] 
143.63/143.61	
143.63/143.61	
143.63/143.61	### Cost equations --> "Loop" of eval_foo_start/3 
143.63/143.61	* CEs [21] --> Loop 18 
143.63/143.61	* CEs [20] --> Loop 19 
143.63/143.61	* CEs [19] --> Loop 20 
143.63/143.61	* CEs [18] --> Loop 21 
143.63/143.61	
143.63/143.61	### Ranking functions of CR eval_foo_start(V_i,V_w,B) 
143.63/143.61	
143.63/143.61	#### Partial ranking functions of CR eval_foo_start(V_i,V_w,B) 
143.63/143.61	
143.63/143.61	
143.63/143.61	Computing Bounds
143.63/143.61	=====================================
143.63/143.61	
143.63/143.61	#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
143.63/143.61	* Chain [[9,10]]...: 2*it(9)+0
143.63/143.61	  with precondition: [V__01>=5,B=2] 
143.63/143.61	
143.63/143.61	* Chain [13]: 0
143.63/143.61	  with precondition: [V__0=0,B=2,6>=V__01,V__01>=5] 
143.63/143.61	
143.63/143.61	* Chain [12,13]: 1
143.63/143.61	  with precondition: [V__01=5,B=2,5>=V__0,V__0>=1] 
143.63/143.61	
143.63/143.61	* Chain [11,13]: 1
143.63/143.61	  with precondition: [V__01=5,B=2,0>=V__0+1,V__0+5>=0] 
143.63/143.61	
143.63/143.61	
143.63/143.61	#### Cost of chains of eval_foo_bb0_in(V_i,B):
143.63/143.61	* Chain [17]: 0
143.63/143.61	  with precondition: [V_i=0] 
143.63/143.61	
143.63/143.61	* Chain [16]: 1
143.63/143.61	  with precondition: [5>=V_i,V_i>=1] 
143.63/143.61	
143.63/143.61	* Chain [15]: 1
143.63/143.61	  with precondition: [0>=V_i+1,V_i+5>=0] 
143.63/143.61	
143.63/143.61	* Chain [14]...: 2*s(1)+0
143.63/143.61	  with precondition: [] 
143.63/143.61	
143.63/143.61	
143.63/143.61	#### Cost of chains of eval_foo_start(V_i,V_w,B):
143.63/143.61	* Chain [21]: 0
143.63/143.61	  with precondition: [V_i=0] 
143.63/143.61	
143.63/143.61	* Chain [20]: 1
143.63/143.61	  with precondition: [5>=V_i,V_i>=1] 
143.63/143.61	
143.63/143.61	* Chain [19]: 1
143.63/143.61	  with precondition: [0>=V_i+1,V_i+5>=0] 
143.63/143.61	
143.63/143.61	* Chain [18]...: 2*s(2)+0
143.63/143.61	  with precondition: [] 
143.63/143.61	
143.63/143.61	
143.63/143.61	Closed-form bounds of eval_foo_start(V_i,V_w,B): 
143.63/143.61	-------------------------------------
143.63/143.61	* Chain [21] with precondition: [V_i=0] 
143.63/143.61	    - Upper bound: 0 
143.63/143.61	    - Complexity: constant 
143.63/143.61	* Chain [20] with precondition: [5>=V_i,V_i>=1] 
143.63/143.61	    - Upper bound: 1 
143.63/143.61	    - Complexity: constant 
143.63/143.61	* Chain [19] with precondition: [0>=V_i+1,V_i+5>=0] 
143.63/143.61	    - Upper bound: 1 
143.63/143.61	    - Complexity: constant 
143.63/143.61	* Chain [18]... with precondition: [] 
143.63/143.61	    - Upper bound: inf 
143.63/143.61	    - Complexity: infinity 
143.63/143.61	
143.63/143.61	### Maximum cost of eval_foo_start(V_i,V_w,B): inf 
143.63/143.61	Asymptotic class: infinity 
143.63/143.61	* Total analysis performed in 121070 ms.
143.63/143.61	
143.64/143.72	EOF