Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275225
details
property
value
status
complete
benchmark
randomwalk_withassume.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n083.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.126381 seconds
cpu usage
0.126418
user time
0.105637
system time
0.020781
max virtual memory
113176.0
max residence set size
18528.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.12 YES 0.00/0.12 0.00/0.12 Solver Timeout: 4 0.00/0.12 Global Timeout: 300 0.00/0.12 No parsing errors! 0.00/0.12 Init Location: 0 0.00/0.12 Transitions: 0.00/0.12 <l0, l11, true> 0.00/0.12 <l1, l2, true> 0.00/0.12 <l3, l4, ((0 + seq^0) <= (1 + N^0))> 0.00/0.12 <l5, l3, (1 <= (0 + choice^0)), par{walker^0 -> (1 + walker^0)}> 0.00/0.12 <l5, l3, ((0 + choice^0) <= 0), par{walker^0 -> (~(1) + walker^0)}> 0.00/0.12 <l6, l4, (undef33 = 1) /\ (undef35 = undef35) /\ (0 <= (0 + undef35)) /\ (undef29 = undef29) /\ ((0 + undef29) <= 2) /\ (2 <= (0 + undef29)), par{N^0 -> undef29, i^0 -> (0 + undef33), pos^0 -> 0, seq^0 -> undef33, walker^0 -> 1, z^0 -> undef35}> 0.00/0.12 <l7, l5, ((0 + i^0) <= 0) /\ (undef40 = (1 + seq^0)) /\ (undef42 = undef42) /\ (0 <= (0 + undef42)), par{i^0 -> (0 + undef40), seq^0 -> undef40, z^0 -> undef42}> 0.00/0.12 <l7, l5, (1 <= (0 + i^0)) /\ ((0 + choice^0) <= 0), par{i^0 -> (~(1) + i^0)}> 0.00/0.12 <l8, l5, (1 <= (0 + z^0)), par{z^0 -> (~(1) + z^0)}> 0.00/0.12 <l8, l7, ((0 + z^0) <= 0)> 0.00/0.12 <l9, l1, ((1 + walker^0) <= 1)> 0.00/0.12 <l9, l8, (1 <= (0 + walker^0)) /\ (undef72 = undef72) /\ (0 <= (0 + undef72)) /\ ((0 + undef72) <= 1), par{choice^0 -> undef72}> 0.00/0.12 <l10, l1, ((1 + N^0) <= (0 + walker^0))> 0.00/0.12 <l10, l9, ((0 + walker^0) <= (0 + N^0))> 0.00/0.12 <l4, l10, true> 0.00/0.12 <l11, l6, true> 0.00/0.12 0.00/0.12 Fresh variables: 0.00/0.12 undef29, undef33, undef35, undef40, undef42, undef72, 0.00/0.12 0.00/0.12 Undef variables: 0.00/0.12 undef29, undef33, undef35, undef40, undef42, undef72, 0.00/0.12 0.00/0.12 Abstraction variables: 0.00/0.12 0.00/0.12 Exit nodes: 0.00/0.12 0.00/0.12 Accepting locations: 0.00/0.12 0.00/0.12 Asserts: 0.00/0.12 0.00/0.12 Preprocessed LLVMGraph 0.00/0.12 Init Location: 0 0.00/0.12 Transitions: 0.00/0.12 <l0, l4, (N^0 = undef29) /\ (i^0 = (0 + undef33)) /\ (seq^0 = undef33) /\ (walker^0 = 1) /\ (z^0 = undef35) /\ (undef33 = 1) /\ (undef35 = undef35) /\ (0 <= (0 + undef35)) /\ (undef29 = undef29) /\ ((0 + undef29) <= 2) /\ (2 <= (0 + undef29))> 0.00/0.12 <l4, l2, ((1 + N^0) <= (0 + walker^0))> 0.00/0.12 <l4, l2, ((0 + walker^0) <= (0 + N^0)) /\ ((1 + walker^0) <= 1)> 0.00/0.12 <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef72 = undef72) /\ (0 <= (0 + undef72)) /\ ((0 + undef72) <= 1) /\ (1 <= (0 + z^0)) /\ (1 <= (0 + undef72)) /\ ((0 + seq^0) <= (1 + N^0)), par{walker^0 -> (1 + walker^0), z^0 -> (~(1) + z^0)}> 0.00/0.12 <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef72 = undef72) /\ (0 <= (0 + undef72)) /\ ((0 + undef72) <= 1) /\ (1 <= (0 + z^0)) /\ ((0 + undef72) <= 0) /\ ((0 + seq^0) <= (1 + N^0)), par{walker^0 -> (~(1) + walker^0), z^0 -> (~(1) + z^0)}> 0.00/0.12 <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef72 = undef72) /\ (0 <= (0 + undef72)) /\ ((0 + undef72) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef40 = (1 + seq^0)) /\ (undef42 = undef42) /\ (0 <= (0 + undef42)) /\ (1 <= (0 + undef72)) /\ ((0 + undef40) <= (1 + N^0)), par{i^0 -> (0 + undef40), seq^0 -> undef40, walker^0 -> (1 + walker^0), z^0 -> undef42}> 0.00/0.12 <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef72 = undef72) /\ (0 <= (0 + undef72)) /\ ((0 + undef72) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef40 = (1 + seq^0)) /\ (undef42 = undef42) /\ (0 <= (0 + undef42)) /\ ((0 + undef72) <= 0) /\ ((0 + undef40) <= (1 + N^0)), par{i^0 -> (0 + undef40), seq^0 -> undef40, walker^0 -> (~(1) + walker^0), z^0 -> undef42}> 0.00/0.12 <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef72 = undef72) /\ (0 <= (0 + undef72)) /\ ((0 + undef72) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ ((0 + undef72) <= 0) /\ ((0 + undef72) <= 0) /\ ((0 + seq^0) <= (1 + N^0)), par{i^0 -> (~(1) + i^0), walker^0 -> (~(1) + walker^0)}> 0.00/0.12 0.00/0.12 Fresh variables: 0.00/0.12 undef29, undef33, undef35, undef40, undef42, undef72, 0.00/0.12 0.00/0.12 Undef variables: 0.00/0.12 undef29, undef33, undef35, undef40, undef42, undef72, 0.00/0.12 0.00/0.12 Abstraction variables: 0.00/0.12 0.00/0.12 Exit nodes: 0.00/0.12 0.00/0.12 Accepting locations: 0.00/0.12 0.00/0.12 Asserts: 0.00/0.12 0.00/0.12 ************************************************************* 0.00/0.12 ******************************************************************************************* 0.00/0.12 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.12 ******************************************************************************************* 0.00/0.12 0.00/0.12 Init Location: 0 0.00/0.12 Graph 0: 0.00/0.12 Transitions: 0.00/0.12 Variables: 0.00/0.12 0.00/0.12 Graph 1: 0.00/0.12 Transitions: 0.00/0.12 <l4, l4, walker^0 <= N^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef72 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}> 0.00/0.12 <l4, l4, walker^0 <= N^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef72 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}> 0.00/0.12 <l4, l4, walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef42 /\ 1 <= walker^0 /\ undef40 <= 1 + N^0 /\ 1 + seq^0 = undef40 /\ undef72 = 1, {i^0 -> undef40, seq^0 -> undef40, walker^0 -> 1 + walker^0, z^0 -> undef42, rest remain the same}> 0.00/0.12 <l4, l4, walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef42 /\ 1 <= walker^0 /\ undef40 <= 1 + N^0 /\ undef72 = 0 /\ 1 + seq^0 = undef40, {i^0 -> undef40, seq^0 -> undef40, walker^0 -> -1 + walker^0, z^0 -> undef42, rest remain the same}> 0.00/0.12 <l4, l4, walker^0 <= N^0 /\ z^0 <= 0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ seq^0 <= 1 + N^0 /\ undef72 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}> 0.00/0.12 Variables: 0.00/0.12 N^0, seq^0, walker^0, z^0, i^0 0.00/0.12 0.00/0.12 Graph 2: 0.00/0.12 Transitions: 0.00/0.12 Variables: 0.00/0.12 0.00/0.12 Precedence: 0.00/0.12 Graph 0 0.00/0.12 0.00/0.12 Graph 1 0.00/0.12 <l0, l4, 0 <= undef35 /\ N^0 = undef29 /\ i^0 = undef33 /\ seq^0 = undef33 /\ z^0 = undef35 /\ walker^0 = 1 /\ undef33 = 1 /\ undef29 = 2, {all remain the same}> 0.00/0.12 0.00/0.12 Graph 2 0.00/0.12 <l4, l2, 1 + N^0 <= walker^0, {all remain the same}> 0.00/0.12 <l4, l2, walker^0 <= N^0 /\ walker^0 <= 0, {all remain the same}> 0.00/0.12 0.00/0.12 Map Locations to Subgraph: 0.00/0.12 ( 0 , 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