Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737061
details
property
value
status
complete
benchmark
bakerybug.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
150.186900854 seconds
cpu usage
328.879691746
max memory
3.46435584E8
stage attributes
key
value
output-size
171817
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l7, true> <l1, l2, ((0 + conditional^0) <= 1) /\ (undef10 = undef10), par{conditional^0 -> undef10}> <l1, l2, (2 <= (0 + conditional^0)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{INCREASE^0 -> undef15, conditional^0 -> undef23, j_min^0 -> ((0 + undef15) + j_min^0)}> <l3, l1, ((0 + conditional^0) <= 1) /\ (undef36 = undef36), par{P^0 -> 1, conditional^0 -> undef36}> <l3, l2, (2 <= (0 + conditional^0)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + MAX^0) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{INCREASE^0 -> undef41, MAX_MIN^0 -> ((0 + MAX^0) + (~(1) * MIN^0)), MIN^0 -> ((0 + undef41) + MIN^0), NUM_MIN^0 -> undef46, Q^0 -> 1, conditional^0 -> undef49, j_min^0 -> undef50}> <l4, l3, ((0 + conditional^0) <= 1) /\ (undef62 = undef62), par{conditional^0 -> undef62}> <l4, l3, (2 <= (0 + conditional^0)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75), par{INCREASE^0 -> undef67, MAX^0 -> ((0 + undef67) + MAX^0), conditional^0 -> undef75}> <l2, l4, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88), par{conditional^0 -> undef88}> <l2, l5, ((0 + pid^0) <= (0 + j_min^0)), par{CRITICAL^0 -> 0, P^0 -> 0, Q^0 -> 0}> <l2, l5, ((1 + num^0) <= (0 + MIN^0)), par{CRITICAL^0 -> 0, P^0 -> 0, Q^0 -> 0}> <l5, l2, true, par{CRITICAL^0 -> 0, MAX^0 -> (1 + MAX^0), NONCRITICAL^0 -> 1, num^0 -> (1 + MAX^0)}> <l6, l5, (undef143 = undef143) /\ (1 <= (0 + undef143)) /\ (undef141 = undef141) /\ (1 <= (0 + undef141)) /\ (undef135 = undef135) /\ (1 <= (0 + undef135)) /\ (undef133 = undef133) /\ ((0 + undef135) <= (0 + undef133)), par{CRITICAL^0 -> 0, MAX^0 -> undef133, MIN^0 -> undef135, NONCRITICAL^0 -> 1, P^0 -> 0, Q^0 -> 0, j_min^0 -> undef141, pid^0 -> undef143}> <l7, l6, true> Fresh variables: undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, Undef variables: undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (MAX^0 = (1 + undef133)) /\ (MIN^0 = undef135) /\ (j_min^0 = undef141) /\ (num^0 = (1 + undef133)) /\ (pid^0 = undef143) /\ (undef143 = undef143) /\ (1 <= (0 + undef143)) /\ (undef141 = undef141) /\ (1 <= (0 + undef141)) /\ (undef135 = undef135) /\ (1 <= (0 + undef135)) /\ (undef133 = undef133) /\ ((0 + undef135) <= (0 + undef133))> <l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ ((0 + undef62) <= 1) /\ (undef36 = undef36) /\ ((0 + undef36) <= 1) /\ (undef10 = undef10)> <l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ ((0 + undef62) <= 1) /\ (undef36 = undef36) /\ (2 <= (0 + undef36)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{j_min^0 -> ((0 + undef15) + j_min^0)}> <l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ (2 <= (0 + undef62)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + MAX^0) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{MIN^0 -> ((0 + undef41) + MIN^0), j_min^0 -> undef50}> <l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 1) /\ (undef36 = undef36) /\ ((0 + undef36) <= 1) /\ (undef10 = undef10), par{MAX^0 -> ((0 + undef67) + MAX^0)}> <l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 1) /\ (undef36 = undef36) /\ (2 <= (0 + undef36)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{MAX^0 -> ((0 + undef67) + MAX^0), j_min^0 -> ((0 + undef15) + j_min^0)}> <l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ (2 <= (0 + undef75)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + ((0 + undef67) + MAX^0)) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{MAX^0 -> ((0 + undef67) + MAX^0), MIN^0 -> ((0 + undef41) + MIN^0), j_min^0 -> undef50}> <l2, l2, ((0 + pid^0) <= (0 + j_min^0)), par{MAX^0 -> (1 + MAX^0), num^0 -> (1 + MAX^0)}> <l2, l2, ((1 + num^0) <= (0 + MIN^0)), par{MAX^0 -> (1 + MAX^0), num^0 -> (1 + MAX^0)}> Fresh variables: undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, Undef variables: undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}> <l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}> <l2, l2, MIN^0 + undef41 <= MAX^0 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 2 <= undef62 /\ undef88 <= 1 /\ MIN^0 + undef46 = num^0, {MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}> <l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}> <l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}> <l2, l2, MIN^0 + undef41 <= MAX^0 + undef67 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 1 <= undef67 /\ 2 <= undef75 /\ 2 <= undef88 /\ MIN^0 + undef46 = num^0, {MAX^0 -> MAX^0 + undef67, MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}> <l2, l2, pid^0 <= j_min^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}> <l2, l2, 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}> Variables: MIN^0, j_min^0, num^0, pid^0, MAX^0 Precedence: Graph 0 Graph 1 <l0, l2, undef135 <= undef133 /\ 1 <= undef135 /\ 1 <= undef141 /\ 1 <= undef143 /\ MIN^0 = undef135 /\ j_min^0 = undef141 /\ pid^0 = undef143 /\ MAX^0 = 1 + undef133 /\ num^0 = 1 + undef133, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 )
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634