details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	16.948777914 seconds
cpu usage	37.930581926
max memory	4.69823488E8

stage attributes

key	value
output-size	11464
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l4, true> <l1, l2, (1 <= (0 + x^0)) /\ ((1 + y^0) <= 0), par{x^0 -> ((0 + x^0) + (~(1) * y^0))}> <l2, l1, true> <l3, l1, true> <l4, l3, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, true> <l1, l1, (1 <= (0 + x^0)) /\ ((1 + y^0) <= 0), par{x^0 -> ((0 + x^0) + (~(1) * y^0))}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, 1 <= x^0 /\ 1 + y^0 <= 0, {x^0 -> x^0 - y^0, rest remain the same}> Variables: x^0, y^0 Precedence: Graph 0 Graph 1 <l0, l1, true, {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.00178 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000544s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001809s [63486 : 63487] [63486 : 63488] Successful child: 63487 [ Invariant Graph ] �[33mStrengthening and disabling transitions...�[0m popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634