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