details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	2.07747793198 seconds
cpu usage	2.074183873
max memory	8.0863232E7

stage attributes

key	value
output-size	2740
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES 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, ((1 + x^0) <= 100)> <l2, l3, (101 <= (0 + x^0))> <l3, l1, true> <l4, l1, true, par{x^0 -> 300}> <l5, l4, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (x^0 = 300)> <l1, l1, ((1 + (~(1) + x^0)) <= 100), par{x^0 -> (~(1) + x^0)}> <l1, l1, (101 <= (0 + (~(1) + x^0))), par{x^0 -> (~(1) + x^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, x^0 <= 100, {x^0 -> -1 + x^0, rest remain the same}> <l1, l1, 102 <= x^0, {x^0 -> -1 + x^0, rest remain the same}> Variables: x^0 Precedence: Graph 0 Graph 1 <l0, l1, x^0 = 300, {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: 1.98756 �[33mSome transition disabled by a set of invariant(s):�[0m �[36mInvariant at l1: 101 <= x^0�[0m �[33mStrengthening and disabling transitions...�[0m > It's unfeasible. Removing transition: <l1, l1, x^0 <= 100, {x^0 -> -1 + x^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): <l1, l1, 102 <= x^0, {x^0 -> -1 + x^0, rest remain the same}> popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634