Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273347
details
property
value
status
complete
benchmark
Velroyen08-ex06.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
2.09054 seconds
cpu usage
2.09046
user time
1.88433
system time
0.206127
max virtual memory
747156.0
max residence set size
91028.0
stage attributes
key
value
starexec-result
NO
output
2.07/2.08 NO 2.07/2.08 2.07/2.08 Solver Timeout: 4 2.07/2.08 Global Timeout: 300 2.07/2.08 No parsing errors! 2.07/2.08 Init Location: 0 2.07/2.08 Transitions: 2.07/2.08 <l0, l6, true> 2.07/2.08 <l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)> 2.07/2.08 <l2, l3, (undef8 > ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}> 2.07/2.08 <l1, l2, (undef13 > ~(1)) /\ (arg2 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (arg1 > 0)> 2.07/2.08 <l2, l4, (undef16 > ~(1)) /\ (arg2 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> undef16, arg2 -> undef17}> 2.07/2.08 <l4, l5, (0 = arg1), par{arg1 -> 0, arg2 -> undef21}> 2.07/2.08 <l4, l5, (arg1 > 0) /\ (arg1 < 6), par{arg1 -> (arg1 - 1), arg2 -> undef23}> 2.07/2.08 <l3, l5, (arg1 < 1) /\ (arg1 < 6) /\ (arg1 > ~(6)), par{arg2 -> undef25}> 2.07/2.08 <l5, l4, (arg1 > ~(1)), par{arg2 -> undef27}> 2.07/2.08 <l5, l3, (arg1 < 0), par{arg1 -> (arg1 + 1), arg2 -> undef29}> 2.07/2.08 <l6, l1, true, par{arg1 -> undef30, arg2 -> undef31}> 2.07/2.08 2.07/2.08 Fresh variables: 2.07/2.08 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, 2.07/2.08 2.07/2.08 Undef variables: 2.07/2.08 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, 2.07/2.08 2.07/2.08 Abstraction variables: 2.07/2.08 2.07/2.08 Exit nodes: 2.07/2.08 2.07/2.08 Accepting locations: 2.07/2.08 2.07/2.08 Asserts: 2.07/2.08 2.07/2.08 Preprocessed LLVMGraph 2.07/2.08 Init Location: 0 2.07/2.08 Transitions: 2.07/2.08 <l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef8 > ~(1)) /\ (undef31 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef30 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0) /\ ((0 - undef8) < 1) /\ ((0 - undef8) < 6) /\ ((0 - undef8) > ~(6)), par{arg1 -> (0 - undef8)}> 2.07/2.08 <l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (0 = undef16), par{arg1 -> 0}> 2.07/2.08 <l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (undef16 > 0) /\ (undef16 < 6), par{arg1 -> (undef16 - 1)}> 2.07/2.08 <l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef8 > ~(1)) /\ (undef31 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef30 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0) /\ ((0 - undef8) < 1) /\ ((0 - undef8) < 6) /\ ((0 - undef8) > ~(6)), par{arg1 -> (0 - undef8)}> 2.07/2.08 <l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (0 = undef16), par{arg1 -> 0}> 2.07/2.08 <l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (undef16 > 0) /\ (undef16 < 6), par{arg1 -> (undef16 - 1)}> 2.07/2.08 <l5, l5, (arg1 > ~(1)) /\ (0 = arg1), par{arg1 -> 0}> 2.07/2.08 <l5, l5, (arg1 > ~(1)) /\ (arg1 > 0) /\ (arg1 < 6), par{arg1 -> (arg1 - 1)}> 2.07/2.08 <l5, l5, (arg1 < 0) /\ ((arg1 + 1) < 1) /\ ((arg1 + 1) < 6) /\ ((arg1 + 1) > ~(6)), par{arg1 -> (arg1 + 1)}> 2.07/2.08 2.07/2.08 Fresh variables: 2.07/2.08 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, 2.07/2.08 2.07/2.08 Undef variables: 2.07/2.08 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, 2.07/2.08 2.07/2.08 Abstraction variables: 2.07/2.08 2.07/2.08 Exit nodes: 2.07/2.08 2.07/2.08 Accepting locations: 2.07/2.08 2.07/2.08 Asserts: 2.07/2.08 2.07/2.08 ************************************************************* 2.07/2.08 ******************************************************************************************* 2.07/2.08 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 2.07/2.08 ******************************************************************************************* 2.07/2.08 2.07/2.08 Init Location: 0 2.07/2.08 Graph 0: 2.07/2.08 Transitions: 2.07/2.08 Variables: 2.07/2.08 2.07/2.08 Graph 1: 2.07/2.08 Transitions: 2.07/2.08 <l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}> 2.07/2.08 <l5, l5, 1 <= arg1 /\ arg1 <= 5, {arg1 -> -1 + arg1, rest remain the same}> 2.07/2.08 <l5, l5, 1 + arg1 <= 0 /\ 0 <= 6 + arg1, {arg1 -> 1 + arg1, rest remain the same}> 2.07/2.08 Variables: 2.07/2.08 arg1 2.07/2.08 2.07/2.08 Precedence: 2.07/2.08 Graph 0 2.07/2.08 2.07/2.08 Graph 1 2.07/2.08 <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}> 2.07/2.08 <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}> 2.07/2.08 <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}> 2.07/2.08 <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}> 2.07/2.08 <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}> 2.07/2.08 <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}> 2.07/2.08 2.07/2.08 Map Locations to Subgraph: 2.07/2.08 ( 0 , 0 ) 2.07/2.08 ( 5 , 1 ) 2.07/2.08 2.07/2.08 ******************************************************************************************* 2.07/2.08 ******************************** CHECKING ASSERTIONS ******************************** 2.07/2.08 ******************************************************************************************* 2.07/2.08 2.07/2.08 Proving termination of subgraph 0 2.07/2.08 Proving termination of subgraph 1 2.07/2.08 Checking unfeasibility...
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