Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429988955
details
property
value
status
complete
benchmark
ComplxStruc.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n135.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.338138 seconds
cpu usage
0.271268
user time
0.242388
system time
0.02888
max virtual memory
113176.0
max residence set size
11224.0
stage attributes
key
value
starexec-result
MAYBE
output
0.06/0.23 MAYBE 0.06/0.23 0.06/0.23 Preprocessing Cost Relations 0.06/0.23 ===================================== 0.06/0.23 0.06/0.23 #### Computed strongly connected components 0.06/0.23 0. recursive : [eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3,eval_foo_bb4_in/4,eval_foo_bb5_in/4,eval_foo_bb6_in/3,eval_foo_bb7_in/3,eval_foo_bb8_in/3] 0.06/0.23 1. non_recursive : [eval_foo_stop/1] 0.06/0.23 2. non_recursive : [eval_foo_bb9_in/1] 0.06/0.23 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.06/0.23 4. non_recursive : [eval_foo_bb0_in/2] 0.06/0.23 5. non_recursive : [eval_foo_start/3] 0.06/0.23 0.06/0.23 #### Obtained direct recursion through partial evaluation 0.06/0.23 0. SCC is partially evaluated into eval_foo_bb1_in/3 0.06/0.23 1. SCC is completely evaluated into other SCCs 0.06/0.23 2. SCC is completely evaluated into other SCCs 0.06/0.23 3. SCC is completely evaluated into other SCCs 0.06/0.23 4. SCC is partially evaluated into eval_foo_bb0_in/2 0.06/0.23 5. SCC is partially evaluated into eval_foo_start/3 0.06/0.23 0.06/0.23 Control-Flow Refinement of Cost Relations 0.06/0.23 ===================================== 0.06/0.23 0.06/0.23 ### Specialization of cost equations eval_foo_bb1_in/3 0.06/0.23 * CE 7 is refined into CE [8] 0.06/0.23 * CE 3 is refined into CE [9] 0.06/0.23 * CE 6 is refined into CE [10] 0.06/0.23 * CE 5 is refined into CE [11] 0.06/0.23 * CE 4 is refined into CE [12] 0.06/0.23 0.06/0.23 0.06/0.23 ### Cost equations --> "Loop" of eval_foo_bb1_in/3 0.06/0.23 * CEs [10] --> Loop 8 0.06/0.23 * CEs [11] --> Loop 9 0.06/0.23 * CEs [12] --> Loop 10 0.06/0.23 * CEs [9] --> Loop 11 0.06/0.23 * CEs [8] --> Loop 12 0.06/0.23 0.06/0.23 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 0.06/0.23 0.06/0.23 #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 0.06/0.23 * Partial RF of phase [8,9,10,11]: 0.06/0.23 - RF of loop [8:1]: 0.06/0.23 V__01-4 depends on loops [9:1,10:1] 0.06/0.23 - RF of loop [9:1]: 0.06/0.23 -V__01+5 depends on loops [8:1,11:1] 0.06/0.23 - RF of loop [10:1]: 0.06/0.23 -V__0+7 0.06/0.23 -V__01+V__0+1 depends on loops [8:1,9:1,11:1] 0.06/0.23 -V__01/2+5/2 depends on loops [8:1,11:1] 0.06/0.23 - RF of loop [11:1]: 0.06/0.23 V__01-1 depends on loops [9:1,10:1] 0.06/0.23 V__01/2-V__0/2 depends on loops [10:1] 0.06/0.23 0.06/0.23 0.06/0.23 ### Specialization of cost equations eval_foo_bb0_in/2 0.06/0.23 * CE 2 is refined into CE [13,14] 0.06/0.23 0.06/0.23 0.06/0.23 ### Cost equations --> "Loop" of eval_foo_bb0_in/2 0.06/0.23 * CEs [14] --> Loop 13 0.06/0.23 * CEs [13] --> Loop 14 0.06/0.23 0.06/0.23 ### Ranking functions of CR eval_foo_bb0_in(V_i,B) 0.06/0.23 0.06/0.23 #### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 0.06/0.23 0.06/0.23 0.06/0.23 ### Specialization of cost equations eval_foo_start/3 0.06/0.23 * CE 1 is refined into CE [15,16] 0.06/0.23 0.06/0.23 0.06/0.23 ### Cost equations --> "Loop" of eval_foo_start/3 0.06/0.23 * CEs [16] --> Loop 15 0.06/0.23 * CEs [15] --> Loop 16 0.06/0.23 0.06/0.23 ### Ranking functions of CR eval_foo_start(V_i,V_j,B) 0.06/0.23 0.06/0.23 #### Partial ranking functions of CR eval_foo_start(V_i,V_j,B) 0.06/0.23 0.06/0.23 0.06/0.23 Computing Bounds 0.06/0.23 ===================================== 0.06/0.23 0.06/0.23 #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): 0.06/0.23 * Chain [[8,9,10,11]]...: 2*it(8)+1*it(10)+1*it(11)+0 0.06/0.23 Such that:it(10) =< -V__0+7 0.06/0.23 0.06/0.23 with precondition: [V__0+1>=V__01,V__0>=1,B=2] 0.06/0.23 0.06/0.23 * Chain [12]: 0 0.06/0.23 with precondition: [B=2,V__0=V__01,0>=V__0] 0.06/0.23 0.06/0.23 0.06/0.23 #### Cost of chains of eval_foo_bb0_in(V_i,B): 0.06/0.23 * Chain [14]: 0 0.06/0.23 with precondition: [0>=V_i] 0.06/0.23 0.06/0.23 * Chain [13]...: 1*s(1)+3*s(2)+0
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