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 QuasiCertifProtocol-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369143500012
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463692820632


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=86|T|=56|A|=223
Time for unfolding: 0m 2.322sec

Net: QuasiCertifProtocol_COL_02
(NrP: 86 NrTr: 56 NrArc: 223)

net check time: 0m 0.000sec

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

init dd package: 0m 3.718sec


RS generation: 0m 0.036sec


-> reachability set: #nodes 1808 (1.8e+03) #states 1,029 (3)



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

checking: ~ [AF [3<=a4_dot]]
normalized: EG [~ [3<=a4_dot]]

abstracting: (3<=a4_dot) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [~ [[AF [2<=a2_dot] & ~ [3<=a5_dot]]]]
normalized: [~ [3<=a5_dot] & ~ [EG [~ [2<=a2_dot]]]]

abstracting: (2<=a2_dot) states: 0

EG iterations: 0
abstracting: (3<=a5_dot) states: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [[~ [AF [1<=a5_dot]] & AG [~ [2<=AstopOK_dot]]]]
normalized: ~ [[~ [E [true U 2<=AstopOK_dot]] & EG [~ [1<=a5_dot]]]]

abstracting: (1<=a5_dot) states: 319
.
EG iterations: 1
abstracting: (2<=AstopOK_dot) states: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: A [EF [3<=Astart_dot] U EF [2<=Astart_dot]]
normalized: [~ [EG [~ [E [true U 2<=Astart_dot]]]] & ~ [E [~ [E [true U 2<=Astart_dot]] U [~ [E [true U 3<=Astart_dot]] & ~ [E [true U 2<=Astart_dot]]]]]]

abstracting: (2<=Astart_dot) states: 0
abstracting: (3<=Astart_dot) states: 0
abstracting: (2<=Astart_dot) states: 0
abstracting: (2<=Astart_dot) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AF [E [2<=AstopAbort_dot U 2<=CstopAbort_dot]]
normalized: ~ [EG [~ [E [2<=AstopAbort_dot U 2<=CstopAbort_dot]]]]

abstracting: (2<=CstopAbort_dot) states: 0
abstracting: (2<=AstopAbort_dot) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EF [~ [sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)<=AstopOK_dot]]]
normalized: ~ [E [true U ~ [E [true U ~ [sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)<=AstopOK_dot]]]]]

abstracting: (sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)<=AstopOK_dot) states: 975
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: [~ [EX [~ [3<=a3_dot]]] | ~ [EG [~ [3<=sum(n5_tsid2, n5_tsid1, n5_tsid0)]]]]
normalized: [~ [EG [~ [3<=sum(n5_tsid2, n5_tsid1, n5_tsid0)]]] | ~ [EX [~ [3<=a3_dot]]]]

abstracting: (3<=a3_dot) states: 0
.abstracting: (3<=sum(n5_tsid2, n5_tsid1, n5_tsid0)) states: 8
.
EG iterations: 1
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: AG [EF [[3<=sum(n5_tsid2, n5_tsid1, n5_tsid0) & 3<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]]]
normalized: ~ [E [true U ~ [E [true U [3<=sum(n5_tsid2, n5_tsid1, n5_tsid0) & 3<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]]]]]

abstracting: (3<=sum(n2_tsid2, n2_tsid1, n2_tsid0)) states: 8
abstracting: (3<=sum(n5_tsid2, n5_tsid1, n5_tsid0)) states: 8
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: A [AF [CstopAbort_dot<=a4_dot] U [2<=sum(n3_tsid2, n3_tsid1, n3_tsid0) | [2<=a1_dot | 2<=AstopOK_dot]]]
normalized: [~ [EG [~ [[2<=sum(n3_tsid2, n3_tsid1, n3_tsid0) | [2<=a1_dot | 2<=AstopOK_dot]]]]] & ~ [E [~ [[2<=sum(n3_tsid2, n3_tsid1, n3_tsid0) | [2<=a1_dot | 2<=AstopOK_dot]]] U [~ [[2<=sum(n3_tsid2, n3_tsid1, n3_tsid0) | [2<=a1_dot | 2<=AstopOK_dot]]] & EG [~ [CstopAbort_dot<=a4_dot]]]]]]

abstracting: (CstopAbort_dot<=a4_dot) states: 732
.
EG iterations: 1
abstracting: (2<=AstopOK_dot) states: 0
abstracting: (2<=a1_dot) states: 0
abstracting: (2<=sum(n3_tsid2, n3_tsid1, n3_tsid0)) states: 32
abstracting: (2<=AstopOK_dot) states: 0
abstracting: (2<=a1_dot) states: 0
abstracting: (2<=sum(n3_tsid2, n3_tsid1, n3_tsid0)) states: 32
abstracting: (2<=AstopOK_dot) states: 0
abstracting: (2<=a1_dot) states: 0
abstracting: (2<=sum(n3_tsid2, n3_tsid1, n3_tsid0)) states: 32
.
EG iterations: 1
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: [AG [[[a3_dot<=AstopAbort_dot | 1<=a3_dot] | [1<=sum(n1_tsid2, n1_tsid1, n1_tsid0) & 3<=CstopAbort_dot]]] & [~ [3<=malicious_reservoir_dot] | AF [AstopOK_dot<=sum(n3_tsid2, n3_tsid1, n3_tsid0)]]]
normalized: [~ [E [true U ~ [[[a3_dot<=AstopAbort_dot | 1<=a3_dot] | [1<=sum(n1_tsid2, n1_tsid1, n1_tsid0) & 3<=CstopAbort_dot]]]]] & [~ [EG [~ [AstopOK_dot<=sum(n3_tsid2, n3_tsid1, n3_tsid0)]]] | ~ [3<=malicious_reservoir_dot]]]

abstracting: (3<=malicious_reservoir_dot) states: 0
abstracting: (AstopOK_dot<=sum(n3_tsid2, n3_tsid1, n3_tsid0)) states: 786
.
EG iterations: 1
abstracting: (3<=CstopAbort_dot) states: 0
abstracting: (1<=sum(n1_tsid2, n1_tsid1, n1_tsid0)) states: 56
abstracting: (1<=a3_dot) states: 32
abstracting: (a3_dot<=AstopAbort_dot) states: 997
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.099sec

checking: [~ [EX [[3<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0) & 1<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0)]]] & ~ [~ [AF [3<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)]]]]
normalized: [~ [EG [~ [3<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)]]] & ~ [EX [[3<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0) & 1<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0)]]]]

abstracting: (1<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0)) states: 366
abstracting: (3<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)) states: 396
.abstracting: (3<=sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)) states: 453
.......
EG iterations: 7
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.127sec

checking: [sum(s4_tsid2, s4_tsid1, s4_tsid0)<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0) & AF [[[AstopOK_dot<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) & 2<=SstopAbort_dot] | 3<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)]]]
normalized: [sum(s4_tsid2, s4_tsid1, s4_tsid0)<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0) & ~ [EG [~ [[3<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0) | [AstopOK_dot<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0) & 2<=SstopAbort_dot]]]]]]

abstracting: (2<=SstopAbort_dot) states: 0
abstracting: (AstopOK_dot<=sum(SstopOK_tsid2, SstopOK_tsid1, SstopOK_tsid0)) states: 908
abstracting: (3<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)) states: 279
.......
EG iterations: 7
abstracting: (sum(s4_tsid2, s4_tsid1, s4_tsid0)<=sum(Sstart_tsid2, Sstart_tsid1, Sstart_tsid0)) states: 876
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.127sec

checking: EG [E [sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(s5_tsid2, s5_tsid1, s5_tsid0) U sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)]]
normalized: EG [E [sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(s5_tsid2, s5_tsid1, s5_tsid0) U sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)]]

abstracting: (sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)) states: 973
abstracting: (sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=sum(s5_tsid2, s5_tsid1, s5_tsid0)) states: 777
....
EG iterations: 4
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.097sec

checking: [EF [[Astart_dot<=AstopAbort_dot & ~ [2<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]]] & AF [~ [[a2_dot<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0) & sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)]]]]
normalized: [E [true U [Astart_dot<=AstopAbort_dot & ~ [2<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]]] & ~ [EG [[a2_dot<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0) & sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)]]]]

abstracting: (sum(n8_tsid2_tsid2, n8_tsid2_tsid1, n8_tsid2_tsid0, n8_tsid1_tsid2, n8_tsid1_tsid1, n8_tsid1_tsid0, n8_tsid0_tsid2, n8_tsid0_tsid1, n8_tsid0_tsid0)<=sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)) states: 621
abstracting: (a2_dot<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0)) states: 1,025 (3)
........
EG iterations: 8
abstracting: (2<=sum(n2_tsid2, n2_tsid1, n2_tsid0)) states: 32
abstracting: (Astart_dot<=AstopAbort_dot) states: 1,025 (3)
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.273sec

checking: [~ [AF [1<=sum(n6_tsid2, n6_tsid1, n6_tsid0)]] & [[~ [~ [2<=sum(s6_tsid2, s6_tsid1, s6_tsid0)]] & [[sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0) | sum(n1_tsid2, n1_tsid1, n1_tsid0)<=a5_dot] & 3<=a3_dot]] | sum(s6_tsid2, s6_tsid1, s6_tsid0)<=sum(n2_tsid2, n2_tsid1, n2_tsid0)]]
normalized: [[sum(s6_tsid2, s6_tsid1, s6_tsid0)<=sum(n2_tsid2, n2_tsid1, n2_tsid0) | [2<=sum(s6_tsid2, s6_tsid1, s6_tsid0) & [3<=a3_dot & [sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0) | sum(n1_tsid2, n1_tsid1, n1_tsid0)<=a5_dot]]]] & EG [~ [1<=sum(n6_tsid2, n6_tsid1, n6_tsid0)]]]

abstracting: (1<=sum(n6_tsid2, n6_tsid1, n6_tsid0)) states: 630
....
EG iterations: 4
abstracting: (sum(n1_tsid2, n1_tsid1, n1_tsid0)<=a5_dot) states: 973
abstracting: (sum(n2_tsid2, n2_tsid1, n2_tsid0)<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0)) states: 973
abstracting: (3<=a3_dot) states: 0
abstracting: (2<=sum(s6_tsid2, s6_tsid1, s6_tsid0)) states: 102
abstracting: (sum(s6_tsid2, s6_tsid1, s6_tsid0)<=sum(n2_tsid2, n2_tsid1, n2_tsid0)) states: 711
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.192sec

checking: [~ [~ [EX [a4_dot<=sum(n1_tsid2, n1_tsid1, n1_tsid0)]]] & [~ [[[a2_dot<=a1_dot & 3<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)] | [3<=a4_dot & 1<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0)]]] | E [sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=AstopOK_dot U 3<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0)]]]
normalized: [[E [sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=AstopOK_dot U 3<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0)] | ~ [[[a2_dot<=a1_dot & 3<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)] | [3<=a4_dot & 1<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0)]]]] & EX [a4_dot<=sum(n1_tsid2, n1_tsid1, n1_tsid0)]]

abstracting: (a4_dot<=sum(n1_tsid2, n1_tsid1, n1_tsid0)) states: 1,025 (3)
.abstracting: (1<=sum(CstopOK_tsid2, CstopOK_tsid1, CstopOK_tsid0)) states: 48
abstracting: (3<=a4_dot) states: 0
abstracting: (3<=sum(Cstart_tsid2, Cstart_tsid1, Cstart_tsid0)) states: 396
abstracting: (a2_dot<=a1_dot) states: 1,025 (3)
abstracting: (3<=sum(n9_tsid2_tsid2, n9_tsid2_tsid1, n9_tsid2_tsid0, n9_tsid1_tsid2, n9_tsid1_tsid1, n9_tsid1_tsid0, n9_tsid0_tsid2, n9_tsid0_tsid1, n9_tsid0_tsid0)) states: 363
abstracting: (sum(n7_tsid2_tsid2, n7_tsid2_tsid1, n7_tsid2_tsid0, n7_tsid1_tsid2, n7_tsid1_tsid1, n7_tsid1_tsid0, n7_tsid0_tsid2, n7_tsid0_tsid1, n7_tsid0_tsid0)<=AstopOK_dot) states: 750
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.187sec


Total processing time: 0m 8.954sec


BK_STOP 1463692829623

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

check for maximal unmarked siphon
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:899 (16), effective:56 (1)

initing FirstDep: 0m 0.000sec


iterations count:56 (1), effective:0 (0)

iterations count:56 (1), effective:0 (0)

iterations count:70 (1), effective:5 (0)

iterations count:56 (1), effective:0 (0)

iterations count:232 (4), effective:15 (0)

iterations count:70 (1), effective:4 (0)

iterations count:71 (1), effective:5 (0)

iterations count:75 (1), effective:4 (0)

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="QuasiCertifProtocol-COL-02"
export BK_EXAMINATION="CTLCardinality"
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/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 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 QuasiCertifProtocol-COL-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r101kn-smll-146369143500012"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;