Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990063
details
property
value
status
complete
benchmark
slayer-n3-filtered.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n152.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.108163 seconds
cpu usage
0.127346
user time
0.108423
system time
0.018923
max virtual memory
246356.0
max residence set size
10528.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(1))
output
0.09/0.10 WORST_CASE(?,O(1)) 0.09/0.10 0.09/0.10 Preprocessing Cost Relations 0.09/0.10 ===================================== 0.09/0.10 0.09/0.10 #### Computed strongly connected components 0.09/0.10 0. non_recursive : [f7/37] 0.09/0.10 1. non_recursive : [f6/37] 0.09/0.10 0.09/0.10 #### Obtained direct recursion through partial evaluation 0.09/0.10 0. SCC is completely evaluated into other SCCs 0.09/0.10 1. SCC is partially evaluated into f6/37 0.09/0.10 0.09/0.10 Control-Flow Refinement of Cost Relations 0.09/0.10 ===================================== 0.09/0.10 0.09/0.10 ### Specialization of cost equations f6/37 0.09/0.10 * CE 1 is refined into CE [2] 0.09/0.10 0.09/0.10 0.09/0.10 ### Cost equations --> "Loop" of f6/37 0.09/0.10 * CEs [2] --> Loop 2 0.09/0.10 0.09/0.10 ### Ranking functions of CR f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1) 0.09/0.10 0.09/0.10 #### Partial ranking functions of CR f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1) 0.09/0.10 0.09/0.10 0.09/0.10 Computing Bounds 0.09/0.10 ===================================== 0.09/0.10 0.09/0.10 #### Cost of chains of f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1): 0.09/0.10 * Chain [2]: 0 0.09/0.10 with precondition: [B=0,E=100,Q=0,Z=0,X=A] 0.09/0.10 0.09/0.10 0.09/0.10 Closed-form bounds of f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1): 0.09/0.10 ------------------------------------- 0.09/0.10 * Chain [2] with precondition: [B=0,E=100,Q=0,Z=0,X=A] 0.09/0.10 - Upper bound: 0 0.09/0.10 - Complexity: constant 0.09/0.10 0.09/0.10 ### Maximum cost of f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,U1): 0 0.09/0.10 Asymptotic class: constant 0.09/0.10 * Total analysis performed in 24 ms. 0.09/0.10 0.09/0.10 EOF
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