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-2979
Executing tool marcie
Input is S_SafeBus-COL-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444129100520
=====================================================================

--------------------
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 SafeBus-COL-03-ReachabilityCardinality-0
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-1
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-10
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-11
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-12
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-13
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-14
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-15
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-2
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-3
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-4
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-5
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-6
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-7
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-8
FORMULA_NAME SafeBus-COL-03-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1464610972825


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=60|T|=97|A|=568
Time for unfolding: 0m 1.831sec

Net: pnml_5851107512331668583
(NrP: 60 NrTr: 97 NrArc: 568)

net check time: 0m 0.000sec

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

init dd package: 0m 3.716sec


RS generation: 0m 0.419sec


-> reachability set: #nodes 6550 (6.6e+03) #states 4,650 (3)



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

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

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

FORMULA SafeBus-COL-03-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA SafeBus-COL-03-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA SafeBus-COL-03-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [3<=sum(loop_em_It3, loop_em_It2, loop_em_It1)]]
normalized: ~ [E [true U 3<=sum(loop_em_It3, loop_em_It2, loop_em_It1)]]

abstracting: (3<=sum(loop_em_It3, loop_em_It2, loop_em_It1)) states: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AG [R_tout_dot<=sum(msgl_It3, msgl_It2, msgl_It1)]
normalized: ~ [E [true U ~ [R_tout_dot<=sum(msgl_It3, msgl_It2, msgl_It1)]]]

abstracting: (R_tout_dot<=sum(msgl_It3, msgl_It2, msgl_It1)) states: 4,650 (3)
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EF [[sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) & [~ [1<=R_tout_dot] & 2<=T_out_dot]]]
normalized: E [true U [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) & [2<=T_out_dot & ~ [1<=R_tout_dot]]]]

abstracting: (1<=R_tout_dot) states: 2,091 (3)
abstracting: (2<=T_out_dot) states: 0
abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)) states: 1,602 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

checking: EF [~ [[~ [1<=sum(RMC_It3, RMC_It2, RMC_It1)] | sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]
normalized: E [true U ~ [[sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) | ~ [1<=sum(RMC_It3, RMC_It2, RMC_It1)]]]]

abstracting: (1<=sum(RMC_It3, RMC_It2, RMC_It1)) states: 1,602 (3)
abstracting: (sum(PMC_It3, PMC_It2, PMC_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)) states: 4,650 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: AG [sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(cable_used_It3, cable_used_It2, cable_used_It1)]
normalized: ~ [E [true U ~ [sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(cable_used_It3, cable_used_It2, cable_used_It1)]]]

abstracting: (sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 4,650 (3)
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [[3<=S_tout_dot & [~ [sum(RMC_It3, RMC_It2, RMC_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)] | [S_tout_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1) | T_out_dot<=sum(cable_used_It3, cable_used_It2, cable_used_It1)]]]]
normalized: E [true U [3<=S_tout_dot & [~ [sum(RMC_It3, RMC_It2, RMC_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)] | [S_tout_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1) | T_out_dot<=sum(cable_used_It3, cable_used_It2, cable_used_It1)]]]]

abstracting: (T_out_dot<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 4,650 (3)
abstracting: (S_tout_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1)) states: 2,973 (3)
abstracting: (sum(RMC_It3, RMC_It2, RMC_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)) states: 4,650 (3)
abstracting: (3<=S_tout_dot) states: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: EF [[[3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1) | 3<=ACK_dot] & ~ [[1<=S_tout_dot & sum(PMC_It3, PMC_It2, PMC_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)]]]]
normalized: E [true U [[3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1) | 3<=ACK_dot] & ~ [[1<=S_tout_dot & sum(PMC_It3, PMC_It2, PMC_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)]]]]

abstracting: (sum(PMC_It3, PMC_It2, PMC_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)) states: 4,344 (3)
abstracting: (1<=S_tout_dot) states: 2,559 (3)
abstracting: (3<=ACK_dot) states: 0
abstracting: (3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)) states: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: AG [[[[cable_free_dot<=sum(cable_used_It3, cable_used_It2, cable_used_It1) & FMCb_dot<=sum(listen_It3, listen_It2, listen_It1)] & ~ [sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]] | ~ [3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]]]
normalized: ~ [E [true U ~ [[~ [3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)] | [[cable_free_dot<=sum(cable_used_It3, cable_used_It2, cable_used_It1) & FMCb_dot<=sum(listen_It3, listen_It2, listen_It1)] & ~ [sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]]]]]]

abstracting: (sum(loop_em_It3, loop_em_It2, loop_em_It1)<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)) states: 3,408 (3)
abstracting: (FMCb_dot<=sum(listen_It3, listen_It2, listen_It1)) states: 2,508 (3)
abstracting: (cable_free_dot<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 3,960 (3)
abstracting: (3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)) states: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.157sec

checking: EF [[[[3<=S_tout_dot & 1<=sum(RMC_It3, RMC_It2, RMC_It1)] & [sum(listen_It3, listen_It2, listen_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) & 1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]] & sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(PMC_It3, PMC_It2, PMC_It1)]]
normalized: E [true U [sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(PMC_It3, PMC_It2, PMC_It1) & [[sum(listen_It3, listen_It2, listen_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) & 1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)] & [3<=S_tout_dot & 1<=sum(RMC_It3, RMC_It2, RMC_It1)]]]]

abstracting: (1<=sum(RMC_It3, RMC_It2, RMC_It1)) states: 1,602 (3)
abstracting: (3<=S_tout_dot) states: 0
abstracting: (1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)) states: 4,650 (3)
abstracting: (sum(listen_It3, listen_It2, listen_It1)<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)) states: 4,284 (3)
abstracting: (sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(PMC_It3, PMC_It2, PMC_It1)) states: 3,192 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: AG [[1<=sum(MSG_It3, MSG_It2, MSG_It1) | [~ [sum(msgl_It3, msgl_It2, msgl_It1)<=FMCb_dot] | ~ [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)]]]]
normalized: ~ [E [true U ~ [[1<=sum(MSG_It3, MSG_It2, MSG_It1) | [~ [sum(msgl_It3, msgl_It2, msgl_It1)<=FMCb_dot] | ~ [sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)]]]]]]

abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)) states: 2,340 (3)
abstracting: (sum(msgl_It3, msgl_It2, msgl_It1)<=FMCb_dot) states: 0
abstracting: (1<=sum(MSG_It3, MSG_It2, MSG_It1)) states: 936
-> the formula is TRUE

FORMULA SafeBus-COL-03-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.112sec

checking: EF [[[1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) & [sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1) | sum(RMC_It3, RMC_It2, RMC_It1)<=cable_free_dot]] & ~ [[S_tout_dot<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) | 1<=sum(cable_used_It3, cable_used_It2, cable_used_It1)]]]]
normalized: E [true U [~ [[S_tout_dot<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) | 1<=sum(cable_used_It3, cable_used_It2, cable_used_It1)]] & [1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1) & [sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1) | sum(RMC_It3, RMC_It2, RMC_It1)<=cable_free_dot]]]]

abstracting: (sum(RMC_It3, RMC_It2, RMC_It1)<=cable_free_dot) states: 3,282 (3)
abstracting: (sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)) states: 3,624 (3)
abstracting: (1<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)) states: 1,602 (3)
abstracting: (1<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 3,960 (3)
abstracting: (S_tout_dot<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)) states: 2,973 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.191sec

checking: EF [[[sum(FMC_It3, FMC_It2, FMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1) & [3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1) & 1<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)]] & ~ [~ [sum(msgl_It3, msgl_It2, msgl_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)]]]]
normalized: E [true U [sum(msgl_It3, msgl_It2, msgl_It1)<=sum(RMC_It3, RMC_It2, RMC_It1) & [sum(FMC_It3, FMC_It2, FMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1) & [3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1) & 1<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)]]]]

abstracting: (1<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)) states: 2,340 (3)
abstracting: (3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)) states: 0
abstracting: (sum(FMC_It3, FMC_It2, FMC_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)) states: 4,650 (3)
abstracting: (sum(msgl_It3, msgl_It2, msgl_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)) states: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.150sec

checking: EF [[[[sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1) & cable_free_dot<=sum(RMC_It3, RMC_It2, RMC_It1)] | [sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=R_tout_dot & 1<=sum(RMC_It3, RMC_It2, RMC_It1)]] & [[sum(FMC_It3, FMC_It2, FMC_It1)<=T_out_dot | 2<=sum(cable_used_It3, cable_used_It2, cable_used_It1)] & ~ [sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)]]]]
normalized: E [true U [[~ [sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)] & [sum(FMC_It3, FMC_It2, FMC_It1)<=T_out_dot | 2<=sum(cable_used_It3, cable_used_It2, cable_used_It1)]] & [[sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=R_tout_dot & 1<=sum(RMC_It3, RMC_It2, RMC_It1)] | [sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1) & cable_free_dot<=sum(RMC_It3, RMC_It2, RMC_It1)]]]]

abstracting: (cable_free_dot<=sum(RMC_It3, RMC_It2, RMC_It1)) states: 4,230 (3)
abstracting: (sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)) states: 4,470 (3)
abstracting: (1<=sum(RMC_It3, RMC_It2, RMC_It1)) states: 1,602 (3)
abstracting: (sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=R_tout_dot) states: 2,958 (3)
abstracting: (2<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 0
abstracting: (sum(FMC_It3, FMC_It2, FMC_It1)<=T_out_dot) states: 3,498 (3)
abstracting: (sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)<=sum(wait_cable_It3, wait_cable_It2, wait_cable_It1)) states: 4,650 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.260sec


Total processing time: 0m 8.907sec


BK_STOP 1464610981770

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
wait_ack_It2_It2
wait_ack_It3_It3
wait_ack_It1_It1

The net has transition(s) that can never fire:
I_reemit_1_1
I_reemit_0_0
I_free_0_0
I_free_1_1
I_free_2_2
I_reemit_2_2

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

730 1535 1749 2502 3004 3140 3713 4289 4692 4981 5568 5572 5175 5055 6116 6767 7126 6939 6656
iterations count:19279 (198), effective:734 (7)

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_SafeBus-COL-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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_SafeBus-COL-03.tgz
mv S_SafeBus-COL-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_SafeBus-COL-03, 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 r185kn-smll-146444129100520"
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 ;