Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429989747
details
property
value
status
complete
benchmark
c.04.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n032.star.cs.uiowa.edu
space
PLDI06
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.24146 seconds
cpu usage
0.159037
user time
0.136097
system time
0.02294
max virtual memory
113176.0
max residence set size
11008.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(n^1))
output
0.03/0.13 WORST_CASE(?,O(n^1)) 0.03/0.13 0.03/0.13 Preprocessing Cost Relations 0.03/0.13 ===================================== 0.03/0.13 0.03/0.13 #### Computed strongly connected components 0.03/0.13 0. recursive : [eval1/4] 0.03/0.13 1. non_recursive : [exit_location/1] 0.03/0.13 2. non_recursive : [eval1_loop_cont/2] 0.03/0.13 3. non_recursive : [eval0/4] 0.03/0.13 0.03/0.13 #### Obtained direct recursion through partial evaluation 0.03/0.13 0. SCC is partially evaluated into eval1/4 0.03/0.13 1. SCC is completely evaluated into other SCCs 0.03/0.13 2. SCC is completely evaluated into other SCCs 0.03/0.13 3. SCC is partially evaluated into eval0/4 0.03/0.13 0.03/0.13 Control-Flow Refinement of Cost Relations 0.03/0.13 ===================================== 0.03/0.13 0.03/0.13 ### Specialization of cost equations eval1/4 0.03/0.13 * CE 4 is refined into CE [5] 0.03/0.13 * CE 2 is refined into CE [6] 0.03/0.13 * CE 3 is refined into CE [7] 0.03/0.13 0.03/0.13 0.03/0.13 ### Cost equations --> "Loop" of eval1/4 0.03/0.13 * CEs [6] --> Loop 5 0.03/0.13 * CEs [7] --> Loop 6 0.03/0.13 * CEs [5] --> Loop 7 0.03/0.13 0.03/0.13 ### Ranking functions of CR eval1(A,B,C,D) 0.03/0.13 * RF of phase [5]: [A-B,-B+C-1] 0.03/0.13 0.03/0.13 #### Partial ranking functions of CR eval1(A,B,C,D) 0.03/0.13 * Partial RF of phase [5]: 0.03/0.13 - RF of loop [5:1]: 0.03/0.13 A-B 0.03/0.13 -B+C-1 0.03/0.13 0.03/0.13 0.03/0.13 ### Specialization of cost equations eval0/4 0.03/0.13 * CE 1 is refined into CE [8,9,10] 0.03/0.13 0.03/0.13 0.03/0.13 ### Cost equations --> "Loop" of eval0/4 0.03/0.13 * CEs [10] --> Loop 8 0.03/0.13 * CEs [9] --> Loop 9 0.03/0.13 * CEs [8] --> Loop 10 0.03/0.13 0.03/0.13 ### Ranking functions of CR eval0(A,B,C,D) 0.03/0.13 0.03/0.13 #### Partial ranking functions of CR eval0(A,B,C,D) 0.03/0.13 0.03/0.13 0.03/0.13 Computing Bounds 0.03/0.13 ===================================== 0.03/0.13 0.03/0.13 #### Cost of chains of eval1(A,B,C,D): 0.03/0.13 * Chain [[5],7]: 1*it(5)+0 0.03/0.13 Such that:it(5) =< A-B 0.03/0.13 0.03/0.13 with precondition: [D=2,A>=1,C>=A+1,A>=B+1] 0.03/0.13 0.03/0.13 * Chain [[5],6,7]: 1*it(5)+1 0.03/0.13 Such that:it(5) =< A-B 0.03/0.13 0.03/0.13 with precondition: [D=2,0>=B+1,A>=1,C>=A+1] 0.03/0.13 0.03/0.13 * Chain [7]: 0 0.03/0.13 with precondition: [D=2,A>=1] 0.03/0.13 0.03/0.13 * Chain [6,7]: 1 0.03/0.13 with precondition: [D=2,A>=1,C>=A+1,A>=B+1] 0.03/0.13 0.03/0.13 0.03/0.13 #### Cost of chains of eval0(A,B,C,D): 0.03/0.13 * Chain [10]: 1*s(2)+1 0.03/0.13 Such that:s(2) =< A-B 0.03/0.14 0.03/0.14 with precondition: [0>=B+1,A>=1,C>=A+1] 0.03/0.14 0.03/0.14 * Chain [9]: 0 0.03/0.14 with precondition: [A>=1] 0.03/0.14 0.03/0.14 * Chain [8]: 1*s(3)+1 0.03/0.14 Such that:s(3) =< A-B 0.03/0.14 0.03/0.14 with precondition: [A>=1,C>=A+1,A>=B+1] 0.03/0.14 0.03/0.14 0.03/0.14 Closed-form bounds of eval0(A,B,C,D): 0.03/0.14 ------------------------------------- 0.03/0.14 * Chain [10] with precondition: [0>=B+1,A>=1,C>=A+1] 0.03/0.14 - Upper bound: A-B+1 0.03/0.14 - Complexity: n 0.03/0.14 * Chain [9] with precondition: [A>=1] 0.03/0.14 - Upper bound: 0 0.03/0.14 - Complexity: constant 0.03/0.14 * Chain [8] with precondition: [A>=1,C>=A+1,A>=B+1]
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