Integer_Transition_Systems 2019-03-29 01.54 pair #432274286

details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	32.4546 seconds
cpu usage	32.4518
user time	30.9346
system time	1.5172
max virtual memory	1001036.0
max residence set size	331636.0

stage attributes

key	value
starexec-result	NO

output

32.36/32.45	NO
32.36/32.45	
32.36/32.45	Solver Timeout: 4
32.36/32.45	Global Timeout: 300
32.36/32.45	No parsing errors!
32.36/32.45	Init Location: 0
32.36/32.45	Transitions:
32.36/32.45	<l0, l7, true>
32.36/32.45	<l1, l2, true>
32.36/32.45	<l3, l4, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)), par{Result_4^0 -> (0 + undef10), __cil_tmp4_8^0 -> undef10, __retres3_7^0 -> undef12}>
32.36/32.45	<l3, l5, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + (~(1) * d_6^0)) + i_5^0)}>
32.36/32.45	<l5, l3, true>
32.36/32.45	<l2, l4, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)), par{Result_4^0 -> (0 + undef31), __cil_tmp4_8^0 -> undef31, __retres3_7^0 -> undef33}>
32.36/32.45	<l2, l3, (0 <= (~(1) + (~(1) * d_6^0)))>
32.36/32.45	<l4, l6, (undef46 = 0) /\ (undef44 = (0 + undef46)), par{Result_4^0 -> (0 + undef44), __cil_tmp2_10^0 -> undef44, __retres1_9^0 -> undef46}>
32.36/32.45	<l7, l1, true>
32.36/32.45	
32.36/32.45	Fresh variables:
32.36/32.45	undef10, undef12, undef31, undef33, undef44, undef46, 
32.36/32.45	
32.36/32.45	Undef variables:
32.36/32.45	undef10, undef12, undef31, undef33, undef44, undef46, 
32.36/32.45	
32.36/32.45	Abstraction variables:
32.36/32.45	
32.36/32.45	Exit nodes:
32.36/32.45	
32.36/32.45	Accepting locations:
32.36/32.45	
32.36/32.45	Asserts:
32.36/32.45	
32.36/32.45	Preprocessed LLVMGraph
32.36/32.45	Init Location: 0
32.36/32.45	Transitions:
32.36/32.45	<l0, l6, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))>
32.36/32.45	<l0, l3, (0 <= (~(1) + (~(1) * d_6^0)))>
32.36/32.45	<l3, l6, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))>
32.36/32.45	<l3, l3, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + (~(1) * d_6^0)) + i_5^0)}>
32.36/32.45	
32.36/32.45	Fresh variables:
32.36/32.45	undef10, undef12, undef31, undef33, undef44, undef46, 
32.36/32.45	
32.36/32.45	Undef variables:
32.36/32.45	undef10, undef12, undef31, undef33, undef44, undef46, 
32.36/32.45	
32.36/32.45	Abstraction variables:
32.36/32.45	
32.36/32.45	Exit nodes:
32.36/32.45	
32.36/32.45	Accepting locations:
32.36/32.45	
32.36/32.45	Asserts:
32.36/32.45	
32.36/32.45	*************************************************************
32.36/32.45	*******************************************************************************************
32.36/32.45	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
32.36/32.45	*******************************************************************************************
32.36/32.45	
32.36/32.45	Init Location: 0
32.36/32.45	Graph 0:
32.36/32.45	Transitions:
32.36/32.45	Variables:
32.36/32.45	
32.36/32.45	Graph 1:
32.36/32.45	Transitions:
32.36/32.45	<l3, l3, 0 <= i_5^0, {i_5^0 -> -d_6^0 + i_5^0, rest remain the same}>
32.36/32.45	Variables:
32.36/32.45	d_6^0, i_5^0
32.36/32.45	
32.36/32.45	Graph 2:
32.36/32.45	Transitions:
32.36/32.45	Variables:
32.36/32.45	
32.36/32.45	Precedence: 
32.36/32.45	Graph 0
32.36/32.45	
32.36/32.45	Graph 1
32.36/32.45	<l0, l3, 1 + d_6^0 <= 0, {all remain the same}>
32.36/32.45	
32.36/32.45	Graph 2
32.36/32.45	<l0, l6, 0 <= d_6^0 /\ undef31 = undef33 /\ undef33 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}>
32.36/32.45	<l3, l6, 1 + i_5^0 <= 0 /\ undef10 = undef12 /\ undef12 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}>
32.36/32.45	
32.36/32.45	Map Locations to Subgraph:
32.36/32.45	( 0 , 0 )
32.36/32.45	( 3 , 1 )
32.36/32.45	( 6 , 2 )
32.36/32.45	
32.36/32.45	*******************************************************************************************
32.36/32.45	********************************    CHECKING ASSERTIONS    ********************************
32.36/32.45	*******************************************************************************************
32.36/32.45	
32.36/32.45	Proving termination of subgraph 0
32.36/32.45	Proving termination of subgraph 1
32.36/32.45	Checking unfeasibility...
32.36/32.45	Time used: 0.002297
32.36/32.45	
32.36/32.45	Checking conditional termination of SCC {l3}...
32.36/32.45	
32.36/32.45	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