details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	0.0674981 seconds
cpu usage	0.067632
user time	0.052815
system time	0.014817
max virtual memory	113176.0
max residence set size	7220.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.06 YES 0.00/0.06 0.00/0.06 Solver Timeout: 4 0.00/0.06 Global Timeout: 300 0.00/0.06 No parsing errors! 0.00/0.06 Init Location: 0 0.00/0.06 Transitions: 0.00/0.06 <l0, l18, true> 0.00/0.06 <l1, l2, ((0 + nodecount^0) <= (0 + i^0))> 0.00/0.06 <l1, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l4, l5, true> 0.00/0.06 <l6, l7, true, par{i^0 -> (1 + i^0)}> 0.00/0.06 <l6, l2, true> 0.00/0.06 <l8, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}> 0.00/0.06 <l8, l6, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef62 = undef62) /\ (undef63 = undef63), par{x^0 -> undef62, y^0 -> undef63}> 0.00/0.06 <l9, l10, true> 0.00/0.06 <l11, l12, true, par{j^0 -> (1 + j^0)}> 0.00/0.06 <l13, l9, ((0 + edgecount^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l13, l11, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef98 = undef98) /\ (undef99 = undef99), par{x^0 -> undef98, y^0 -> undef99}> 0.00/0.06 <l12, l13, true> 0.00/0.06 <l10, l7, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}> 0.00/0.06 <l10, l12, ((1 + i^0) <= (0 + nodecount^0)), par{j^0 -> 0}> 0.00/0.06 <l14, l15, true> 0.00/0.06 <l15, l4, true, par{i^0 -> (1 + i^0)}> 0.00/0.06 <l16, l14, ((1 + source^0) <= (0 + i^0))> 0.00/0.06 <l16, l14, ((1 + i^0) <= (0 + source^0))> 0.00/0.06 <l16, l15, ((0 + i^0) <= (0 + source^0)) /\ ((0 + source^0) <= (0 + i^0))> 0.00/0.06 <l5, l9, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}> 0.00/0.06 <l5, l16, ((1 + i^0) <= (0 + nodecount^0))> 0.00/0.06 <l7, l8, true> 0.00/0.06 <l3, l1, true> 0.00/0.06 <l17, l4, true, par{edgecount^0 -> (0 + __const_7^0), i^0 -> 0, nodecount^0 -> (0 + __const_5^0), source^0 -> 0}> 0.00/0.06 <l18, l17, true> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef62, undef63, undef98, undef99, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef62, undef63, undef98, undef99, 0.00/0.06 0.00/0.06 Abstraction variables: 0.00/0.06 0.00/0.06 Exit nodes: 0.00/0.06 0.00/0.06 Accepting locations: 0.00/0.06 0.00/0.06 Asserts: 0.00/0.06 0.00/0.06 Preprocessed LLVMGraph 0.00/0.06 Init Location: 0 0.00/0.06 Transitions: 0.00/0.06 <l0, l4, (edgecount^0 = (0 + edgecount^0)) /\ (i^0 = 0) /\ (nodecount^0 = (0 + nodecount^0)) /\ (0 = 0)> 0.00/0.06 <l3, l2, ((0 + nodecount^0) <= (0 + i^0))> 0.00/0.06 <l3, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l4, l7, ((0 + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0}> 0.00/0.06 <l4, l12, ((0 + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + nodecount^0)), par{i^0 -> 0, j^0 -> 0}> 0.00/0.06 <l4, l4, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l4, l4, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + i^0) <= (0 + 0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l4, l4, ((1 + i^0) <= (0 + nodecount^0)) /\ ((0 + i^0) <= (0 + 0)) /\ ((0 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l7, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}> 0.00/0.06 <l7, l7, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef62 = undef62) /\ (undef63 = undef63), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l7, l2, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef62 = undef62) /\ (undef63 = undef63)> 0.00/0.06 <l12, l7, ((0 + edgecount^0) <= (0 + j^0)) /\ ((0 + nodecount^0) <= (0 + (1 + i^0))), par{i^0 -> 0}> 0.00/0.06 <l12, l12, ((0 + edgecount^0) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0), j^0 -> 0}> 0.00/0.06 <l12, l12, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef98 = undef98) /\ (undef99 = undef99), par{j^0 -> (1 + j^0)}> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef62, undef63, undef98, undef99, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef62, undef63, undef98, undef99, 0.00/0.06 0.00/0.06 Abstraction variables: 0.00/0.06 0.00/0.06 Exit nodes: 0.00/0.06 0.00/0.06 Accepting locations: 0.00/0.06 0.00/0.06 Asserts: 0.00/0.06 0.00/0.06 ************************************************************* 0.00/0.06 ******************************************************************************************* 0.00/0.06 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.06 ******************************************************************************************* 0.00/0.06 0.00/0.06 Init Location: 0 0.00/0.06 Graph 0: 0.00/0.06 Transitions: 0.00/0.06 Variables: 0.00/0.06 0.00/0.06 Graph 1: 0.00/0.06 Transitions: 0.00/0.06 <l4, l4, 1 + i^0 <= nodecount^0 /\ 1 <= i^0, {i^0 -> 1 + i^0, rest remain the same}> 0.00/0.06 <l4, l4, 1 + i^0 <= 0 /\ 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}> 0.00/0.06 <l4, l4, 1 + i^0 <= nodecount^0 /\ i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}> 0.00/0.06 Variables: 0.00/0.06 i^0, nodecount^0 0.00/0.06 0.00/0.06 Graph 2: 0.00/0.06 Transitions: 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