details

property	value
status	complete
benchmark	slayer-n2-filtered.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n160.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	44.6093 seconds
cpu usage	44.4819
user time	41.8724
system time	2.6095
max virtual memory	951856.0
max residence set size	277024.0

stage attributes

key	value
starexec-result	NO

output

44.46/44.60 NO 44.46/44.60 44.46/44.60 Solver Timeout: 4 44.46/44.60 Global Timeout: 300 44.46/44.60 No parsing errors! 44.46/44.60 Init Location: 0 44.46/44.60 Transitions: 44.46/44.60 <l0, l6, true> 44.46/44.60 <l1, l2, (undef3 = 0) /\ (0 <= (0 + undef3)) /\ ((0 + undef3) <= 0), par{i_13^0 -> undef3}> 44.46/44.60 <l3, l2, ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef13 = (~(1) + i_13^0)) /\ (undef9 = undef9) /\ (~(1) <= (0 + undef9)) /\ ((0 + undef9) <= ~(1)) /\ (undef8 = undef8) /\ ((0 + undef8) <= (0 + undef9)) /\ ((0 + undef9) <= (0 + undef8)), par{a_19^0 -> undef8, i_13^0 -> undef9}> 44.46/44.60 <l2, l4, ((0 + __const_10^0) <= (0 + i_13^0)), par{rt_11^0 -> (0 + st_14^0)}> 44.46/44.60 <l2, l5, (undef23 = undef23) /\ ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef22 = (~(1) + i_13^0)) /\ ((0 + undef22) <= (~(1) + undef23)) /\ ((~(1) + undef23) <= (0 + undef22)) /\ ((1 + undef23) <= (0 + __const_10^0)), par{i_13^0 -> undef22, i_20^0 -> undef23}> 44.46/44.60 <l5, l2, true> 44.46/44.60 <l6, l1, true> 44.46/44.60 44.46/44.60 Fresh variables: 44.46/44.60 undef3, undef8, undef9, undef13, undef22, undef23, 44.46/44.60 44.46/44.60 Undef variables: 44.46/44.60 undef3, undef8, undef9, undef13, undef22, undef23, 44.46/44.60 44.46/44.60 Abstraction variables: 44.46/44.60 44.46/44.60 Exit nodes: 44.46/44.60 44.46/44.60 Accepting locations: 44.46/44.60 44.46/44.60 Asserts: 44.46/44.60 44.46/44.60 Preprocessed LLVMGraph 44.46/44.60 Init Location: 0 44.46/44.60 Transitions: 44.46/44.60 <l0, l2, (i_13^0 = undef3) /\ (undef3 = 0) /\ (0 <= (0 + undef3)) /\ ((0 + undef3) <= 0)> 44.46/44.60 <l2, l4, ((0 + __const_10^0) <= (0 + i_13^0))> 44.46/44.60 <l2, l2, (undef23 = undef23) /\ ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef22 = (~(1) + i_13^0)) /\ ((0 + undef22) <= (~(1) + undef23)) /\ ((~(1) + undef23) <= (0 + undef22)) /\ ((1 + undef23) <= (0 + __const_10^0)), par{i_13^0 -> undef22}> 44.46/44.60 44.46/44.60 Fresh variables: 44.46/44.60 undef3, undef8, undef9, undef13, undef22, undef23, 44.46/44.60 44.46/44.60 Undef variables: 44.46/44.60 undef3, undef8, undef9, undef13, undef22, undef23, 44.46/44.60 44.46/44.60 Abstraction variables: 44.46/44.60 44.46/44.60 Exit nodes: 44.46/44.60 44.46/44.60 Accepting locations: 44.46/44.60 44.46/44.60 Asserts: 44.46/44.60 44.46/44.60 ************************************************************* 44.46/44.60 ******************************************************************************************* 44.46/44.60 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 44.46/44.60 ******************************************************************************************* 44.46/44.60 44.46/44.60 Init Location: 0 44.47/44.60 Graph 0: 44.47/44.60 Transitions: 44.47/44.60 Variables: 44.47/44.60 44.47/44.60 Graph 1: 44.47/44.60 Transitions: 44.47/44.60 <l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}> 44.47/44.60 Variables: 44.47/44.60 __const_10^0, i_13^0 44.47/44.60 44.47/44.60 Graph 2: 44.47/44.60 Transitions: 44.47/44.60 Variables: 44.47/44.60 44.47/44.60 Precedence: 44.47/44.60 Graph 0 44.47/44.60 44.47/44.60 Graph 1 44.47/44.60 <l0, l2, i_13^0 = undef3 /\ undef3 = 0, {all remain the same}> 44.47/44.60 44.47/44.60 Graph 2 44.47/44.60 <l2, l4, __const_10^0 <= i_13^0, {all remain the same}> 44.47/44.60 44.47/44.60 Map Locations to Subgraph: 44.47/44.60 ( 0 , 0 ) 44.47/44.60 ( 2 , 1 ) 44.47/44.60 ( 4 , 2 ) 44.47/44.60 44.47/44.60 ******************************************************************************************* 44.47/44.60 ******************************** CHECKING ASSERTIONS ******************************** 44.47/44.60 ******************************************************************************************* 44.47/44.60 44.47/44.60 Proving termination of subgraph 0 44.47/44.60 Proving termination of subgraph 1 44.47/44.60 Checking unfeasibility... 44.47/44.60 Time used: 0.002247 44.47/44.60 44.47/44.60 Checking conditional termination of SCC {l2}... 44.47/44.60 44.47/44.60 LOG: CALL solveLinear 44.47/44.60 44.47/44.60 LOG: RETURN solveLinear - Elapsed time: 0.000764s 44.47/44.60 44.47/44.60 LOG: CALL solveLinear 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