Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738424
details
property
value
status
complete
benchmark
Recursions.jar-obl-13.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.070729970932 seconds
cpu usage
0.067871698
max memory
5181440.0
stage attributes
key
value
output-size
10742
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l8, true> <l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> arg2, arg4 -> undef4, arg5 -> undef5}> <l2, l2, (arg3 > arg2) /\ (arg3 > 0) /\ (undef6 <= arg1) /\ (arg1 > 0) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 + 1), arg4 -> undef9, arg5 -> undef10}> <l2, l3, (arg3 > arg2) /\ (arg3 > 0) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> arg3, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> <l3, l3, (arg2 >= arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0), par{arg1 -> (arg1 + 1), arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> <l3, l4, (arg2 > 0) /\ (arg2 >= arg1), par{arg2 -> 0, arg3 -> (2 * arg1), arg4 -> undef24, arg5 -> undef25}> <l4, l4, (arg1 > ~(1)) /\ (arg3 >= arg2) /\ (arg2 > ~(1)), par{arg2 -> (arg2 + 1), arg4 -> undef29, arg5 -> undef30}> <l4, l5, (arg1 > ~(1)) /\ (arg3 >= arg2) /\ (arg2 > ~(1)), par{arg3 -> (arg1 + arg2), arg4 -> undef34, arg5 -> undef35}> <l5, l5, ((3 * arg2) >= 0) /\ (arg3 > ~(1)) /\ ((2 * arg1) >= 0) /\ (((2 * arg1) + (3 * arg2)) >= 0) /\ ((4 * arg3) >= 0), par{arg3 -> (arg3 - 1), arg4 -> undef39, arg5 -> undef40}> <l5, l6, ((3 * arg2) >= 0) /\ (arg3 > ~(1)) /\ ((2 * arg1) >= 0) /\ (((2 * arg1) + (3 * arg2)) >= 0) /\ ((4 * arg3) >= 0), par{arg4 -> 0, arg5 -> (((2 * arg1) + (3 * arg2)) + (4 * arg3))}> <l6, l6, ((100 * arg2) >= 0) /\ (arg5 >= arg4) /\ ((1000 * arg1) >= 0) /\ ((10 * arg3) >= 0) /\ (((1000 * arg1) + (100 * arg2)) >= 0) /\ (arg3 > ~(1)) /\ ((((1000 * arg1) + (100 * arg2)) + (10 * arg3)) >= 0) /\ (arg4 > ~(1)), par{arg4 -> (arg4 + 1)}> <l6, l7, ((100 * arg2) >= 0) /\ (arg5 >= arg4) /\ ((1000 * arg1) >= 0) /\ ((10 * arg3) >= 0) /\ (((1000 * arg1) + (100 * arg2)) >= 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ ((((1000 * arg1) + (100 * arg2)) + (10 * arg3)) >= 0), par{arg1 -> ((((1000 * arg1) + (100 * arg2)) + (10 * arg3)) + arg4), arg2 -> undef52, arg3 -> undef53, arg4 -> undef54, arg5 -> undef55}> <l7, l7, (arg1 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> undef57, arg3 -> undef58, arg4 -> undef59, arg5 -> undef60}> <l8, l1, true, par{arg1 -> undef61, arg2 -> undef62, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65}> Fresh variables: undef1, undef4, undef5, undef6, undef9, undef10, undef13, undef14, undef15, undef18, undef19, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef52, undef53, undef54, undef55, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, Undef variables: undef1, undef4, undef5, undef6, undef9, undef10, undef13, undef14, undef15, undef18, undef19, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef52, undef53, undef54, undef55, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = undef1) /\ (arg2 = 0) /\ (arg3 = undef62) /\ (arg4 = undef4) /\ (arg5 = undef5) /\ (undef1 <= undef61) /\ (undef62 > ~(1)) /\ (undef61 > 0) /\ (undef1 > 0)> <l2, l2, (arg3 > arg2) /\ (arg3 > 0) /\ (undef6 <= arg1) /\ (arg1 > 0) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 + 1), arg4 -> undef9, arg5 -> undef10}> <l2, l3, (arg3 > arg2) /\ (arg3 > 0) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> arg3, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> <l3, l3, (arg2 >= arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0), par{arg1 -> (arg1 + 1), arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> <l3, l4, (arg2 > 0) /\ (arg2 >= arg1), par{arg2 -> 0, arg3 -> (2 * arg1), arg4 -> undef24, arg5 -> undef25}> <l4, l4, (arg1 > ~(1)) /\ (arg3 >= arg2) /\ (arg2 > ~(1)), par{arg2 -> (arg2 + 1), arg4 -> undef29, arg5 -> undef30}> <l4, l5, (arg1 > ~(1)) /\ (arg3 >= arg2) /\ (arg2 > ~(1)), par{arg3 -> (arg1 + arg2), arg4 -> undef34, arg5 -> undef35}> <l5, l5, ((3 * arg2) >= 0) /\ (arg3 > ~(1)) /\ ((2 * arg1) >= 0) /\ (((2 * arg1) + (3 * arg2)) >= 0) /\ ((4 * arg3) >= 0), par{arg3 -> (arg3 - 1), arg4 -> undef39, arg5 -> undef40}> <l5, l6, ((3 * arg2) >= 0) /\ (arg3 > ~(1)) /\ ((2 * arg1) >= 0) /\ (((2 * arg1) + (3 * arg2)) >= 0) /\ ((4 * arg3) >= 0), par{arg4 -> 0, arg5 -> (((2 * arg1) + (3 * arg2)) + (4 * arg3))}> <l6, l6, ((100 * arg2) >= 0) /\ (arg5 >= arg4) /\ ((1000 * arg1) >= 0) /\ ((10 * arg3) >= 0) /\ (((1000 * arg1) + (100 * arg2)) >= 0) /\ (arg3 > ~(1)) /\ ((((1000 * arg1) + (100 * arg2)) + (10 * arg3)) >= 0) /\ (arg4 > ~(1)), par{arg4 -> (arg4 + 1)}> <l6, l7, ((100 * arg2) >= 0) /\ (arg5 >= arg4) /\ ((1000 * arg1) >= 0) /\ ((10 * arg3) >= 0) /\ (((1000 * arg1) + (100 * arg2)) >= 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ ((((1000 * arg1) + (100 * arg2)) + (10 * arg3)) >= 0), par{arg1 -> ((((1000 * arg1) + (100 * arg2)) + (10 * arg3)) + arg4), arg2 -> undef52, arg3 -> undef53, arg4 -> undef54, arg5 -> undef55}> <l7, l7, (arg1 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> undef57, arg3 -> undef58, arg4 -> undef59, arg5 -> undef60}> Fresh variables: undef1, undef4, undef5, undef6, undef9, undef10, undef13, undef14, undef15, undef18, undef19, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef52, undef53, undef54, undef55, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, Undef variables: undef1, undef4, undef5, undef6, undef9, undef10, undef13, undef14, undef15, undef18, undef19, undef20, undef24, undef25, undef29, undef30, undef34, undef35, undef39, undef40, undef52, undef53, undef54, undef55, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg3 /\ 1 <= undef6 /\ undef6 <= arg1, {arg1 -> undef6, arg2 -> 1 + arg2, arg4 -> undef9, arg5 -> undef10, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Graph 2: Transitions: <l3, l3, 1 <= arg2 /\ arg1 <= arg2 /\ 0 <= arg1, {arg1 -> 1 + arg1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Graph 3: Transitions: <l4, l4, 0 <= arg1 /\ arg2 <= arg3 /\ 0 <= arg2, {arg2 -> 1 + arg2, arg4 -> undef29, arg5 -> undef30, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634