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-2270
Executing tool marcie
Input is S_PermAdmissibility-PT-01, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204600164
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433635034628

Model: S_PermAdmissibility-PT-01
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 168 NrTr: 592 NrArc: 3456)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m2sec


RS generation: 0m31sec


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



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

checking: [[[[[[sum(maxVal(aux15_7), maxVal(aux15_3), maxVal(aux15_4), maxVal(aux15_5), maxVal(aux15_6), maxVal(aux15_0), maxVal(aux15_1), maxVal(aux15_2))<=3 & sum(maxVal(out6_7), maxVal(out6_3), maxVal(out6_4), maxVal(out6_5), maxVal(out6_6), maxVal(out6_0), maxVal(out6_2), maxVal(out6_1))<=2] & [sum(maxVal(aux10_7), maxVal(aux10_6), maxVal(aux10_5), maxVal(aux10_3), maxVal(aux10_4), maxVal(aux10_1), maxVal(aux10_2), maxVal(aux10_0))<=1 & sum(maxVal(aux15_7), maxVal(aux15_3), maxVal(aux15_4), maxVal(aux15_5), maxVal(aux15_6), maxVal(aux15_0), maxVal(aux15_1), maxVal(aux15_2))<=2]] & sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=1] & sum(maxVal(aux15_7), maxVal(aux15_3), maxVal(aux15_4), maxVal(aux15_5), maxVal(aux15_6), maxVal(aux15_0), maxVal(aux15_1), maxVal(aux15_2))<=3] & [[maxVal(c11)<=1 & maxVal(c12)<=2] & [sum(maxVal(aux13_6), maxVal(aux13_5), maxVal(aux13_4), maxVal(aux13_3), maxVal(aux13_7), maxVal(aux13_0), maxVal(aux13_1), maxVal(aux13_2))<=3 & sum(maxVal(aux14_7), maxVal(aux14_5), maxVal(aux14_6), maxVal(aux14_4), maxVal(aux14_3), maxVal(aux14_2), maxVal(aux14_1), maxVal(aux14_0))<=2]]] & [[sum(maxVal(in1_0), maxVal(in1_1))<=1 & maxVal(c20)<=2] & sum(maxVal(aux13_6), maxVal(aux13_5), maxVal(aux13_4), maxVal(aux13_3), maxVal(aux13_7), maxVal(aux13_0), maxVal(aux13_1), maxVal(aux13_2))<=2]]
normalized: [[[sum(maxVal(aux15_7), maxVal(aux15_3), maxVal(aux15_4), maxVal(aux15_5), maxVal(aux15_6), maxVal(aux15_0), maxVal(aux15_1), maxVal(aux15_2))<=3 & [sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=1 & [[sum(maxVal(aux15_7), maxVal(aux15_3), maxVal(aux15_4), maxVal(aux15_5), maxVal(aux15_6), maxVal(aux15_0), maxVal(aux15_1), maxVal(aux15_2))<=3 & sum(maxVal(out6_7), maxVal(out6_3), maxVal(out6_4), maxVal(out6_5), maxVal(out6_6), maxVal(out6_0), maxVal(out6_2), maxVal(out6_1))<=2] & [sum(maxVal(aux10_7), maxVal(aux10_6), maxVal(aux10_5), maxVal(aux10_3), maxVal(aux10_4), maxVal(aux10_1), maxVal(aux10_2), maxVal(aux10_0))<=1 & sum(maxVal(aux15_7), maxVal(aux15_3), maxVal(aux15_4), maxVal(aux15_5), maxVal(aux15_6), maxVal(aux15_0), maxVal(aux15_1), maxVal(aux15_2))<=2]]]] & [[maxVal(c11)<=1 & maxVal(c12)<=2] & [sum(maxVal(aux13_6), maxVal(aux13_5), maxVal(aux13_4), maxVal(aux13_3), maxVal(aux13_7), maxVal(aux13_0), maxVal(aux13_1), maxVal(aux13_2))<=3 & sum(maxVal(aux14_7), maxVal(aux14_5), maxVal(aux14_6), maxVal(aux14_4), maxVal(aux14_3), maxVal(aux14_2), maxVal(aux14_1), maxVal(aux14_0))<=2]]] & [sum(maxVal(aux13_6), maxVal(aux13_5), maxVal(aux13_4), maxVal(aux13_3), maxVal(aux13_7), maxVal(aux13_0), maxVal(aux13_1), maxVal(aux13_2))<=2 & [sum(maxVal(in1_0), maxVal(in1_1))<=1 & maxVal(c20)<=2]]]

abstracting: (1<=2) states: 52,537 (4)
abstracting: (2<=1) states: 0
abstracting: (8<=2) states: 0
abstracting: (8<=2) states: 0
abstracting: (8<=3) states: 0
abstracting: (1<=2) states: 52,537 (4)
abstracting: (1<=1) states: 52,537 (4)
abstracting: (8<=2) states: 0
abstracting: (8<=1) states: 0
abstracting: (8<=2) states: 0
abstracting: (8<=3) states: 0
abstracting: (4<=1) states: 0
abstracting: (8<=3) states: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(aux7_2), maxVal(aux7_3), maxVal(aux7_6), maxVal(aux7_7))<=1 & sum(maxVal(aux8_2), maxVal(aux8_6), maxVal(aux8_3), maxVal(aux8_7))<=2]
normalized: [sum(maxVal(aux7_2), maxVal(aux7_3), maxVal(aux7_6), maxVal(aux7_7))<=1 & sum(maxVal(aux8_2), maxVal(aux8_6), maxVal(aux8_3), maxVal(aux8_7))<=2]

abstracting: (4<=2) states: 0
abstracting: (4<=1) states: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(aux16_7), maxVal(aux16_6), maxVal(aux16_5), maxVal(aux16_4), maxVal(aux16_3), maxVal(aux16_2), maxVal(aux16_1), maxVal(aux16_0))<=1 & sum(maxVal(aux8_2), maxVal(aux8_6), maxVal(aux8_3), maxVal(aux8_7))<=2]
normalized: [sum(maxVal(aux16_7), maxVal(aux16_6), maxVal(aux16_5), maxVal(aux16_4), maxVal(aux16_3), maxVal(aux16_2), maxVal(aux16_1), maxVal(aux16_0))<=1 & sum(maxVal(aux8_2), maxVal(aux8_6), maxVal(aux8_3), maxVal(aux8_7))<=2]

abstracting: (4<=2) states: 0
abstracting: (8<=1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: maxVal(c7)<=2
normalized: maxVal(c7)<=2

abstracting: (1<=2) states: 52,537 (4)
-> the formula is TRUE

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

MC time: 0m0sec

checking: maxVal(c5)<=3
normalized: maxVal(c5)<=3

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

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

MC time: 0m0sec

checking: sum(maxVal(aux11_6), maxVal(aux11_7), maxVal(aux11_0), maxVal(aux11_1), maxVal(aux11_2), maxVal(aux11_3), maxVal(aux11_4), maxVal(aux11_5))<=3
normalized: sum(maxVal(aux11_6), maxVal(aux11_7), maxVal(aux11_0), maxVal(aux11_1), maxVal(aux11_2), maxVal(aux11_3), maxVal(aux11_4), maxVal(aux11_5))<=3

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

FORMULA PermAdmissibility-COL-01-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(aux6_4), maxVal(aux6_1), maxVal(aux6_5), maxVal(aux6_0))<=2 & [[sum(maxVal(out6_7), maxVal(out6_3), maxVal(out6_4), maxVal(out6_5), maxVal(out6_6), maxVal(out6_0), maxVal(out6_2), maxVal(out6_1))<=3 & [maxVal(c9)<=2 & sum(maxVal(aux9_3), maxVal(aux9_2), maxVal(aux9_1), maxVal(aux9_0), maxVal(aux9_7), maxVal(aux9_6), maxVal(aux9_5), maxVal(aux9_4))<=2]] & sum(maxVal(aux11_6), maxVal(aux11_7), maxVal(aux11_0), maxVal(aux11_1), maxVal(aux11_2), maxVal(aux11_3), maxVal(aux11_4), maxVal(aux11_5))<=3]]
normalized: [sum(maxVal(aux6_4), maxVal(aux6_1), maxVal(aux6_5), maxVal(aux6_0))<=2 & [[[maxVal(c9)<=2 & sum(maxVal(aux9_3), maxVal(aux9_2), maxVal(aux9_1), maxVal(aux9_0), maxVal(aux9_7), maxVal(aux9_6), maxVal(aux9_5), maxVal(aux9_4))<=2] & sum(maxVal(out6_7), maxVal(out6_3), maxVal(out6_4), maxVal(out6_5), maxVal(out6_6), maxVal(out6_0), maxVal(out6_2), maxVal(out6_1))<=3] & sum(maxVal(aux11_6), maxVal(aux11_7), maxVal(aux11_0), maxVal(aux11_1), maxVal(aux11_2), maxVal(aux11_3), maxVal(aux11_4), maxVal(aux11_5))<=3]]

abstracting: (8<=3) states: 0
abstracting: (8<=3) states: 0
abstracting: (8<=2) states: 0
abstracting: (1<=2) states: 52,537 (4)
abstracting: (4<=2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [sum(maxVal(out2_2), maxVal(out2_1), maxVal(out2_4), maxVal(out2_3), maxVal(out2_6), maxVal(out2_5), maxVal(out2_7), maxVal(out2_0))<=1 & [sum(maxVal(out8_5), maxVal(out8_4), maxVal(out8_7), maxVal(out8_6), maxVal(out8_2), maxVal(out8_3), maxVal(out8_0), maxVal(out8_1))<=1 & maxVal(c13)<=1]]
normalized: [[sum(maxVal(out8_5), maxVal(out8_4), maxVal(out8_7), maxVal(out8_6), maxVal(out8_2), maxVal(out8_3), maxVal(out8_0), maxVal(out8_1))<=1 & maxVal(c13)<=1] & sum(maxVal(out2_2), maxVal(out2_1), maxVal(out2_4), maxVal(out2_3), maxVal(out2_6), maxVal(out2_5), maxVal(out2_7), maxVal(out2_0))<=1]

abstracting: (8<=1) states: 0
abstracting: (1<=1) states: 52,537 (4)
abstracting: (8<=1) states: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[sum(maxVal(out2_2), maxVal(out2_1), maxVal(out2_4), maxVal(out2_3), maxVal(out2_6), maxVal(out2_5), maxVal(out2_7), maxVal(out2_0))<=3 & [maxVal(c9)<=3 & [[sum(maxVal(out4_4), maxVal(out4_5), maxVal(out4_2), maxVal(out4_3), maxVal(out4_6), maxVal(out4_7), maxVal(out4_1), maxVal(out4_0))<=3 & maxVal(c6)<=2] & sum(maxVal(in3_4), maxVal(in3_5))<=2]]] & [sum(maxVal(aux9_3), maxVal(aux9_2), maxVal(aux9_1), maxVal(aux9_0), maxVal(aux9_7), maxVal(aux9_6), maxVal(aux9_5), maxVal(aux9_4))<=3 & maxVal(c20)<=2]] & maxVal(c5)<=3]
normalized: [[[sum(maxVal(out2_2), maxVal(out2_1), maxVal(out2_4), maxVal(out2_3), maxVal(out2_6), maxVal(out2_5), maxVal(out2_7), maxVal(out2_0))<=3 & [[[sum(maxVal(out4_4), maxVal(out4_5), maxVal(out4_2), maxVal(out4_3), maxVal(out4_6), maxVal(out4_7), maxVal(out4_1), maxVal(out4_0))<=3 & maxVal(c6)<=2] & sum(maxVal(in3_4), maxVal(in3_5))<=2] & maxVal(c9)<=3]] & [sum(maxVal(aux9_3), maxVal(aux9_2), maxVal(aux9_1), maxVal(aux9_0), maxVal(aux9_7), maxVal(aux9_6), maxVal(aux9_5), maxVal(aux9_4))<=3 & maxVal(c20)<=2]] & maxVal(c5)<=3]

abstracting: (1<=3) states: 52,537 (4)
abstracting: (1<=2) states: 52,537 (4)
abstracting: (8<=3) states: 0
abstracting: (1<=3) states: 52,537 (4)
abstracting: (2<=2) states: 52,537 (4)
abstracting: (1<=2) states: 52,537 (4)
abstracting: (8<=3) states: 0
abstracting: (8<=3) states: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(c5)<=2 & sum(maxVal(aux13_6), maxVal(aux13_5), maxVal(aux13_4), maxVal(aux13_3), maxVal(aux13_7), maxVal(aux13_0), maxVal(aux13_1), maxVal(aux13_2))<=2] & [[[maxVal(c14)<=3 & maxVal(c13)<=1] & [sum(maxVal(aux14_7), maxVal(aux14_5), maxVal(aux14_6), maxVal(aux14_4), maxVal(aux14_3), maxVal(aux14_2), maxVal(aux14_1), maxVal(aux14_0))<=2 & [[sum(maxVal(aux10_7), maxVal(aux10_6), maxVal(aux10_5), maxVal(aux10_3), maxVal(aux10_4), maxVal(aux10_1), maxVal(aux10_2), maxVal(aux10_0))<=3 & maxVal(c19)<=2] & sum(maxVal(in4_7), maxVal(in4_6))<=1]]] & [[sum(maxVal(aux15_7), maxVal(aux15_3), maxVal(aux15_4), maxVal(aux15_5), maxVal(aux15_6), maxVal(aux15_0), maxVal(aux15_1), maxVal(aux15_2))<=3 & maxVal(c15)<=2] & [maxVal(c8)<=2 & maxVal(c19)<=1]]]]
normalized: [[maxVal(c5)<=2 & sum(maxVal(aux13_6), maxVal(aux13_5), maxVal(aux13_4), maxVal(aux13_3), maxVal(aux13_7), maxVal(aux13_0), maxVal(aux13_1), maxVal(aux13_2))<=2] & [[[sum(maxVal(aux14_7), maxVal(aux14_5), maxVal(aux14_6), maxVal(aux14_4), maxVal(aux14_3), maxVal(aux14_2), maxVal(aux14_1), maxVal(aux14_0))<=2 & [sum(maxVal(in4_7), maxVal(in4_6))<=1 & [sum(maxVal(aux10_7), maxVal(aux10_6), maxVal(aux10_5), maxVal(aux10_3), maxVal(aux10_4), maxVal(aux10_1), maxVal(aux10_2), maxVal(aux10_0))<=3 & maxVal(c19)<=2]]] & [maxVal(c14)<=3 & maxVal(c13)<=1]] & [[sum(maxVal(aux15_7), maxVal(aux15_3), maxVal(aux15_4), maxVal(aux15_5), maxVal(aux15_6), maxVal(aux15_0), maxVal(aux15_1), maxVal(aux15_2))<=3 & maxVal(c15)<=2] & [maxVal(c8)<=2 & maxVal(c19)<=1]]]]

abstracting: (1<=1) states: 52,537 (4)
abstracting: (1<=2) states: 52,537 (4)
abstracting: (1<=2) states: 52,537 (4)
abstracting: (8<=3) states: 0
abstracting: (1<=1) states: 52,537 (4)
abstracting: (1<=3) states: 52,537 (4)
abstracting: (1<=2) states: 52,537 (4)
abstracting: (8<=3) states: 0
abstracting: (2<=1) states: 0
abstracting: (8<=2) states: 0
abstracting: (8<=2) states: 0
abstracting: (1<=2) states: 52,537 (4)
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [sum(maxVal(aux14_7), maxVal(aux14_5), maxVal(aux14_6), maxVal(aux14_4), maxVal(aux14_3), maxVal(aux14_2), maxVal(aux14_1), maxVal(aux14_0))<=2 & [sum(maxVal(aux14_7), maxVal(aux14_5), maxVal(aux14_6), maxVal(aux14_4), maxVal(aux14_3), maxVal(aux14_2), maxVal(aux14_1), maxVal(aux14_0))<=3 & [maxVal(c19)<=1 & [sum(maxVal(in3_4), maxVal(in3_5))<=2 & [[sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=3 & sum(maxVal(aux11_6), maxVal(aux11_7), maxVal(aux11_0), maxVal(aux11_1), maxVal(aux11_2), maxVal(aux11_3), maxVal(aux11_4), maxVal(aux11_5))<=1] & sum(maxVal(in4_7), maxVal(in4_6))<=2]]]]]
normalized: [sum(maxVal(aux14_7), maxVal(aux14_5), maxVal(aux14_6), maxVal(aux14_4), maxVal(aux14_3), maxVal(aux14_2), maxVal(aux14_1), maxVal(aux14_0))<=2 & [[[sum(maxVal(in3_4), maxVal(in3_5))<=2 & [sum(maxVal(in4_7), maxVal(in4_6))<=2 & [sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=3 & sum(maxVal(aux11_6), maxVal(aux11_7), maxVal(aux11_0), maxVal(aux11_1), maxVal(aux11_2), maxVal(aux11_3), maxVal(aux11_4), maxVal(aux11_5))<=1]]] & maxVal(c19)<=1] & sum(maxVal(aux14_7), maxVal(aux14_5), maxVal(aux14_6), maxVal(aux14_4), maxVal(aux14_3), maxVal(aux14_2), maxVal(aux14_1), maxVal(aux14_0))<=3]]

abstracting: (8<=3) states: 0
abstracting: (1<=1) states: 52,537 (4)
abstracting: (8<=1) states: 0
abstracting: (4<=3) states: 0
abstracting: (2<=2) states: 52,537 (4)
abstracting: (2<=2) states: 52,537 (4)
abstracting: (8<=2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: maxVal(c8)<=1
normalized: maxVal(c8)<=1

abstracting: (1<=1) states: 52,537 (4)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[[[[[maxVal(c14)<=2 & maxVal(c11)<=2] & [sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=2 & sum(maxVal(in3_4), maxVal(in3_5))<=1]] & [[sum(maxVal(out5_7), maxVal(out5_4), maxVal(out5_3), maxVal(out5_6), maxVal(out5_5), maxVal(out5_0), maxVal(out5_2), maxVal(out5_1))<=2 & sum(maxVal(in1_0), maxVal(in1_1))<=1] & sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=3]] & [maxVal(c14)<=1 & sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=1]] & sum(maxVal(out8_5), maxVal(out8_4), maxVal(out8_7), maxVal(out8_6), maxVal(out8_2), maxVal(out8_3), maxVal(out8_0), maxVal(out8_1))<=3] & sum(maxVal(out8_5), maxVal(out8_4), maxVal(out8_7), maxVal(out8_6), maxVal(out8_2), maxVal(out8_3), maxVal(out8_0), maxVal(out8_1))<=2]
normalized: [[[[maxVal(c14)<=1 & sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=1] & [[[sum(maxVal(out5_7), maxVal(out5_4), maxVal(out5_3), maxVal(out5_6), maxVal(out5_5), maxVal(out5_0), maxVal(out5_2), maxVal(out5_1))<=2 & sum(maxVal(in1_0), maxVal(in1_1))<=1] & sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=3] & [[maxVal(c14)<=2 & maxVal(c11)<=2] & [sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=2 & sum(maxVal(in3_4), maxVal(in3_5))<=1]]]] & sum(maxVal(out8_5), maxVal(out8_4), maxVal(out8_7), maxVal(out8_6), maxVal(out8_2), maxVal(out8_3), maxVal(out8_0), maxVal(out8_1))<=3] & sum(maxVal(out8_5), maxVal(out8_4), maxVal(out8_7), maxVal(out8_6), maxVal(out8_2), maxVal(out8_3), maxVal(out8_0), maxVal(out8_1))<=2]

abstracting: (8<=2) states: 0
abstracting: (8<=3) states: 0
abstracting: (2<=1) states: 0
abstracting: (4<=2) states: 0
abstracting: (1<=2) states: 52,537 (4)
abstracting: (1<=2) states: 52,537 (4)
abstracting: (4<=3) states: 0
abstracting: (2<=1) states: 0
abstracting: (8<=2) states: 0
abstracting: (4<=1) states: 0
abstracting: (1<=1) states: 52,537 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=2 & [sum(maxVal(aux10_7), maxVal(aux10_6), maxVal(aux10_5), maxVal(aux10_3), maxVal(aux10_4), maxVal(aux10_1), maxVal(aux10_2), maxVal(aux10_0))<=3 & [maxVal(c110)<=3 & sum(maxVal(in3_4), maxVal(in3_5))<=3]]] & maxVal(c16)<=3]
normalized: [[[[maxVal(c110)<=3 & sum(maxVal(in3_4), maxVal(in3_5))<=3] & sum(maxVal(aux10_7), maxVal(aux10_6), maxVal(aux10_5), maxVal(aux10_3), maxVal(aux10_4), maxVal(aux10_1), maxVal(aux10_2), maxVal(aux10_0))<=3] & sum(maxVal(aux5_4), maxVal(aux5_5), maxVal(aux5_0), maxVal(aux5_1))<=2] & maxVal(c16)<=3]

abstracting: (1<=3) states: 52,537 (4)
abstracting: (4<=2) states: 0
abstracting: (8<=3) states: 0
abstracting: (2<=3) states: 52,537 (4)
abstracting: (1<=3) states: 52,537 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[sum(maxVal(aux10_7), maxVal(aux10_6), maxVal(aux10_5), maxVal(aux10_3), maxVal(aux10_4), maxVal(aux10_1), maxVal(aux10_2), maxVal(aux10_0))<=2 & [sum(maxVal(out2_2), maxVal(out2_1), maxVal(out2_4), maxVal(out2_3), maxVal(out2_6), maxVal(out2_5), maxVal(out2_7), maxVal(out2_0))<=1 & maxVal(c11)<=1]] & [sum(maxVal(out5_7), maxVal(out5_4), maxVal(out5_3), maxVal(out5_6), maxVal(out5_5), maxVal(out5_0), maxVal(out5_2), maxVal(out5_1))<=3 & maxVal(c18)<=3]]
normalized: [[sum(maxVal(out5_7), maxVal(out5_4), maxVal(out5_3), maxVal(out5_6), maxVal(out5_5), maxVal(out5_0), maxVal(out5_2), maxVal(out5_1))<=3 & maxVal(c18)<=3] & [[sum(maxVal(out2_2), maxVal(out2_1), maxVal(out2_4), maxVal(out2_3), maxVal(out2_6), maxVal(out2_5), maxVal(out2_7), maxVal(out2_0))<=1 & maxVal(c11)<=1] & sum(maxVal(aux10_7), maxVal(aux10_6), maxVal(aux10_5), maxVal(aux10_3), maxVal(aux10_4), maxVal(aux10_1), maxVal(aux10_2), maxVal(aux10_0))<=2]]

abstracting: (8<=2) states: 0
abstracting: (1<=1) states: 52,537 (4)
abstracting: (8<=1) states: 0
abstracting: (1<=3) states: 52,537 (4)
abstracting: (8<=3) states: 0
-> the formula is FALSE

FORMULA PermAdmissibility-COL-01-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(c7)<=3
normalized: maxVal(c7)<=3

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

FORMULA PermAdmissibility-COL-01-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 1m0sec


BK_STOP 1433635095596

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

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: 0m0sec

1176 1597 1707 1957 2050 2297 2387 2489 2559 2643 2803 2882 2955 2993 3050 3166 3262 3285 3509 3562 3644 3710 3718 3924 3986 3998 4068 4115 4287 4356 4390 4479 4519 4639 4702 4752 4765 4766 4831 4907 4930 4925 4957 4970 5043 5116 5148 5138 5135 5174 5198 5186 5330 5321 5320 5435 5418 5519 5490 5490 5722 5834 5873 5899 6174 6174 6553 6609 6613 6805 6790 6789 6835 6891 6911 6906 6943 6993 7044 7093 7135 7159 7190 7313 7328 7338 7369 7408 7453 7485 7530 7548 7580 7670 7654 7665 7677 7668 7690 7703 7729 7764 7776 7809 7947 7931 7998 8051 8095 8108 8147 8189 8203 8234 8317 8328 8318 8364 8407 8480 8489 8540 8549 8580 8584 8671 8682 8665 8679 8722 8735 8768 8810 8836 8820 8857 8928 8937 8973 9010 9046 9083 9097 9113 9095 9110 10001 10986 11533 11863 12238 12550 12841 13175 13387 13604 13796 13957 14544 14732 15175 15238 15539 15685 15997 16109 16219 16424 16468 16549 16727 16902 17055 17272 17440 17566 17670 17764 17837 17964 18046 18190 18377 18532 18669 18806 18844 18936 19006 19033 19243 19430 19583 19643 19749 19837 19905 20128 20308 20339 20579 20656 20717 20871 20930 21045 21159 21220 21356 21451 21537 21566 21806 21934 22026 22037 22138 22225 22316 22495 22608 22861 23043 23218 23313 23416 23442 23484 23538 23676 23770 23876 23935 24002 24095 24108 24222 24264 24404 24471 24499 24532 24684 24757 24762 24826 24830 24878 24924 25007 25035 25108 25149 25283 25368 25529 25692 25775 25848 25876 25885 25897 25931 25959 26009 26059 26094 26167 26188 26270 26282 26349 26416 26526 26584 26604 26660 26658 26683 26714 26741 26753 26799 26825 26854 26951 26979 26999 27016 27021 27031 27052 27060 27083 27099 27134 27129 27233 27252 27285 27310 27315 27372 27387 27411 27449 27488 27478 27746 27785 27813 27892 27903 27995 28050 28048 28102 28190 28207 28417 28431 28518 28553 28631 28708 28729 28766 28767 28766 28847 29135 29203 29321 29331 29463 29525 29569 29599 29643 29675 29702 29695 29708 29740 29785 29806 29883 30001 30006 30018 30124 30198 30252 30257 30293 30309 30309 30316 30316 30322 30358 30400 30403 30704 30835 30937 30965 31120 31190 31253 31310 31355 31563 31651 31683 31734 31795 31826 31879 32122 32190 32285 32329 32363 32416 32415 32450 32513 32590 32639 32670 32702 32749 32761 32746 32812 33086 33135 33160 33283 33337 33415 33505 33580 33648 33674 33755 33829 33900 33922 34007 34088 34262 34360 34394 34443 34508 34568 34623 34651 34698 34746 34784 34807 34846 34902 34936 34962 35007 35162 35193 35231 35257 35263 35280 35330 35367 35377 35395 35408 35567 35578 35610 35632 35647 35698 35723 35734 35744 35752 35772 35855 35881 35897 35917 35934 35943 35968 35991 36005 36018 36026 36119 36171 36225 36257 36326 36370 36399 36434 36476 36529 36586 36622 36672 36705 36710 36744 36757 36900 36935 36987 37024 37060 37076 37108 37161 37239 37269 37328 37364 37408 37418 37429 37509 37633 37696 37724 37750 37773 37789 37809 37857 37888 37940 37987 37999 38020 38019 38025 38025 38044 38137 38194 38223 38232 38241 38269 38321 38351 38375 38375 38382 38498 38533 38568 38607 38643 38675 38698 38738 38801 38828 38864 38893 38938 38976 39000 39006 39082 39109 39143 39173 39174 39217 39241 39246 39265 39285 39284 41503 43332 43630 45271 45804 46933 48072 48754 49427 49682 49905 51049 51609 52082 52709 52920 53573 53866 54121 54245 54463 57593 59060 60844 61832 62793 63289 63800 64165 64213 64627 64834 65030 65346 65751 65804 66016 66249 66377 66513 66630 66651 66827 66918 66963
iterations count:595704 (1006), effective:3264 (5)

initing FirstDep: 0m0sec

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="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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-2270"
echo " Executing tool marcie"
echo " Input is S_PermAdmissibility-PT-01, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r204st-blw3-143341204600164"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;