Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738393
details
property
value
status
complete
benchmark
ppblockbug.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n007.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
18.366808176 seconds
cpu usage
42.067666206
max memory
6.7735552E8
stage attributes
key
value
output-size
16289
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l9, true> <l1, l2, ((0 + conditional^0) <= 1)> <l1, l3, (2 <= (0 + conditional^0)), par{num^0 -> (1 + num^0)}> <l4, l5, ((0 + conditional^0) <= 1), par{IoCreateDevice^0 -> 0, status^0 -> 1}> <l4, l1, (2 <= (0 + conditional^0)) /\ (undef37 = undef37), par{IoCreateDevice^0 -> 0, Pdo^0 -> 0, conditional^0 -> undef37}> <l2, l6, true, par{PPBunlockInits^0 -> 1, num^0 -> 0}> <l6, l2, true> <l7, l2, ((0 + DName^0) <= 0)> <l7, l4, (1 <= (0 + DName^0)) /\ (undef77 = undef77), par{IoCreateDevice^0 -> 1, conditional^0 -> undef77}> <l5, l3, true, par{i^0 -> (~(1) + i^0)}> <l5, l3, true, par{i^0 -> (1 + i^0)}> <l3, l2, ((0 + Pdolen^0) <= (0 + i^0)), par{status^0 -> 0}> <l3, l7, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111), par{DName^0 -> undef111, PPBlockInits^0 -> 1, status^0 -> 0}> <l8, l3, (undef128 = undef128) /\ (undef126 = undef126), par{IoCreateDevice^0 -> 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef126, i^0 -> undef128, status^0 -> 0}> <l9, l8, true> Fresh variables: undef37, undef77, undef111, undef126, undef128, Undef variables: undef37, undef77, undef111, undef126, undef128, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (Pdolen^0 = undef126) /\ (i^0 = undef128) /\ (undef128 = undef128) /\ (undef126 = undef126)> <l2, l2, true, par{num^0 -> 0}> <l3, l2, ((0 + Pdolen^0) <= (0 + i^0))> <l3, l2, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ ((0 + undef111) <= 0)> <l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ ((0 + undef77) <= 1), par{i^0 -> (~(1) + i^0)}> <l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ ((0 + undef77) <= 1), par{i^0 -> (1 + i^0)}> <l3, l2, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ (2 <= (0 + undef77)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 1)> <l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ (2 <= (0 + undef77)) /\ (undef37 = undef37) /\ (2 <= (0 + undef37)), par{num^0 -> (1 + num^0)}> Fresh variables: undef37, undef77, undef111, undef126, undef128, Undef variables: undef37, undef77, undef111, undef126, undef128, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}> <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}> <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Graph 2: Transitions: <l2, l2, true, {num^0 -> 0, rest remain the same}> Variables: Precedence: Graph 0 Graph 1 <l0, l3, Pdolen^0 = undef126 /\ i^0 = undef128, {all remain the same}> Graph 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634