Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737788
details
property
value
status
complete
benchmark
BTree.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0997049808502 seconds
cpu usage
0.095047158
max memory
8196096.0
stage attributes
key
value
output-size
6819
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, l6, true> <l1, l2, (undef1 > 2), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> <l1, l2, (undef4 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> undef6}> <l1, l3, true, par{arg1 -> 5, arg2 -> 5, arg3 -> 5}> <l3, l3, ((arg2 - 1) < arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (arg2 = arg3), par{arg1 -> (arg2 - 1), arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> <l3, l4, ((arg2 - 1) < arg2) /\ (arg2 > 1) /\ (undef14 > 4) /\ (arg1 > 0) /\ (arg2 = arg3), par{arg2 -> undef14, arg3 -> (arg2 - 1)}> <l3, l4, ((arg2 - 1) < arg2) /\ (arg2 > 1) /\ (undef17 > 3) /\ (arg1 > 0) /\ (arg2 = arg3), par{arg2 -> undef17, arg3 -> (arg2 - 1)}> <l4, l3, (arg3 > 0) /\ (arg1 > 0) /\ (arg2 > 2), par{arg1 -> arg3, arg2 -> arg3}> <l2, l5, (undef22 <= arg1) /\ ((undef23 + 1) <= arg1) /\ (arg1 > 0) /\ (undef22 > 0) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> <l5, l5, ((undef25 + 2) <= arg1) /\ (undef25 <= arg2) /\ ((undef26 + 3) <= arg1) /\ ((undef26 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef25 > 0) /\ (undef26 > ~(1)), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27}> <l5, l5, ((undef28 + 2) <= arg1) /\ ((undef29 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > ~(1)) /\ (undef28 > 0) /\ (undef29 > ~(1)), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30}> <l6, l1, true, par{arg1 -> undef31, arg2 -> undef32, arg3 -> undef33}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef14, undef17, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef14, undef17, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l5, (undef1 > 2) /\ (undef22 <= undef1) /\ ((undef23 + 1) <= undef1) /\ (undef1 > 0) /\ (undef22 > 0) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> <l0, l5, (undef4 > 1) /\ (undef22 <= undef4) /\ ((undef23 + 1) <= undef4) /\ (undef4 > 0) /\ (undef22 > 0) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> <l0, l3, true, par{arg1 -> 5, arg2 -> 5, arg3 -> 5}> <l3, l3, ((arg2 - 1) < arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (arg2 = arg3), par{arg1 -> (arg2 - 1), arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> <l3, l3, ((arg2 - 1) < arg2) /\ (arg2 > 1) /\ (undef14 > 4) /\ (arg1 > 0) /\ (arg2 = arg3) /\ ((arg2 - 1) > 0) /\ (arg1 > 0) /\ (undef14 > 2), par{arg1 -> (arg2 - 1), arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> <l3, l3, ((arg2 - 1) < arg2) /\ (arg2 > 1) /\ (undef17 > 3) /\ (arg1 > 0) /\ (arg2 = arg3) /\ ((arg2 - 1) > 0) /\ (arg1 > 0) /\ (undef17 > 2), par{arg1 -> (arg2 - 1), arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> <l5, l5, ((undef25 + 2) <= arg1) /\ (undef25 <= arg2) /\ ((undef26 + 3) <= arg1) /\ ((undef26 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef25 > 0) /\ (undef26 > ~(1)), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27}> <l5, l5, ((undef28 + 2) <= arg1) /\ ((undef29 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > ~(1)) /\ (undef28 > 0) /\ (undef29 > ~(1)), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef14, undef17, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef14, undef17, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 2 <= arg2 /\ 1 <= arg1 /\ arg2 = arg3, {arg1 -> -1 + arg2, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> <l3, l3, 2 <= arg2 /\ 1 <= arg1 /\ 5 <= undef14 /\ arg2 = arg3, {arg1 -> -1 + arg2, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> <l3, l3, 2 <= arg2 /\ 1 <= arg1 /\ 4 <= undef17 /\ arg2 = arg3, {arg1 -> -1 + arg2, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: <l5, l5, 2 + undef25 <= arg1 /\ 1 <= arg2 /\ 1 + undef26 <= arg2 /\ 1 <= undef25 /\ undef25 <= arg2 /\ 0 <= undef26 /\ 3 <= arg1 /\ 3 + undef26 <= arg1, {arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, rest remain the same}> <l5, l5, 2 + undef28 <= arg1 /\ 1 <= undef28 /\ 0 <= arg2 /\ 0 <= undef29 /\ 3 <= arg1 /\ 3 + undef29 <= arg1, {arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l3, true, {arg1 -> 5, arg2 -> 5, arg3 -> 5, rest remain the same}> Graph 2 <l0, l5, 1 + undef23 <= undef1 /\ 1 <= undef22 /\ undef22 <= undef1 /\ 0 <= undef23 /\ 3 <= undef1, {arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, 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