Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990921
details
property
value
status
complete
benchmark
ludcmp.c.i.ludcmp.pl.t2.fixed.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
39.0933 seconds
cpu usage
39.0293
user time
38.9178
system time
0.111556
max virtual memory
385048.0
max residence set size
81664.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(n^1))
output
38.91/38.91 WORST_CASE(?,O(n^1)) 38.91/38.91 WARNING: Excluded non-linear constraints:[S=D-Q*R] 38.91/38.91 WARNING: Excluded non-linear constraints:[K=I*J,B>=I*J+1] 38.91/38.91 WARNING: Excluded non-linear constraints:[K=I*J,L=I*J,I*J>=B] 38.91/38.91 WARNING: Excluded non-linear constraints:[J=B-H*I] 38.91/38.91 WARNING: Excluded non-linear constraints:[R>=S*T+1] 38.91/38.91 WARNING: Excluded non-linear constraints:[R*S>=T] 38.91/38.91 38.91/38.91 Preprocessing Cost Relations 38.91/38.91 ===================================== 38.91/38.91 38.91/38.91 #### Computed strongly connected components 38.91/38.91 0. recursive : [f9/12] 38.91/38.91 1. recursive : [f5/12,f9_loop_cont/13] 38.91/38.91 2. non_recursive : [exit_location/1] 38.91/38.91 3. recursive : [f30/7] 38.91/38.91 4. recursive : [f26/10,f30_loop_cont/11] 38.91/38.91 5. recursive : [f44/16] 38.91/38.91 6. recursive : [f40/17,f44_loop_cont/18] 38.91/38.91 7. recursive : [f59/6] 38.91/38.91 8. recursive : [f74/6] 38.91/38.91 9. recursive : [f23/18,f26_loop_cont/19,f40_loop_cont/19,f59_loop_cont/19,f69/18,f71/18,f74_loop_cont/19] 38.91/38.91 10. non_recursive : [f1/12] 38.91/38.91 11. non_recursive : [f23_loop_cont/13] 38.91/38.91 12. non_recursive : [f5_loop_cont/13] 38.91/38.91 13. non_recursive : [f2/12] 38.91/38.91 38.91/38.91 #### Obtained direct recursion through partial evaluation 38.91/38.91 0. SCC is partially evaluated into f9/12 38.91/38.91 1. SCC is partially evaluated into f5/12 38.91/38.91 2. SCC is completely evaluated into other SCCs 38.91/38.91 3. SCC is partially evaluated into f30/7 38.91/38.91 4. SCC is partially evaluated into f26/10 38.91/38.91 5. SCC is partially evaluated into f44/16 38.91/38.91 6. SCC is partially evaluated into f40/17 38.91/38.91 7. SCC is partially evaluated into f59/6 38.91/38.91 8. SCC is partially evaluated into f74/6 38.91/38.91 9. SCC is partially evaluated into f23/18 38.91/38.91 10. SCC is completely evaluated into other SCCs 38.91/38.91 11. SCC is partially evaluated into f23_loop_cont/13 38.91/38.91 12. SCC is partially evaluated into f5_loop_cont/13 38.91/38.91 13. SCC is partially evaluated into f2/12 38.91/38.91 38.91/38.91 Control-Flow Refinement of Cost Relations 38.91/38.91 ===================================== 38.91/38.91 38.91/38.91 ### Specialization of cost equations f9/12 38.91/38.91 * CE 11 is refined into CE [50] 38.91/38.91 * CE 10 is discarded (unfeasible) 38.91/38.91 * CE 13 is refined into CE [51] 38.91/38.91 * CE 12 is refined into CE [52] 38.91/38.91 * CE 9 is refined into CE [53] 38.91/38.91 * CE 8 is refined into CE [54] 38.91/38.91 38.91/38.91 38.91/38.91 ### Cost equations --> "Loop" of f9/12 38.91/38.91 * CEs [53] --> Loop 45 38.91/38.91 * CEs [54] --> Loop 46 38.91/38.91 * CEs [50] --> Loop 47 38.91/38.91 * CEs [51] --> Loop 48 38.91/38.91 * CEs [52] --> Loop 49 38.91/38.91 38.91/38.91 ### Ranking functions of CR f9(A,B,C,D,E,F,N,O,P,Q,R,S) 38.91/38.91 * RF of phase [45,46]: [A-D+1] 38.91/38.91 38.91/38.91 #### Partial ranking functions of CR f9(A,B,C,D,E,F,N,O,P,Q,R,S) 38.91/38.91 * Partial RF of phase [45,46]: 38.91/38.91 - RF of loop [45:1,46:1]: 38.91/38.91 A-D+1 38.91/38.91 38.91/38.91 38.91/38.91 ### Specialization of cost equations f5/12 38.91/38.91 * CE 4 is refined into CE [55] 38.91/38.91 * CE 2 is refined into CE [56,57] 38.91/38.91 * CE 5 is refined into CE [58] 38.91/38.91 * CE 3 is refined into CE [59,60,61] 38.91/38.91 38.91/38.91 38.91/38.91 ### Cost equations --> "Loop" of f5/12 38.91/38.91 * CEs [61] --> Loop 50 38.91/38.91 * CEs [60] --> Loop 51 38.91/38.91 * CEs [59] --> Loop 52 38.91/38.91 * CEs [55] --> Loop 53 38.91/38.91 * CEs [57] --> Loop 54 38.91/38.91 * CEs [56] --> Loop 55 38.91/38.91 * CEs [58] --> Loop 56 38.91/38.91 38.91/38.91 ### Ranking functions of CR f5(A,B,C,D,E,F,N,O,P,Q,R,S) 38.91/38.91 * RF of phase [52]: [A-B+1,-B+D] 38.91/38.91 38.91/38.91 #### Partial ranking functions of CR f5(A,B,C,D,E,F,N,O,P,Q,R,S) 38.91/38.91 * Partial RF of phase [52]: 38.91/38.91 - RF of loop [52:1]: 38.91/38.91 A-B+1 38.91/38.91 -B+D 38.91/38.91 38.91/38.91 38.91/38.91 ### Specialization of cost equations f30/7 38.91/38.91 * CE 44 is refined into CE [62] 38.91/38.91 * CE 45 is refined into CE [63]
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