details

property	value
status	complete
benchmark	smagillc-succeed.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n023.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	6.21686410904 seconds
cpu usage	22.363905189
max memory	2.09215488E8

stage attributes

key	value
output-size	6158
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, true> <l3, l4, true> <l5, l6, true> <l6, l5, true> <l7, l1, ((0 + ___rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}> <l7, l1, (1 <= (0 + ___rho_1_^0)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> <l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37), par{___rho_1_^0 -> undef37}> <l2, l5, ((0 + curr_serv^0) <= 0)> <l8, l1, (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4), par{___rho_2_^0 -> undef50, c^0 -> undef51, curr_serv^0 -> (0 + undef54), resp^0 -> 0, servers^0 -> undef54}> <l9, l8, true> Fresh variables: undef37, undef50, undef51, undef54, Undef variables: undef37, undef50, undef51, undef54, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (c^0 = undef51) /\ (curr_serv^0 = (0 + undef54)) /\ (resp^0 = 0) /\ (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4)> <l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}> <l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ (1 <= (0 + undef37)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> <l1, l5, ((0 + curr_serv^0) <= 0)> <l5, l5, true> Fresh variables: undef37, undef50, undef51, undef54, Undef variables: undef37, undef50, undef51, undef54, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}> <l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> Variables: c^0, curr_serv^0, resp^0 Graph 2: Transitions: <l5, l5, true, {all remain the same}> Variables: Precedence: Graph 0 Graph 1 <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}> Graph 2 <l1, l5, curr_serv^0 <= 0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 5 , 2 ) ******************************************************************************************* popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Integ Trans Syste 27634