0.03/0.08	WORST_CASE(?,O(n^1))  
0.03/0.08	
0.03/0.08	Preprocessing Cost Relations
0.03/0.08	=====================================
0.03/0.08	
0.03/0.08	#### Computed strongly connected components 
0.03/0.08	0. recursive  : [eval/3]
0.03/0.08	1. non_recursive  : [exit_location/1]
0.03/0.08	2. non_recursive  : [eval_loop_cont/2]
0.03/0.08	3. non_recursive  : [start/3]
0.03/0.08	
0.03/0.08	#### Obtained direct recursion through partial evaluation 
0.03/0.08	0. SCC is partially evaluated into eval/3
0.03/0.08	1. SCC is completely evaluated into other SCCs
0.03/0.08	2. SCC is completely evaluated into other SCCs
0.03/0.08	3. SCC is partially evaluated into start/3
0.03/0.08	
0.03/0.08	Control-Flow Refinement of Cost Relations
0.03/0.08	=====================================
0.03/0.08	
0.03/0.08	### Specialization of cost equations eval/3 
0.03/0.08	* CE 3 is refined into CE [4] 
0.03/0.08	* CE 2 is refined into CE [5] 
0.03/0.08	
0.03/0.08	
0.03/0.08	### Cost equations --> "Loop" of eval/3 
0.03/0.08	* CEs [5] --> Loop 4 
0.03/0.08	* CEs [4] --> Loop 5 
0.03/0.08	
0.03/0.08	### Ranking functions of CR eval(A,B,C) 
0.03/0.08	* RF of phase [4]: [A-B]
0.03/0.08	
0.03/0.08	#### Partial ranking functions of CR eval(A,B,C) 
0.03/0.08	* Partial RF of phase [4]:
0.03/0.08	  - RF of loop [4:1]:
0.03/0.08	    A-B
0.03/0.08	
0.03/0.08	
0.03/0.08	### Specialization of cost equations start/3 
0.03/0.08	* CE 1 is refined into CE [6,7] 
0.03/0.08	
0.03/0.08	
0.03/0.08	### Cost equations --> "Loop" of start/3 
0.03/0.08	* CEs [7] --> Loop 6 
0.03/0.08	* CEs [6] --> Loop 7 
0.03/0.08	
0.03/0.08	### Ranking functions of CR start(A,B,C) 
0.03/0.08	
0.03/0.08	#### Partial ranking functions of CR start(A,B,C) 
0.03/0.08	
0.03/0.08	
0.03/0.08	Computing Bounds
0.03/0.08	=====================================
0.03/0.08	
0.03/0.08	#### Cost of chains of eval(A,B,C):
0.03/0.08	* Chain [[4],5]: 1*it(4)+0
0.03/0.08	  Such that:it(4) =< A-B
0.03/0.08	
0.03/0.08	  with precondition: [C=2,A>=B+1] 
0.03/0.08	
0.03/0.08	* Chain [5]: 0
0.03/0.08	  with precondition: [C=2] 
0.03/0.08	
0.03/0.08	
0.03/0.08	#### Cost of chains of start(A,B,C):
0.03/0.08	* Chain [7]: 0
0.03/0.08	  with precondition: [] 
0.03/0.08	
0.03/0.08	* Chain [6]: 1*s(1)+0
0.03/0.08	  Such that:s(1) =< A-B
0.03/0.08	
0.03/0.08	  with precondition: [A>=B+1] 
0.03/0.08	
0.03/0.08	
0.03/0.08	Closed-form bounds of start(A,B,C): 
0.03/0.08	-------------------------------------
0.03/0.08	* Chain [7] with precondition: [] 
0.03/0.08	    - Upper bound: 0 
0.03/0.08	    - Complexity: constant 
0.03/0.08	* Chain [6] with precondition: [A>=B+1] 
0.03/0.08	    - Upper bound: A-B 
0.03/0.08	    - Complexity: n 
0.03/0.08	
0.03/0.08	### Maximum cost of start(A,B,C): nat(A-B) 
0.03/0.08	Asymptotic class: n 
0.03/0.08	* Total analysis performed in 28 ms.
0.03/0.08	
0.03/0.09	EOF