0.02/0.11	WORST_CASE(?,O(n^1))  
0.02/0.11	
0.02/0.11	Preprocessing Cost Relations
0.02/0.11	=====================================
0.02/0.11	
0.02/0.11	#### Computed strongly connected components 
0.02/0.11	0. recursive  : [evalndecrbb1in/3,evalndecrbbin/3]
0.02/0.11	1. non_recursive  : [evalndecrstop/2]
0.02/0.11	2. non_recursive  : [evalndecrreturnin/2]
0.02/0.11	3. non_recursive  : [exit_location/1]
0.02/0.11	4. non_recursive  : [evalndecrbb1in_loop_cont/3]
0.02/0.11	5. non_recursive  : [evalndecrentryin/2]
0.02/0.11	6. non_recursive  : [evalndecrstart/2]
0.02/0.11	
0.02/0.11	#### Obtained direct recursion through partial evaluation 
0.02/0.11	0. SCC is partially evaluated into evalndecrbb1in/3
0.02/0.11	1. SCC is completely evaluated into other SCCs
0.02/0.11	2. SCC is completely evaluated into other SCCs
0.02/0.11	3. SCC is completely evaluated into other SCCs
0.02/0.11	4. SCC is partially evaluated into evalndecrbb1in_loop_cont/3
0.02/0.11	5. SCC is partially evaluated into evalndecrentryin/2
0.02/0.11	6. SCC is partially evaluated into evalndecrstart/2
0.02/0.11	
0.02/0.11	Control-Flow Refinement of Cost Relations
0.02/0.11	=====================================
0.02/0.11	
0.02/0.11	### Specialization of cost equations evalndecrbb1in/3 
0.02/0.11	* CE 5 is refined into CE [8] 
0.02/0.11	* CE 4 is refined into CE [9] 
0.02/0.11	* CE 3 is refined into CE [10] 
0.02/0.11	
0.02/0.11	
0.02/0.11	### Cost equations --> "Loop" of evalndecrbb1in/3 
0.02/0.11	* CEs [10] --> Loop 8 
0.02/0.11	* CEs [8] --> Loop 9 
0.02/0.11	* CEs [9] --> Loop 10 
0.02/0.11	
0.02/0.11	### Ranking functions of CR evalndecrbb1in(A,B,C) 
0.02/0.11	* RF of phase [8]: [A-1]
0.02/0.11	
0.02/0.11	#### Partial ranking functions of CR evalndecrbb1in(A,B,C) 
0.02/0.11	* Partial RF of phase [8]:
0.02/0.11	  - RF of loop [8:1]:
0.02/0.11	    A-1
0.02/0.11	
0.02/0.11	
0.02/0.11	### Specialization of cost equations evalndecrbb1in_loop_cont/3 
0.02/0.11	* CE 7 is refined into CE [11] 
0.02/0.11	* CE 6 is refined into CE [12] 
0.02/0.11	
0.02/0.11	
0.02/0.11	### Cost equations --> "Loop" of evalndecrbb1in_loop_cont/3 
0.02/0.11	* CEs [11] --> Loop 11 
0.02/0.11	* CEs [12] --> Loop 12 
0.02/0.11	
0.02/0.11	### Ranking functions of CR evalndecrbb1in_loop_cont(A,B,C) 
0.02/0.11	
0.02/0.11	#### Partial ranking functions of CR evalndecrbb1in_loop_cont(A,B,C) 
0.02/0.11	
0.02/0.11	
0.02/0.11	### Specialization of cost equations evalndecrentryin/2 
0.02/0.11	* CE 2 is refined into CE [13,14,15,16] 
0.02/0.11	
0.02/0.11	
0.02/0.11	### Cost equations --> "Loop" of evalndecrentryin/2 
0.02/0.11	* CEs [13,16] --> Loop 13 
0.02/0.11	* CEs [14] --> Loop 14 
0.02/0.11	* CEs [15] --> Loop 15 
0.02/0.11	
0.02/0.11	### Ranking functions of CR evalndecrentryin(A,B) 
0.02/0.11	
0.02/0.11	#### Partial ranking functions of CR evalndecrentryin(A,B) 
0.02/0.11	
0.02/0.11	
0.02/0.11	### Specialization of cost equations evalndecrstart/2 
0.02/0.11	* CE 1 is refined into CE [17,18,19] 
0.02/0.11	
0.02/0.11	
0.02/0.11	### Cost equations --> "Loop" of evalndecrstart/2 
0.02/0.11	* CEs [19] --> Loop 16 
0.02/0.11	* CEs [18] --> Loop 17 
0.02/0.11	* CEs [17] --> Loop 18 
0.02/0.11	
0.02/0.11	### Ranking functions of CR evalndecrstart(A,B) 
0.02/0.11	
0.02/0.11	#### Partial ranking functions of CR evalndecrstart(A,B) 
0.02/0.11	
0.02/0.11	
0.02/0.11	Computing Bounds
0.02/0.11	=====================================
0.02/0.11	
0.02/0.11	#### Cost of chains of evalndecrbb1in(A,B,C):
0.02/0.11	* Chain [[8],10]: 1*it(8)+0
0.02/0.11	  Such that:it(8) =< A
0.02/0.11	
0.02/0.11	  with precondition: [B=2,C=1,A>=2] 
0.02/0.11	
0.02/0.11	* Chain [[8],9]: 1*it(8)+0
0.02/0.11	  Such that:it(8) =< A
0.02/0.11	
0.02/0.11	  with precondition: [B=3,A>=2] 
0.02/0.11	
0.02/0.11	* Chain [10]: 0
0.02/0.11	  with precondition: [B=2,A=C,1>=A] 
0.02/0.11	
0.02/0.11	* Chain [9]: 0
0.02/0.11	  with precondition: [B=3] 
0.02/0.11	
0.02/0.11	
0.02/0.11	#### Cost of chains of evalndecrbb1in_loop_cont(A,B,C):
0.02/0.11	* Chain [12]: 0
0.02/0.11	  with precondition: [A=2] 
0.02/0.11	
0.02/0.11	* Chain [11]: 0
0.02/0.11	  with precondition: [A=3] 
0.02/0.11	
0.02/0.11	
0.02/0.11	#### Cost of chains of evalndecrentryin(A,B):
0.02/0.11	* Chain [15]: 0
0.02/0.11	  with precondition: [] 
0.02/0.11	
0.02/0.11	* Chain [14]: 0
0.02/0.11	  with precondition: [2>=A] 
0.02/0.11	
0.02/0.11	* Chain [13]: 2*s(1)+0
0.02/0.11	  Such that:aux(1) =< A
0.02/0.11	s(1) =< aux(1)
0.02/0.11	
0.02/0.11	  with precondition: [A>=3] 
0.02/0.11	
0.02/0.11	
0.02/0.11	#### Cost of chains of evalndecrstart(A,B):
0.02/0.11	* Chain [18]: 0
0.02/0.11	  with precondition: [] 
0.02/0.11	
0.02/0.11	* Chain [17]: 0
0.02/0.11	  with precondition: [2>=A] 
0.02/0.11	
0.02/0.11	* Chain [16]: 2*s(4)+0
0.02/0.11	  Such that:s(3) =< A
0.02/0.11	s(4) =< s(3)
0.02/0.11	
0.02/0.11	  with precondition: [A>=3] 
0.02/0.11	
0.02/0.11	
0.02/0.11	Closed-form bounds of evalndecrstart(A,B): 
0.02/0.11	-------------------------------------
0.02/0.11	* Chain [18] with precondition: [] 
0.02/0.11	    - Upper bound: 0 
0.02/0.11	    - Complexity: constant 
0.02/0.11	* Chain [17] with precondition: [2>=A] 
0.02/0.11	    - Upper bound: 0 
0.02/0.11	    - Complexity: constant 
0.02/0.11	* Chain [16] with precondition: [A>=3] 
0.02/0.11	    - Upper bound: 2*A 
0.02/0.11	    - Complexity: n 
0.02/0.11	
0.02/0.11	### Maximum cost of evalndecrstart(A,B): nat(A)*2 
0.02/0.11	Asymptotic class: n 
0.02/0.11	* Total analysis performed in 54 ms.
0.02/0.11	
0.02/0.21	EOF