details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0409989356995 seconds
cpu usage	0.037244711
max memory	4657152.0

stage attributes

key	value
output-size	4615
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, l5, true> <l1, l2, true, par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> <l2, l3, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l3, l3, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2)}> <l3, l4, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l4, l4, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 3), arg3 -> (arg2 + 3)}> <l5, l1, true, par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}> Fresh variables: undef19, undef20, undef21, Undef variables: undef19, undef20, undef21, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = 0)> <l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> <l2, l3, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l3, l3, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2)}> <l3, l4, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l4, l4, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 3), arg3 -> (arg2 + 3)}> Fresh variables: undef19, undef20, undef21, Undef variables: undef19, undef20, undef21, 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 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: <l3, l3, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Graph 3: Transitions: <l4, l4, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 3 + arg2, arg3 -> 3 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l2, arg1 = 0 /\ arg2 = 0 /\ arg3 = 0, {all remain the same}> Graph 2 <l2, l3, 1001 <= arg2 /\ arg2 = arg3, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}> Graph 3 <l3, l4, 1001 <= arg2 /\ arg2 = arg3, {arg1 -> 0, arg2 -> 0, arg3 -> 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