details

property	value
status	complete
benchmark	Et4-rec.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n030.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	10.5987229347 seconds
cpu usage	35.013800992
max memory	3.96271616E8

stage attributes

key	value
output-size	27495
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l3, true> <l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}> <l1, l2, (arg1 > 0) /\ (undef6 > ~(1)) /\ (1 = arg2), par{arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1}> <l1, l2, (undef13 > ~(1)) /\ (undef11 > ~(1)) /\ (arg1 > 0) /\ (2 = arg2), par{arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2}> <l1, l2, (undef16 > ~(1)) /\ (arg2 > 2) /\ (undef21 > ~(1)) /\ (undef17 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef16, arg2 -> undef17, arg3 -> (undef21 - undef17), arg4 -> arg2, arg5 -> 3}> <l2, l2, ((arg1 + 1) > arg1) /\ (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg1 = arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (10 - (arg1 + 1))}> <l2, l2, (arg3 > 0) /\ (((arg1 + 1) + undef32) >= 1) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > ~(1)) /\ (undef32 > ~(1)) /\ (arg1 = arg2), par{arg1 -> ((arg1 + 1) + undef32), arg2 -> ((arg1 + 1) + undef32), arg3 -> (10 - ((arg1 + 1) + undef32)), arg5 -> (arg5 + 1)}> <l3, l1, true, par{arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> Fresh variables: undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, Undef variables: undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef33 > 0) /\ (0 = undef34), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}> <l0, l2, (undef33 > 0) /\ (undef6 > ~(1)) /\ (1 = undef34), par{arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1}> <l0, l2, (undef13 > ~(1)) /\ (undef11 > ~(1)) /\ (undef33 > 0) /\ (2 = undef34), par{arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2}> <l0, l2, (undef16 > ~(1)) /\ (undef34 > 2) /\ (undef21 > ~(1)) /\ (undef17 > ~(1)) /\ (undef33 > 0), par{arg1 -> undef16, arg2 -> undef17, arg3 -> (undef21 - undef17), arg4 -> undef34, arg5 -> 3}> <l2, l2, ((arg1 + 1) > arg1) /\ (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg1 = arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (10 - (arg1 + 1))}> <l2, l2, (arg3 > 0) /\ (((arg1 + 1) + undef32) >= 1) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > ~(1)) /\ (undef32 > ~(1)) /\ (arg1 = arg2), par{arg1 -> ((arg1 + 1) + undef32), arg2 -> ((arg1 + 1) + undef32), arg3 -> (10 - ((arg1 + 1) + undef32)), arg5 -> (arg5 + 1)}> Fresh variables: undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, Undef variables: undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 0 <= arg1 /\ arg4 <= arg5 /\ 0 <= arg4 /\ 1 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> <l2, l2, 0 <= arg1 /\ 0 <= arg1 + undef32 /\ 0 <= arg4 /\ 0 <= arg5 /\ 0 <= undef32 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ arg1 = arg2, {arg1 -> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef33 /\ undef34 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> <l0, l2, 0 <= undef6 /\ 1 <= undef33 /\ undef34 = 1, {arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1, rest remain the same}> <l0, l2, 0 <= undef11 /\ 0 <= undef13 /\ 1 <= undef33 /\ undef34 = 2, {arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> <l0, l2, 0 <= undef16 /\ 0 <= undef17 /\ 0 <= undef21 /\ 1 <= undef33 /\ 3 <= undef34, {arg1 -> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.012475 popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634