Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273143
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
n074.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.100129 seconds
cpu usage
0.100268
user time
0.088211
system time
0.012057
max virtual memory
113176.0
max residence set size
9696.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.09 YES 0.00/0.09 0.00/0.09 Solver Timeout: 4 0.00/0.09 Global Timeout: 300 0.00/0.09 No parsing errors! 0.00/0.09 Init Location: 0 0.00/0.09 Transitions: 0.00/0.09 <l0, l6, true> 0.00/0.09 <l1, l2, (undef1 > 2), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> 0.00/0.09 <l1, l2, (undef4 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> undef6}> 0.00/0.09 <l1, l3, true, par{arg1 -> 5, arg2 -> 5, arg3 -> 5}> 0.00/0.09 <l3, l3, ((arg2 - 1) < arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (arg2 = arg3), par{arg1 -> (arg2 - 1), arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 0.00/0.09 <l3, l4, ((arg2 - 1) < arg2) /\ (arg2 > 1) /\ (undef14 > 4) /\ (arg1 > 0) /\ (arg2 = arg3), par{arg2 -> undef14, arg3 -> (arg2 - 1)}> 0.00/0.09 <l3, l4, ((arg2 - 1) < arg2) /\ (arg2 > 1) /\ (undef17 > 3) /\ (arg1 > 0) /\ (arg2 = arg3), par{arg2 -> undef17, arg3 -> (arg2 - 1)}> 0.00/0.09 <l4, l3, (arg3 > 0) /\ (arg1 > 0) /\ (arg2 > 2), par{arg1 -> arg3, arg2 -> arg3}> 0.00/0.09 <l2, l5, (undef22 <= arg1) /\ ((undef23 + 1) <= arg1) /\ (arg1 > 0) /\ (undef22 > 0) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> 0.00/0.09 <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}> 0.00/0.09 <l5, l5, ((undef28 + 2) <= arg1) /\ ((undef29 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > ~(1)) /\ (undef28 > 0) /\ (undef29 > ~(1)), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30}> 0.00/0.09 <l6, l1, true, par{arg1 -> undef31, arg2 -> undef32, arg3 -> undef33}> 0.00/0.09 0.00/0.09 Fresh variables: 0.00/0.09 undef1, undef2, undef3, undef4, undef5, undef6, undef14, undef17, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, 0.00/0.09 0.00/0.09 Undef variables: 0.00/0.09 undef1, undef2, undef3, undef4, undef5, undef6, undef14, undef17, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, 0.00/0.09 0.00/0.09 Abstraction variables: 0.00/0.09 0.00/0.09 Exit nodes: 0.00/0.09 0.00/0.09 Accepting locations: 0.00/0.09 0.00/0.09 Asserts: 0.00/0.09 0.00/0.09 Preprocessed LLVMGraph 0.00/0.09 Init Location: 0 0.00/0.09 Transitions: 0.00/0.09 <l0, l5, (undef1 > 2) /\ (undef22 <= undef1) /\ ((undef23 + 1) <= undef1) /\ (undef1 > 0) /\ (undef22 > 0) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> 0.00/0.09 <l0, l5, (undef4 > 1) /\ (undef22 <= undef4) /\ ((undef23 + 1) <= undef4) /\ (undef4 > 0) /\ (undef22 > 0) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> 0.00/0.09 <l0, l3, true, par{arg1 -> 5, arg2 -> 5, arg3 -> 5}> 0.00/0.09 <l3, l3, ((arg2 - 1) < arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (arg2 = arg3), par{arg1 -> (arg2 - 1), arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 0.00/0.09 <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)}> 0.00/0.09 <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)}> 0.00/0.09 <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}> 0.00/0.09 <l5, l5, ((undef28 + 2) <= arg1) /\ ((undef29 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > ~(1)) /\ (undef28 > 0) /\ (undef29 > ~(1)), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30}> 0.00/0.09 0.00/0.09 Fresh variables: 0.00/0.09 undef1, undef2, undef3, undef4, undef5, undef6, undef14, undef17, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, 0.00/0.09 0.00/0.09 Undef variables: 0.00/0.09 undef1, undef2, undef3, undef4, undef5, undef6, undef14, undef17, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, 0.00/0.09 0.00/0.09 Abstraction variables: 0.00/0.09 0.00/0.09 Exit nodes: 0.00/0.09 0.00/0.09 Accepting locations: 0.00/0.09 0.00/0.09 Asserts: 0.00/0.09 0.00/0.09 ************************************************************* 0.00/0.09 ******************************************************************************************* 0.00/0.09 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.09 ******************************************************************************************* 0.00/0.09 0.00/0.09 Init Location: 0 0.00/0.09 Graph 0: 0.00/0.09 Transitions: 0.00/0.09 Variables: 0.00/0.09 0.00/0.09 Graph 1: 0.00/0.09 Transitions: 0.00/0.09 <l3, l3, 2 <= arg2 /\ 1 <= arg1 /\ arg2 = arg3, {arg1 -> -1 + arg2, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 0.00/0.09 <l3, l3, 2 <= arg2 /\ 1 <= arg1 /\ 5 <= undef14 /\ arg2 = arg3, {arg1 -> -1 + arg2, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 0.00/0.09 <l3, l3, 2 <= arg2 /\ 1 <= arg1 /\ 4 <= undef17 /\ arg2 = arg3, {arg1 -> -1 + arg2, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 0.00/0.09 Variables: 0.00/0.09 arg1, arg2, arg3 0.00/0.09 0.00/0.09 Graph 2: 0.00/0.09 Transitions: 0.00/0.09 <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}> 0.00/0.09 <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}> 0.00/0.09 Variables: 0.00/0.09 arg1, arg2, arg3 0.00/0.09 0.00/0.09 Precedence: 0.00/0.09 Graph 0 0.00/0.09 0.00/0.09 Graph 1 0.00/0.09 <l0, l3, true, {arg1 -> 5, arg2 -> 5, arg3 -> 5, rest remain the same}> 0.00/0.09 0.00/0.09 Graph 2 0.00/0.09 <l0, l5, 1 + undef23 <= undef1 /\ 1 <= undef22 /\ undef22 <= undef1 /\ 0 <= undef23 /\ 3 <= undef1, {arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, rest remain the same}> 0.00/0.09 <l0, l5, 2 <= undef4 /\ 1 + undef23 <= undef4 /\ 1 <= undef22 /\ undef22 <= undef4 /\ 0 <= undef23, {arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, rest remain the same}> 0.00/0.09 0.00/0.09 Map Locations to Subgraph: 0.00/0.09 ( 0 , 0 ) 0.00/0.09 ( 3 , 1 ) 0.00/0.09 ( 5 , 2 ) 0.00/0.09
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer_Transition_Systems 2019-03-29 01.54