Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274055
details
property
value
status
complete
benchmark
mc91test.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n174.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.695539 seconds
cpu usage
0.695597
user time
0.637331
system time
0.058266
max virtual memory
693512.0
max residence set size
38520.0
stage attributes
key
value
starexec-result
YES
output
0.63/0.69 YES 0.63/0.69 0.63/0.69 Solver Timeout: 4 0.63/0.69 Global Timeout: 300 0.63/0.69 No parsing errors! 0.63/0.69 Init Location: 0 0.63/0.69 Transitions: 0.63/0.69 <l0, l8, true> 0.63/0.69 <l1, l2, (1 <= (0 + copied^0)) /\ ((0 + olde^0) <= (0 + e^0)) /\ ((0 + n^0) <= (0 + oldn^0))> 0.63/0.69 <l1, l3, ((0 + copied^0) <= 0) /\ (1 <= (0 + e^0)) /\ ((0 + n^0) <= 100), par{copied^0 -> 1, e^0 -> (1 + e^0), n^0 -> (11 + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> 0.63/0.69 <l3, l1, true> 0.63/0.69 <l1, l4, ((0 + copied^0) <= 0) /\ (1 <= (0 + e^0)) /\ (101 <= (0 + n^0)), par{copied^0 -> 1, e^0 -> (~(1) + e^0), n^0 -> (~(10) + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> 0.63/0.69 <l4, l1, true> 0.63/0.69 <l1, l5, (1 <= (0 + e^0)) /\ ((0 + n^0) <= 100), par{e^0 -> (1 + e^0), n^0 -> (11 + n^0)}> 0.63/0.69 <l5, l1, true> 0.63/0.69 <l1, l6, (1 <= (0 + e^0)) /\ (101 <= (0 + n^0)), par{e^0 -> (~(1) + e^0), n^0 -> (~(10) + n^0)}> 0.63/0.69 <l6, l1, true> 0.63/0.69 <l7, l1, (undef48 = undef48), par{copied^0 -> 0, e^0 -> 1, n^0 -> undef48}> 0.63/0.69 <l8, l7, true> 0.63/0.69 0.63/0.69 Fresh variables: 0.63/0.69 undef48, 0.63/0.69 0.63/0.69 Undef variables: 0.63/0.69 undef48, 0.63/0.69 0.63/0.69 Abstraction variables: 0.63/0.69 0.63/0.69 Exit nodes: 0.63/0.69 0.63/0.69 Accepting locations: 0.63/0.69 0.63/0.69 Asserts: 0.63/0.69 0.63/0.69 Preprocessed LLVMGraph 0.63/0.69 Init Location: 0 0.63/0.69 Transitions: 0.63/0.69 <l0, l1, (copied^0 = 0) /\ (e^0 = 1) /\ (n^0 = undef48) /\ (undef48 = undef48)> 0.63/0.69 <l1, l2, (1 <= (0 + copied^0)) /\ ((0 + olde^0) <= (0 + e^0)) /\ ((0 + n^0) <= (0 + oldn^0))> 0.63/0.69 <l1, l1, ((0 + copied^0) <= 0) /\ (1 <= (0 + e^0)) /\ ((0 + n^0) <= 100), par{copied^0 -> 1, e^0 -> (1 + e^0), n^0 -> (11 + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> 0.63/0.69 <l1, l1, ((0 + copied^0) <= 0) /\ (1 <= (0 + e^0)) /\ (101 <= (0 + n^0)), par{copied^0 -> 1, e^0 -> (~(1) + e^0), n^0 -> (~(10) + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> 0.63/0.69 <l1, l1, (1 <= (0 + e^0)) /\ ((0 + n^0) <= 100), par{e^0 -> (1 + e^0), n^0 -> (11 + n^0)}> 0.63/0.69 <l1, l1, (1 <= (0 + e^0)) /\ (101 <= (0 + n^0)), par{e^0 -> (~(1) + e^0), n^0 -> (~(10) + n^0)}> 0.63/0.69 0.63/0.69 Fresh variables: 0.63/0.69 undef48, 0.63/0.69 0.63/0.69 Undef variables: 0.63/0.69 undef48, 0.63/0.69 0.63/0.69 Abstraction variables: 0.63/0.69 0.63/0.69 Exit nodes: 0.63/0.69 0.63/0.69 Accepting locations: 0.63/0.69 0.63/0.69 Asserts: 0.63/0.69 0.63/0.69 ************************************************************* 0.63/0.69 ******************************************************************************************* 0.63/0.69 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.63/0.69 ******************************************************************************************* 0.63/0.69 0.63/0.69 Init Location: 0 0.63/0.69 Graph 0: 0.63/0.69 Transitions: 0.63/0.69 Variables: 0.63/0.69 0.63/0.69 Graph 1: 0.63/0.69 Transitions: 0.63/0.69 <l1, l1, 1 <= e^0 /\ copied^0 <= 0 /\ n^0 <= 100, {copied^0 -> 1, e^0 -> 1 + e^0, n^0 -> 11 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 0.63/0.69 <l1, l1, 1 <= e^0 /\ copied^0 <= 0 /\ 101 <= n^0, {copied^0 -> 1, e^0 -> -1 + e^0, n^0 -> -10 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> 0.63/0.69 <l1, l1, 1 <= e^0 /\ n^0 <= 100, {e^0 -> 1 + e^0, n^0 -> 11 + n^0, rest remain the same}> 0.63/0.69 <l1, l1, 1 <= e^0 /\ 101 <= n^0, {e^0 -> -1 + e^0, n^0 -> -10 + n^0, rest remain the same}> 0.63/0.69 Variables: 0.63/0.69 copied^0, e^0, n^0, olde^0, oldn^0 0.63/0.69 0.63/0.69 Graph 2: 0.63/0.69 Transitions: 0.63/0.69 Variables: 0.63/0.69 0.63/0.69 Precedence: 0.63/0.69 Graph 0 0.63/0.69 0.63/0.69 Graph 1 0.63/0.69 <l0, l1, copied^0 = 0 /\ n^0 = undef48 /\ e^0 = 1, {all remain the same}> 0.63/0.69 0.63/0.69 Graph 2 0.63/0.69 <l1, l2, 1 <= copied^0 /\ olde^0 <= e^0 /\ n^0 <= oldn^0, {all remain the same}> 0.63/0.69 0.63/0.69 Map Locations to Subgraph: 0.63/0.69 ( 0 , 0 ) 0.63/0.69 ( 1 , 1 ) 0.63/0.69 ( 2 , 2 ) 0.63/0.69 0.63/0.69 ******************************************************************************************* 0.63/0.69 ******************************** CHECKING ASSERTIONS ******************************** 0.63/0.69 ******************************************************************************************* 0.63/0.69 0.63/0.69 Proving termination of subgraph 0
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