details

property	value
status	complete
benchmark	neg-acqrel-fail.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n040.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	9.13933 seconds
cpu usage	9.13839
user time	8.47589
system time	0.6625
max virtual memory	939504.0
max residence set size	220528.0

stage attributes

key	value
starexec-result	NO

output

9.06/9.13 NO 9.06/9.13 9.06/9.13 Solver Timeout: 4 9.06/9.13 Global Timeout: 300 9.06/9.13 No parsing errors! 9.06/9.13 Init Location: 0 9.06/9.13 Transitions: 9.06/9.13 <l0, l10, true> 9.06/9.13 <l1, l2, ((0 + dobreak^0) <= 0) /\ (undef6 = 1) /\ (undef3 = undef3), par{A^0 -> 0, __rho_1_^0 -> undef3, n^0 -> (0 + undef3)}> 9.06/9.13 <l1, l3, (1 <= (0 + dobreak^0))> 9.06/9.13 <l4, l1, true> 9.06/9.13 <l2, l5, true> 9.06/9.13 <l6, l7, true> 9.06/9.13 <l3, l8, true> 9.06/9.13 <l8, l3, true> 9.06/9.13 <l5, l2, (1 <= (0 + n^0)), par{n^0 -> (~(1) + n^0)}> 9.06/9.13 <l5, l4, ((0 + n^0) <= 0) /\ (undef47 = 1) /\ (undef45 = undef45), par{R^0 -> 0, dobreak^0 -> undef45}> 9.06/9.13 <l9, l4, (undef51 = undef51), par{A^0 -> 0, R^0 -> 0, dobreak^0 -> undef51}> 9.06/9.13 <l10, l9, true> 9.06/9.13 9.06/9.13 Fresh variables: 9.06/9.13 undef3, undef6, undef45, undef47, undef51, 9.06/9.13 9.06/9.13 Undef variables: 9.06/9.13 undef3, undef6, undef45, undef47, undef51, 9.06/9.13 9.06/9.13 Abstraction variables: 9.06/9.13 9.06/9.13 Exit nodes: 9.06/9.13 9.06/9.13 Accepting locations: 9.06/9.13 9.06/9.13 Asserts: 9.06/9.13 9.06/9.13 Preprocessed LLVMGraph 9.06/9.13 Init Location: 0 9.06/9.13 Transitions: 9.06/9.13 <l0, l2, (undef51 = undef51) /\ ((0 + undef51) <= 0) /\ (undef6 = 1) /\ (undef3 = undef3), par{n^0 -> (0 + undef3)}> 9.06/9.13 <l0, l3, (undef51 = undef51) /\ (1 <= (0 + undef51))> 9.06/9.13 <l2, l2, (1 <= (0 + n^0)), par{n^0 -> (~(1) + n^0)}> 9.06/9.13 <l2, l2, ((0 + n^0) <= 0) /\ (undef47 = 1) /\ (undef45 = undef45) /\ ((0 + undef45) <= 0) /\ (undef6 = 1) /\ (undef3 = undef3), par{n^0 -> (0 + undef3)}> 9.06/9.13 <l2, l3, ((0 + n^0) <= 0) /\ (undef47 = 1) /\ (undef45 = undef45) /\ (1 <= (0 + undef45))> 9.06/9.13 <l3, l3, true> 9.06/9.13 9.06/9.13 Fresh variables: 9.06/9.13 undef3, undef6, undef45, undef47, undef51, 9.06/9.13 9.06/9.13 Undef variables: 9.06/9.13 undef3, undef6, undef45, undef47, undef51, 9.06/9.13 9.06/9.13 Abstraction variables: 9.06/9.13 9.06/9.13 Exit nodes: 9.06/9.13 9.06/9.13 Accepting locations: 9.06/9.13 9.06/9.13 Asserts: 9.06/9.13 9.06/9.13 ************************************************************* 9.06/9.13 ******************************************************************************************* 9.06/9.13 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 9.06/9.13 ******************************************************************************************* 9.06/9.13 9.06/9.13 Init Location: 0 9.06/9.13 Graph 0: 9.06/9.13 Transitions: 9.06/9.13 Variables: 9.06/9.13 9.06/9.13 Graph 1: 9.06/9.13 Transitions: 9.06/9.13 <l2, l2, 1 <= n^0, {n^0 -> -1 + n^0, rest remain the same}> 9.06/9.13 <l2, l2, n^0 <= 0 /\ undef45 <= 0 /\ undef6 = 1 /\ undef47 = 1, {n^0 -> undef3, rest remain the same}> 9.06/9.13 Variables: 9.06/9.13 n^0 9.06/9.13 9.06/9.13 Graph 2: 9.06/9.13 Transitions: 9.06/9.13 <l3, l3, true, {all remain the same}> 9.06/9.13 Variables: 9.06/9.13 9.06/9.13 Precedence: 9.06/9.13 Graph 0 9.06/9.13 9.06/9.13 Graph 1 9.06/9.13 <l0, l2, undef51 <= 0 /\ undef6 = 1, {n^0 -> undef3, rest remain the same}> 9.06/9.13 9.06/9.13 Graph 2 9.06/9.13 <l0, l3, 1 <= undef51, {all remain the same}> 9.06/9.13 <l2, l3, n^0 <= 0 /\ 1 <= undef45 /\ undef47 = 1, {all remain the same}> 9.06/9.13 9.06/9.13 Map Locations to Subgraph: 9.06/9.13 ( 0 , 0 ) 9.06/9.13 ( 2 , 1 ) 9.06/9.13 ( 3 , 2 ) 9.06/9.13 9.06/9.13 ******************************************************************************************* 9.06/9.13 ******************************** CHECKING ASSERTIONS ******************************** 9.06/9.13 ******************************************************************************************* 9.06/9.13 9.06/9.13 Proving termination of subgraph 0 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