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-3254
Executing tool marcie
Input is S_PermAdmissibility-PT-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r111-blw7-149441637300403
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494790383969

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: PermAdmissibility_PT_01
(NrP: 168 NrTr: 592 NrArc: 3456)

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

net check time: 0m 0.001sec

init dd package: 0m 1.081sec

parse successfull
net created successfully

Net: PermAdmissibility_PT_01
(NrP: 168 NrTr: 592 NrArc: 3456)

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

net check time: 0m 0.001sec

init dd package: 0m 3.435sec


RS generation: 0m26.781sec


-> reachability set: #nodes 57487 (5.7e+04) #states 52,537 (4)



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

checking: EF [~ [~ [1<=c19]]]
normalized: E [true U 1<=c19]

abstracting: (1<=c19)
states: 4,672 (3)
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.298sec

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

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

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [[3<=c8 & 1<=c13]]
normalized: E [true U [3<=c8 & 1<=c13]]

abstracting: (1<=c13)
states: 256
abstracting: (3<=c8)
states: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: EF [~ [c18<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)]]
normalized: E [true U ~ [c18<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)]]

abstracting: (c18<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0))
states: 47,865 (4)
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.322sec

checking: AG [~ [[2<=c19 & [1<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) | 1<=sum(in4_7, in4_6)]]]]
normalized: ~ [E [true U [2<=c19 & [1<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) | 1<=sum(in4_7, in4_6)]]]]

abstracting: (1<=sum(in4_7, in4_6))
states: 25
abstracting: (1<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0))
states: 46,720 (4)
abstracting: (2<=c19)
states: 0
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.137sec

checking: AG [~ [~ [sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)]]]
normalized: ~ [E [true U ~ [sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0)]]]

abstracting: (sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0))
states: 52,537 (4)
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.133sec

checking: AG [sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)<=sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0)]
normalized: ~ [E [true U ~ [sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)<=sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0)]]]

abstracting: (sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)<=sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0))
states: 10,489 (4)
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.074sec

checking: EF [~ [[[3<=c16 & 2<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2)] | ~ [2<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)]]]]
normalized: E [true U ~ [[~ [2<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)] | [3<=c16 & 2<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2)]]]]

abstracting: (2<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2))
states: 5,136 (3)
abstracting: (3<=c16)
states: 0
abstracting: (2<=sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0))
states: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.143sec

checking: AG [~ [[[c18<=c15 & 2<=c19] & [sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)<=c11 & 1<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)]]]]
normalized: ~ [E [true U [[sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)<=c11 & 1<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)] & [c18<=c15 & 2<=c19]]]]

abstracting: (2<=c19)
states: 0
abstracting: (c18<=c15)
states: 47,865 (4)
abstracting: (1<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0))
states: 42,048 (4)
abstracting: (sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)<=c11)
states: 51,001 (4)
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.187sec

checking: AG [[[c9<=c17 | [c11<=sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5) | 2<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)]] | 3<=c5]]
normalized: ~ [E [true U ~ [[3<=c5 | [c9<=c17 | [c11<=sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5) | 2<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)]]]]]]

abstracting: (2<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1))
states: 0
abstracting: (c11<=sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5))
states: 52,473 (4)
abstracting: (c9<=c17)
states: 52,521 (4)
abstracting: (3<=c5)
states: 0
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.177sec

checking: AG [[[~ [2<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)] | 1<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)] & c17<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)]]
normalized: ~ [E [true U ~ [[c17<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0) & [1<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0) | ~ [2<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0)]]]]]]

abstracting: (2<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0))
states: 0
abstracting: (1<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0))
states: 29,200 (4)
abstracting: (c17<=sum(out4_4, out4_5, out4_2, out4_3, out4_6, out4_7, out4_1, out4_0))
states: 51,369 (4)
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.677sec

checking: AG [~ [[sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) & [sum(in1_0, in1_1)<=sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0) & 2<=sum(in1_0, in1_1)]]]]
normalized: ~ [E [true U [sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0) & [sum(in1_0, in1_1)<=sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0) & 2<=sum(in1_0, in1_1)]]]]

abstracting: (2<=sum(in1_0, in1_1))
states: 1
abstracting: (sum(in1_0, in1_1)<=sum(aux10_7, aux10_6, aux10_5, aux10_3, aux10_4, aux10_1, aux10_2, aux10_0))
states: 52,532 (4)
abstracting: (sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(out2_2, out2_1, out2_4, out2_3, out2_6, out2_5, out2_7, out2_0))
states: 49,033 (4)
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.267sec

checking: EF [[[[sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2) | c12<=sum(aux8_2, aux8_6, aux8_3, aux8_7)] & ~ [2<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)]] & 1<=c20]]
normalized: E [true U [1<=c20 & [~ [2<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)] & [sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2) | c12<=sum(aux8_2, aux8_6, aux8_3, aux8_7)]]]]

abstracting: (c12<=sum(aux8_2, aux8_6, aux8_3, aux8_7))
states: 52,537 (4)
abstracting: (sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2)<=sum(aux13_6, aux13_5, aux13_4, aux13_3, aux13_7, aux13_0, aux13_1, aux13_2))
states: 52,537 (4)
abstracting: (2<=sum(aux15_7, aux15_3, aux15_4, aux15_5, aux15_6, aux15_0, aux15_1, aux15_2))
states: 3,504 (3)
abstracting: (1<=c20)
states: 18,688 (4)
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 6.659sec

checking: AG [~ [[[sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6) & c20<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)] & 3<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1)]]]
normalized: ~ [E [true U [3<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1) & [sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6) & c20<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)]]]]

abstracting: (c20<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1))
states: 52,537 (4)
abstracting: (sum(aux11_6, aux11_7, aux11_0, aux11_1, aux11_2, aux11_3, aux11_4, aux11_5)<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 52,281 (4)
abstracting: (3<=sum(out5_7, out5_4, out5_3, out5_6, out5_5, out5_0, out5_2, out5_1))
states: 0
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.214sec

checking: EF [[[~ [sum(out8_5, out8_4, out8_7, out8_6, out8_2, out8_3, out8_0, out8_1)<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)] | ~ [1<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)]] & [~ [sum(in1_0, in1_1)<=c11] & [sum(in2_3, in2_2)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0) | 3<=c15]]]]
normalized: E [true U [[[sum(in2_3, in2_2)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0) | 3<=c15] & ~ [sum(in1_0, in1_1)<=c11]] & [~ [1<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0)] | ~ [sum(out8_5, out8_4, out8_7, out8_6, out8_2, out8_3, out8_0, out8_1)<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4)]]]]

abstracting: (sum(out8_5, out8_4, out8_7, out8_6, out8_2, out8_3, out8_0, out8_1)<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4))
states: 33,849 (4)
abstracting: (1<=sum(aux16_7, aux16_6, aux16_5, aux16_4, aux16_3, aux16_2, aux16_1, aux16_0))
states: 29,200 (4)
abstracting: (sum(in1_0, in1_1)<=c11)
states: 52,532 (4)
abstracting: (3<=c15)
states: 0
abstracting: (sum(in2_3, in2_2)<=sum(aux14_7, aux14_5, aux14_6, aux14_4, aux14_3, aux14_2, aux14_1, aux14_0))
states: 52,512 (4)
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.374sec

checking: AG [[[[2<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4) | c14<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)] | [3<=sum(aux7_2, aux7_3, aux7_6, aux7_7) & sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)]] | [[sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)<=sum(aux8_2, aux8_6, aux8_3, aux8_7) | sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)<=c11] | [c8<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1) & 1<=c9]]]]
normalized: ~ [E [true U ~ [[[[c8<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1) & 1<=c9] | [sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)<=sum(aux8_2, aux8_6, aux8_3, aux8_7) | sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)<=c11]] | [[3<=sum(aux7_2, aux7_3, aux7_6, aux7_7) & sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)] | [2<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4) | c14<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)]]]]]]

abstracting: (c14<=sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6))
states: 52,537 (4)
abstracting: (2<=sum(aux9_3, aux9_2, aux9_1, aux9_0, aux9_7, aux9_6, aux9_5, aux9_4))
states: 640
abstracting: (sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1)<=sum(out6_7, out6_3, out6_4, out6_5, out6_6, out6_0, out6_2, out6_1))
states: 52,537 (4)
abstracting: (3<=sum(aux7_2, aux7_3, aux7_6, aux7_7))
states: 0
abstracting: (sum(aux12_7, aux12_0, aux12_1, aux12_2, aux12_3, aux12_4, aux12_5, aux12_6)<=c11)
states: 48,313 (4)
abstracting: (sum(out1_3, out1_4, out1_1, out1_2, out1_7, out1_5, out1_6, out1_0)<=sum(aux8_2, aux8_6, aux8_3, aux8_7))
states: 5,817 (3)
abstracting: (1<=c9)
states: 16
abstracting: (c8<=sum(out7_6, out7_7, out7_4, out7_5, out7_2, out7_3, out7_0, out7_1))
states: 52,521 (4)
-> the formula is TRUE

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.514sec

totally nodes used: 33142748 (3.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 45547021 254099092 299646113
used/not used/entry size/cache size: 66059395 1049469 16 1024MB
basic ops cache: hits/miss/sum: 6377976 35035150 41413126
used/not used/entry size/cache size: 16451034 326182 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 406048 406048
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 11152 68345 79497
used/not used/entry size/cache size: 68158 8320450 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 44123272
1 15264285
2 5783801
3 1526943
4 336122
5 62822
6 10105
7 1345
8 140
9 21
>= 10 8

Total processing time: 2m54.298sec


BK_STOP 1494790558430

--------------------
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:66: Boundedness exception: net maybe 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.002sec

6024 13526 21978 25981 29790 45194
iterations count:624986 (1055), effective:3528 (5)

initing FirstDep: 0m 0.001sec

21241 27982 31395
iterations count:317785 (536), effective:2127 (3)
18491 21986
iterations count:209716 (354), effective:1692 (2)
46953 53694 57107
iterations count:317785 (536), effective:2127 (3)
9395
iterations count:199917 (337), effective:1651 (2)
24192 30809 35709 40628 41971 42765 44545 45118
iterations count:849425 (1434), effective:4185 (7)

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_PermAdmissibility-PT-01"
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_PermAdmissibility-PT-01.tgz
mv S_PermAdmissibility-PT-01 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_PermAdmissibility-PT-01, 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 r111-blw7-149441637300403"
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 ;