Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990795
details
property
value
status
complete
benchmark
p-53.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.0670489 seconds
cpu usage
0.084309
user time
0.071678
system time
0.012631
max virtual memory
113176.0
max residence set size
10528.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(1))
output
0.00/0.06 WORST_CASE(?,O(1)) 0.00/0.06 0.00/0.06 Preprocessing Cost Relations 0.00/0.06 ===================================== 0.00/0.06 0.00/0.06 #### Computed strongly connected components 0.00/0.06 0. non_recursive : [f300/3] 0.00/0.06 1. non_recursive : [f4/3] 0.00/0.06 0.00/0.06 #### Obtained direct recursion through partial evaluation 0.00/0.06 0. SCC is completely evaluated into other SCCs 0.00/0.06 1. SCC is partially evaluated into f4/3 0.00/0.06 0.00/0.06 Control-Flow Refinement of Cost Relations 0.00/0.06 ===================================== 0.00/0.06 0.00/0.06 ### Specialization of cost equations f4/3 0.00/0.06 * CE 2 is refined into CE [3] 0.00/0.06 * CE 1 is refined into CE [4] 0.00/0.06 0.00/0.06 0.00/0.06 ### Cost equations --> "Loop" of f4/3 0.00/0.06 * CEs [3] --> Loop 3 0.00/0.06 * CEs [4] --> Loop 4 0.00/0.06 0.00/0.06 ### Ranking functions of CR f4(A,B,D) 0.00/0.06 0.00/0.06 #### Partial ranking functions of CR f4(A,B,D) 0.00/0.06 0.00/0.06 0.00/0.06 Computing Bounds 0.00/0.06 ===================================== 0.00/0.06 0.00/0.06 #### Cost of chains of f4(A,B,D): 0.00/0.06 * Chain [4]: 0 0.00/0.06 with precondition: [0>=A+1] 0.00/0.06 0.00/0.06 * Chain [3]: 0 0.00/0.06 with precondition: [A>=0] 0.00/0.06 0.00/0.06 0.00/0.06 Closed-form bounds of f4(A,B,D): 0.00/0.06 ------------------------------------- 0.00/0.06 * Chain [4] with precondition: [0>=A+1] 0.00/0.06 - Upper bound: 0 0.00/0.06 - Complexity: constant 0.00/0.06 * Chain [3] with precondition: [A>=0] 0.00/0.06 - Upper bound: 0 0.00/0.06 - Complexity: constant 0.00/0.06 0.00/0.06 ### Maximum cost of f4(A,B,D): 0 0.00/0.06 Asymptotic class: constant 0.00/0.06 * Total analysis performed in 7 ms. 0.00/0.06 0.00/0.06 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