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	n045.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	27.3373 seconds
cpu usage	60.2071
user time	54.0006
system time	6.20649
max virtual memory	4357520.0
max residence set size	251800.0

stage attributes

key	value
starexec-result	NO

output

60.17/27.33 NO 60.17/27.33 60.17/27.33 Solver Timeout: 4 60.17/27.33 Global Timeout: 300 60.17/27.33 Maximum number of concurrent processes: 900 60.17/27.33 ******************************************************************************************* 60.17/27.33 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 60.17/27.33 ******************************************************************************************* 60.17/27.33 60.17/27.33 60.17/27.33 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 60.17/27.33 60.17/27.33 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 60.17/27.33 + + 60.17/27.33 Init Location: 0 60.17/27.33 Transitions: 60.17/27.33 <l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> main_i}> 60.17/27.33 <l1, l2, true> 60.17/27.33 <l2, l34, not((main_i > 0))> 60.17/27.33 <l2, l3, (main_i > 0)> 60.17/27.33 <l3, l4, (main_i >= main_j)> 60.17/27.33 <l3, l16, not((main_i >= main_j))> 60.17/27.33 <l4, l5, true, seq{main_i -> (main_i + 1)}> 60.17/27.33 <l5, l6, (main_j < 5)> 60.17/27.33 <l5, l13, not((main_j < 5))> 60.17/27.33 <l6, l7, true, seq{main_j -> (main_j + 1)}> 60.17/27.33 <l7, l8, ((main_i - main_j) > 2)> 60.17/27.33 <l7, l10, not(((main_i - main_j) > 2))> 60.17/27.33 <l8, l9, true, seq{main_i -> (main_i + 1)}> 60.17/27.33 <l9, l12, true> 60.17/27.33 <l10, l11, true, seq{main_j -> (main_j + 1)}> 60.17/27.33 <l11, l12, true> 60.17/27.33 <l12, l15, true> 60.17/27.33 <l13, l14, true, seq{main_j -> (main_j - 1)}> 60.17/27.33 <l14, l15, true> 60.17/27.33 <l15, l33, true> 60.17/27.33 <l16, l25, not((main_i > 0))> 60.17/27.33 <l16, l17, (main_i > 0)> 60.17/27.33 <l17, l18, (main_j < 0)> 60.17/27.33 <l17, l25, not((main_j < 0))> 60.17/27.33 <l18, l19, true, seq{main_i -> (main_i - 1)}> 60.17/27.33 <l19, l20, (main_j < ~(1))> 60.17/27.33 <l19, l22, not((main_j < ~(1)))> 60.17/27.33 <l20, l21, true, seq{main_j -> (main_j + 1)}> 60.17/27.33 <l21, l24, true> 60.17/27.33 <l22, l23, true, seq{main_i -> (main_i + 1)}> 60.17/27.33 <l23, l24, true> 60.17/27.33 <l24, l32, true> 60.17/27.33 <l25, l26, true, seq{main_i -> (main_i + 1)}> 60.17/27.33 <l26, l27, ((main_j * 2) > main_i)> 60.17/27.33 <l26, l29, not(((main_j * 2) > main_i))> 60.17/27.33 <l27, l28, true, seq{main_j -> (main_j - 1)}> 60.17/27.33 <l28, l31, true> 60.17/27.33 <l29, l30, true, seq{main_j -> (main_j + 1)}> 60.17/27.33 <l30, l31, true> 60.17/27.33 <l31, l32, true> 60.17/27.33 <l32, l33, true> 60.17/27.33 <l33, l2, true> 60.17/27.33 <l34, l35, true, seq{main__func_return_ -> 0}> 60.17/27.33 60.17/27.33 Fresh variables: 60.17/27.33 60.17/27.33 Undef variables: 60.17/27.33 60.17/27.33 Abstraction variables: 60.17/27.33 60.17/27.33 Exit nodes: 60.17/27.33 60.17/27.33 Accepting locations: 60.17/27.33 60.17/27.33 Asserts: 60.17/27.33 60.17/27.33 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 60.17/27.33 60.17/27.33 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 60.17/27.33 60.17/27.33 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 60.17/27.33 60.17/27.33 Init Location: 0 60.17/27.33 Transitions: 60.17/27.33 <l0, l36, true, seq{main__func_return_ -> 0}> 60.17/27.33 <l36, l37, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> 60.17/27.33 <l37, l1, true, seq{main_i -> varCall_1, main_j -> main_i}> 60.17/27.33 <l1, l2, true> 60.17/27.33 <l2, l3, (main_i > 0)> 60.17/27.33 <l2, l34, not((main_i > 0))> 60.17/27.33 <l3, l4, (main_i >= main_j)> 60.17/27.33 <l3, l16, not((main_i >= main_j))> 60.17/27.33 <l4, l5, true, seq{main_i -> (main_i + 1)}> 60.17/27.33 <l5, l6, (main_j < 5)> 60.17/27.33 <l5, l13, not((main_j < 5))> 60.17/27.33 <l6, l7, true, seq{main_j -> (main_j + 1)}> 60.17/27.33 <l7, l8, ((main_i - main_j) > 2)> 60.17/27.33 <l7, l10, not(((main_i - main_j) > 2))> 60.17/27.33 <l8, l9, true, seq{main_i -> (main_i + 1)}> 60.17/27.33 <l9, l12, true> 60.17/27.33 <l10, l11, true, seq{main_j -> (main_j + 1)}> 60.17/27.33 <l11, l12, true> 60.17/27.33 <l12, l15, true> 60.17/27.33 <l13, l14, true, seq{main_j -> (main_j - 1)}> 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