details

property	value
status	complete
benchmark	DivMinus2.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n020.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0612778663635 seconds
cpu usage	0.05815239
max memory	7241728.0

stage attributes

key	value
output-size	8747
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: <l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_res -> 0}> <l1, l2, true> <l2, l15, not((main_x >= main_y))> <l2, l3, (main_x >= main_y)> <l3, l15, not((main_y > 0))> <l3, l4, (main_y > 0)> <l4, l5, true, seq{main_ytmp -> main_y}> <l5, l6, true> <l6, l13, (main_ytmp = 0)> <l6, l7, not((main_ytmp = 0))> <l7, l8, (main_ytmp > 0)> <l7, l10, not((main_ytmp > 0))> <l8, l9, true, seq{main_ytmp -> (main_ytmp - 1), main_x -> (main_x - 1)}> <l9, l12, true> <l10, l11, true, seq{main_ytmp -> (main_ytmp + 1), main_x -> (main_x + 1)}> <l11, l12, true> <l12, l6, true> <l13, l14, true, seq{main_res -> (main_res + 1)}> <l14, l2, true> <l15, l16, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: <l0, l17, true, seq{main__func_return_ -> 0}> <l17, l18, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l18, l19, true, seq{main_x -> varCall_1}> <l19, l20, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l20, l1, true, seq{main_y -> varCall_2, main_res -> 0}> <l1, l2, true> <l2, l3, (main_x >= main_y)> <l2, l15, not((main_x >= main_y))> <l3, l4, (main_y > 0)> <l3, l15, not((main_y > 0))> <l4, l5, true, seq{main_ytmp -> main_y}> <l5, l6, true> <l6, l13, (main_ytmp = 0)> <l6, l7, not((main_ytmp = 0))> <l7, l8, (main_ytmp > 0)> <l7, l10, not((main_ytmp > 0))> <l8, l9, true, seq{main_ytmp -> (main_ytmp - 1), main_x -> (main_x - 1)}> <l9, l12, true> <l10, l11, true, seq{main_ytmp -> (main_ytmp + 1), main_x -> (main_x + 1)}> <l11, l12, true> <l12, l6, true> <l13, l14, true, seq{main_res -> (main_res + 1)}> <l14, l2, true> <l15, l16, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 16, Accepting locations: Asserts: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to C Integ Progr 58257