Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3253
Executing tool marcie
Input is S_CSRepetitions-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r091-ebro-149488438400115
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-0
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-1
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-10
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-11
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-12
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-13
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-14
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-15
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-2
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-3
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-4
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-5
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-6
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-7
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-8
FORMULA_NAME CSRepetitions-COL-02-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1495049080318

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: CSRepetitions_PT_02
(NrP: 23 NrTr: 28 NrArc: 92)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.384sec

parse successfull
net created successfully

Net: CSRepetitions_PT_02
(NrP: 23 NrTr: 28 NrArc: 92)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 7.433sec


RS generation: 0m 0.035sec


-> reachability set: #nodes 309 (3.1e+02) #states 7,424 (3)



starting MCC model checker
--------------------------

checking: EF [~ [~ [3<=RequestBufferSlots]]]
normalized: E [true U 3<=RequestBufferSlots]

abstracting: (3<=RequestBufferSlots)
states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]
normalized: E [true U 3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]

abstracting: (3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: EF [[3<=RequestBufferSlots | [[1<=sum(Server_Waiting_1, Server_Waiting_2) | 2<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)] & [3<=RequestBufferSlots & 2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]
normalized: E [true U [[[3<=RequestBufferSlots & 2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)] & [1<=sum(Server_Waiting_1, Server_Waiting_2) | 2<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] | 3<=RequestBufferSlots]]

abstracting: (3<=RequestBufferSlots)
states: 0
abstracting: (2<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 3,104 (3)
abstracting: (1<=sum(Server_Waiting_1, Server_Waiting_2))
states: 3,024 (3)
abstracting: (2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 5,423 (3)
abstracting: (3<=RequestBufferSlots)
states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.176sec

checking: AG [~ [[[2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) & 3<=RequestBufferSlots] & [sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1) | 1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]
normalized: ~ [E [true U [[sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1) | 1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)] & [2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) & 3<=RequestBufferSlots]]]]

abstracting: (3<=RequestBufferSlots)
states: 0
abstracting: (2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 4,863 (3)
abstracting: (1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 7,139 (3)
abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 6,864 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.173sec

checking: AG [[~ [[2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | RequestBufferSlots<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] | ~ [~ [sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]
normalized: ~ [E [true U ~ [[~ [[2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | RequestBufferSlots<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]

abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 7,424 (3)
abstracting: (RequestBufferSlots<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 6,624 (3)
abstracting: (2<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 5,423 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: EF [[[1<=RequestBufferSlots & ~ [RequestBufferSlots<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]] & ~ [[2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) | sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]
normalized: E [true U [~ [[2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) | sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]] & [1<=RequestBufferSlots & ~ [RequestBufferSlots<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]]]

abstracting: (RequestBufferSlots<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 7,174 (3)
abstracting: (1<=RequestBufferSlots)
states: 2,400 (3)
abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 5,423 (3)
abstracting: (2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 4,863 (3)
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: EF [~ [[sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Waiting_1, Server_Waiting_2) | [3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2)]]]]
normalized: E [true U ~ [[[3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2)] | sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Waiting_1, Server_Waiting_2)]]]

abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Waiting_1, Server_Waiting_2))
states: 7,424 (3)
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2))
states: 3,024 (3)
abstracting: (3<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 2,561 (3)
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.122sec

checking: EF [~ [[1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) | [3<=sum(Server_Waiting_1, Server_Waiting_2) | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]
normalized: E [true U ~ [[[3<=sum(Server_Waiting_1, Server_Waiting_2) | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)] | 1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]

abstracting: (1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,088 (3)
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 7,424 (3)
abstracting: (3<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: AG [[2<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1) | [[1<=sum(Server_Waiting_1, Server_Waiting_2) | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)] | 1<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]]
normalized: ~ [E [true U ~ [[[[1<=sum(Server_Waiting_1, Server_Waiting_2) | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)] | 1<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] | 2<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]

abstracting: (2<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 3,104 (3)
abstracting: (1<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 6,899 (3)
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 7,424 (3)
abstracting: (1<=sum(Server_Waiting_1, Server_Waiting_2))
states: 3,024 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: EF [~ [[sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | [1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]
normalized: E [true U ~ [[[1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)] | sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]

abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 7,424 (3)
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 7,424 (3)
abstracting: (1<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 7,139 (3)
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[~ [sum(Server_Waiting_1, Server_Waiting_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)] & ~ [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]]
normalized: ~ [E [true U [~ [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)] & ~ [sum(Server_Waiting_1, Server_Waiting_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]

abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 7,151 (3)
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,424 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: EF [[[~ [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)] & ~ [3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] & 2<=sum(Server_Waiting_1, Server_Waiting_2)]]
normalized: E [true U [[~ [3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)] & ~ [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]] & 2<=sum(Server_Waiting_1, Server_Waiting_2)]]

abstracting: (2<=sum(Server_Waiting_1, Server_Waiting_2))
states: 336
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,424 (3)
abstracting: (3<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: AG [~ [[[sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) & 3<=sum(Server_Waiting_1, Server_Waiting_2)] & 2<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]
normalized: ~ [E [true U [[sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) & 3<=sum(Server_Waiting_1, Server_Waiting_2)] & 2<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]

abstracting: (2<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 4,400 (3)
abstracting: (3<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,424 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: AG [[[[RequestBufferSlots<=RequestBufferSlots | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=RequestBufferSlots] | [sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) & sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]] | ~ [~ [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]]
normalized: ~ [E [true U ~ [[[[sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) & sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] | [RequestBufferSlots<=RequestBufferSlots | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=RequestBufferSlots]] | sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]]

abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 4,205 (3)
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=RequestBufferSlots)
states: 2,784 (3)
abstracting: (RequestBufferSlots<=RequestBufferSlots)
states: 7,424 (3)
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 6,038 (3)
abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,088 (3)
-> the formula is TRUE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.247sec

checking: EF [[[~ [sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)] & [3<=sum(Server_Waiting_1, Server_Waiting_2) & 1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]] & [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) | [RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) | 3<=sum(Server_Waiting_1, Server_Waiting_2)]]]]
normalized: E [true U [[[RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) | 3<=sum(Server_Waiting_1, Server_Waiting_2)] | sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)] & [[3<=sum(Server_Waiting_1, Server_Waiting_2) & 1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)] & ~ [sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]

abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 6,864 (3)
abstracting: (1<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,088 (3)
abstracting: (3<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 4,205 (3)
abstracting: (3<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
abstracting: (RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,200 (3)
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: EF [[[[sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Server_Waiting_1, Server_Waiting_2) | 2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] & [RequestBufferSlots<=RequestBufferSlots | sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]] & [[1<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) & 2<=RequestBufferSlots] & [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2) & 2<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]]
normalized: E [true U [[[sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2) & 2<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)] & [1<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) & 2<=RequestBufferSlots]] & [[RequestBufferSlots<=RequestBufferSlots | sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)] & [sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Server_Waiting_1, Server_Waiting_2) | 2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]]]

abstracting: (2<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 4,863 (3)
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Server_Waiting_1, Server_Waiting_2))
states: 2,496 (3)
abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 5,423 (3)
abstracting: (RequestBufferSlots<=RequestBufferSlots)
states: 7,424 (3)
abstracting: (2<=RequestBufferSlots)
states: 400
abstracting: (1<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 6,899 (3)
abstracting: (2<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 4,400 (3)
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2))
states: 3,024 (3)
-> the formula is FALSE

FORMULA CSRepetitions-COL-02-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

totally nodes used: 8152 (8.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18856 35464 54320
used/not used/entry size/cache size: 38577 67070287 16 1024MB
basic ops cache: hits/miss/sum: 8116 12673 20789
used/not used/entry size/cache size: 21885 16755331 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 9310 9310
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1797 2233 4030
used/not used/entry size/cache size: 2233 8386375 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67100787
1 8014
2 54
3 6
4 3
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m16.078sec


BK_STOP 1495049096615

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1143 (40), effective:161 (5)

initing FirstDep: 0m 0.000sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_CSRepetitions-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_CSRepetitions-PT-02.tgz
mv S_CSRepetitions-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is S_CSRepetitions-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r091-ebro-149488438400115"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;