Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273497
details
property
value
status
complete
benchmark
ListReverseAcyclicList.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n106.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0319981 seconds
cpu usage
0.032113
user time
0.028339
system time
0.003774
max virtual memory
113176.0
max residence set size
5728.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.02 YES 0.00/0.02 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) /\ (undef3 > ~(1)) /\ ((undef1 + 1) <= arg1) /\ (arg1 > 0) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> (undef3 - 1)}> 0.00/0.03 <l2, l3, (undef4 <= arg1) /\ (arg2 < 1) /\ (arg1 > ~(1)) /\ (undef4 > ~(1)), par{arg1 -> undef4, arg2 -> undef5}> 0.00/0.03 <l2, l2, ((undef6 - 2) <= arg1) /\ (arg2 > 0) /\ (arg1 > ~(1)) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 - 1)}> 0.00/0.03 <l3, l3, ((undef8 + 1) <= arg1) /\ (arg1 > 0) /\ (undef8 > ~(1)), par{arg1 -> undef8, arg2 -> undef9}> 0.00/0.03 <l4, l1, true, par{arg1 -> undef10, arg2 -> undef11}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, 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 = (undef3 - 1)) /\ (undef11 > 0) /\ (undef3 > ~(1)) /\ ((undef1 + 1) <= undef10) /\ (undef10 > 0) /\ (undef1 > ~(1))> 0.00/0.03 <l2, l3, (undef4 <= arg1) /\ (arg2 < 1) /\ (arg1 > ~(1)) /\ (undef4 > ~(1)), par{arg1 -> undef4, arg2 -> undef5}> 0.00/0.03 <l2, l2, ((undef6 - 2) <= arg1) /\ (arg2 > 0) /\ (arg1 > ~(1)) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 - 1)}> 0.00/0.03 <l3, l3, ((undef8 + 1) <= arg1) /\ (arg1 > 0) /\ (undef8 > ~(1)), par{arg1 -> undef8, arg2 -> undef9}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, 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, 0 <= arg1 /\ 1 <= arg2 /\ 1 <= undef6 /\ undef6 <= 2 + arg1, {arg1 -> undef6, arg2 -> -1 + arg2, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2 0.00/0.03 0.00/0.03 Graph 2: 0.00/0.03 Transitions: 0.00/0.03 <l3, l3, 0 <= undef8 /\ 1 <= arg1 /\ 1 + undef8 <= arg1, {arg1 -> undef8, arg2 -> undef9, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2 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 /\ 0 <= undef3 /\ 1 + undef1 <= undef10 /\ 1 <= undef10 /\ 1 <= undef11 /\ arg1 = undef1 /\ 1 + arg2 = undef3, {all remain the same}> 0.00/0.03 0.00/0.03 Graph 2 0.00/0.03 <l2, l3, 0 <= arg1 /\ undef4 <= arg1 /\ arg2 <= 0 /\ 0 <= undef4, {arg1 -> undef4, arg2 -> undef5, 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.00255 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l2}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.000901s
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