About the Execution of Marcie+red for DrinkVendingMachine-COL-24
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5482.304 | 11458.00 | 16263.00 | 480.20 | TFTTFFTTFFFFTTFT | normal |
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-167819421200594.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-24, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421200594
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 27K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 04:33 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 28K 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-24-CTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-24-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678998251701
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-24
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 20:24:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 20:24:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:24:14] [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 20:24:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 20:24:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 696 ms
[2023-03-16 20:24:14] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 288 PT places and 3.3235344E7 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2023-03-16 20:24:15] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 5 ms.
[2023-03-16 20:24:15] [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 8 ms. (steps per millisecond=0 )
[2023-03-16 20:24:15] [INFO ] Flatten gal took : 17 ms
[2023-03-16 20:24:15] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:96) in guard (LEQ $x 23)introduces in Quality(96) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:96) in guard (AND (GT $x 23) (LEQ $x 47))introduces in Quality(96) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:96) in guard (AND (GT $x 47) (LEQ $x 71))introduces in Quality(96) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:96) in guard (AND (GT $x 71) (LEQ $x 95))introduces in Quality(96) 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 96 reducing to 4 values.
For transition elaborate0:(LEQ $x 23) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 23) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 47) (LEQ $x 71)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 71) (LEQ $x 95)) -> (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 24
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 24
[2023-03-16 20:24:15] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 22 ms.
[2023-03-16 20:24:15] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-24-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-09 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 8 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 20:24:15] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-16 20:24:15] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
[2023-03-16 20:24:15] [INFO ] Invariant cache hit.
[2023-03-16 20:24:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-16 20:24:15] [INFO ] Invariant cache hit.
[2023-03-16 20:24:15] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-16 20:24:15] [INFO ] Invariant cache hit.
[2023-03-16 20:24:15] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 20:24:15] [INFO ] Flatten gal took : 7 ms
[2023-03-16 20:24:15] [INFO ] Flatten gal took : 6 ms
[2023-03-16 20:24:15] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:24:15] [INFO ] Invariant cache hit.
[2023-03-16 20:24:15] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-16 20:24:15] [INFO ] Flatten gal took : 3 ms
[2023-03-16 20:24:15] [INFO ] Flatten gal took : 4 ms
[2023-03-16 20:24:15] [INFO ] Input system was already deterministic with 10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:15] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 3 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 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 8 transition count 8
Applied a total of 6 rules in 6 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 8/12 places, 8/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA DrinkVendingMachine-COL-24-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 3 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 3 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [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 : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 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 8 transition count 8
Applied a total of 6 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 8/12 places, 8/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 2 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 20:24:16] [INFO ] Invariant cache hit.
[2023-03-16 20:24:16] [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 : 12/12 places, 10/10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 1 ms
[2023-03-16 20:24:16] [INFO ] Input system was already deterministic with 10 transitions.
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 3 ms
[2023-03-16 20:24:16] [INFO ] Flatten gal took : 3 ms
[2023-03-16 20:24:16] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-16 20:24:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 34 arcs took 0 ms.
Total runtime 2472 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: 12 NrTr: 10 NrArc: 34)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.355sec
RS generation: 0m 0.007sec
-> reachability set: #nodes 156 (1.6e+02) #states 244,140,625 (8)
starting MCC model checker
--------------------------
checking: EX [1<=p2]
normalized: EX [1<=p2]
abstracting: (1<=p2)
states: 234,375,000 (8)
.-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [[p3<=0 | p7<=0]]
normalized: EX [[p3<=0 | p7<=0]]
abstracting: (p7<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
.-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [[EG [AF [1<=p0]] | [2<=p1 & [1<=p3 & 1<=p5]]]]
normalized: EX [[[2<=p1 & [1<=p3 & 1<=p5]] | EG [~ [EG [~ [1<=p0]]]]]]
abstracting: (1<=p0)
states: 234,375,000 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (2<=p1)
states: 224,609,375 (8)
.-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EX [EF [[[p1<=0 | p3<=0] | [p6<=0 | 1<=p2]]]]
normalized: EX [E [true U [[p6<=0 | 1<=p2] | [p1<=0 | p3<=0]]]]
abstracting: (p3<=0)
states: 9,765,625 (6)
abstracting: (p1<=0)
states: 9,765,625 (6)
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (p6<=0)
states: 9,765,625 (6)
.-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [EG [AG [[[p8<=0 & p9<=0] & [p10<=0 & p11<=0]]]]]
normalized: E [true U EG [~ [E [true U ~ [[[p10<=0 & p11<=0] & [p8<=0 & p9<=0]]]]]]]
abstracting: (p9<=0)
states: 9,765,625 (6)
abstracting: (p8<=0)
states: 9,765,625 (6)
abstracting: (p11<=0)
states: 9,765,625 (6)
abstracting: (p10<=0)
states: 9,765,625 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: A [AX [[3<=p1 & [1<=p3 & 1<=p4]]] U 1<=p0]
normalized: [~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [EX [~ [[[1<=p3 & 1<=p4] & 3<=p1]]] & ~ [1<=p0]]]]]
abstracting: (1<=p0)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.abstracting: (1<=p0)
states: 234,375,000 (8)
abstracting: (1<=p0)
states: 234,375,000 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EG [[EX [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]] & EG [[EG [[1<=p1 & [1<=p3 & 1<=p6]]] | [[[p1<=1 | [p3<=0 | p5<=0]] & AX [[1<=p3 & 1<=p7]]] | EG [AX [1<=p2]]]]]]]
normalized: EG [[EG [[[EG [~ [EX [~ [1<=p2]]]] | [~ [EX [~ [[1<=p3 & 1<=p7]]]] & [[p3<=0 | p5<=0] | p1<=1]]] | EG [[[1<=p3 & 1<=p6] & 1<=p1]]]] & EX [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
.abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.
EG iterations: 1
abstracting: (p1<=1)
states: 19,531,250 (7)
abstracting: (p5<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
abstracting: (1<=p7)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.abstracting: (1<=p2)
states: 234,375,000 (8)
...
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EX [AF [E [[[2<=p1 & [1<=p3 & 1<=p5]] | [A [~ [[p3<=0 | p7<=0]] U [3<=p1 & [1<=p3 & 1<=p4]]] & AX [1<=p0]]] U [AF [~ [[p3<=0 | p7<=0]]] & EG [[3<=p1 & [1<=p3 & 1<=p4]]]]]]]
normalized: EX [~ [EG [~ [E [[[~ [EX [~ [1<=p0]]] & [~ [EG [~ [[[1<=p3 & 1<=p4] & 3<=p1]]]] & ~ [E [~ [[[1<=p3 & 1<=p4] & 3<=p1]] U [[p3<=0 | p7<=0] & ~ [[[1<=p3 & 1<=p4] & 3<=p1]]]]]]] | [[1<=p3 & 1<=p5] & 2<=p1]] U [EG [[[1<=p3 & 1<=p4] & 3<=p1]] & ~ [EG [[p3<=0 | p7<=0]]]]]]]]]
abstracting: (p7<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
.........................................................................................................................
EG iterations: 121
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.
EG iterations: 1
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (p7<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
......................................................................................................................
EG iterations: 118
abstracting: (1<=p0)
states: 234,375,000 (8)
........................................................................................................................
EG iterations: 119
.-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.203sec
checking: [AG [AF [~ [E [EX [1<=p0] U 1<=p2]]]] & EF [[[[[EG [[1<=p1 & [1<=p3 & 1<=p6]]] | EG [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]]] | [p0<=0 | A [[3<=p1 & [1<=p3 & 1<=p4]] U [[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]]]] & A [AX [1<=p0] U EX [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]]]] & [3<=p1 & [1<=p3 & 1<=p4]]]]]
normalized: [E [true U [[[1<=p3 & 1<=p4] & 3<=p1] & [[~ [EG [~ [EX [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]] & ~ [E [~ [EX [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]] U [EX [~ [1<=p0]] & ~ [EX [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]]]] & [[[~ [EG [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]] & ~ [E [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]] U [~ [[[1<=p3 & 1<=p4] & 3<=p1]] & ~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]]] | p0<=0] | [EG [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]] | EG [[[1<=p3 & 1<=p6] & 1<=p1]]]]]]] & ~ [E [true U EG [E [EX [1<=p0] U 1<=p2]]]]]
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p0)
states: 234,375,000 (8)
..
EG iterations: 1
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.
EG iterations: 1
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
.
EG iterations: 1
abstracting: (p0<=0)
states: 9,765,625 (6)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
..................................................
EG iterations: 50
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
.abstracting: (1<=p0)
states: 234,375,000 (8)
.abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
.abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
...........................
EG iterations: 26
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [[EG [[AG [[p1<=0 | [p3<=0 | p6<=0]]] & [1<=p3 & 1<=p7]]] | [[EG [[[p8<=0 & p9<=0] & [p10<=0 & p11<=0]]] & E [1<=p2 U ~ [[p3<=0 | p7<=0]]]] & [AX [[p1<=1 | [p3<=0 | p5<=0]]] & [[p0<=0 | [p3<=0 | p7<=0]] & [[[AG [p2<=0] | 1<=p8] | [1<=p9 | 1<=p10]] | [[1<=p11 | p1<=2] | [p3<=0 | [p4<=0 | p7<=0]]]]]]]]]
normalized: E [true U [[[[[[[[p4<=0 | p7<=0] | p3<=0] | [1<=p11 | p1<=2]] | [[1<=p9 | 1<=p10] | [~ [E [true U ~ [p2<=0]]] | 1<=p8]]] & [[p3<=0 | p7<=0] | p0<=0]] & ~ [EX [~ [[[p3<=0 | p5<=0] | p1<=1]]]]] & [E [1<=p2 U ~ [[p3<=0 | p7<=0]]] & EG [[[p10<=0 & p11<=0] & [p8<=0 & p9<=0]]]]] | EG [[[1<=p3 & 1<=p7] & ~ [E [true U ~ [[[p3<=0 | p6<=0] | p1<=0]]]]]]]]
abstracting: (p1<=0)
states: 9,765,625 (6)
abstracting: (p6<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
abstracting: (1<=p7)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.
EG iterations: 1
abstracting: (p9<=0)
states: 9,765,625 (6)
abstracting: (p8<=0)
states: 9,765,625 (6)
abstracting: (p11<=0)
states: 9,765,625 (6)
abstracting: (p10<=0)
states: 9,765,625 (6)
..................................................
EG iterations: 50
abstracting: (p7<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (p1<=1)
states: 19,531,250 (7)
abstracting: (p5<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
.abstracting: (p0<=0)
states: 9,765,625 (6)
abstracting: (p7<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (p2<=0)
states: 9,765,625 (6)
abstracting: (1<=p10)
states: 234,375,000 (8)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (p1<=2)
states: 29,296,875 (7)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (p3<=0)
states: 9,765,625 (6)
abstracting: (p7<=0)
states: 9,765,625 (6)
abstracting: (p4<=0)
states: 9,765,625 (6)
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [[AX [[p3<=0 | p7<=0]] | AF [[[[EX [1<=p0] & 1<=p2] & [2<=p1 & 1<=p3]] & [[1<=p5 & 3<=p1] & [1<=p3 & 1<=p4]]]]] & [AX [[EG [[p2<=0 & [1<=p0 | [1<=p1 & [1<=p3 & 1<=p6]]]]] & AX [[2<=p1 & [1<=p3 & 1<=p5]]]]] | AF [[A [~ [AF [[3<=p1 & [1<=p3 & 1<=p4]]]] U [[1<=p1 & [1<=p3 & 1<=p6]] | [3<=p1 & [1<=p3 & 1<=p4]]]] | 1<=p2]]]]
normalized: [[~ [EG [~ [[[~ [EG [~ [[[[1<=p3 & 1<=p4] & 3<=p1] | [[1<=p3 & 1<=p6] & 1<=p1]]]]] & ~ [E [~ [[[[1<=p3 & 1<=p4] & 3<=p1] | [[1<=p3 & 1<=p6] & 1<=p1]]] U [~ [EG [~ [[[1<=p3 & 1<=p4] & 3<=p1]]]] & ~ [[[[1<=p3 & 1<=p4] & 3<=p1] | [[1<=p3 & 1<=p6] & 1<=p1]]]]]]] | 1<=p2]]]] | ~ [EX [~ [[~ [EX [~ [[[1<=p3 & 1<=p5] & 2<=p1]]]] & EG [[[[[1<=p3 & 1<=p6] & 1<=p1] | 1<=p0] & p2<=0]]]]]]] & [~ [EG [~ [[[[1<=p3 & 1<=p4] & [1<=p5 & 3<=p1]] & [[2<=p1 & 1<=p3] & [EX [1<=p0] & 1<=p2]]]]]] | ~ [EX [~ [[p3<=0 | p7<=0]]]]]]
abstracting: (p7<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
.abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p0)
states: 234,375,000 (8)
.abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.....................................................................................................................
EG iterations: 117
abstracting: (p2<=0)
states: 9,765,625 (6)
abstracting: (1<=p0)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
..........................................................................................................................
EG iterations: 122
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
..abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
......................................................................................................................
EG iterations: 118
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
........................................................................................................................
EG iterations: 120
..................................................................................................
EG iterations: 98
-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.296sec
checking: AX [[E [[EX [A [[2<=p1 & [1<=p3 & 1<=p5]] U [[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]]] & EG [EX [~ [[p3<=0 | p7<=0]]]]] U ~ [[EG [[1<=p1 & [1<=p3 & 1<=p6]]] | [2<=p1 & [1<=p3 & 1<=p5]]]]] | [AF [[1<=p3 & 1<=p7]] & [A [[[1<=p1 & [1<=p3 & 1<=p6]] | ~ [[2<=p1 & [1<=p3 & 1<=p5]]]] U E [[1<=p1 & [1<=p3 & 1<=p6]] U [3<=p1 & [1<=p4 & 1<=p3]]]] & EF [[[1<=p8 | [1<=p9 | 1<=p10]] | [1<=p11 | [[[2<=p1 & [1<=p3 & 1<=p5]] & [1<=p1 & [1<=p3 & 1<=p6]]] | 1<=p2]]]]]]]]
normalized: ~ [EX [~ [[[[E [true U [[[[[[1<=p3 & 1<=p5] & 2<=p1] & [[1<=p3 & 1<=p6] & 1<=p1]] | 1<=p2] | 1<=p11] | [[1<=p9 | 1<=p10] | 1<=p8]]] & [~ [EG [~ [E [[[1<=p3 & 1<=p6] & 1<=p1] U [[1<=p4 & 1<=p3] & 3<=p1]]]]] & ~ [E [~ [E [[[1<=p3 & 1<=p6] & 1<=p1] U [[1<=p4 & 1<=p3] & 3<=p1]]] U [~ [[~ [[[1<=p3 & 1<=p5] & 2<=p1]] | [[1<=p3 & 1<=p6] & 1<=p1]]] & ~ [E [[[1<=p3 & 1<=p6] & 1<=p1] U [[1<=p4 & 1<=p3] & 3<=p1]]]]]]]] & ~ [EG [~ [[1<=p3 & 1<=p7]]]]] | E [[EG [EX [~ [[p3<=0 | p7<=0]]]] & EX [[~ [EG [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]] & ~ [E [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]] U [~ [[[1<=p3 & 1<=p5] & 2<=p1]] & ~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]]]]] U ~ [[[[1<=p3 & 1<=p5] & 2<=p1] | EG [[[1<=p3 & 1<=p6] & 1<=p1]]]]]]]]]
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.
EG iterations: 1
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
..................................................
EG iterations: 50
.abstracting: (p7<=0)
states: 9,765,625 (6)
abstracting: (p3<=0)
states: 9,765,625 (6)
..
EG iterations: 1
abstracting: (1<=p7)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.........................................................................................................................
EG iterations: 121
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
........................................................................................................................
EG iterations: 120
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: [EX [AG [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]]] & [AX [EF [[[p8<=0 & p9<=0] & [p10<=0 & p11<=0]]]] | [E [[[[A [[1<=p1 & [1<=p3 & 1<=p6]] U 1<=p2] | A [[[3<=p1 & 1<=p3] & [1<=p4 & 1<=p0]] U E [[1<=p1 & [1<=p3 & 1<=p6]] U 1<=p2]]] | [[[3<=p1 & [1<=p3 & 1<=p4]] & [2<=p1 & [1<=p3 & 1<=p5]]] | [3<=p1 & [1<=p3 & 1<=p4]]]] | [[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]] U [[[AF [1<=p2] | [AX [[2<=p1 & [1<=p3 & 1<=p5]]] & 1<=p0]] & 3<=p1] & [1<=p3 & 1<=p4]]] & EF [[EX [AG [[1<=p3 & 1<=p7]]] | [3<=p1 & [1<=p3 & 1<=p4]]]]]]]
normalized: [[[E [[[[[~ [EG [~ [E [[[1<=p3 & 1<=p6] & 1<=p1] U 1<=p2]]]] & ~ [E [~ [E [[[1<=p3 & 1<=p6] & 1<=p1] U 1<=p2]] U [~ [[[1<=p4 & 1<=p0] & [3<=p1 & 1<=p3]]] & ~ [E [[[1<=p3 & 1<=p6] & 1<=p1] U 1<=p2]]]]]] | [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [[[1<=p3 & 1<=p6] & 1<=p1]] & ~ [1<=p2]]]]]] | [[[1<=p3 & 1<=p4] & 3<=p1] | [[[1<=p3 & 1<=p5] & 2<=p1] & [[1<=p3 & 1<=p4] & 3<=p1]]]] | [[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]] U [[1<=p3 & 1<=p4] & [[[~ [EX [~ [[[1<=p3 & 1<=p5] & 2<=p1]]]] & 1<=p0] | ~ [EG [~ [1<=p2]]]] & 3<=p1]]] & E [true U [[[1<=p3 & 1<=p4] & 3<=p1] | EX [~ [E [true U ~ [[1<=p3 & 1<=p7]]]]]]]] | ~ [EX [~ [E [true U [[p10<=0 & p11<=0] & [p8<=0 & p9<=0]]]]]]] & EX [~ [E [true U ~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]]]
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
.abstracting: (p9<=0)
states: 9,765,625 (6)
abstracting: (p8<=0)
states: 9,765,625 (6)
abstracting: (p11<=0)
states: 9,765,625 (6)
abstracting: (p10<=0)
states: 9,765,625 (6)
.abstracting: (1<=p7)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p2)
states: 234,375,000 (8)
..........................................................................................................................
EG iterations: 122
abstracting: (1<=p0)
states: 234,375,000 (8)
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
.abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p9)
states: 234,375,000 (8)
abstracting: (1<=p8)
states: 234,375,000 (8)
abstracting: (1<=p11)
states: 234,375,000 (8)
abstracting: (1<=p10)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (2<=p1)
states: 224,609,375 (8)
abstracting: (1<=p5)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p2)
states: 234,375,000 (8)
..........................................................................................................................
EG iterations: 122
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (3<=p1)
states: 214,843,750 (8)
abstracting: (1<=p0)
states: 234,375,000 (8)
abstracting: (1<=p4)
states: 234,375,000 (8)
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
abstracting: (1<=p2)
states: 234,375,000 (8)
abstracting: (1<=p1)
states: 234,375,000 (8)
abstracting: (1<=p6)
states: 234,375,000 (8)
abstracting: (1<=p3)
states: 234,375,000 (8)
..................................................................................................
EG iterations: 98
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-24-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
totally nodes used: 323627 (3.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 710528 519244 1229772
used/not used/entry size/cache size: 741073 66367791 16 1024MB
basic ops cache: hits/miss/sum: 382636 212884 595520
used/not used/entry size/cache size: 447224 16329992 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: 2352 1952 4304
used/not used/entry size/cache size: 1952 8386656 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 66794925
1 312574
2 905
3 151
4 65
5 5
6 4
7 1
8 2
9 0
>= 10 232
Total processing time: 0m 5.494sec
BK_STOP 1678998263159
--------------------
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:1002 (100), effective:368 (36)
initing FirstDep: 0m 0.000sec
iterations count:13 (1), effective:2 (0)
iterations count:14 (1), effective:2 (0)
iterations count:81 (8), effective:47 (4)
iterations count:58 (5), effective:24 (2)
iterations count:14 (1), effective:3 (0)
iterations count:13 (1), effective:2 (0)
iterations count:13 (1), effective:2 (0)
iterations count:10 (1), effective:0 (0)
iterations count:56 (5), effective:23 (2)
iterations count:19 (1), effective:5 (0)
iterations count:16 (1), effective:3 (0)
iterations count:13 (1), effective:2 (0)
iterations count:13 (1), effective:2 (0)
iterations count:95 (9), effective:53 (5)
iterations count:10 (1), effective:0 (0)
iterations count:82 (8), effective:48 (4)
iterations count:15 (1), effective:3 (0)
iterations count:15 (1), effective:3 (0)
iterations count:18 (1), effective:4 (0)
iterations count:15 (1), effective:3 (0)
iterations count:12 (1), effective:1 (0)
iterations count:154 (15), effective:96 (9)
iterations count:154 (15), effective:96 (9)
iterations count:58 (5), effective:24 (2)
iterations count:19 (1), effective:5 (0)
iterations count:10 (1), effective:0 (0)
iterations count:13 (1), effective:2 (0)
iterations count:13 (1), effective:2 (0)
iterations count:52 (5), effective:21 (2)
iterations count:13 (1), effective:2 (0)
iterations count:19 (1), effective:5 (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-COL-24"
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-24, 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-167819421200594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-24.tgz
mv DrinkVendingMachine-COL-24 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 '
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 ;