Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989139
details
property
value
status
complete
benchmark
Sunset.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n102.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.258268 seconds
cpu usage
0.181734
user time
0.15382
system time
0.027914
max virtual memory
113176.0
max residence set size
11348.0
stage attributes
key
value
starexec-result
MAYBE
output
0.05/0.15 MAYBE 0.05/0.15 0.05/0.15 Preprocessing Cost Relations 0.05/0.15 ===================================== 0.05/0.15 0.05/0.15 #### Computed strongly connected components 0.05/0.15 0. recursive : [eval_foo_bb1_in/2,eval_foo_bb2_in/2] 0.05/0.15 1. non_recursive : [eval_foo_stop/1] 0.05/0.15 2. non_recursive : [eval_foo_bb3_in/1] 0.05/0.15 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.05/0.15 4. non_recursive : [eval_foo_bb0_in/2] 0.05/0.15 5. non_recursive : [eval_foo_start/2] 0.05/0.15 0.05/0.15 #### Obtained direct recursion through partial evaluation 0.05/0.15 0. SCC is partially evaluated into eval_foo_bb1_in/2 0.05/0.15 1. SCC is completely evaluated into other SCCs 0.05/0.15 2. SCC is completely evaluated into other SCCs 0.05/0.15 3. SCC is completely evaluated into other SCCs 0.05/0.15 4. SCC is partially evaluated into eval_foo_bb0_in/2 0.05/0.15 5. SCC is partially evaluated into eval_foo_start/2 0.05/0.15 0.05/0.15 Control-Flow Refinement of Cost Relations 0.05/0.15 ===================================== 0.05/0.15 0.05/0.15 ### Specialization of cost equations eval_foo_bb1_in/2 0.05/0.15 * CE 7 is refined into CE [8] 0.05/0.15 * CE 5 is refined into CE [9] 0.05/0.15 * CE 4 is refined into CE [10] 0.05/0.15 * CE 3 is refined into CE [11] 0.05/0.15 * CE 6 is refined into CE [12] 0.05/0.15 0.05/0.15 0.05/0.15 ### Cost equations --> "Loop" of eval_foo_bb1_in/2 0.05/0.15 * CEs [9] --> Loop 8 0.05/0.15 * CEs [10] --> Loop 9 0.05/0.15 * CEs [11] --> Loop 10 0.05/0.15 * CEs [12] --> Loop 11 0.05/0.15 * CEs [8] --> Loop 12 0.05/0.15 0.05/0.15 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) 0.05/0.15 * RF of phase [8]: [V__0-10] 0.05/0.15 0.05/0.15 #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 0.05/0.15 * Partial RF of phase [8]: 0.05/0.15 - RF of loop [8:1]: 0.05/0.15 V__0-10 0.05/0.15 * Partial RF of phase [9,11]: 0.05/0.15 - RF of loop [9:1]: 0.05/0.15 V__0-25 depends on loops [11:1] 0.05/0.15 - RF of loop [11:1]: 0.05/0.15 -V__0/4+13/2 depends on loops [9:1] 0.05/0.15 0.05/0.15 0.05/0.15 ### Specialization of cost equations eval_foo_bb0_in/2 0.05/0.15 * CE 2 is refined into CE [13,14,15,16] 0.05/0.15 0.05/0.15 0.05/0.15 ### Cost equations --> "Loop" of eval_foo_bb0_in/2 0.05/0.15 * CEs [16] --> Loop 13 0.05/0.15 * CEs [15] --> Loop 14 0.05/0.15 * CEs [14] --> Loop 15 0.05/0.15 * CEs [13] --> Loop 16 0.05/0.15 0.05/0.15 ### Ranking functions of CR eval_foo_bb0_in(V_i,B) 0.05/0.15 0.05/0.15 #### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 0.05/0.15 0.05/0.15 0.05/0.15 ### Specialization of cost equations eval_foo_start/2 0.05/0.15 * CE 1 is refined into CE [17,18,19,20] 0.05/0.15 0.05/0.15 0.05/0.15 ### Cost equations --> "Loop" of eval_foo_start/2 0.05/0.15 * CEs [20] --> Loop 17 0.05/0.15 * CEs [19] --> Loop 18 0.05/0.15 * CEs [18] --> Loop 19 0.05/0.15 * CEs [17] --> Loop 20 0.05/0.15 0.05/0.15 ### Ranking functions of CR eval_foo_start(V_i,B) 0.05/0.15 0.05/0.15 #### Partial ranking functions of CR eval_foo_start(V_i,B) 0.05/0.15 0.05/0.15 0.05/0.15 Computing Bounds 0.05/0.15 ===================================== 0.05/0.15 0.05/0.15 #### Cost of chains of eval_foo_bb1_in(V__0,B): 0.05/0.15 * Chain [[9,11]]...: 2*it(9)+0 0.05/0.15 with precondition: [30>=V__0,V__0>=25,B=2] 0.05/0.15 0.05/0.15 * Chain [[8],12]: 1*it(8)+0 0.05/0.15 Such that:it(8) =< V__0 0.05/0.15 0.05/0.15 with precondition: [B=2,24>=V__0,V__0>=11] 0.05/0.15 0.05/0.15 * Chain [12]: 0 0.05/0.15 with precondition: [B=2,10>=V__0] 0.05/0.15 0.05/0.15 * Chain [10,[8],12]: 1*it(8)+1 0.05/0.15 Such that:it(8) =< 20
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_C_Integer 2019-03-21 04.38