Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273779
details
property
value
status
complete
benchmark
AProVE12-cyclic-Length.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n061.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.09845 seconds
cpu usage
0.098617
user time
0.07935
system time
0.019267
max virtual memory
113176.0
max residence set size
14004.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, l4, true> 0.00/0.09 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg2 - 1), arg3 -> 0}> 0.00/0.09 <l2, l2, (arg2 > 0) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef6}> 0.00/0.09 <l2, l2, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1}> 0.00/0.09 <l2, l3, (arg2 < 1) /\ (undef10 > 0), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> 0.00/0.09 <l3, l3, ((undef13 + 1) <= arg1) /\ (arg1 > 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.09 <l4, l1, true, par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18}> 0.00/0.09 0.00/0.09 Fresh variables: 0.00/0.09 undef6, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 0.00/0.09 0.00/0.09 Undef variables: 0.00/0.09 undef6, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 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, l2, (arg1 = (undef17 - 1)) /\ (arg2 = undef17) /\ (arg3 = 0) /\ (undef16 > 0) /\ (undef17 > ~(1))> 0.00/0.09 <l2, l2, (arg2 > 0) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef6}> 0.00/0.09 <l2, l2, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1}> 0.00/0.09 <l2, l3, (arg2 < 1) /\ (undef10 > 0), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> 0.00/0.09 <l3, l3, ((undef13 + 1) <= arg1) /\ (arg1 > 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.09 0.00/0.09 Fresh variables: 0.00/0.09 undef6, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 0.00/0.09 0.00/0.09 Undef variables: 0.00/0.09 undef6, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 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 <l2, l2, 1 <= arg2 /\ 1 <= arg3, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef6, rest remain the same}> 0.00/0.09 <l2, l2, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> 1, 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 <l3, l3, 0 <= undef13 /\ 1 <= arg1 /\ 1 + undef13 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, 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, l2, 0 <= undef17 /\ 1 <= undef16 /\ arg2 = undef17 /\ arg3 = 0 /\ 1 + arg1 = undef17, {all remain the same}> 0.00/0.09 0.00/0.09 Graph 2 0.00/0.09 <l2, l3, arg2 <= 0 /\ 1 <= undef10, {arg1 -> undef10, arg2 -> undef11, arg3 -> undef12, 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 ( 2 , 1 ) 0.00/0.09 ( 3 , 2 ) 0.00/0.09 0.00/0.09 ******************************************************************************************* 0.00/0.09 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.09 ******************************************************************************************* 0.00/0.09 0.00/0.09 Proving termination of subgraph 0 0.00/0.09 Proving termination of subgraph 1 0.00/0.09 Checking unfeasibility... 0.00/0.09 Time used: 0.006126 0.00/0.09 0.00/0.09 Checking conditional termination of SCC {l2}... 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