details

property	value
status	complete
benchmark	LeikeHeizmann-TACAS2014-Fig1_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.175050973892 seconds
cpu usage	0.398677171
max memory	3.6610048E7

stage attributes

key	value
output-size	11430
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_q -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> <l1, l2, true> <l2, l5, not((main_q > 0))> <l2, l3, (main_q > 0)> <l3, l4, true, seq{main_q -> (main_q - main_y), main_y -> (main_y + 1)}> <l4, l2, true> <l5, l6, 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, l7, true, seq{main__func_return_ -> 0}> <l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l8, l9, true, seq{main_q -> varCall_1}> <l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l10, l1, true, seq{main_y -> varCall_2}> <l1, l2, true> <l2, l3, (main_q > 0)> <l2, l5, not((main_q > 0))> <l3, l4, true, seq{main_q -> (main_q - main_y), main_y -> (main_y + 1)}> <l4, l2, true> <l5, l6, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, 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 [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6> main | function | [integer, ()] | <line: 13, col: 1> q | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 17, col: 9> <line: 18, col: 3> <line: 18, col: 7> y | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 18, col: 11> <line: 19, col: 3> <line: 19, col: 7> Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (main_q = undef3) /\ (main_y = undef4)> <l2, l2, (main_q > 0), par{main_q -> (main_q - main_y), main_y -> (main_y + 1)}> <l2, l6, not((main_q > 0))> Fresh variables: popout

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

job log

popout

actions

all output return to C Integ Progr 58257