details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	13.4825661182 seconds
cpu usage	33.903388969
max memory	8.29546496E8

stage attributes

key	value
output-size	5363
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, l4, true> <l1, l2, (undef1 = (300 + x^0)) /\ (101 <= (0 + undef1)), par{x^0 -> undef1}> <l2, l1, (undef2 = (400 + x^0)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}> <l3, l1, (undef3 = (200 + x^0)) /\ (101 <= (0 + undef3)), par{x^0 -> undef3}> <l3, l2, (undef4 = (100 + x^0)) /\ (101 <= (0 + undef4)), par{x^0 -> undef4}> <l4, l3, true> Fresh variables: undef1, undef2, undef3, undef4, Undef variables: undef1, undef2, undef3, undef4, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (undef3 = (200 + x^0)) /\ (101 <= (0 + undef3)), par{x^0 -> undef3}> <l0, l1, (undef4 = (100 + x^0)) /\ (101 <= (0 + undef4)) /\ (undef2 = (400 + undef4)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}> <l1, l1, (undef1 = (300 + x^0)) /\ (101 <= (0 + undef1)) /\ (undef2 = (400 + undef1)) /\ (101 <= (0 + undef2)), par{x^0 -> undef2}> Fresh variables: undef1, undef2, undef3, undef4, Undef variables: undef1, undef2, undef3, undef4, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, 101 <= undef1 /\ 101 <= undef2 /\ 300 + x^0 = undef1 /\ 400 + undef1 = undef2, {x^0 -> undef2, rest remain the same}> Variables: x^0 Precedence: Graph 0 Graph 1 <l0, l1, 101 <= undef3 /\ 200 + x^0 = undef3, {x^0 -> undef3, rest remain the same}> <l0, l1, 101 <= undef2 /\ 101 <= undef4 /\ 100 + x^0 = undef4 /\ undef2 = 400 + undef4, {x^0 -> undef2, rest 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.001964 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000707s LOG: CALL solveLinear popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634