Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer 2019-03-28 22.15 pair #432272145
details
property
value
status
complete
benchmark
DivWithoutMinus.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n068.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
31.7588 seconds
cpu usage
67.17
user time
62.69
system time
4.48
max virtual memory
6103092.0
max residence set size
217712.0
stage attributes
key
value
starexec-result
NO
output
67.17/31.75 NO 67.17/31.75 67.17/31.75 Solver Timeout: 4 67.17/31.75 Global Timeout: 300 67.17/31.75 Maximum number of concurrent processes: 900 67.17/31.75 /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: warning: '&&' within '||' 67.17/31.75 while (z > 0 && (y == 0 || y > 0 && x > 0)) { 67.17/31.75 ~~ ~~~~~~^~~~~~~~ 67.17/31.75 /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: note: place parentheses around the '&&' expression to silence this warning 67.17/31.75 while (z > 0 && (y == 0 || y > 0 && x > 0)) { 67.17/31.75 ^ 67.17/31.75 ( ) 67.17/31.75 1 warning generated. 67.17/31.75 /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: warning: '&&' within '||' 67.17/31.75 while (z > 0 && (y == 0 || y > 0 && x > 0)) { 67.17/31.75 ~~ ~~~~~~^~~~~~~~ 67.17/31.75 /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: note: place parentheses around the '&&' expression to silence this warning 67.17/31.75 while (z > 0 && (y == 0 || y > 0 && x > 0)) { 67.17/31.75 ^ 67.17/31.75 ( ) 67.17/31.75 2 warnings generated. 67.17/31.75 ******************************************************************************************* 67.17/31.75 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 67.17/31.75 ******************************************************************************************* 67.17/31.75 67.17/31.75 67.17/31.75 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 67.17/31.75 67.17/31.75 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 67.17/31.75 + + 67.17/31.75 Init Location: 0 67.17/31.75 Transitions: 67.17/31.75 <l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> main_y, main_res -> 0}> 67.17/31.75 <l1, l2, true> 67.17/31.75 <l2, l12, not((main_z > 0))> 67.17/31.75 <l2, l3, (main_z > 0)> 67.17/31.75 <l3, l4, not((main_y = 0))> 67.17/31.75 <l3, l6, (main_y = 0)> 67.17/31.75 <l4, l12, not((main_y > 0))> 67.17/31.75 <l4, l5, (main_y > 0)> 67.17/31.75 <l5, l12, not((main_x > 0))> 67.17/31.75 <l5, l6, (main_x > 0)> 67.17/31.75 <l6, l7, (main_y = 0)> 67.17/31.75 <l6, l9, not((main_y = 0))> 67.17/31.75 <l7, l8, true, seq{main_res -> (main_res + 1), main_y -> main_z}> 67.17/31.75 <l8, l11, true> 67.17/31.75 <l9, l10, true, seq{main_x -> (main_x + 1), main_y -> (main_y - 1)}> 67.17/31.75 <l10, l11, true> 67.17/31.75 <l11, l2, true> 67.17/31.75 <l12, l13, true, seq{main__func_return_ -> 0}> 67.17/31.75 67.17/31.75 Fresh variables: 67.17/31.75 67.17/31.75 Undef variables: 67.17/31.75 67.17/31.75 Abstraction variables: 67.17/31.75 67.17/31.75 Exit nodes: 67.17/31.75 67.17/31.75 Accepting locations: 67.17/31.75 67.17/31.75 Asserts: 67.17/31.75 67.17/31.75 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 67.17/31.75 67.17/31.75 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 67.17/31.75 67.17/31.75 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 67.17/31.75 67.17/31.75 Init Location: 0 67.17/31.75 Transitions: 67.17/31.75 <l0, l14, true, seq{main__func_return_ -> 0}> 67.17/31.75 <l14, l15, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> 67.17/31.75 <l15, l16, true, seq{main_x -> varCall_1}> 67.17/31.75 <l16, l17, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> 67.17/31.75 <l17, l1, true, seq{main_y -> varCall_2, main_z -> main_y, main_res -> 0}> 67.17/31.75 <l1, l2, true> 67.17/31.75 <l2, l3, (main_z > 0)> 67.17/31.75 <l2, l12, not((main_z > 0))> 67.17/31.75 <l3, l6, (main_y = 0)> 67.17/31.75 <l3, l4, not((main_y = 0))> 67.17/31.75 <l4, l5, (main_y > 0)> 67.17/31.75 <l4, l12, not((main_y > 0))> 67.17/31.75 <l5, l6, (main_x > 0)> 67.17/31.75 <l5, l12, not((main_x > 0))> 67.17/31.75 <l6, l7, (main_y = 0)> 67.17/31.75 <l6, l9, not((main_y = 0))> 67.17/31.75 <l7, l8, true, seq{main_res -> (main_res + 1), main_y -> main_z}> 67.17/31.75 <l8, l11, true> 67.17/31.75 <l9, l10, true, seq{main_x -> (main_x + 1), main_y -> (main_y - 1)}> 67.17/31.75 <l10, l11, true> 67.17/31.75 <l11, l2, true> 67.17/31.75 <l12, l13, true, seq{main__func_return_ -> 0}> 67.17/31.75 67.17/31.75 Fresh variables: 67.17/31.75 67.17/31.75 Undef variables: 67.17/31.75 67.17/31.75 Abstraction variables: 67.17/31.75
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer 2019-03-28 22.15