details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	3.97638106346 seconds
cpu usage	8.1439206
max memory	7.00080128E8

stage attributes

key	value
output-size	5221
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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_i -> 0}> <l1, l2, true> <l2, l9, not((main_i < 100))> <l2, l3, (main_i < 100)> <l3, l4, (main_i < 50)> <l3, l6, not((main_i < 50))> <l4, l5, true, seq{main_i -> (main_i + 1)}> <l5, l8, true> <l6, l7, true, seq{main_i -> (main_i - 1)}> <l7, l8, true> <l8, l2, true> <l9, l10, 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, l1, true, seq{main__func_return_ -> 0, main_i -> 0}> <l1, l2, true> <l2, l3, (main_i < 100)> <l2, l9, not((main_i < 100))> <l3, l4, (main_i < 50)> <l3, l6, not((main_i < 50))> <l4, l5, true, seq{main_i -> (main_i + 1)}> <l5, l8, true> <l6, l7, true, seq{main_i -> (main_i - 1)}> <l7, l8, true> <l8, l2, true> <l9, l10, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 10, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [3 idents]: __VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> main | function | [integer, ()] | <line: 5, col: 1> i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 13> <line: 10, col: 23> <line: 10, col: 27> <line: 11, col: 16> <line: 11, col: 20> Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (main_i = 0)> <l2, l2, (main_i < 100) /\ (main_i < 50), par{main_i -> (main_i + 1)}> popout

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

job log

popout

actions

all output return to C Integ Progr 58257