Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r138-smll-167819421400630.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DrinkVendingMachine-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421400630
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 11K Feb 26 04:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 04:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 04:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 04:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 04:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 04:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 04:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 51K Mar 5 18:22 model.pnml

--------------------
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-PT-02-ReachabilityCardinality-00
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-01
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-02
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-03
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-04
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-05
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-06
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-07
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-08
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-09
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-10
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-11
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-12
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-13
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-14
FORMULA_NAME DrinkVendingMachine-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679013647423

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 00:40:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 00:40:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 00:40:50] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-17 00:40:50] [INFO ] Transformed 24 places.
[2023-03-17 00:40:50] [INFO ] Transformed 72 transitions.
[2023-03-17 00:40:50] [INFO ] Parsed PT model containing 24 places and 72 transitions and 440 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 967 ms. (steps per millisecond=10 ) properties (out of 9) seen :5
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 52 rows 24 cols
[2023-03-17 00:40:52] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-17 00:40:52] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-17 00:40:52] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-17 00:40:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-17 00:40:52] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 2293 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DrinkVendingMachine_PT_02
(NrP: 24 NrTr: 72 NrArc: 440)

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

net check time: 0m 0.000sec

init dd package: 0m 3.993sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 34 (3.4e+01) #states 1,024 (3)



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

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

abstracting: (theOptions_2<=1)
states: 1,024 (3)
-> the formula is TRUE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [67<=sum(optionSlots_2, optionSlots_1)]
normalized: E [true U 67<=sum(optionSlots_2, optionSlots_1)]

abstracting: (67<=sum(optionSlots_2, optionSlots_1))
states: 0
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AG [~ [[sum(productSlots_2, productSlots_1)<=50 | 84<=sum(theProducts_2, theProducts_1)]]]
normalized: ~ [E [true U [sum(productSlots_2, productSlots_1)<=50 | 84<=sum(theProducts_2, theProducts_1)]]]

abstracting: (84<=sum(theProducts_2, theProducts_1))
states: 0
abstracting: (sum(productSlots_2, productSlots_1)<=50)
states: 1,024 (3)
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: AG [sum(optionSlots_2, optionSlots_1)<=sum(theOptions_2, theOptions_1)]
normalized: ~ [E [true U ~ [sum(optionSlots_2, optionSlots_1)<=sum(theOptions_2, theOptions_1)]]]

abstracting: (sum(optionSlots_2, optionSlots_1)<=sum(theOptions_2, theOptions_1))
states: 768
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: AG [~ [sum(theProducts_2, theProducts_1)<=sum(optionSlots_2, optionSlots_1)]]
normalized: ~ [E [true U sum(theProducts_2, theProducts_1)<=sum(optionSlots_2, optionSlots_1)]]

abstracting: (sum(theProducts_2, theProducts_1)<=sum(optionSlots_2, optionSlots_1))
states: 704
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AG [[[1<=wait_4 & ~ [ready_5<=ready_6]] | optionSlots_1<=wait_3]]
normalized: ~ [E [true U ~ [[[~ [ready_5<=ready_6] & 1<=wait_4] | optionSlots_1<=wait_3]]]]

abstracting: (optionSlots_1<=wait_3)
states: 768
abstracting: (1<=wait_4)
states: 512
abstracting: (ready_5<=ready_6)
states: 768
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[theProducts_1<=productSlots_1 | ~ [[~ [1<=wait_7] & ~ [[wait_1<=1 | productSlots_1<=0]]]]] | theOptions_2<=ready_3]]
normalized: ~ [E [true U ~ [[[~ [[~ [[wait_1<=1 | productSlots_1<=0]] & ~ [1<=wait_7]]] | theProducts_1<=productSlots_1] | theOptions_2<=ready_3]]]]

abstracting: (theOptions_2<=ready_3)
states: 768
abstracting: (theProducts_1<=productSlots_1)
states: 512
abstracting: (1<=wait_7)
states: 1,024 (3)
abstracting: (productSlots_1<=0)
states: 512
abstracting: (wait_1<=1)
states: 1,024 (3)
-> the formula is TRUE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=27]
normalized: E [true U sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=27]

abstracting: (sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=27)
states: 1,024 (3)
-> the formula is TRUE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AG [[sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1) | ~ [sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=30]]]
normalized: ~ [E [true U ~ [[sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1) | ~ [sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=30]]]]]

abstracting: (sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=30)
states: 1,024 (3)
abstracting: (sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1))
states: 704
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: EF [[[~ [[wait_5<=0 & [[ready_8<=ready_6 | ~ [theProducts_1<=0]] & [[~ [[ready_6<=1 | ready_8<=wait_3]] | [~ [1<=productSlots_1] & [1<=wait_3 & ready_4<=wait_2]]] & ready_6<=1]]]] & ~ [theProducts_1<=ready_4]] | ~ [theOptions_1<=wait_6]]]
normalized: E [true U [~ [theOptions_1<=wait_6] | [~ [theProducts_1<=ready_4] & ~ [[[[[[[1<=wait_3 & ready_4<=wait_2] & ~ [1<=productSlots_1]] | ~ [[ready_6<=1 | ready_8<=wait_3]]] & ready_6<=1] & [~ [theProducts_1<=0] | ready_8<=ready_6]] & wait_5<=0]]]]]

abstracting: (wait_5<=0)
states: 512
abstracting: (ready_8<=ready_6)
states: 1,024 (3)
abstracting: (theProducts_1<=0)
states: 512
abstracting: (ready_6<=1)
states: 1,024 (3)
abstracting: (ready_8<=wait_3)
states: 1,024 (3)
abstracting: (ready_6<=1)
states: 1,024 (3)
abstracting: (1<=productSlots_1)
states: 512
abstracting: (ready_4<=wait_2)
states: 768
abstracting: (1<=wait_3)
states: 512
abstracting: (theProducts_1<=ready_4)
states: 768
abstracting: (theOptions_1<=wait_6)
states: 768
-> the formula is TRUE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[theOptions_2<=1 & ready_5<=0] & [[~ [wait_3<=1] & [wait_7<=1 & [wait_8<=theOptions_1 | [~ [[[ready_2<=0 | 1<=theOptions_2] & [wait_2<=1 & productSlots_2<=0]]] & 1<=wait_1]]]] & [~ [[[[[[wait_3<=1 | wait_5<=1] | [1<=ready_7 | ready_5<=wait_3]] & ~ [1<=productSlots_1]] | [[~ [wait_8<=theProducts_1] | ~ [1<=wait_6]] | [~ [wait_6<=0] | productSlots_1<=1]]] & 1<=ready_6]] | [[productSlots_1<=ready_8 | [~ [theOptions_1<=0] & theProducts_2<=ready_8]] & ~ [[ready_3<=ready_5 | ~ [[ready_3<=0 | 1<=wait_7]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[~ [[ready_3<=0 | 1<=wait_7]] | ready_3<=ready_5]] & [[~ [theOptions_1<=0] & theProducts_2<=ready_8] | productSlots_1<=ready_8]] | ~ [[[[[~ [wait_6<=0] | productSlots_1<=1] | [~ [1<=wait_6] | ~ [wait_8<=theProducts_1]]] | [~ [1<=productSlots_1] & [[1<=ready_7 | ready_5<=wait_3] | [wait_3<=1 | wait_5<=1]]]] & 1<=ready_6]]] & [[[[~ [[[wait_2<=1 & productSlots_2<=0] & [ready_2<=0 | 1<=theOptions_2]]] & 1<=wait_1] | wait_8<=theOptions_1] & wait_7<=1] & ~ [wait_3<=1]]] & [theOptions_2<=1 & ready_5<=0]]]]]

abstracting: (ready_5<=0)
states: 512
abstracting: (theOptions_2<=1)
states: 1,024 (3)
abstracting: (wait_3<=1)
states: 1,024 (3)
abstracting: (wait_7<=1)
states: 1,024 (3)
abstracting: (wait_8<=theOptions_1)
states: 512
abstracting: (1<=wait_1)
states: 512
abstracting: (1<=theOptions_2)
states: 512
abstracting: (ready_2<=0)
states: 512
abstracting: (productSlots_2<=0)
states: 512
abstracting: (wait_2<=1)
states: 1,024 (3)
abstracting: (1<=ready_6)
states: 512
abstracting: (wait_5<=1)
states: 1,024 (3)
abstracting: (wait_3<=1)
states: 1,024 (3)
abstracting: (ready_5<=wait_3)
states: 768
abstracting: (1<=ready_7)
states: 0
abstracting: (1<=productSlots_1)
states: 512
abstracting: (wait_8<=theProducts_1)
states: 512
abstracting: (1<=wait_6)
states: 512
abstracting: (productSlots_1<=1)
states: 1,024 (3)
abstracting: (wait_6<=0)
states: 512
abstracting: (productSlots_1<=ready_8)
states: 512
abstracting: (theProducts_2<=ready_8)
states: 512
abstracting: (theOptions_1<=0)
states: 512
abstracting: (ready_3<=ready_5)
states: 768
abstracting: (1<=wait_7)
states: 1,024 (3)
abstracting: (ready_3<=0)
states: 512
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[ready_8<=ready_1 | ~ [wait_2<=wait_5]] & [1<=ready_1 & [~ [[[[[wait_8<=theProducts_2 | 1<=ready_3] & [optionSlots_1<=wait_3 & ready_7<=0]] | ~ [[theOptions_1<=ready_2 & ready_8<=wait_4]]] & [~ [[1<=optionSlots_1 | 1<=wait_4]] & 1<=theOptions_1]]] & [[[[~ [1<=ready_6] & productSlots_2<=ready_8] | [[optionSlots_2<=theOptions_2 | 1<=wait_4] | theOptions_1<=1]] & [[[ready_8<=1 | theProducts_2<=0] & theProducts_2<=optionSlots_2] | [[1<=ready_4 | wait_2<=0] & ~ [theProducts_2<=0]]]] & ~ [[[[ready_3<=wait_6 & ready_2<=optionSlots_1] & productSlots_2<=ready_1] & [[theProducts_2<=theOptions_2 & wait_3<=ready_1] | [ready_5<=1 & 1<=ready_6]]]]]]]] & optionSlots_2<=1]]
normalized: E [true U [[[[[~ [[[[ready_5<=1 & 1<=ready_6] | [theProducts_2<=theOptions_2 & wait_3<=ready_1]] & [[ready_3<=wait_6 & ready_2<=optionSlots_1] & productSlots_2<=ready_1]]] & [[[~ [theProducts_2<=0] & [1<=ready_4 | wait_2<=0]] | [[ready_8<=1 | theProducts_2<=0] & theProducts_2<=optionSlots_2]] & [[[optionSlots_2<=theOptions_2 | 1<=wait_4] | theOptions_1<=1] | [~ [1<=ready_6] & productSlots_2<=ready_8]]]] & ~ [[[~ [[1<=optionSlots_1 | 1<=wait_4]] & 1<=theOptions_1] & [~ [[theOptions_1<=ready_2 & ready_8<=wait_4]] | [[optionSlots_1<=wait_3 & ready_7<=0] & [wait_8<=theProducts_2 | 1<=ready_3]]]]]] & 1<=ready_1] & [~ [wait_2<=wait_5] | ready_8<=ready_1]] & optionSlots_2<=1]]

abstracting: (optionSlots_2<=1)
states: 1,024 (3)
abstracting: (ready_8<=ready_1)
states: 1,024 (3)
abstracting: (wait_2<=wait_5)
states: 768
abstracting: (1<=ready_1)
states: 512
abstracting: (1<=ready_3)
states: 512
abstracting: (wait_8<=theProducts_2)
states: 512
abstracting: (ready_7<=0)
states: 1,024 (3)
abstracting: (optionSlots_1<=wait_3)
states: 768
abstracting: (ready_8<=wait_4)
states: 1,024 (3)
abstracting: (theOptions_1<=ready_2)
states: 768
abstracting: (1<=theOptions_1)
states: 512
abstracting: (1<=wait_4)
states: 512
abstracting: (1<=optionSlots_1)
states: 512
abstracting: (productSlots_2<=ready_8)
states: 512
abstracting: (1<=ready_6)
states: 512
abstracting: (theOptions_1<=1)
states: 1,024 (3)
abstracting: (1<=wait_4)
states: 512
abstracting: (optionSlots_2<=theOptions_2)
states: 512
abstracting: (theProducts_2<=optionSlots_2)
states: 768
abstracting: (theProducts_2<=0)
states: 512
abstracting: (ready_8<=1)
states: 1,024 (3)
abstracting: (wait_2<=0)
states: 512
abstracting: (1<=ready_4)
states: 512
abstracting: (theProducts_2<=0)
states: 512
abstracting: (productSlots_2<=ready_1)
states: 768
abstracting: (ready_2<=optionSlots_1)
states: 768
abstracting: (ready_3<=wait_6)
states: 768
abstracting: (wait_3<=ready_1)
states: 768
abstracting: (theProducts_2<=theOptions_2)
states: 768
abstracting: (1<=ready_6)
states: 512
abstracting: (ready_5<=1)
states: 1,024 (3)
-> the formula is TRUE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[[[ready_2<=1 & [[ready_3<=wait_3 & [theOptions_1<=1 & ~ [[theProducts_2<=0 | wait_4<=ready_1]]]] | [[[~ [ready_7<=1] & [wait_6<=1 & theOptions_1<=wait_8]] & [[1<=ready_7 & optionSlots_1<=1] | [wait_2<=wait_5 | 1<=ready_7]]] & [[~ [wait_7<=ready_4] & [wait_6<=0 | 1<=optionSlots_2]] | [~ [wait_3<=theOptions_2] & [wait_1<=wait_5 | 1<=wait_3]]]]]] & ~ [[[1<=productSlots_1 | ~ [1<=wait_7]] & [~ [[1<=productSlots_2 | 1<=optionSlots_2]] | [wait_2<=ready_8 & ~ [[ready_8<=0 & wait_4<=0]]]]]]] & ~ [[[[1<=ready_7 | [optionSlots_2<=wait_2 & [~ [ready_6<=ready_6] | ~ [1<=ready_1]]]] | ~ [[wait_4<=1 | [[optionSlots_2<=ready_8 | 1<=optionSlots_2] | wait_8<=wait_3]]]] | [ready_8<=ready_1 | optionSlots_2<=1]]]]]]
normalized: ~ [E [true U [~ [[[ready_8<=ready_1 | optionSlots_2<=1] | [~ [[[[optionSlots_2<=ready_8 | 1<=optionSlots_2] | wait_8<=wait_3] | wait_4<=1]] | [[[~ [1<=ready_1] | ~ [ready_6<=ready_6]] & optionSlots_2<=wait_2] | 1<=ready_7]]]] & [~ [[[[~ [[ready_8<=0 & wait_4<=0]] & wait_2<=ready_8] | ~ [[1<=productSlots_2 | 1<=optionSlots_2]]] & [~ [1<=wait_7] | 1<=productSlots_1]]] & [[[[[[wait_1<=wait_5 | 1<=wait_3] & ~ [wait_3<=theOptions_2]] | [[wait_6<=0 | 1<=optionSlots_2] & ~ [wait_7<=ready_4]]] & [[[wait_2<=wait_5 | 1<=ready_7] | [1<=ready_7 & optionSlots_1<=1]] & [[wait_6<=1 & theOptions_1<=wait_8] & ~ [ready_7<=1]]]] | [[~ [[theProducts_2<=0 | wait_4<=ready_1]] & theOptions_1<=1] & ready_3<=wait_3]] & ready_2<=1]]]]]

abstracting: (ready_2<=1)
states: 1,024 (3)
abstracting: (ready_3<=wait_3)
states: 512
abstracting: (theOptions_1<=1)
states: 1,024 (3)
abstracting: (wait_4<=ready_1)
states: 768
abstracting: (theProducts_2<=0)
states: 512
abstracting: (ready_7<=1)
states: 1,024 (3)
abstracting: (theOptions_1<=wait_8)
states: 1,024 (3)
abstracting: (wait_6<=1)
states: 1,024 (3)
abstracting: (optionSlots_1<=1)
states: 1,024 (3)
abstracting: (1<=ready_7)
states: 0
abstracting: (1<=ready_7)
states: 0
abstracting: (wait_2<=wait_5)
states: 768
abstracting: (wait_7<=ready_4)
states: 512
abstracting: (1<=optionSlots_2)
states: 512
abstracting: (wait_6<=0)
states: 512
abstracting: (wait_3<=theOptions_2)
states: 768
abstracting: (1<=wait_3)
states: 512
abstracting: (wait_1<=wait_5)
states: 768
abstracting: (1<=productSlots_1)
states: 512
abstracting: (1<=wait_7)
states: 1,024 (3)
abstracting: (1<=optionSlots_2)
states: 512
abstracting: (1<=productSlots_2)
states: 512
abstracting: (wait_2<=ready_8)
states: 512
abstracting: (wait_4<=0)
states: 512
abstracting: (ready_8<=0)
states: 1,024 (3)
abstracting: (1<=ready_7)
states: 0
abstracting: (optionSlots_2<=wait_2)
states: 768
abstracting: (ready_6<=ready_6)
states: 1,024 (3)
abstracting: (1<=ready_1)
states: 512
abstracting: (wait_4<=1)
states: 1,024 (3)
abstracting: (wait_8<=wait_3)
states: 512
abstracting: (1<=optionSlots_2)
states: 512
abstracting: (optionSlots_2<=ready_8)
states: 512
abstracting: (optionSlots_2<=1)
states: 1,024 (3)
abstracting: (ready_8<=ready_1)
states: 1,024 (3)
-> the formula is TRUE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) & sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1)] | [85<=sum(optionSlots_2, optionSlots_1) | ~ [[~ [33<=sum(optionSlots_2, optionSlots_1)] | ~ [[~ [[[79<=sum(productSlots_2, productSlots_1) & sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1)] | ~ [sum(optionSlots_2, optionSlots_1)<=88]]] & [[~ [22<=sum(optionSlots_2, optionSlots_1)] | [14<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)]] | ~ [[sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | 70<=sum(optionSlots_2, optionSlots_1)]]]]]]]]]]
normalized: E [true U [[~ [[~ [[[~ [[sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | 70<=sum(optionSlots_2, optionSlots_1)]] | [[14<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) | sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1)] | ~ [22<=sum(optionSlots_2, optionSlots_1)]]] & ~ [[~ [sum(optionSlots_2, optionSlots_1)<=88] | [79<=sum(productSlots_2, productSlots_1) & sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1)]]]]] | ~ [33<=sum(optionSlots_2, optionSlots_1)]]] | 85<=sum(optionSlots_2, optionSlots_1)] | [sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1) & sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1)]]]

abstracting: (sum(productSlots_2, productSlots_1)<=sum(productSlots_2, productSlots_1))
states: 1,024 (3)
abstracting: (sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
abstracting: (85<=sum(optionSlots_2, optionSlots_1))
states: 0
abstracting: (33<=sum(optionSlots_2, optionSlots_1))
states: 0
abstracting: (sum(theProducts_2, theProducts_1)<=sum(theOptions_2, theOptions_1))
states: 704
abstracting: (79<=sum(productSlots_2, productSlots_1))
states: 0
abstracting: (sum(optionSlots_2, optionSlots_1)<=88)
states: 1,024 (3)
abstracting: (22<=sum(optionSlots_2, optionSlots_1))
states: 0
abstracting: (sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1))
states: 768
abstracting: (14<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 0
abstracting: (70<=sum(optionSlots_2, optionSlots_1))
states: 0
abstracting: (sum(productSlots_2, productSlots_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
-> the formula is TRUE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.315sec

checking: AG [[[~ [[~ [[~ [ready_7<=theOptions_1] | ready_8<=0]] & ~ [[[[[optionSlots_1<=wait_1 & optionSlots_2<=0] | wait_8<=0] | [[theOptions_1<=1 | 1<=optionSlots_2] & [1<=productSlots_1 & productSlots_2<=1]]] & [[[wait_3<=theOptions_2 | wait_2<=ready_5] & ~ [ready_6<=wait_6]] & [1<=optionSlots_1 | [ready_6<=0 | wait_8<=0]]]]]]] & [[[~ [[[ready_7<=0 & ~ [theOptions_2<=ready_2]] | wait_5<=1]] & ~ [[[~ [1<=wait_6] | [ready_1<=1 | 1<=ready_1]] & [ready_5<=ready_5 & [optionSlots_2<=1 | productSlots_1<=1]]]]] & [ready_1<=theOptions_1 | wait_3<=1]] | [[wait_4<=0 | [~ [1<=wait_2] & [[ready_4<=wait_8 | [ready_3<=0 & ready_3<=0]] | [theOptions_1<=0 | wait_4<=wait_3]]]] & theOptions_2<=theOptions_1]]] & [[~ [ready_8<=wait_3] | [[1<=wait_8 & ~ [[~ [1<=ready_3] & [~ [wait_5<=0] | [theProducts_1<=0 | 1<=wait_8]]]]] | ~ [theOptions_1<=1]]] | wait_4<=ready_2]]]
normalized: ~ [E [true U ~ [[[~ [[~ [[[[[optionSlots_1<=wait_1 & optionSlots_2<=0] | wait_8<=0] | [[1<=productSlots_1 & productSlots_2<=1] & [theOptions_1<=1 | 1<=optionSlots_2]]] & [[~ [ready_6<=wait_6] & [wait_3<=theOptions_2 | wait_2<=ready_5]] & [[ready_6<=0 | wait_8<=0] | 1<=optionSlots_1]]]] & ~ [[~ [ready_7<=theOptions_1] | ready_8<=0]]]] & [[[ready_1<=theOptions_1 | wait_3<=1] & [~ [[[[ready_1<=1 | 1<=ready_1] | ~ [1<=wait_6]] & [[optionSlots_2<=1 | productSlots_1<=1] & ready_5<=ready_5]]] & ~ [[[~ [theOptions_2<=ready_2] & ready_7<=0] | wait_5<=1]]]] | [[[[[theOptions_1<=0 | wait_4<=wait_3] | [[ready_3<=0 & ready_3<=0] | ready_4<=wait_8]] & ~ [1<=wait_2]] | wait_4<=0] & theOptions_2<=theOptions_1]]] & [[[~ [theOptions_1<=1] | [~ [[[~ [wait_5<=0] | [theProducts_1<=0 | 1<=wait_8]] & ~ [1<=ready_3]]] & 1<=wait_8]] | ~ [ready_8<=wait_3]] | wait_4<=ready_2]]]]]

abstracting: (wait_4<=ready_2)
states: 768
abstracting: (ready_8<=wait_3)
states: 1,024 (3)
abstracting: (1<=wait_8)
states: 1,024 (3)
abstracting: (1<=ready_3)
states: 512
abstracting: (1<=wait_8)
states: 1,024 (3)
abstracting: (theProducts_1<=0)
states: 512
abstracting: (wait_5<=0)
states: 512
abstracting: (theOptions_1<=1)
states: 1,024 (3)
abstracting: (theOptions_2<=theOptions_1)
states: 768
abstracting: (wait_4<=0)
states: 512
abstracting: (1<=wait_2)
states: 512
abstracting: (ready_4<=wait_8)
states: 1,024 (3)
abstracting: (ready_3<=0)
states: 512
abstracting: (ready_3<=0)
states: 512
abstracting: (wait_4<=wait_3)
states: 768
abstracting: (theOptions_1<=0)
states: 512
abstracting: (wait_5<=1)
states: 1,024 (3)
abstracting: (ready_7<=0)
states: 1,024 (3)
abstracting: (theOptions_2<=ready_2)
states: 768
abstracting: (ready_5<=ready_5)
states: 1,024 (3)
abstracting: (productSlots_1<=1)
states: 1,024 (3)
abstracting: (optionSlots_2<=1)
states: 1,024 (3)
abstracting: (1<=wait_6)
states: 512
abstracting: (1<=ready_1)
states: 512
abstracting: (ready_1<=1)
states: 1,024 (3)
abstracting: (wait_3<=1)
states: 1,024 (3)
abstracting: (ready_1<=theOptions_1)
states: 768
abstracting: (ready_8<=0)
states: 1,024 (3)
abstracting: (ready_7<=theOptions_1)
states: 1,024 (3)
abstracting: (1<=optionSlots_1)
states: 512
abstracting: (wait_8<=0)
states: 0
abstracting: (ready_6<=0)
states: 512
abstracting: (wait_2<=ready_5)
states: 768
abstracting: (wait_3<=theOptions_2)
states: 768
abstracting: (ready_6<=wait_6)
states: 512
abstracting: (1<=optionSlots_2)
states: 512
abstracting: (theOptions_1<=1)
states: 1,024 (3)
abstracting: (productSlots_2<=1)
states: 1,024 (3)
abstracting: (1<=productSlots_1)
states: 512
abstracting: (wait_8<=0)
states: 0
abstracting: (optionSlots_2<=0)
states: 512
abstracting: (optionSlots_1<=wait_1)
states: 768
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [sum(theProducts_2, theProducts_1)<=32] | ~ [[[~ [[51<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1) & ~ [sum(theProducts_2, theProducts_1)<=77]]] | [[~ [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=33] & ~ [[sum(optionSlots_2, optionSlots_1)<=16 | sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=36]]] | ~ [97<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]] | ~ [[[[78<=sum(productSlots_2, productSlots_1) | [sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1) | sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]] | ~ [[41<=sum(optionSlots_2, optionSlots_1) | 56<=sum(theOptions_2, theOptions_1)]]] & ~ [[[49<=sum(optionSlots_2, optionSlots_1) & 37<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] & [sum(productSlots_2, productSlots_1)<=7 | 5<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]]]]]]]]
normalized: E [true U [~ [[~ [[~ [[[sum(productSlots_2, productSlots_1)<=7 | 5<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)] & [49<=sum(optionSlots_2, optionSlots_1) & 37<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]] & [~ [[41<=sum(optionSlots_2, optionSlots_1) | 56<=sum(theOptions_2, theOptions_1)]] | [78<=sum(productSlots_2, productSlots_1) | [sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1) | sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)]]]]] | [[~ [97<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)] | [~ [[sum(optionSlots_2, optionSlots_1)<=16 | sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=36]] & ~ [sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=33]]] | ~ [[~ [sum(theProducts_2, theProducts_1)<=77] & 51<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)]]]]] | ~ [sum(theProducts_2, theProducts_1)<=32]]]

abstracting: (sum(theProducts_2, theProducts_1)<=32)
states: 1,024 (3)
abstracting: (51<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 0
abstracting: (sum(theProducts_2, theProducts_1)<=77)
states: 1,024 (3)
abstracting: (sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1)<=33)
states: 1,024 (3)
abstracting: (sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1)<=36)
states: 1,024 (3)
abstracting: (sum(optionSlots_2, optionSlots_1)<=16)
states: 1,024 (3)
abstracting: (97<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 0
abstracting: (sum(theProducts_2, theProducts_1)<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 1,024 (3)
abstracting: (sum(productSlots_2, productSlots_1)<=sum(theProducts_2, theProducts_1))
states: 768
abstracting: (78<=sum(productSlots_2, productSlots_1))
states: 0
abstracting: (56<=sum(theOptions_2, theOptions_1))
states: 0
abstracting: (41<=sum(optionSlots_2, optionSlots_1))
states: 0
abstracting: (37<=sum(wait_8, wait_7, wait_6, wait_5, wait_4, wait_3, wait_2, wait_1))
states: 0
abstracting: (49<=sum(optionSlots_2, optionSlots_1))
states: 0
abstracting: (5<=sum(ready_8, ready_6, ready_7, ready_4, ready_5, ready_2, ready_3, ready_1))
states: 112
abstracting: (sum(productSlots_2, productSlots_1)<=7)
states: 1,024 (3)
-> the formula is FALSE

FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.526sec

totally nodes used: 3763 (3.8e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2389 8191 10580
used/not used/entry size/cache size: 9431 67099433 16 1024MB
basic ops cache: hits/miss/sum: 1923 6411 8334
used/not used/entry size/cache size: 12782 16764434 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 3700 3700
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 398 823 1221
used/not used/entry size/cache size: 823 8387785 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 67105135
1 3695
2 34
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.729sec


BK_STOP 1679013661116

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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.000sec


iterations count:285 (3), effective:26 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:113 (1), effective:7 (0)

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

iterations count:101 (1), effective:7 (0)

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

iterations count:116 (1), effective:8 (0)

iterations count:77 (1), effective:3 (0)

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

iterations count:93 (1), effective:8 (0)

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

iterations count:74 (1), effective:2 (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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DrinkVendingMachine-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-167819421400630"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;