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