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