details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	5.0177090168 seconds
cpu usage	8.425262114
max memory	4.6467072E8

stage attributes

key	value
output-size	7569
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, l3, true> <l1, l2, (undef3 > 0) /\ (arg2 > ~(1)) /\ ((undef1 - 1) <= arg1) /\ ((undef2 - 3) <= arg1) /\ (arg1 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> <l1, l2, ((undef4 - 3) <= arg1) /\ (arg2 > ~(1)) /\ ((undef5 - 1) <= arg1) /\ (arg1 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> <l2, l2, (arg1 >= undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}> <l2, l2, ((undef10 - 3) <= arg1) /\ ((undef10 - 3) <= arg2) /\ (undef11 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> <l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef3 > 0) /\ (undef14 > ~(1)) /\ ((undef1 - 1) <= undef13) /\ ((undef2 - 3) <= undef13) /\ (undef13 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> <l0, l2, ((undef4 - 3) <= undef13) /\ (undef14 > ~(1)) /\ ((undef5 - 1) <= undef13) /\ (undef13 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> <l2, l2, (arg1 >= undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}> <l2, l2, ((undef10 - 3) <= arg1) /\ ((undef10 - 3) <= arg2) /\ (undef11 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}> <l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ undef5 <= 1 + undef13 /\ undef4 <= 3 + undef13 /\ 2 <= undef5 /\ 4 <= undef4, {arg1 -> undef4, arg2 -> undef5, arg3 -> 0, 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.008695 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002238s popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634