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