fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r149kn-smll-146416258900430
Last Updated
June 30, 2016

About the Execution of Marcie for S_DrinkVendingMachine-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7352.610 3600000.00 3603009.00 30.10 F???T???FTTF??FF normal

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_DrinkVendingMachine-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416258900430
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1464350103335


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

Net: DrinkVendingMachine_PT_10
(NrP: 120 NrTr: 111160 NrArc: 1026520)

net check time: 0m 0.157sec

parse formulas
formulas created successfully
place and transition orderings generation:0m22.391sec

init dd package: 0m 3.616sec


RS generation: 0m 7.206sec


-> reachability set: #nodes 180 (1.8e+02) #states 1,152,921,504,606,846,976 (18)



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

checking: AG [2<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)]
normalized: ~ [E [true U ~ [2<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)]]]

abstracting: (2<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)) states: 1,140,536,605,631,578,112 (18)
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.289sec

checking: AG [3<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)]
normalized: ~ [E [true U ~ [3<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)]]]

abstracting: (3<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)) states: 1,089,871,109,823,660,032 (18)
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.718sec

checking: AG [sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)]
normalized: ~ [E [true U ~ [sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)]]]

abstracting: (sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)) states: 1,152,921,504,606,846,976 (18)
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AG [~ [~ [sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)]]]
normalized: ~ [E [true U ~ [sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)]]]

abstracting: (sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)) states: 678,031,437,454,114,816 (17)
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.145sec

checking: AG [[3<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1) | 1<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)]]
normalized: ~ [E [true U ~ [[3<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1) | 1<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)]]]]

abstracting: (1<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)) states: 1,151,795,604,700,004,352 (18)
abstracting: (3<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)) states: 1,089,871,109,823,660,032 (18)
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.236sec

checking: EF [sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)]
normalized: E [true U sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)]

abstracting: (sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)) states: 718,324,140,565,594,112 (17)
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.791sec

checking: AG [[~ [~ [2<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)]] & sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)]]
normalized: ~ [E [true U ~ [[2<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1) & sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)]]]]

abstracting: (sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)) states: 718,324,140,565,594,112 (17)
abstracting: (2<=sum(theOptions_10, theOptions_8, theOptions_9, theOptions_6, theOptions_7, theOptions_4, theOptions_5, theOptions_3, theOptions_2, theOptions_1)) states: 1,140,536,605,631,578,112 (18)
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.852sec

checking: AG [[1<=sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1) | sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)]]
normalized: ~ [E [true U ~ [[1<=sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1) | sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)]]]]

abstracting: (sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)) states: 678,031,437,454,114,816 (17)
abstracting: (1<=sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)) states: 1,151,795,604,700,004,352 (18)
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.637sec

checking: EF [~ [[[sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)<=sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1) & 1<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)] | 2<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)]]]
normalized: E [true U ~ [[[sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)<=sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1) & 1<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)] | 2<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)]]]

abstracting: (2<=sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)) states: 1,140,536,605,631,578,112 (18)
abstracting: (1<=sum(productSlots_10, productSlots_8, productSlots_9, productSlots_6, productSlots_7, productSlots_4, productSlots_5, productSlots_2, productSlots_3, productSlots_1)) states: 1,151,795,604,700,004,352 (18)
abstracting: (sum(theProducts_9, theProducts_8, theProducts_10, theProducts_5, theProducts_4, theProducts_7, theProducts_6, theProducts_1, theProducts_3, theProducts_2)<=sum(optionSlots_10, optionSlots_9, optionSlots_8, optionSlots_7, optionSlots_6, optionSlots_5, optionSlots_4, optionSlots_3, optionSlots_2, optionSlots_1)) states: 678,031,437,454,114,816 (17)

BK_TIME_CONFINEMENT_REACHED

--------------------
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 3.211sec

243 188 245 282 214 206 187 234 228 217 280 217 269 375 256 267 261 238 190 160 170 170 160 160 162 161 172 162 170 163 163 163 164 164 164 164 165 165 165 165 165 165 178 178 173 173 166 166 166 166 166 166 167 167 167 167 167 167 167 167 167 190 168 168 168 168 168 168 168 168 168 168 168 168 168 200 169 169 169 169 169 169 169 169 169 169 169 169 169 169 169 170 170 170 170 170 170 170 170 170 170 170 170 170 170 170 170 170 170 170 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 171 202 197 197 197 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 172 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 173 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 174 208 208 208 208 194 194 194 194 194 194 194 194 194 194 194 194 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 175 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 176 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 241 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 186 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180
iterations count:832369 (7), effective:461 (0)

initing FirstDep: 0m 3.284sec

222 222 222 222 214 214 214 214 214 214 214 206 206 206 206 206 206 206 206 206 206 206 206 206 206 206 206 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 195 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180
iterations count:261787 (2), effective:18 (0)
248 250 237 245 223 223 223 206 206 206 206 206 206 206 206 206 229 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180
iterations count:146746 (1), effective:24 (0)
370 332 334 294 302 256 256 215 215 215 215 244 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180
iterations count:123111 (1), effective:28 (0)
173 175 174 182 175 175 175 176 176 176 176 176 176 176 176 176 199 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 177 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 178 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 179 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180
iterations count:236996 (2), effective:30 (0)
222 222 222 222 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180
iterations count:115285 (1), effective:10 (0)
266 268 237 245 208 208 208 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180
iterations count:118986 (1), effective:18 (0)
219 210 210 211 211 212 205 205 205 205 205 205 205 206 206 206 199 199 199 199 199 199 199 199 199 199 199 199 199 199 200 200 200 200 200 200 200 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 191 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 192 193 193 193 193 193 193 193 193 193 193 193 193 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 183 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 184 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180 180
iterations count:310571 (2), effective:29 (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="S_DrinkVendingMachine-PT-10"
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_DrinkVendingMachine-PT-10.tgz
mv S_DrinkVendingMachine-PT-10 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_DrinkVendingMachine-PT-10, 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 r149kn-smll-146416258900430"
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 ;