Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275249
details
property
value
status
complete
benchmark
n-1c.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.37239 seconds
cpu usage
5.37165
user time
5.07889
system time
0.292757
max virtual memory
751320.0
max residence set size
88028.0
stage attributes
key
value
starexec-result
NO
output
5.32/5.36 NO 5.32/5.36 5.32/5.37 Solver Timeout: 4 5.32/5.37 Global Timeout: 300 5.32/5.37 No parsing errors! 5.32/5.37 Init Location: 0 5.32/5.37 Transitions: 5.32/5.37 <l0, l8, true> 5.32/5.37 <l1, l2, (undef10 = undef10) /\ (undef9 = undef9), par{x_5^0 -> undef9, y_6^0 -> undef10}> 5.32/5.37 <l2, l3, (undef22 = (0 + cnt_16^0)) /\ (undef21 = (0 + cnt_21^0)) /\ (((0 + undef21) + (~(1) * undef22)) <= 0) /\ (undef17 = undef17) /\ (undef15 = undef15) /\ (undef11 = undef11), par{Result_4^0 -> undef11, lt_10^0 -> undef15, lt_9^0 -> undef17}> 5.32/5.37 <l2, l4, (undef34 = (0 + cnt_16^0)) /\ (undef33 = (0 + cnt_21^0)) /\ (0 <= ((~(1) + undef33) + (~(1) * undef34))) /\ (undef29 = undef29) /\ (undef27 = undef27) /\ (undef30 = undef30) /\ ((0 + undef30) <= 0) /\ (0 <= (0 + undef30)), par{lt_10^0 -> undef27, lt_9^0 -> undef29, tmp_7^0 -> undef30}> 5.32/5.37 <l4, l2, true> 5.32/5.37 <l2, l5, (undef56 = (0 + cnt_16^0)) /\ (undef55 = (0 + cnt_21^0)) /\ (0 <= ((~(1) + undef55) + (~(1) * undef56))) /\ (undef51 = undef51) /\ (undef49 = undef49) /\ (undef52 = undef52), par{lt_10^0 -> undef49, lt_9^0 -> undef51, tmp_7^0 -> undef52}> 5.32/5.37 <l5, l6, (undef58 = __disjvr_0^0) /\ (__disjvr_0^0 = undef58), par{__disjvr_0^0 -> undef58}> 5.32/5.37 <l6, l7, (undef77 = (0 + cnt_16^0)) /\ (undef72 = undef72), par{lt_8^0 -> undef72}> 5.32/5.37 <l7, l2, true> 5.32/5.37 <l8, l1, true> 5.32/5.37 5.32/5.37 Fresh variables: 5.32/5.37 undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 5.32/5.37 5.32/5.37 Undef variables: 5.32/5.37 undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 5.32/5.37 5.32/5.37 Abstraction variables: 5.32/5.37 5.32/5.37 Exit nodes: 5.32/5.37 5.32/5.37 Accepting locations: 5.32/5.37 5.32/5.37 Asserts: 5.32/5.37 5.32/5.37 Preprocessed LLVMGraph 5.32/5.37 Init Location: 0 5.32/5.37 Transitions: 5.32/5.37 <l0, l2, (undef10 = undef10) /\ (undef9 = undef9)> 5.32/5.37 <l2, l3, (undef22 = (0 + cnt_16^0)) /\ (undef21 = (0 + cnt_21^0)) /\ (((0 + undef21) + (~(1) * undef22)) <= 0) /\ (undef17 = undef17) /\ (undef15 = undef15) /\ (undef11 = undef11)> 5.32/5.37 <l2, l2, (undef34 = (0 + cnt_16^0)) /\ (undef33 = (0 + cnt_21^0)) /\ (0 <= ((~(1) + undef33) + (~(1) * undef34))) /\ (undef29 = undef29) /\ (undef27 = undef27) /\ (undef30 = undef30) /\ ((0 + undef30) <= 0) /\ (0 <= (0 + undef30))> 5.32/5.37 <l2, l2, (undef56 = (0 + cnt_16^0)) /\ (undef55 = (0 + cnt_21^0)) /\ (0 <= ((~(1) + undef55) + (~(1) * undef56))) /\ (undef51 = undef51) /\ (undef49 = undef49) /\ (undef52 = undef52) /\ (undef58 = __disjvr_0^0) /\ (__disjvr_0^0 = undef58) /\ (undef77 = (0 + cnt_16^0)) /\ (undef72 = undef72), par{__disjvr_0^0 -> undef58}> 5.32/5.37 5.32/5.37 Fresh variables: 5.32/5.37 undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 5.32/5.37 5.32/5.37 Undef variables: 5.32/5.37 undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 5.32/5.37 5.32/5.37 Abstraction variables: 5.32/5.37 5.32/5.37 Exit nodes: 5.32/5.37 5.32/5.37 Accepting locations: 5.32/5.37 5.32/5.37 Asserts: 5.32/5.37 5.32/5.37 ************************************************************* 5.32/5.37 ******************************************************************************************* 5.32/5.37 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.32/5.37 ******************************************************************************************* 5.32/5.37 5.32/5.37 Init Location: 0 5.32/5.37 Graph 0: 5.32/5.37 Transitions: 5.32/5.37 Variables: 5.32/5.37 5.32/5.37 Graph 1: 5.32/5.37 Transitions: 5.32/5.37 <l2, l2, 1 + undef34 <= undef33 /\ cnt_16^0 = undef34 /\ cnt_21^0 = undef33 /\ undef30 = 0, {all remain the same}> 5.32/5.37 <l2, l2, 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}> 5.32/5.37 Variables: 5.32/5.37 cnt_16^0, cnt_21^0, __disjvr_0^0 5.32/5.37 5.32/5.37 Graph 2: 5.32/5.37 Transitions: 5.32/5.37 Variables: 5.32/5.37 5.32/5.37 Precedence: 5.32/5.37 Graph 0 5.32/5.37 5.32/5.37 Graph 1 5.32/5.37 <l0, l2, true, {all remain the same}> 5.32/5.37 5.32/5.37 Graph 2 5.32/5.37 <l2, l3, undef21 <= undef22 /\ cnt_16^0 = undef22 /\ cnt_21^0 = undef21, {all remain the same}> 5.32/5.37 5.32/5.37 Map Locations to Subgraph: 5.32/5.37 ( 0 , 0 ) 5.32/5.37 ( 2 , 1 ) 5.32/5.37 ( 3 , 2 ) 5.32/5.37 5.32/5.37 ******************************************************************************************* 5.32/5.37 ******************************** CHECKING ASSERTIONS ******************************** 5.32/5.37 ******************************************************************************************* 5.32/5.37 5.32/5.37 Proving termination of subgraph 0 5.32/5.37 Proving termination of subgraph 1 5.32/5.37 Checking unfeasibility... 5.32/5.37 Time used: 0.004364 5.32/5.37 5.32/5.37 Checking conditional termination of SCC {l2}... 5.32/5.37
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