details

property	value
status	complete
benchmark	n-1d.t2_fixed.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n007.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	20.3328 seconds
cpu usage	20.3054
user time	19.0784
system time	1.22702
max virtual memory	1123296.0
max residence set size	363592.0

stage attributes

key	value
starexec-result	NO

output

20.25/20.32 NO 20.25/20.32 20.25/20.33 Solver Timeout: 4 20.25/20.33 Global Timeout: 300 20.25/20.33 No parsing errors! 20.25/20.33 Init Location: 0 20.25/20.33 Transitions: 20.25/20.33 <l0, l8, true> 20.25/20.33 <l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}> 20.25/20.33 <l1, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)), par{tmp_7^0 -> undef6}> 20.25/20.33 <l3, l1, true> 20.25/20.33 <l1, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14), par{tmp_7^0 -> undef14}> 20.25/20.33 <l4, l5, ((1 + tmp_7^0) <= 0)> 20.25/20.33 <l4, l5, (1 <= (0 + tmp_7^0))> 20.25/20.33 <l5, l6, true, par{x_5^0 -> (1 + x_5^0)}> 20.25/20.33 <l6, l1, true> 20.25/20.33 <l7, l1, true> 20.25/20.33 <l8, l7, true> 20.25/20.33 20.25/20.33 Fresh variables: 20.25/20.33 undef1, undef6, undef14, 20.25/20.33 20.25/20.33 Undef variables: 20.25/20.33 undef1, undef6, undef14, 20.25/20.33 20.25/20.33 Abstraction variables: 20.25/20.33 20.25/20.33 Exit nodes: 20.25/20.33 20.25/20.33 Accepting locations: 20.25/20.33 20.25/20.33 Asserts: 20.25/20.33 20.25/20.33 Preprocessed LLVMGraph 20.25/20.33 Init Location: 0 20.25/20.33 Transitions: 20.25/20.33 <l0, l1, true> 20.25/20.33 <l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1)> 20.25/20.33 <l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6))> 20.25/20.33 <l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ ((1 + undef14) <= 0), par{x_5^0 -> (1 + x_5^0)}> 20.25/20.33 <l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ (1 <= (0 + undef14)), par{x_5^0 -> (1 + x_5^0)}> 20.25/20.33 20.25/20.33 Fresh variables: 20.25/20.33 undef1, undef6, undef14, 20.25/20.33 20.25/20.33 Undef variables: 20.25/20.33 undef1, undef6, undef14, 20.25/20.33 20.25/20.33 Abstraction variables: 20.25/20.33 20.25/20.33 Exit nodes: 20.25/20.33 20.25/20.33 Accepting locations: 20.25/20.33 20.25/20.33 Asserts: 20.25/20.33 20.25/20.33 ************************************************************* 20.25/20.33 ******************************************************************************************* 20.25/20.33 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 20.25/20.33 ******************************************************************************************* 20.25/20.33 20.25/20.33 Init Location: 0 20.25/20.33 Graph 0: 20.25/20.33 Transitions: 20.25/20.33 Variables: 20.25/20.33 20.25/20.33 Graph 1: 20.25/20.33 Transitions: 20.25/20.33 <l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {all remain the same}> 20.25/20.33 <l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}> 20.25/20.33 <l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, rest remain the same}> 20.25/20.33 Variables: 20.25/20.33 x_5^0, y_6^0 20.25/20.33 20.25/20.33 Graph 2: 20.25/20.33 Transitions: 20.25/20.33 Variables: 20.25/20.33 20.25/20.33 Precedence: 20.25/20.33 Graph 0 20.25/20.33 20.25/20.33 Graph 1 20.25/20.33 <l0, l1, true, {all remain the same}> 20.25/20.33 20.25/20.33 Graph 2 20.25/20.33 <l1, l2, y_6^0 <= x_5^0, {all remain the same}> 20.25/20.33 20.25/20.33 Map Locations to Subgraph: 20.25/20.33 ( 0 , 0 ) 20.25/20.33 ( 1 , 1 ) 20.25/20.33 ( 2 , 2 ) 20.25/20.33 20.25/20.33 ******************************************************************************************* 20.25/20.33 ******************************** CHECKING ASSERTIONS ******************************** 20.25/20.33 ******************************************************************************************* 20.25/20.33 20.25/20.33 Proving termination of subgraph 0 20.25/20.33 Proving termination of subgraph 1 20.25/20.33 Checking unfeasibility... 20.25/20.33 Time used: 0.004889 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