details

property	value
status	complete
benchmark	ex17.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n085.star.cs.uiowa.edu
space	T2

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.325793981552 seconds
cpu usage	0.241041145
max memory	9129984.0

stage attributes

key	value
output-size	4912
starexec-result	WORST_CASE(?,O(1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f5/7] 1. non_recursive : [exit_location/1] 2. non_recursive : [f13/8] 3. recursive : [f17/11] 4. recursive : [f32/7] 5. non_recursive : [f32_loop_cont/9] 6. non_recursive : [f17_loop_cont/9] 7. non_recursive : [f5_loop_cont/9] 8. non_recursive : [f0/8] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f5/7 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f17/11 4. SCC is partially evaluated into f32/7 5. SCC is partially evaluated into f32_loop_cont/9 6. SCC is partially evaluated into f17_loop_cont/9 7. SCC is partially evaluated into f5_loop_cont/9 8. SCC is partially evaluated into f0/8 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f5/7 * CE 4 is refined into CE [21] * CE 3 is refined into CE [22] * CE 2 is refined into CE [23] ### Cost equations --> "Loop" of f5/7 * CEs [23] --> Loop 21 * CEs [21] --> Loop 22 * CEs [22] --> Loop 23 ### Ranking functions of CR f5(A,B,D,J,K,L,M) * RF of phase [21]: [-A+100] #### Partial ranking functions of CR f5(A,B,D,J,K,L,M) * Partial RF of phase [21]: - RF of loop [21:1]: -A+100 ### Specialization of cost equations f17/11 * CE 9 is discarded (unfeasible) * CE 11 is discarded (unfeasible) * CE 10 is discarded (unfeasible) * CE 7 is discarded (unfeasible) * CE 8 is discarded (unfeasible) ### Cost equations --> "Loop" of f17/11 ### Ranking functions of CR f17(B,C,D,F,G,J,K,L,M,N,O) #### Partial ranking functions of CR f17(B,C,D,F,G,J,K,L,M,N,O) Warning: no base case found for predicate ### Specialization of cost equations f32/7 * CE 18 is discarded (unfeasible) * CE 17 is discarded (unfeasible) * CE 15 is discarded (unfeasible) * CE 16 is discarded (unfeasible) ### Cost equations --> "Loop" of f32/7 ### Ranking functions of CR f32(C,D,E,J,K,L,M) #### Partial ranking functions of CR f32(C,D,E,J,K,L,M) Warning: no base case found for predicate ### Specialization of cost equations f32_loop_cont/9 * CE 20 is discarded (unfeasible) * CE 19 is discarded (unfeasible) ### Cost equations --> "Loop" of f32_loop_cont/9 ### Ranking functions of CR f32_loop_cont(A,B,C,D,E,F,G,H,I) #### Partial ranking functions of CR f32_loop_cont(A,B,C,D,E,F,G,H,I) Warning: no base case found for predicate popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl Integ Trans Syste 26843