Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744510
details
property
value
status
complete
benchmark
nd_loop.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
SAS10
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.313266992569 seconds
cpu usage
0.226640354
max memory
9064448.0
stage attributes
key
value
output-size
3818
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 : [cut/5,lbl51/5] 1. non_recursive : [exit_location/1] 2. non_recursive : [stop/5] 3. non_recursive : [lbl51_loop_cont/6] 4. non_recursive : [start/5] 5. non_recursive : [start0/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into lbl51/5 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into lbl51_loop_cont/6 4. SCC is partially evaluated into start/5 5. SCC is partially evaluated into start0/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations lbl51/5 * CE 7 is refined into CE [10] * CE 5 is refined into CE [11] * CE 4 is refined into CE [12] * CE 6 is refined into CE [13] * CE 3 is refined into CE [14] ### Cost equations --> "Loop" of lbl51/5 * CEs [14] --> Loop 10 * CEs [10] --> Loop 11 * CEs [11] --> Loop 12 * CEs [12] --> Loop 13 * CEs [13] --> Loop 14 ### Ranking functions of CR lbl51(A,C,F,G,H) * RF of phase [10]: [-C+9] #### Partial ranking functions of CR lbl51(A,C,F,G,H) * Partial RF of phase [10]: - RF of loop [10:1]: -C+9 ### Specialization of cost equations lbl51_loop_cont/6 * CE 9 is refined into CE [15] * CE 8 is refined into CE [16] ### Cost equations --> "Loop" of lbl51_loop_cont/6 * CEs [15] --> Loop 15 * CEs [16] --> Loop 16 ### Ranking functions of CR lbl51_loop_cont(A,B,C,D,E,F) #### Partial ranking functions of CR lbl51_loop_cont(A,B,C,D,E,F) ### Specialization of cost equations start/5 * CE 2 is refined into CE [17,18,19,20,21,22,23] ### Cost equations --> "Loop" of start/5 * CEs [17,18,19,20,21,22,23] --> Loop 17 ### Ranking functions of CR start(A,B,C,D,F) #### Partial ranking functions of CR start(A,B,C,D,F) ### Specialization of cost equations start0/5 * CE 1 is refined into CE [24] ### Cost equations --> "Loop" of start0/5 * CEs [24] --> Loop 18 ### Ranking functions of CR start0(A,B,C,D,F) #### Partial ranking functions of CR start0(A,B,C,D,F) Computing Bounds ===================================== #### Cost of chains of lbl51(A,C,F,G,H): * Chain [[10],14]: 1*it(10)+0 Such that:it(10) =< -C+H with precondition: [F=2,9>=H,C>=0,G>=10,C+2>=A,H>=A,A>=C+1,H+2>=G]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843