details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	5.08582 seconds
cpu usage	5.08529
user time	4.7831
system time	0.302193
max virtual memory	854084.0
max residence set size	155488.0

stage attributes

key	value
starexec-result	NO

output

5.01/5.08 NO 5.01/5.08 5.01/5.08 Solver Timeout: 4 5.01/5.08 Global Timeout: 300 5.01/5.08 No parsing errors! 5.01/5.08 Init Location: 0 5.01/5.08 Transitions: 5.01/5.08 <l0, l10, true> 5.01/5.08 <l1, l2, true> 5.01/5.08 <l3, l4, true> 5.01/5.08 <l5, l6, true> 5.01/5.08 <l7, l8, true> 5.01/5.08 <l8, l7, true> 5.01/5.08 <l4, l3, (1 <= (0 + n^0))> 5.01/5.08 <l4, l1, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33), par{R^0 -> 0, ___rho_1_^0 -> undef33, dobreak^0 -> (0 + undef33)}> 5.01/5.08 <l2, l3, ((0 + dobreak^0) <= 0) /\ (undef42 = 1) /\ (undef41 = undef41) /\ (1 <= (0 + undef41)), par{A^0 -> 0, n^0 -> undef41}> 5.01/5.08 <l2, l7, (1 <= (0 + dobreak^0))> 5.01/5.08 <l9, l1, (undef50 = undef50), par{A^0 -> 0, R^0 -> 0, ___rho_1_^0 -> undef50, dobreak^0 -> (0 + undef50)}> 5.01/5.08 <l10, l9, true> 5.01/5.08 5.01/5.08 Fresh variables: 5.01/5.08 undef33, undef36, undef41, undef42, undef50, 5.01/5.08 5.01/5.08 Undef variables: 5.01/5.08 undef33, undef36, undef41, undef42, undef50, 5.01/5.08 5.01/5.08 Abstraction variables: 5.01/5.08 5.01/5.08 Exit nodes: 5.01/5.08 5.01/5.08 Accepting locations: 5.01/5.08 5.01/5.08 Asserts: 5.01/5.08 5.01/5.08 Preprocessed LLVMGraph 5.01/5.08 Init Location: 0 5.01/5.08 Transitions: 5.01/5.08 <l0, l3, (undef50 = undef50) /\ ((0 + (0 + undef50)) <= 0) /\ (undef42 = 1) /\ (undef41 = undef41) /\ (1 <= (0 + undef41)), par{n^0 -> undef41}> 5.01/5.08 <l0, l7, (undef50 = undef50) /\ (1 <= (0 + (0 + undef50)))> 5.01/5.08 <l3, l3, (1 <= (0 + n^0))> 5.01/5.08 <l3, l3, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ ((0 + (0 + undef33)) <= 0) /\ (undef42 = 1) /\ (undef41 = undef41) /\ (1 <= (0 + undef41)), par{n^0 -> undef41}> 5.01/5.08 <l3, l7, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ (1 <= (0 + (0 + undef33)))> 5.01/5.08 <l7, l7, true> 5.01/5.08 5.01/5.08 Fresh variables: 5.01/5.08 undef33, undef36, undef41, undef42, undef50, 5.01/5.08 5.01/5.08 Undef variables: 5.01/5.08 undef33, undef36, undef41, undef42, undef50, 5.01/5.08 5.01/5.08 Abstraction variables: 5.01/5.08 5.01/5.08 Exit nodes: 5.01/5.08 5.01/5.08 Accepting locations: 5.01/5.08 5.01/5.08 Asserts: 5.01/5.08 5.01/5.08 ************************************************************* 5.01/5.08 ******************************************************************************************* 5.01/5.08 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.01/5.08 ******************************************************************************************* 5.01/5.08 5.01/5.08 Init Location: 0 5.01/5.08 Graph 0: 5.01/5.08 Transitions: 5.01/5.08 Variables: 5.01/5.08 5.01/5.08 Graph 1: 5.01/5.08 Transitions: 5.01/5.08 <l3, l3, 1 <= n^0, {all remain the same}> 5.01/5.08 <l3, l3, 1 <= undef41 /\ n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}> 5.01/5.08 Variables: 5.01/5.08 n^0 5.01/5.08 5.01/5.08 Graph 2: 5.01/5.08 Transitions: 5.01/5.08 <l7, l7, true, {all remain the same}> 5.01/5.08 Variables: 5.01/5.08 5.01/5.08 Precedence: 5.01/5.08 Graph 0 5.01/5.08 5.01/5.08 Graph 1 5.01/5.08 <l0, l3, 1 <= undef41 /\ undef50 <= 0 /\ undef42 = 1, {n^0 -> undef41, rest remain the same}> 5.01/5.08 5.01/5.08 Graph 2 5.01/5.08 <l0, l7, 1 <= undef50, {all remain the same}> 5.01/5.08 <l3, l7, 1 <= undef33 /\ n^0 <= 0 /\ undef36 = 1, {all remain the same}> 5.01/5.08 5.01/5.08 Map Locations to Subgraph: 5.01/5.08 ( 0 , 0 ) 5.01/5.08 ( 3 , 1 ) 5.01/5.08 ( 7 , 2 ) 5.01/5.08 5.01/5.08 ******************************************************************************************* 5.01/5.08 ******************************** CHECKING ASSERTIONS ******************************** 5.01/5.08 ******************************************************************************************* 5.01/5.08 5.01/5.08 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