Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990833
details
property
value
status
complete
benchmark
p-1a.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n119.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.249197 seconds
cpu usage
0.167747
user time
0.151967
system time
0.01578
max virtual memory
113176.0
max residence set size
10996.0
stage attributes
key
value
starexec-result
MAYBE
output
0.03/0.14 MAYBE 0.03/0.14 0.03/0.14 Preprocessing Cost Relations 0.03/0.14 ===================================== 0.03/0.14 0.03/0.14 #### Computed strongly connected components 0.03/0.14 0. recursive : [f1/11] 0.03/0.14 1. non_recursive : [exit_location/1] 0.03/0.14 2. non_recursive : [f300/11] 0.03/0.14 3. non_recursive : [f1_loop_cont/12] 0.03/0.14 4. non_recursive : [f2/11] 0.03/0.14 0.03/0.14 #### Obtained direct recursion through partial evaluation 0.03/0.14 0. SCC is partially evaluated into f1/11 0.03/0.14 1. SCC is completely evaluated into other SCCs 0.03/0.14 2. SCC is completely evaluated into other SCCs 0.03/0.14 3. SCC is partially evaluated into f1_loop_cont/12 0.03/0.14 4. SCC is partially evaluated into f2/11 0.03/0.14 0.03/0.14 Control-Flow Refinement of Cost Relations 0.03/0.14 ===================================== 0.03/0.14 0.03/0.14 ### Specialization of cost equations f1/11 0.03/0.14 * CE 4 is refined into CE [7] 0.03/0.14 * CE 3 is refined into CE [8] 0.03/0.14 * CE 2 is refined into CE [9] 0.03/0.14 0.03/0.14 0.03/0.14 ### Cost equations --> "Loop" of f1/11 0.03/0.14 * CEs [9] --> Loop 7 0.03/0.14 * CEs [7] --> Loop 8 0.03/0.14 * CEs [8] --> Loop 9 0.03/0.14 0.03/0.14 ### Ranking functions of CR f1(A,B,C,D,E,F,O,P,Q,R,S) 0.03/0.14 0.03/0.14 #### Partial ranking functions of CR f1(A,B,C,D,E,F,O,P,Q,R,S) 0.03/0.14 0.03/0.14 0.03/0.14 ### Specialization of cost equations f1_loop_cont/12 0.03/0.14 * CE 6 is refined into CE [10] 0.03/0.14 * CE 5 is refined into CE [11] 0.03/0.14 0.03/0.14 0.03/0.14 ### Cost equations --> "Loop" of f1_loop_cont/12 0.03/0.14 * CEs [10] --> Loop 10 0.03/0.14 * CEs [11] --> Loop 11 0.03/0.14 0.03/0.14 ### Ranking functions of CR f1_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L) 0.03/0.14 0.03/0.14 #### Partial ranking functions of CR f1_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L) 0.03/0.14 0.03/0.14 0.03/0.14 ### Specialization of cost equations f2/11 0.03/0.14 * CE 1 is refined into CE [12,13,14,15,16] 0.03/0.14 0.03/0.14 0.03/0.14 ### Cost equations --> "Loop" of f2/11 0.03/0.14 * CEs [15,16] --> Loop 12 0.03/0.14 * CEs [12] --> Loop 13 0.03/0.14 * CEs [14] --> Loop 14 0.03/0.14 * CEs [13] --> Loop 15 0.03/0.14 0.03/0.14 ### Ranking functions of CR f2(A,B,C,D,E,F,G,H,I,J,O) 0.03/0.14 0.03/0.14 #### Partial ranking functions of CR f2(A,B,C,D,E,F,G,H,I,J,O) 0.03/0.14 0.03/0.14 0.03/0.14 Computing Bounds 0.03/0.14 ===================================== 0.03/0.14 0.03/0.14 #### Cost of chains of f1(A,B,C,D,E,F,O,P,Q,R,S): 0.03/0.14 * Chain [[7]]...: 1*it(7)+0 0.03/0.14 with precondition: [B>=A+1] 0.03/0.14 0.03/0.14 * Chain [[7],8]: 1*it(7)+0 0.03/0.14 with precondition: [O=3,B>=A+1] 0.03/0.14 0.03/0.14 * Chain [9]: 0 0.03/0.14 with precondition: [O=2,R=E,A>=B] 0.03/0.14 0.03/0.14 * Chain [8]: 0 0.03/0.14 with precondition: [O=3] 0.03/0.14 0.03/0.14 0.03/0.14 #### Cost of chains of f1_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L): 0.03/0.14 * Chain [11]: 0 0.03/0.14 with precondition: [A=2] 0.03/0.14 0.03/0.14 * Chain [10]: 0 0.03/0.14 with precondition: [A=3] 0.03/0.14 0.03/0.14 0.03/0.14 #### Cost of chains of f2(A,B,C,D,E,F,G,H,I,J,O): 0.03/0.14 * Chain [15]: 0 0.03/0.14 with precondition: [] 0.03/0.14 0.03/0.14 * Chain [14]: 1*s(1)+0 0.03/0.14 with precondition: [B>=A+1] 0.03/0.14 0.03/0.14 * Chain [13]: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_ITS 2019-03-21 04.46