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-167819421100570.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-COL-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421100570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.8K Feb 26 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:33 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 4.1K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 04:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 22K 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-COL-02-CTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678992864400

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 18:54:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 18:54:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:54:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 18:54:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 18:54:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 824 ms
[2023-03-16 18:54:28] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2023-03-16 18:54:28] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 5 ms.
[2023-03-16 18:54:28] [INFO ] Skeletonized 5 HLPN properties in 2 ms. Removed 11 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=0 )
[2023-03-16 18:54:29] [INFO ] Flatten gal took : 17 ms
[2023-03-16 18:54:29] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:8) in guard (AND (GT $x 5) (LEQ $x 7))introduces in Quality(8) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:8) in guard (AND (GT $x 3) (LEQ $x 5))introduces in Quality(8) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:8) in guard (AND (GT $x 1) (LEQ $x 3))introduces in Quality(8) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:8) in guard (LEQ $x 1)introduces in Quality(8) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 8 reducing to 4 values.
For transition elaborate3:(AND (GT $x 5) (LEQ $x 7)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 3) (LEQ $x 5)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 1) (LEQ $x 3)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 1) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 2
[2023-03-16 18:54:29] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 18 ms.
[2023-03-16 18:54:29] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA DrinkVendingMachine-COL-02-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 7 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 18:54:29] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-16 18:54:29] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 1 transitions.
Found 1 dead transitions using SMT.
Drop transitions removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-16 18:54:29] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 18:54:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-16 18:54:29] [INFO ] Invariant cache hit.
[2023-03-16 18:54:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/12 places, 9/10 transitions.
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/9 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 12/12 places, 8/10 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Support contains 10 out of 10 places after structural reductions.
[2023-03-16 18:54:29] [INFO ] Flatten gal took : 4 ms
[2023-03-16 18:54:29] [INFO ] Flatten gal took : 4 ms
[2023-03-16 18:54:29] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 10 cols
[2023-03-16 18:54:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 18:54:30] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2023-03-16 18:54:30] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 3 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 3 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 6 transition count 6
Applied a total of 6 rules in 7 ms. Remains 6 /10 variables (removed 4) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 18:54:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 6/10 places, 6/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-16 18:54:30] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 18:54:30] [INFO ] Invariant cache hit.
[2023-03-16 18:54:30] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 10/10 places, 8/8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:54:30] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 3 ms
[2023-03-16 18:54:30] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:54:30] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-16 18:54:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10 places, 8 transitions and 26 arcs took 0 ms.
Total runtime 3057 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 10 NrTr: 8 NrArc: 26)

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

net check time: 0m 0.000sec

init dd package: 0m 3.558sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 20 (2.0e+01) #states 243



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

checking: EF [AX [p9<=0]]
normalized: E [true U ~ [EX [~ [p9<=0]]]]

abstracting: (p9<=0)
states: 81
.-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [E [p9<=0 U ~ [EX [AG [1<=p7]]]]]
normalized: ~ [E [p9<=0 U ~ [EX [~ [E [true U ~ [1<=p7]]]]]]]

abstracting: (1<=p7)
states: 162
.abstracting: (p9<=0)
states: 81
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [E [1<=p7 U AF [1<=p9]]]
normalized: EX [E [1<=p7 U ~ [EG [~ [1<=p9]]]]]

abstracting: (1<=p9)
states: 162
.
EG iterations: 1
abstracting: (1<=p7)
states: 162
.-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[1<=p3 & 1<=p6]]
normalized: EX [[1<=p3 & 1<=p6]]

abstracting: (1<=p6)
states: 162
abstracting: (1<=p3)
states: 162
.-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [EF [[1<=p3 & 1<=p6]] U EF [~ [AG [EF [1<=p9]]]]]
normalized: [~ [EG [~ [E [true U E [true U ~ [E [true U 1<=p9]]]]]]] & ~ [E [~ [E [true U E [true U ~ [E [true U 1<=p9]]]]] U [~ [E [true U E [true U ~ [E [true U 1<=p9]]]]] & ~ [E [true U [1<=p3 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 162
abstracting: (1<=p3)
states: 162
abstracting: (1<=p9)
states: 162
abstracting: (1<=p9)
states: 162
abstracting: (1<=p9)
states: 162

EG iterations: 0
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AG [AX [[[p6<=0 | p8<=2] & [p3<=0 | p6<=0]]]]]
normalized: ~ [EG [E [true U EX [~ [[[p3<=0 | p6<=0] & [p6<=0 | p8<=2]]]]]]]

abstracting: (p8<=2)
states: 243
abstracting: (p6<=0)
states: 81
abstracting: (p6<=0)
states: 81
abstracting: (p3<=0)
states: 81
.
EG iterations: 0
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [1<=0] & AF [[AF [AG [[1<=p5 & [1<=p6 & 2<=p8]]]] & AG [EF [[p3<=0 | p6<=0]]]]]]
normalized: [~ [EG [~ [[~ [EG [E [true U ~ [[[1<=p6 & 2<=p8] & 1<=p5]]]]] & ~ [E [true U ~ [E [true U [p3<=0 | p6<=0]]]]]]]]] & ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p6<=0)
states: 81
abstracting: (p3<=0)
states: 81
abstracting: (1<=p5)
states: 162
abstracting: (2<=p8)
states: 81
abstracting: (1<=p6)
states: 162

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: [EX [0<=0] | AX [AX [AX [~ [A [[1<=p5 & [1<=p6 & 2<=p8]] U [1<=p4 & [1<=p6 & 1<=p8]]]]]]]]
normalized: [~ [EX [EX [EX [[~ [E [~ [[[1<=p6 & 1<=p8] & 1<=p4]] U [~ [[[1<=p6 & 2<=p8] & 1<=p5]] & ~ [[[1<=p6 & 1<=p8] & 1<=p4]]]]] & ~ [EG [~ [[[1<=p6 & 1<=p8] & 1<=p4]]]]]]]]] | EX [0<=0]]

abstracting: (0<=0)
states: 243
.abstracting: (1<=p4)
states: 162
abstracting: (1<=p8)
states: 162
abstracting: (1<=p6)
states: 162
........
EG iterations: 8
abstracting: (1<=p4)
states: 162
abstracting: (1<=p8)
states: 162
abstracting: (1<=p6)
states: 162
abstracting: (1<=p5)
states: 162
abstracting: (2<=p8)
states: 81
abstracting: (1<=p6)
states: 162
abstracting: (1<=p4)
states: 162
abstracting: (1<=p8)
states: 162
abstracting: (1<=p6)
states: 162
...-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[1<=p7 | AF [[p7<=0 & EX [[[1<=p5 & 1<=p6] & [2<=p8 & [1<=p0 | [1<=p1 | 1<=p2]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[EX [[[[[1<=p1 | 1<=p2] | 1<=p0] & 2<=p8] & [1<=p5 & 1<=p6]]] & p7<=0]]]] | 1<=p7]]]]

abstracting: (1<=p7)
states: 162
abstracting: (p7<=0)
states: 81
abstracting: (1<=p6)
states: 162
abstracting: (1<=p5)
states: 162
abstracting: (2<=p8)
states: 81
abstracting: (1<=p0)
states: 162
abstracting: (1<=p2)
states: 162
abstracting: (1<=p1)
states: 162
..
EG iterations: 1
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [AX [AG [[[A [[1<=p5 & [1<=p6 & 2<=p8]] U [1<=p0 | [1<=p1 | 1<=p2]]] | 1<=p0] | [1<=p2 | 1<=p1]]]]]
normalized: ~ [E [true U EX [E [true U ~ [[[1<=p2 | 1<=p1] | [[~ [EG [~ [[[1<=p1 | 1<=p2] | 1<=p0]]]] & ~ [E [~ [[[1<=p1 | 1<=p2] | 1<=p0]] U [~ [[[1<=p6 & 2<=p8] & 1<=p5]] & ~ [[[1<=p1 | 1<=p2] | 1<=p0]]]]]] | 1<=p0]]]]]]]

abstracting: (1<=p0)
states: 162
abstracting: (1<=p0)
states: 162
abstracting: (1<=p2)
states: 162
abstracting: (1<=p1)
states: 162
abstracting: (1<=p5)
states: 162
abstracting: (2<=p8)
states: 81
abstracting: (1<=p6)
states: 162
abstracting: (1<=p0)
states: 162
abstracting: (1<=p2)
states: 162
abstracting: (1<=p1)
states: 162
abstracting: (1<=p0)
states: 162
abstracting: (1<=p2)
states: 162
abstracting: (1<=p1)
states: 162
......
EG iterations: 6
abstracting: (1<=p1)
states: 162
abstracting: (1<=p2)
states: 162
.-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AX [[AG [EX [1<=p7]] & AF [[[[1<=p5 & [1<=p6 & 2<=p8]] & [1<=p4 & [1<=p6 & 1<=p8]]] | [[1<=p4 & [1<=p6 & 1<=p8]] | 1<=p7]]]]]]
normalized: ~ [EX [EX [~ [[~ [EG [~ [[[[[1<=p6 & 1<=p8] & 1<=p4] | 1<=p7] | [[[1<=p6 & 1<=p8] & 1<=p4] & [1<=p5 & [1<=p6 & 2<=p8]]]]]]] & ~ [E [true U ~ [EX [1<=p7]]]]]]]]]

abstracting: (1<=p7)
states: 162
.abstracting: (2<=p8)
states: 81
abstracting: (1<=p6)
states: 162
abstracting: (1<=p5)
states: 162
abstracting: (1<=p4)
states: 162
abstracting: (1<=p8)
states: 162
abstracting: (1<=p6)
states: 162
abstracting: (1<=p7)
states: 162
abstracting: (1<=p4)
states: 162
abstracting: (1<=p8)
states: 162
abstracting: (1<=p6)
states: 162
........
EG iterations: 8
..-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-02-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1636 (1.6e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1769 3397 5166
used/not used/entry size/cache size: 4506 67104358 16 1024MB
basic ops cache: hits/miss/sum: 1066 1896 2962
used/not used/entry size/cache size: 3670 16773546 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 148 158 306
used/not used/entry size/cache size: 158 8388450 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 67107349
1 1444
2 52
3 12
4 3
5 1
6 0
7 1
8 1
9 0
>= 10 1

Total processing time: 0m 5.197sec


BK_STOP 1678992877626

--------------------
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 CTLFireability -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:60 (7), effective:22 (2)

initing FirstDep: 0m 0.000sec


iterations count:18 (2), effective:6 (0)

iterations count:12 (1), effective:2 (0)

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

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

iterations count:11 (1), effective:2 (0)

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

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

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

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

iterations count:12 (1), effective:2 (0)

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

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

iterations count:30 (3), effective:12 (1)

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

iterations count:22 (2), effective:10 (1)

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

iterations count:33 (4), effective:11 (1)

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-COL-02"
export BK_EXAMINATION="CTLFireability"
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-COL-02, examination is CTLFireability"
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-167819421100570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-02.tgz
mv DrinkVendingMachine-COL-02 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;