0.03/0.20	WORST_CASE(?,O(1))  
0.03/0.20	
0.03/0.21	Preprocessing Cost Relations
0.03/0.21	=====================================
0.03/0.21	
0.03/0.21	#### Computed strongly connected components 
0.03/0.21	0. recursive  : [cut/5,lbl51/5]
0.03/0.21	1. non_recursive  : [exit_location/1]
0.03/0.21	2. non_recursive  : [stop/5]
0.03/0.21	3. non_recursive  : [lbl51_loop_cont/6]
0.03/0.21	4. non_recursive  : [start/5]
0.03/0.21	5. non_recursive  : [start0/5]
0.03/0.21	
0.03/0.21	#### Obtained direct recursion through partial evaluation 
0.03/0.21	0. SCC is partially evaluated into lbl51/5
0.03/0.21	1. SCC is completely evaluated into other SCCs
0.03/0.21	2. SCC is completely evaluated into other SCCs
0.03/0.21	3. SCC is partially evaluated into lbl51_loop_cont/6
0.03/0.21	4. SCC is partially evaluated into start/5
0.03/0.21	5. SCC is partially evaluated into start0/5
0.03/0.21	
0.03/0.21	Control-Flow Refinement of Cost Relations
0.03/0.21	=====================================
0.03/0.21	
0.03/0.21	### Specialization of cost equations lbl51/5 
0.03/0.21	* CE 7 is refined into CE [10] 
0.03/0.21	* CE 5 is refined into CE [11] 
0.03/0.21	* CE 4 is refined into CE [12] 
0.03/0.21	* CE 6 is refined into CE [13] 
0.03/0.21	* CE 3 is refined into CE [14] 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Cost equations --> "Loop" of lbl51/5 
0.03/0.21	* CEs [14] --> Loop 10 
0.03/0.21	* CEs [10] --> Loop 11 
0.03/0.21	* CEs [11] --> Loop 12 
0.03/0.21	* CEs [12] --> Loop 13 
0.03/0.21	* CEs [13] --> Loop 14 
0.03/0.21	
0.03/0.21	### Ranking functions of CR lbl51(A,C,F,G,H) 
0.03/0.21	* RF of phase [10]: [-C+9]
0.03/0.21	
0.03/0.21	#### Partial ranking functions of CR lbl51(A,C,F,G,H) 
0.03/0.21	* Partial RF of phase [10]:
0.03/0.21	  - RF of loop [10:1]:
0.03/0.21	    -C+9
0.03/0.21	
0.03/0.21	
0.03/0.21	### Specialization of cost equations lbl51_loop_cont/6 
0.03/0.21	* CE 9 is refined into CE [15] 
0.03/0.21	* CE 8 is refined into CE [16] 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Cost equations --> "Loop" of lbl51_loop_cont/6 
0.03/0.21	* CEs [15] --> Loop 15 
0.03/0.21	* CEs [16] --> Loop 16 
0.03/0.21	
0.03/0.21	### Ranking functions of CR lbl51_loop_cont(A,B,C,D,E,F) 
0.03/0.21	
0.03/0.21	#### Partial ranking functions of CR lbl51_loop_cont(A,B,C,D,E,F) 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Specialization of cost equations start/5 
0.03/0.21	* CE 2 is refined into CE [17,18,19,20,21,22,23] 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Cost equations --> "Loop" of start/5 
0.03/0.21	* CEs [17,18,19,20,21,22,23] --> Loop 17 
0.03/0.21	
0.03/0.21	### Ranking functions of CR start(A,B,C,D,F) 
0.03/0.21	
0.03/0.21	#### Partial ranking functions of CR start(A,B,C,D,F) 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Specialization of cost equations start0/5 
0.03/0.21	* CE 1 is refined into CE [24] 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Cost equations --> "Loop" of start0/5 
0.03/0.21	* CEs [24] --> Loop 18 
0.03/0.21	
0.03/0.21	### Ranking functions of CR start0(A,B,C,D,F) 
0.03/0.21	
0.03/0.21	#### Partial ranking functions of CR start0(A,B,C,D,F) 
0.03/0.21	
0.03/0.21	
0.03/0.21	Computing Bounds
0.03/0.21	=====================================
0.03/0.21	
0.03/0.21	#### Cost of chains of lbl51(A,C,F,G,H):
0.03/0.21	* Chain [[10],14]: 1*it(10)+0
0.03/0.21	  Such that:it(10) =< -C+H
0.03/0.21	
0.03/0.21	  with precondition: [F=2,9>=H,C>=0,G>=10,C+2>=A,H>=A,A>=C+1,H+2>=G] 
0.03/0.21	
0.03/0.21	* Chain [[10],13]: 1*it(10)+0
0.03/0.21	  Such that:it(10) =< -C+H
0.03/0.21	
0.03/0.21	  with precondition: [F=2,9>=H,C>=0,C+2>=A,H>=A,A>=C+1,H>=G] 
0.03/0.21	
0.03/0.21	* Chain [[10],12]: 1*it(10)+0
0.03/0.21	  Such that:it(10) =< -C+H
0.03/0.21	
0.03/0.21	  with precondition: [F=2,9>=H,C>=0,C+2>=A,H>=A,A>=C+1,G>=H+3] 
0.03/0.21	
0.03/0.21	* Chain [[10],11]: 1*it(10)+0
0.03/0.21	  Such that:it(10) =< -C+9
0.03/0.21	
0.03/0.21	  with precondition: [F=3,9>=A,C>=0,C+2>=A,A>=C+1] 
0.03/0.21	
0.03/0.21	* Chain [13]: 0
0.03/0.21	  with precondition: [F=2,A=G,C=H,9>=C,C>=0,C>=A] 
0.03/0.21	
0.03/0.21	* Chain [12]: 0
0.03/0.21	  with precondition: [F=2,A=G,C=H,9>=C,C>=0,A>=C+3] 
0.03/0.21	
0.03/0.21	* Chain [11]: 0
0.03/0.21	  with precondition: [F=3,C>=0] 
0.03/0.21	
0.03/0.21	
0.03/0.21	#### Cost of chains of lbl51_loop_cont(A,B,C,D,E,F):
0.03/0.21	* Chain [16]: 0
0.03/0.21	  with precondition: [A=2] 
0.03/0.21	
0.03/0.21	* Chain [15]: 0
0.03/0.21	  with precondition: [A=3] 
0.03/0.21	
0.03/0.21	
0.03/0.21	#### Cost of chains of start(A,B,C,D,F):
0.03/0.21	* Chain [17]: 36
0.03/0.21	  with precondition: [B=A,D=C] 
0.03/0.21	
0.03/0.21	
0.03/0.21	#### Cost of chains of start0(A,B,C,D,F):
0.03/0.21	* Chain [18]: 36
0.03/0.21	  with precondition: [] 
0.03/0.21	
0.03/0.21	
0.03/0.21	Closed-form bounds of start0(A,B,C,D,F): 
0.03/0.21	-------------------------------------
0.03/0.21	* Chain [18] with precondition: [] 
0.03/0.21	    - Upper bound: 36 
0.03/0.21	    - Complexity: constant 
0.03/0.21	
0.03/0.21	### Maximum cost of start0(A,B,C,D,F): 36 
0.03/0.21	Asymptotic class: constant 
0.03/0.21	* Total analysis performed in 144 ms.
0.03/0.21	
0.03/0.31	EOF