0.03/0.22	MAYBE
0.03/0.22	
0.03/0.22	Preprocessing Cost Relations
0.03/0.22	=====================================
0.03/0.22	
0.03/0.22	#### Computed strongly connected components 
0.03/0.22	0. recursive  : [f0/12]
0.03/0.22	1. non_recursive  : [exit_location/1]
0.03/0.22	2. non_recursive  : [f2/8]
0.03/0.22	3. non_recursive  : [f0_loop_cont/9]
0.03/0.22	4. non_recursive  : [f1/8]
0.03/0.22	
0.03/0.22	#### Obtained direct recursion through partial evaluation 
0.03/0.22	0. SCC is partially evaluated into f0/12
0.03/0.22	1. SCC is completely evaluated into other SCCs
0.03/0.22	2. SCC is completely evaluated into other SCCs
0.03/0.22	3. SCC is partially evaluated into f0_loop_cont/9
0.03/0.22	4. SCC is partially evaluated into f1/8
0.03/0.22	
0.03/0.22	Control-Flow Refinement of Cost Relations
0.03/0.22	=====================================
0.03/0.22	
0.03/0.22	### Specialization of cost equations f0/12 
0.03/0.22	* CE 6 is refined into CE [9] 
0.03/0.22	* CE 2 is refined into CE [10] 
0.03/0.22	* CE 5 is refined into CE [11] 
0.03/0.22	* CE 4 is refined into CE [12] 
0.03/0.22	* CE 3 is refined into CE [13] 
0.03/0.22	
0.03/0.22	
0.03/0.22	### Cost equations --> "Loop" of f0/12 
0.03/0.22	* CEs [11] --> Loop 9 
0.03/0.22	* CEs [12] --> Loop 10 
0.03/0.22	* CEs [13] --> Loop 11 
0.03/0.22	* CEs [9] --> Loop 12 
0.03/0.22	* CEs [10] --> Loop 13 
0.03/0.22	
0.03/0.22	### Ranking functions of CR f0(A,B,C,D,E,F,L,M,N,O,P,Q) 
0.03/0.22	
0.03/0.22	#### Partial ranking functions of CR f0(A,B,C,D,E,F,L,M,N,O,P,Q) 
0.03/0.22	
0.03/0.22	
0.03/0.22	### Specialization of cost equations f0_loop_cont/9 
0.03/0.22	* CE 8 is refined into CE [14] 
0.03/0.22	* CE 7 is refined into CE [15] 
0.03/0.22	
0.03/0.22	
0.03/0.22	### Cost equations --> "Loop" of f0_loop_cont/9 
0.03/0.22	* CEs [14] --> Loop 14 
0.03/0.22	* CEs [15] --> Loop 15 
0.03/0.22	
0.03/0.22	### Ranking functions of CR f0_loop_cont(A,B,C,D,E,F,G,H,I) 
0.03/0.22	
0.03/0.22	#### Partial ranking functions of CR f0_loop_cont(A,B,C,D,E,F,G,H,I) 
0.03/0.22	
0.03/0.22	
0.03/0.22	### Specialization of cost equations f1/8 
0.03/0.22	* CE 1 is refined into CE [16,17,18,19,20,21] 
0.03/0.22	
0.03/0.22	
0.03/0.22	### Cost equations --> "Loop" of f1/8 
0.03/0.22	* CEs [20,21] --> Loop 16 
0.03/0.22	* CEs [16] --> Loop 17 
0.03/0.22	* CEs [17,19] --> Loop 18 
0.03/0.22	* CEs [18] --> Loop 19 
0.03/0.22	
0.03/0.22	### Ranking functions of CR f1(A,B,C,D,E,F,G,L) 
0.03/0.22	
0.03/0.22	#### Partial ranking functions of CR f1(A,B,C,D,E,F,G,L) 
0.03/0.22	
0.03/0.22	
0.03/0.22	Computing Bounds
0.03/0.22	=====================================
0.03/0.22	
0.03/0.22	#### Cost of chains of f0(A,B,C,D,E,F,L,M,N,O,P,Q):
0.03/0.22	* Chain [[9,10,11]]...: 3*it(9)+0
0.03/0.22	  with precondition: [B>=A+1] 
0.03/0.22	
0.03/0.22	* Chain [[9,10,11],13]: 3*it(9)+0
0.03/0.22	  with precondition: [L=2,B>=A+1] 
0.03/0.22	
0.03/0.22	* Chain [[9,10,11],12]: 3*it(9)+0
0.03/0.22	  with precondition: [L=3,B>=A+1] 
0.03/0.22	
0.03/0.22	* Chain [13]: 0
0.03/0.22	  with precondition: [L=2,O=D,P=E,Q=F,A>=B] 
0.03/0.22	
0.03/0.22	* Chain [12]: 0
0.03/0.22	  with precondition: [L=3] 
0.03/0.22	
0.03/0.22	
0.03/0.22	#### Cost of chains of f0_loop_cont(A,B,C,D,E,F,G,H,I):
0.03/0.22	* Chain [15]: 0
0.03/0.22	  with precondition: [A=2] 
0.03/0.22	
0.03/0.22	* Chain [14]: 0
0.03/0.22	  with precondition: [A=3] 
0.03/0.22	
0.03/0.22	
0.03/0.22	#### Cost of chains of f1(A,B,C,D,E,F,G,L):
0.03/0.22	* Chain [19]: 0
0.03/0.22	  with precondition: [] 
0.03/0.22	
0.03/0.22	* Chain [18]: 1*aux(1)+0
0.03/0.22	  with precondition: [B>=A+1] 
0.03/0.22	
0.03/0.22	* Chain [17]: 0
0.03/0.22	  with precondition: [A>=B] 
0.03/0.22	
0.03/0.22	* Chain [16]...: 1*aux(2)+0
0.03/0.22	  with precondition: [B>=A+1] 
0.03/0.22	
0.03/0.22	
0.03/0.22	Closed-form bounds of f1(A,B,C,D,E,F,G,L): 
0.03/0.22	-------------------------------------
0.03/0.22	* Chain [19] with precondition: [] 
0.03/0.22	    - Upper bound: 0 
0.03/0.22	    - Complexity: constant 
0.03/0.22	* Chain [18] with precondition: [B>=A+1] 
0.03/0.22	    - Upper bound: inf 
0.03/0.22	    - Complexity: infinity 
0.03/0.22	* Chain [17] with precondition: [A>=B] 
0.03/0.22	    - Upper bound: 0 
0.03/0.22	    - Complexity: constant 
0.03/0.22	* Chain [16]... with precondition: [B>=A+1] 
0.03/0.22	    - Upper bound: inf 
0.03/0.22	    - Complexity: infinity 
0.03/0.22	
0.03/0.22	### Maximum cost of f1(A,B,C,D,E,F,G,L): inf 
0.03/0.22	Asymptotic class: infinity 
0.03/0.22	* Total analysis performed in 155 ms.
0.03/0.22	
0.03/0.32	EOF