Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432276062
details
property
value
status
complete
benchmark
n-1.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.22403 seconds
cpu usage
5.22434
user time
4.9145
system time
0.309845
max virtual memory
798056.0
max residence set size
116448.0
stage attributes
key
value
starexec-result
NO
output
5.19/5.22 NO 5.19/5.22 5.21/5.22 Solver Timeout: 4 5.21/5.22 Global Timeout: 300 5.21/5.22 No parsing errors! 5.21/5.22 Init Location: 0 5.21/5.22 Transitions: 5.21/5.22 <l0, l7, true> 5.21/5.22 <l1, l2, (undef8 = undef8) /\ (undef7 = undef7), par{x_5^0 -> undef7, y_6^0 -> undef8}> 5.21/5.22 <l2, l3, (undef17 = (0 + cnt_15^0)) /\ (undef18 = (0 + cnt_20^0)) /\ ((0 + undef17) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef17)) /\ (undef13 = undef13) /\ (undef14 = undef14) /\ (undef9 = undef9), par{Result_4^0 -> undef9, lt_8^0 -> undef13, lt_9^0 -> undef14}> 5.21/5.22 <l2, l4, true, par{lt_8^0 -> (0 + cnt_15^0), lt_9^0 -> (0 + cnt_20^0)}> 5.21/5.22 <l4, l5, ((1 + lt_8^0) <= (0 + lt_9^0))> 5.21/5.22 <l4, l5, ((1 + lt_9^0) <= (0 + lt_8^0))> 5.21/5.22 <l5, l6, (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46), par{lt_7^0 -> undef46, lt_8^0 -> undef47, lt_9^0 -> undef48}> 5.21/5.22 <l6, l2, true> 5.21/5.22 <l7, l1, true> 5.21/5.22 5.21/5.22 Fresh variables: 5.21/5.22 undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 5.21/5.22 5.21/5.22 Undef variables: 5.21/5.22 undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 5.21/5.22 5.21/5.22 Abstraction variables: 5.21/5.22 5.21/5.22 Exit nodes: 5.21/5.22 5.21/5.22 Accepting locations: 5.21/5.22 5.21/5.22 Asserts: 5.21/5.22 5.21/5.22 Preprocessed LLVMGraph 5.21/5.22 Init Location: 0 5.21/5.22 Transitions: 5.21/5.22 <l0, l2, (undef8 = undef8) /\ (undef7 = undef7)> 5.21/5.22 <l2, l3, (undef17 = (0 + cnt_15^0)) /\ (undef18 = (0 + cnt_20^0)) /\ ((0 + undef17) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef17)) /\ (undef13 = undef13) /\ (undef14 = undef14) /\ (undef9 = undef9)> 5.21/5.22 <l2, l2, ((1 + (0 + cnt_15^0)) <= (0 + (0 + cnt_20^0))) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46)> 5.21/5.22 <l2, l2, ((1 + (0 + cnt_20^0)) <= (0 + (0 + cnt_15^0))) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46)> 5.21/5.22 5.21/5.22 Fresh variables: 5.21/5.22 undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 5.21/5.22 5.21/5.22 Undef variables: 5.21/5.22 undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 5.21/5.22 5.21/5.22 Abstraction variables: 5.21/5.22 5.21/5.22 Exit nodes: 5.21/5.22 5.21/5.22 Accepting locations: 5.21/5.22 5.21/5.22 Asserts: 5.21/5.22 5.21/5.22 ************************************************************* 5.21/5.22 ******************************************************************************************* 5.21/5.22 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.21/5.22 ******************************************************************************************* 5.21/5.22 5.21/5.22 Init Location: 0 5.21/5.22 Graph 0: 5.21/5.22 Transitions: 5.21/5.22 Variables: 5.21/5.22 5.21/5.22 Graph 1: 5.21/5.22 Transitions: 5.21/5.22 <l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}> 5.21/5.22 <l2, l2, 1 + cnt_20^0 <= cnt_15^0 /\ cnt_15^0 = undef51, {all remain the same}> 5.21/5.22 Variables: 5.21/5.22 cnt_15^0, cnt_20^0 5.21/5.22 5.21/5.22 Graph 2: 5.21/5.22 Transitions: 5.21/5.22 Variables: 5.21/5.22 5.21/5.22 Precedence: 5.21/5.22 Graph 0 5.21/5.22 5.21/5.22 Graph 1 5.21/5.22 <l0, l2, true, {all remain the same}> 5.21/5.22 5.21/5.22 Graph 2 5.21/5.22 <l2, l3, cnt_15^0 = undef17 /\ cnt_20^0 = undef18 /\ undef17 = undef18, {all remain the same}> 5.21/5.22 5.21/5.22 Map Locations to Subgraph: 5.21/5.22 ( 0 , 0 ) 5.21/5.22 ( 2 , 1 ) 5.21/5.22 ( 3 , 2 ) 5.21/5.22 5.21/5.22 ******************************************************************************************* 5.21/5.22 ******************************** CHECKING ASSERTIONS ******************************** 5.21/5.22 ******************************************************************************************* 5.21/5.22 5.21/5.22 Proving termination of subgraph 0 5.21/5.22 Proving termination of subgraph 1 5.21/5.22 Checking unfeasibility... 5.21/5.22 Time used: 0.003305 5.21/5.22 5.21/5.22 > No variable changes in termination graph. 5.21/5.22 Checking conditional unfeasibility... 5.21/5.22 Calling Safety with literal cnt_20^0 <= cnt_15^0 and entry <l2, l2, true, {all remain the same}>
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