details

property	value
status	complete
benchmark	consts1nt.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n029.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	16.6422688961 seconds
cpu usage	37.132245506
max memory	2.54291968E8

stage attributes

key	value
output-size	5769
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l5, true> <l1, l2, true, par{x^0 -> (~(1) + x^0)}> <l2, l3, (undef5 = __disjvr_0^0) /\ (__disjvr_0^0 = undef5), par{__disjvr_0^0 -> undef5}> <l3, l1, true> <l4, l1, true, par{x^0 -> (0 + __const_100^0)}> <l5, l4, true> Fresh variables: undef5, Undef variables: undef5, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (x^0 = (0 + __const_100^0))> <l1, l1, (undef5 = __disjvr_0^0) /\ (__disjvr_0^0 = undef5), par{__disjvr_0^0 -> undef5, x^0 -> (~(1) + x^0)}> Fresh variables: undef5, Undef variables: undef5, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, __disjvr_0^0 = undef5, {__disjvr_0^0 -> undef5, x^0 -> -1 + x^0, rest remain the same}> Variables: __disjvr_0^0, x^0 Precedence: Graph 0 Graph 1 <l0, l1, __const_100^0 = x^0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001768 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000487s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001392s [11785 : 11786] popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634