Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432272939
details
property
value
status
complete
benchmark
SharingAnalysis.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n144.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.040451 seconds
cpu usage
0.040624
user time
0.029373
system time
0.011251
max virtual memory
113176.0
max residence set size
6380.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.03 YES 0.00/0.03 0.00/0.03 Solver Timeout: 4 0.00/0.03 Global Timeout: 300 0.00/0.03 No parsing errors! 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l4, true> 0.00/0.03 <l1, l2, (arg2 > 0) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> undef3}> 0.00/0.03 <l2, l2, (undef5 > arg2) /\ (arg1 > 1) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> undef6}> 0.00/0.03 <l2, l2, (arg1 > 1), par{arg1 -> (arg1 - 1), arg2 -> 1, arg3 -> undef9}> 0.00/0.03 <l2, l3, (undef10 > 1) /\ (undef11 > 3) /\ (arg1 < 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> 0.00/0.03 <l3, l3, ((undef13 - 1) <= arg2) /\ ((undef14 + 1) <= arg2) /\ (arg1 > 1) /\ (arg2 > 0) /\ (undef13 > 1) /\ (undef14 > ~(1)) /\ ((arg3 + 2) <= arg1) /\ ((undef15 + 2) <= arg2), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.03 <l4, l1, true, par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef3, undef5, undef6, undef9, undef10, undef11, undef13, undef14, undef15, undef16, undef17, undef18, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef3, undef5, undef6, undef9, undef10, undef11, undef13, undef14, undef15, undef16, undef17, undef18, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 Preprocessed LLVMGraph 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l2, (arg1 = undef1) /\ (arg2 = 0) /\ (arg3 = undef3) /\ (undef17 > 0) /\ (undef1 > ~(1)) /\ (undef16 > 0)> 0.00/0.03 <l2, l2, (undef5 > arg2) /\ (arg1 > 1) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> undef6}> 0.00/0.03 <l2, l2, (arg1 > 1), par{arg1 -> (arg1 - 1), arg2 -> 1, arg3 -> undef9}> 0.00/0.03 <l2, l3, (undef10 > 1) /\ (undef11 > 3) /\ (arg1 < 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> 0.00/0.03 <l3, l3, ((undef13 - 1) <= arg2) /\ ((undef14 + 1) <= arg2) /\ (arg1 > 1) /\ (arg2 > 0) /\ (undef13 > 1) /\ (undef14 > ~(1)) /\ ((arg3 + 2) <= arg1) /\ ((undef15 + 2) <= arg2), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef3, undef5, undef6, undef9, undef10, undef11, undef13, undef14, undef15, undef16, undef17, undef18, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef3, undef5, undef6, undef9, undef10, undef11, undef13, undef14, undef15, undef16, undef17, undef18, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 ************************************************************* 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Graph 0: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Graph 1: 0.00/0.03 Transitions: 0.00/0.03 <l2, l2, 1 + arg2 <= undef5 /\ 1 <= arg2 /\ 2 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef5, arg3 -> undef6, rest remain the same}> 0.00/0.03 <l2, l2, 2 <= arg1, {arg1 -> -1 + arg1, arg2 -> 1, arg3 -> undef9, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 0.00/0.03 0.00/0.03 Graph 2: 0.00/0.03 Transitions: 0.00/0.03 <l3, l3, 0 <= undef14 /\ 1 <= arg2 /\ 1 + undef14 <= arg2 /\ undef13 <= 1 + arg2 /\ 2 <= arg1 /\ 2 + arg3 <= arg1 /\ 2 + undef15 <= arg2 /\ 2 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3 0.00/0.03 0.00/0.03 Precedence: 0.00/0.03 Graph 0 0.00/0.03 0.00/0.03 Graph 1 0.00/0.03 <l0, l2, 0 <= undef1 /\ 1 <= undef16 /\ 1 <= undef17 /\ arg1 = undef1 /\ arg2 = 0 /\ arg3 = undef3, {all remain the same}> 0.00/0.03 0.00/0.03 Graph 2 0.00/0.03 <l2, l3, arg1 <= 1 /\ 2 <= undef10 /\ 4 <= undef11, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> 0.00/0.03 0.00/0.03 Map Locations to Subgraph: 0.00/0.03 ( 0 , 0 ) 0.00/0.03 ( 2 , 1 ) 0.00/0.03 ( 3 , 2 ) 0.00/0.03 0.00/0.03 ******************************************************************************************* 0.00/0.03 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Proving termination of subgraph 0 0.00/0.03 Proving termination of subgraph 1 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.005707 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l2}... 0.00/0.03
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