Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275906
details
property
value
status
complete
benchmark
popl07-succeed.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.155255 seconds
cpu usage
0.155416
user time
0.132122
system time
0.023294
max virtual memory
113176.0
max residence set size
33820.0
stage attributes
key
value
starexec-result
NO
output
0.00/0.15 NO 0.00/0.15 0.00/0.15 Solver Timeout: 4 0.00/0.15 Global Timeout: 300 0.00/0.15 No parsing errors! 0.00/0.15 Init Location: 0 0.00/0.15 Transitions: 0.00/0.15 <l0, l14, true> 0.00/0.15 <l1, l2, true> 0.00/0.15 <l3, l4, (undef47 = 1), par{num^0 -> 0, unset^0 -> 0}> 0.00/0.15 <l5, l3, true> 0.00/0.15 <l6, l5, ((1 + status^0) <= 2)> 0.00/0.15 <l6, l5, (3 <= (0 + status^0))> 0.00/0.15 <l6, l5, (2 <= (0 + status^0)) /\ ((0 + status^0) <= 2), par{a1111^0 -> (0 + DName^0), num^0 -> (1 + num^0)}> 0.00/0.15 <l7, l6, true, par{Pdoi^0 -> 0}> 0.00/0.15 <l8, l9, (1 <= (0 + status^0)) /\ ((0 + status^0) <= 1), par{i^0 -> (1 + i^0)}> 0.00/0.15 <l8, l7, ((1 + status^0) <= 1)> 0.00/0.15 <l8, l7, (2 <= (0 + status^0))> 0.00/0.15 <l9, l10, true> 0.00/0.15 <l11, l8, ((0 + DName^0) <= 0) /\ (undef276 = undef276) /\ (undef271 = (0 + undef276)) /\ (undef278 = 1), par{a77^0 -> (0 + DName^0), a88^0 -> (0 + Pdoi^0), pc^0 -> 0, ret_IoCreateDevice1010^0 -> undef271, status^0 -> (0 + undef271), tmp99^0 -> undef276}> 0.00/0.15 <l11, l3, (1 <= (0 + DName^0))> 0.00/0.15 <l4, l12, true> 0.00/0.15 <l12, l4, true> 0.00/0.15 <l10, l11, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef368 = undef368) /\ (undef365 = (0 + undef368)), par{DName^0 -> (0 + undef365), a11^0 -> (0 + lptNamei^0), b22^0 -> (0 + PdoType^0), c33^0 -> (0 + dcIdi^0), d44^0 -> (0 + num^0), ret_PPMakeDeviceName66^0 -> undef365, tmp55^0 -> undef368}> 0.00/0.15 <l10, l3, ((0 + Pdolen^0) <= (0 + i^0))> 0.00/0.15 <l13, l9, (undef416 = 0) /\ (undef417 = (0 + undef416)) /\ (undef418 = 1), par{set^0 -> 0, unset^0 -> undef416}> 0.00/0.15 <l14, l13, true> 0.00/0.15 0.00/0.15 Fresh variables: 0.00/0.15 undef47, undef271, undef276, undef278, undef365, undef368, undef416, undef417, undef418, 0.00/0.15 0.00/0.15 Undef variables: 0.00/0.15 undef47, undef271, undef276, undef278, undef365, undef368, undef416, undef417, undef418, 0.00/0.15 0.00/0.15 Abstraction variables: 0.00/0.15 0.00/0.15 Exit nodes: 0.00/0.15 0.00/0.15 Accepting locations: 0.00/0.15 0.00/0.15 Asserts: 0.00/0.15 0.00/0.15 Preprocessed LLVMGraph 0.00/0.15 Init Location: 0 0.00/0.15 Transitions: 0.00/0.15 <l0, l9, (undef416 = 0) /\ (undef417 = (0 + undef416)) /\ (undef418 = 1)> 0.00/0.15 <l4, l4, true> 0.00/0.15 <l9, l9, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef368 = undef368) /\ (undef365 = (0 + undef368)) /\ ((0 + (0 + undef365)) <= 0) /\ (undef276 = undef276) /\ (undef271 = (0 + undef276)) /\ (undef278 = 1) /\ (1 <= (0 + (0 + undef271))) /\ ((0 + (0 + undef271)) <= 1), par{i^0 -> (1 + i^0)}> 0.00/0.15 <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef368 = undef368) /\ (undef365 = (0 + undef368)) /\ ((0 + (0 + undef365)) <= 0) /\ (undef276 = undef276) /\ (undef271 = (0 + undef276)) /\ (undef278 = 1) /\ ((1 + (0 + undef271)) <= 1) /\ ((1 + (0 + undef271)) <= 2) /\ (undef47 = 1), par{Pdoi^0 -> 0, num^0 -> 0}> 0.00/0.15 <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef368 = undef368) /\ (undef365 = (0 + undef368)) /\ ((0 + (0 + undef365)) <= 0) /\ (undef276 = undef276) /\ (undef271 = (0 + undef276)) /\ (undef278 = 1) /\ (2 <= (0 + (0 + undef271))) /\ (3 <= (0 + (0 + undef271))) /\ (undef47 = 1), par{Pdoi^0 -> 0, num^0 -> 0}> 0.00/0.15 <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef368 = undef368) /\ (undef365 = (0 + undef368)) /\ ((0 + (0 + undef365)) <= 0) /\ (undef276 = undef276) /\ (undef271 = (0 + undef276)) /\ (undef278 = 1) /\ (2 <= (0 + (0 + undef271))) /\ (2 <= (0 + (0 + undef271))) /\ ((0 + (0 + undef271)) <= 2) /\ (undef47 = 1), par{Pdoi^0 -> 0, num^0 -> 0}> 0.00/0.15 <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef368 = undef368) /\ (undef365 = (0 + undef368)) /\ (1 <= (0 + (0 + undef365))) /\ (undef47 = 1), par{num^0 -> 0}> 0.00/0.15 <l9, l4, ((0 + Pdolen^0) <= (0 + i^0)) /\ (undef47 = 1), par{num^0 -> 0}> 0.00/0.15 0.00/0.15 Fresh variables: 0.00/0.15 undef47, undef271, undef276, undef278, undef365, undef368, undef416, undef417, undef418, 0.00/0.15 0.00/0.15 Undef variables: 0.00/0.15 undef47, undef271, undef276, undef278, undef365, undef368, undef416, undef417, undef418, 0.00/0.15 0.00/0.15 Abstraction variables: 0.00/0.15 0.00/0.15 Exit nodes: 0.00/0.15 0.00/0.15 Accepting locations: 0.00/0.15 0.00/0.15 Asserts: 0.00/0.15 0.00/0.15 ************************************************************* 0.00/0.15 ******************************************************************************************* 0.00/0.15 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.15 ******************************************************************************************* 0.00/0.15 0.00/0.15 Init Location: 0 0.00/0.15 Graph 0: 0.00/0.15 Transitions: 0.00/0.15 Variables: 0.00/0.15 0.00/0.15 Graph 1: 0.00/0.15 Transitions: 0.00/0.15 <l9, l9, undef365 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef271 = undef276 /\ undef365 = undef368 /\ undef271 = 1 /\ undef278 = 1, {i^0 -> 1 + i^0, rest remain the same}> 0.00/0.15 Variables: 0.00/0.15 Pdolen^0, i^0 0.00/0.15 0.00/0.15 Graph 2: 0.00/0.15 Transitions: 0.00/0.15 <l4, l4, true, {all remain the same}> 0.00/0.15 Variables: 0.00/0.15 0.00/0.15 Precedence: 0.00/0.15 Graph 0 0.00/0.15 0.00/0.15 Graph 1 0.00/0.15 <l0, l9, undef416 = 0 /\ undef416 = undef417 /\ undef418 = 1, {all remain the same}> 0.00/0.15 0.00/0.15 Graph 2 0.00/0.15 <l9, l4, undef271 <= 0 /\ undef365 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef271 = undef276 /\ undef365 = undef368 /\ undef47 = 1 /\ undef278 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}> 0.00/0.15 <l9, l4, undef365 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 3 <= undef271 /\ undef271 = undef276 /\ undef365 = undef368 /\ undef47 = 1 /\ undef278 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}> 0.00/0.15 <l9, l4, undef365 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef271 = undef276 /\ undef365 = undef368 /\ undef47 = 1 /\ undef278 = 1 /\ undef271 = 2, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}> 0.00/0.15 <l9, l4, 1 + i^0 <= Pdolen^0 /\ 1 <= undef365 /\ undef365 = undef368 /\ undef47 = 1, {num^0 -> 0, rest 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