Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738712
details
property
value
status
complete
benchmark
Parts.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n025.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.121325016022 seconds
cpu usage
0.117492803
max memory
1.1341824E7
stage attributes
key
value
output-size
11909
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, l8, true> <l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> arg2, arg4 -> undef4}> <l2, l3, (arg3 >= arg2) /\ (arg3 > ~(1)) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg3 -> 0, arg4 -> arg3}> <l3, l2, (arg3 > arg4) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> (arg2 + 1), arg3 -> arg4, arg4 -> undef12}> <l3, l4, (arg4 >= arg2) /\ (arg4 >= arg3) /\ (arg1 > 0), par{arg1 -> arg3, arg3 -> undef15, arg4 -> undef16}> <l3, l3, (arg4 > ~(1)) /\ (arg4 >= arg3) /\ (undef17 <= arg1) /\ (arg1 > 0) /\ (undef17 > 0) /\ (0 = arg2), par{arg1 -> undef17, arg2 -> 0, arg3 -> (arg3 + 1)}> <l3, l3, (arg4 >= arg2) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (arg1 > 0) /\ (undef21 > 0) /\ (0 = arg3), par{arg1 -> undef21, arg3 -> 1}> <l5, l3, (undef25 <= arg1) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg3 -> (arg3 + 1)}> <l3, l3, (arg4 >= arg2) /\ (arg4 >= arg3) /\ (arg4 > ~(1)) /\ (undef29 <= arg1) /\ (arg1 > 0) /\ (undef29 > 0), par{arg1 -> undef29, arg3 -> (arg3 + 1)}> <l4, l4, (arg2 > 0) /\ (arg2 < arg1) /\ (arg1 > 1), par{arg1 -> arg2, arg3 -> undef35, arg4 -> undef36}> <l4, l4, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg2 -> (arg2 - arg1), arg3 -> undef39, arg4 -> undef40}> <l4, l6, (arg2 > 0) /\ (arg1 > 0) /\ ((arg2 - arg1) = 0) /\ (arg2 >= arg1), par{arg3 -> (arg1 - 1), arg4 -> undef44}> <l7, l6, (arg2 > 0), par{arg1 -> arg2, arg2 -> arg1, arg3 -> (arg2 - 1), arg4 -> undef48}> <l4, l6, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg3 -> (arg1 - 1), arg4 -> undef52}> <l6, l4, (arg2 > 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ (arg3 < arg1), par{arg1 -> arg3, arg3 -> undef55, arg4 -> undef56}> <l4, l4, (arg2 > 0) /\ (arg1 > 1) /\ (arg2 >= arg1) /\ ((arg1 - 1) < arg1) /\ (undef62 > 0), par{arg1 -> (arg1 - 1), arg3 -> undef60, arg4 -> undef61}> <l8, l1, true, par{arg1 -> undef63, arg2 -> undef64, arg3 -> undef65, arg4 -> undef66}> Fresh variables: undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, Undef variables: undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (arg1 = undef5) /\ (arg2 = 0) /\ (arg3 = 0) /\ (arg4 = undef64) /\ (undef1 <= undef63) /\ (undef64 > ~(1)) /\ (undef63 > 0) /\ (undef1 > 0) /\ (undef64 >= 0) /\ (undef64 > ~(1)) /\ (undef5 <= undef1) /\ (undef1 > 0) /\ (undef5 > 0)> <l3, l3, (arg3 > arg4) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ (arg4 >= (arg2 + 1)) /\ (arg4 > ~(1)) /\ (undef5 <= undef9) /\ (undef9 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> arg4}> <l3, l4, (arg4 >= arg2) /\ (arg4 >= arg3) /\ (arg1 > 0), par{arg1 -> arg3, arg3 -> undef15, arg4 -> undef16}> <l3, l3, (arg4 > ~(1)) /\ (arg4 >= arg3) /\ (undef17 <= arg1) /\ (arg1 > 0) /\ (undef17 > 0) /\ (0 = arg2), par{arg1 -> undef17, arg2 -> 0, arg3 -> (arg3 + 1)}> <l3, l3, (arg4 >= arg2) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (arg1 > 0) /\ (undef21 > 0) /\ (0 = arg3), par{arg1 -> undef21, arg3 -> 1}> <l3, l3, (arg4 >= arg2) /\ (arg4 >= arg3) /\ (arg4 > ~(1)) /\ (undef29 <= arg1) /\ (arg1 > 0) /\ (undef29 > 0), par{arg1 -> undef29, arg3 -> (arg3 + 1)}> <l4, l4, (arg2 > 0) /\ (arg2 < arg1) /\ (arg1 > 1), par{arg1 -> arg2, arg3 -> undef35, arg4 -> undef36}> <l4, l4, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg2 -> (arg2 - arg1), arg3 -> undef39, arg4 -> undef40}> <l4, l4, (arg2 > 0) /\ (arg1 > 0) /\ ((arg2 - arg1) = 0) /\ (arg2 >= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> undef55, arg4 -> undef56}> <l4, l4, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> undef55, arg4 -> undef56}> <l4, l4, (arg2 > 0) /\ (arg1 > 1) /\ (arg2 >= arg1) /\ ((arg1 - 1) < arg1) /\ (undef62 > 0), par{arg1 -> (arg1 - 1), arg3 -> undef60, arg4 -> undef61}> Fresh variables: undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, Undef variables: undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg4 /\ 1 + arg4 <= arg3 /\ 1 <= undef5 /\ 1 <= undef9 /\ undef9 <= arg1 /\ 0 <= arg4 /\ undef5 <= undef9, {arg1 -> undef5, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> <l3, l3, 1 <= arg1 /\ 1 <= undef17 /\ undef17 <= arg1 /\ arg3 <= arg4 /\ 0 <= arg4 /\ arg2 = 0, {arg1 -> undef17, arg2 -> 0, arg3 -> 1 + arg3, rest remain the same}> <l3, l3, 1 <= arg1 /\ 1 <= undef21 /\ undef21 <= arg1 /\ arg2 <= arg4 /\ 0 <= arg4 /\ arg3 = 0, {arg1 -> undef21, arg3 -> 1, rest remain the same}> <l3, l3, 1 <= arg1 /\ 1 <= undef29 /\ undef29 <= arg1 /\ arg2 <= arg4 /\ arg3 <= arg4 /\ 0 <= arg4, {arg1 -> undef29, arg3 -> 1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: <l4, l4, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1, {arg1 -> arg2, arg3 -> undef35, arg4 -> undef36, rest remain the same}> <l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ arg1 <= arg2, {arg2 -> -arg1 + arg2, arg3 -> undef39, arg4 -> undef40, rest remain the same}> <l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef57 /\ arg1 = arg2, {arg1 -> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}> <l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef57 /\ arg1 <= arg2, {arg1 -> -1 + arg1, arg3 -> undef55, arg4 -> undef56, 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