details

property	value
status	complete
benchmark	NoriSharma-FSE2013-Fig8_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n074.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0513029098511 seconds
cpu usage	0.038466676
max memory	7507968.0

stage attributes

key	value
output-size	6922
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_z -> ¿functionCall(__VERIFIER_nondet_int), main_u -> main_x, main_v -> main_y, main_w -> main_z, main_c -> 0}> <l1, l2, true> <l2, l10, not((main_x >= main_y))> <l2, l3, (main_x >= main_y)> <l3, l4, true, seq{main_c -> (main_c + 1)}> <l4, l5, (main_z > 1)> <l4, l7, not((main_z > 1))> <l5, l6, true, seq{main_z -> (main_z - 1), main_x -> (main_x + main_z)}> <l6, l9, true> <l7, l8, true, seq{main_y -> (main_y + 1)}> <l8, l9, true> <l9, l2, true> <l10, l11, 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, l12, true, seq{main__func_return_ -> 0}> <l12, l13, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l13, l14, true, seq{main_x -> varCall_1}> <l14, l15, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l15, l16, true, seq{main_y -> varCall_2}> <l16, l17, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}> <l17, l1, true, seq{main_z -> varCall_3, main_u -> main_x, main_v -> main_y, main_w -> main_z, main_c -> 0}> <l1, l2, true> <l2, l3, (main_x >= main_y)> <l2, l10, not((main_x >= main_y))> <l3, l4, true, seq{main_c -> (main_c + 1)}> <l4, l5, (main_z > 1)> <l4, l7, not((main_z > 1))> <l5, l6, true, seq{main_z -> (main_z - 1), main_x -> (main_x + main_z)}> <l6, l9, true> <l7, l8, true, seq{main_y -> (main_y + 1)}> <l8, l9, true> <l9, l2, true> <l10, l11, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 11, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [9 idents]: popout

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

job log

popout

actions

all output return to C Integ Progr 58257