details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	4.15565896034 seconds
cpu usage	4.151034741
max memory	7.845888E7

stage attributes

key	value
output-size	4310
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, l4, true> <l1, l2, true, par{arg1 -> 1, arg2 -> undef2, arg3 -> undef3}> <l2, l3, (arg1 > 0) /\ (arg1 < 100), par{arg2 -> 0, arg3 -> (100 - arg1)}> <l3, l2, (arg3 <= arg2), par{arg1 -> (arg1 + 1), arg2 -> undef8, arg3 -> undef9}> <l3, l3, (arg2 < 100) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (arg2 < 99) /\ (undef13 <= undef14) /\ (arg1 > 0), par{arg2 -> (arg2 + 1), arg3 -> (100 - arg1)}> <l3, l3, (arg2 < 100) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (arg2 < 99) /\ (arg1 > 0) /\ (undef18 > undef19), par{arg2 -> (arg2 + 1), arg3 -> (100 - arg1)}> <l4, l1, true, par{arg1 -> undef20, arg2 -> undef21, arg3 -> undef22}> Fresh variables: undef2, undef3, undef8, undef9, undef13, undef14, undef18, undef19, undef20, undef21, undef22, Undef variables: undef2, undef3, undef8, undef9, undef13, undef14, undef18, undef19, undef20, undef21, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (arg1 = 1) /\ (arg2 = 0) /\ (arg3 = (100 - 1)) /\ (1 > 0) /\ (1 < 100)> <l3, l3, (arg3 <= arg2) /\ ((arg1 + 1) > 0) /\ ((arg1 + 1) < 100), par{arg1 -> (arg1 + 1), arg2 -> 0, arg3 -> (100 - (arg1 + 1))}> <l3, l3, (arg2 < 100) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (arg2 < 99) /\ (undef13 <= undef14) /\ (arg1 > 0), par{arg2 -> (arg2 + 1), arg3 -> (100 - arg1)}> <l3, l3, (arg2 < 100) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (arg2 < 99) /\ (arg1 > 0) /\ (undef18 > undef19), par{arg2 -> (arg2 + 1), arg3 -> (100 - arg1)}> Fresh variables: undef2, undef3, undef8, undef9, undef13, undef14, undef18, undef19, undef20, undef21, undef22, Undef variables: undef2, undef3, undef8, undef9, undef13, undef14, undef18, undef19, undef20, undef21, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 0 <= arg1 /\ arg3 <= arg2 /\ arg1 <= 98, {arg1 -> 1 + arg1, arg2 -> 0, arg3 -> 99 - arg1, rest remain the same}> <l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 0 <= arg2 /\ undef13 <= undef14 /\ arg2 <= 98, {arg2 -> 1 + arg2, arg3 -> 100 - arg1, rest remain the same}> <l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 + undef19 <= undef18 /\ 0 <= arg2 /\ arg2 <= 98, {arg2 -> 1 + arg2, arg3 -> 100 - arg1, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l3, arg2 = 0 /\ arg1 = 1 /\ arg3 = 99, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 4.10085 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011319s popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634