About the Execution of Marcie+red for DrinkVendingMachine-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.855 | 17653.00 | 23254.00 | 1324.40 | FFTTFTFFTTTTFFFF | 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-167819421300626.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421300626
=====================================================================
--------------------
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-CTLFireability-00
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-01
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-02
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-03
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-04
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-05
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-06
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-07
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-08
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-09
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-10
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-11
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-12
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-13
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-14
FORMULA_NAME DrinkVendingMachine-PT-02-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679013522629
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-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 00:38:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 00:38:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 00:38:46] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-17 00:38:46] [INFO ] Transformed 24 places.
[2023-03-17 00:38:46] [INFO ] Transformed 72 transitions.
[2023-03-17 00:38:46] [INFO ] Parsed PT model containing 24 places and 72 transitions and 440 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Initial state reduction rules removed 3 formulas.
[2023-03-17 00:38:46] [INFO ] Reduced 4 identical enabling conditions.
[2023-03-17 00:38:46] [INFO ] Reduced 16 identical enabling conditions.
[2023-03-17 00:38:46] [INFO ] Reduced 4 identical enabling conditions.
[2023-03-17 00:38:46] [INFO ] Reduced 4 identical enabling conditions.
[2023-03-17 00:38:46] [INFO ] Reduced 16 identical enabling conditions.
[2023-03-17 00:38:46] [INFO ] Reduced 4 identical enabling conditions.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA DrinkVendingMachine-PT-02-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 21 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 24 cols
[2023-03-17 00:38:46] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-17 00:38:46] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 24 transitions.
Found 24 dead transitions using SMT.
Drop transitions removed 24 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 24 transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-03-17 00:38:46] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-17 00:38:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-17 00:38:46] [INFO ] Invariant cache hit.
[2023-03-17 00:38:46] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/24 places, 28/52 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 26/28 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 24/24 places, 26/52 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 20 out of 20 places after structural reductions.
[2023-03-17 00:38:47] [INFO ] Flatten gal took : 38 ms
[2023-03-17 00:38:47] [INFO ] Flatten gal took : 24 ms
[2023-03-17 00:38:47] [INFO ] Input system was already deterministic with 26 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 755 ms. (steps per millisecond=13 ) properties (out of 34) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 26 rows 20 cols
[2023-03-17 00:38:48] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-17 00:38:49] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2023-03-17 00:38:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-17 00:38:49] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 14 atomic propositions for a total of 13 simplifications.
[2023-03-17 00:38:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 13 ms
[2023-03-17 00:38:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DrinkVendingMachine-PT-02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 11 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 12 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 12 transition count 16
Applied a total of 18 rules in 13 ms. Remains 12 /20 variables (removed 8) and now considering 16/26 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 12/20 places, 16/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 4 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 4 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 7 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 8 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 15 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 7 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 5 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 5 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 12 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 12 transition count 18
Applied a total of 16 rules in 6 ms. Remains 12 /20 variables (removed 8) and now considering 18/26 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 12/20 places, 18/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 3 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 3 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
FORMULA DrinkVendingMachine-PT-02-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 5 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 6 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 26/26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 5 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 5 ms
[2023-03-17 00:38:49] [INFO ] Input system was already deterministic with 26 transitions.
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 9 ms
[2023-03-17 00:38:49] [INFO ] Flatten gal took : 9 ms
[2023-03-17 00:38:49] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-17 00:38:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 26 transitions and 116 arcs took 1 ms.
Total runtime 3767 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: 20 NrTr: 26 NrArc: 116)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.847sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 30 (3.0e+01) #states 1,024 (3)
starting MCC model checker
--------------------------
checking: EF [AX [1<=0]]
normalized: E [true U ~ [EX [~ [1<=0]]]]
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.035sec
checking: AF [EG [AX [1<=0]]]
normalized: ~ [EG [~ [EG [~ [EX [~ [1<=0]]]]]]]
abstracting: (1<=0)
states: 0
..
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [EX [1<=p19]]
normalized: E [true U EX [1<=p19]]
abstracting: (1<=p19)
states: 512
.-> the formula is TRUE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [AF [[[p4<=0 | p7<=0] | [p8<=0 | p9<=0]]]]
normalized: EX [~ [EG [~ [[[p8<=0 | p9<=0] | [p4<=0 | p7<=0]]]]]]
abstracting: (p7<=0)
states: 512
abstracting: (p4<=0)
states: 512
abstracting: (p9<=0)
states: 512
abstracting: (p8<=0)
states: 512
.
EG iterations: 1
.-> the formula is TRUE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AX [1<=0] | [EX [AF [AX [[[p4<=0 | p6<=0] | [p8<=0 | p9<=0]]]]] | ~ [E [[~ [AG [~ [[[p4<=0 | p6<=0] | [p8<=0 | p9<=0]]]]] & 1<=p11] U [AX [AX [1<=0]] & AX [1<=0]]]]]]
normalized: [~ [EX [~ [1<=0]]] | [EX [~ [EG [EX [~ [[[p8<=0 | p9<=0] | [p4<=0 | p6<=0]]]]]]] | ~ [E [[E [true U [[p8<=0 | p9<=0] | [p4<=0 | p6<=0]]] & 1<=p11] U [~ [EX [EX [~ [1<=0]]]] & ~ [EX [~ [1<=0]]]]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (1<=0)
states: 0
..abstracting: (1<=p11)
states: 512
abstracting: (p6<=0)
states: 512
abstracting: (p4<=0)
states: 512
abstracting: (p9<=0)
states: 512
abstracting: (p8<=0)
states: 512
abstracting: (p6<=0)
states: 512
abstracting: (p4<=0)
states: 512
abstracting: (p9<=0)
states: 512
abstracting: (p8<=0)
states: 512
..
EG iterations: 1
.abstracting: (1<=0)
states: 0
.-> the formula is TRUE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [EF [[[[1<=p1 & 1<=p7] | [1<=p1 & 1<=p6]] | [[1<=p0 & 1<=p7] | [1<=p0 & 1<=p6]]]] U EF [~ [AG [EF [[1<=p17 | 1<=p19]]]]]]
normalized: [~ [EG [~ [E [true U E [true U ~ [E [true U [1<=p17 | 1<=p19]]]]]]]] & ~ [E [~ [E [true U E [true U ~ [E [true U [1<=p17 | 1<=p19]]]]]] U [~ [E [true U [[[1<=p1 & 1<=p7] | [1<=p1 & 1<=p6]] | [[1<=p0 & 1<=p6] | [1<=p0 & 1<=p7]]]]] & ~ [E [true U E [true U ~ [E [true U [1<=p17 | 1<=p19]]]]]]]]]]
abstracting: (1<=p19)
states: 512
abstracting: (1<=p17)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p0)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p0)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p1)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p1)
states: 512
abstracting: (1<=p19)
states: 512
abstracting: (1<=p17)
states: 512
abstracting: (1<=p19)
states: 512
abstracting: (1<=p17)
states: 512
EG iterations: 0
-> the formula is FALSE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AF [AG [AX [[[[[[p7<=0 | [p8<=0 | p9<=1]] & [p7<=0 | [p8<=1 | p9<=0]]] & [[p7<=0 | p9<=2] & [[p7<=0 | [p8<=1 | p9<=0]] & [p6<=0 | p8<=2]]]] & [[[p6<=0 | p9<=2] & [p7<=0 | p8<=2]] & [[p7<=0 | p9<=2] & [[p7<=0 | p8<=2] & [p6<=0 | p8<=2]]]]] & [[[[p6<=0 | [p8<=1 | p9<=0]] & [p6<=0 | [p8<=0 | p9<=1]]] & [[p6<=0 | p9<=2] & [[p7<=0 | [p8<=0 | p9<=1]] & [p6<=0 | [p8<=1 | p9<=0]]]]] & [[[p6<=0 | [p8<=0 | p9<=1]] & [p1<=0 | p7<=0]] & [[p1<=0 | p6<=0] & [[p0<=0 | p7<=0] & [p0<=0 | p6<=0]]]]]]]]]
normalized: ~ [EG [E [true U EX [~ [[[[[[[p0<=0 | p6<=0] & [p0<=0 | p7<=0]] & [p1<=0 | p6<=0]] & [[p1<=0 | p7<=0] & [[p8<=0 | p9<=1] | p6<=0]]] & [[[[[p8<=1 | p9<=0] | p6<=0] & [[p8<=0 | p9<=1] | p7<=0]] & [p6<=0 | p9<=2]] & [[[p8<=0 | p9<=1] | p6<=0] & [[p8<=1 | p9<=0] | p6<=0]]]] & [[[[[p6<=0 | p8<=2] & [[p8<=1 | p9<=0] | p7<=0]] & [p7<=0 | p9<=2]] & [[[p8<=1 | p9<=0] | p7<=0] & [[p8<=0 | p9<=1] | p7<=0]]] & [[[[p6<=0 | p8<=2] & [p7<=0 | p8<=2]] & [p7<=0 | p9<=2]] & [[p7<=0 | p8<=2] & [p6<=0 | p9<=2]]]]]]]]]]
abstracting: (p9<=2)
states: 1,024 (3)
abstracting: (p6<=0)
states: 512
abstracting: (p8<=2)
states: 1,024 (3)
abstracting: (p7<=0)
states: 512
abstracting: (p9<=2)
states: 1,024 (3)
abstracting: (p7<=0)
states: 512
abstracting: (p8<=2)
states: 1,024 (3)
abstracting: (p7<=0)
states: 512
abstracting: (p8<=2)
states: 1,024 (3)
abstracting: (p6<=0)
states: 512
abstracting: (p7<=0)
states: 512
abstracting: (p9<=1)
states: 1,024 (3)
abstracting: (p8<=0)
states: 512
abstracting: (p7<=0)
states: 512
abstracting: (p9<=0)
states: 512
abstracting: (p8<=1)
states: 1,024 (3)
abstracting: (p9<=2)
states: 1,024 (3)
abstracting: (p7<=0)
states: 512
abstracting: (p7<=0)
states: 512
abstracting: (p9<=0)
states: 512
abstracting: (p8<=1)
states: 1,024 (3)
abstracting: (p8<=2)
states: 1,024 (3)
abstracting: (p6<=0)
states: 512
abstracting: (p6<=0)
states: 512
abstracting: (p9<=0)
states: 512
abstracting: (p8<=1)
states: 1,024 (3)
abstracting: (p6<=0)
states: 512
abstracting: (p9<=1)
states: 1,024 (3)
abstracting: (p8<=0)
states: 512
abstracting: (p9<=2)
states: 1,024 (3)
abstracting: (p6<=0)
states: 512
abstracting: (p7<=0)
states: 512
abstracting: (p9<=1)
states: 1,024 (3)
abstracting: (p8<=0)
states: 512
abstracting: (p6<=0)
states: 512
abstracting: (p9<=0)
states: 512
abstracting: (p8<=1)
states: 1,024 (3)
abstracting: (p6<=0)
states: 512
abstracting: (p9<=1)
states: 1,024 (3)
abstracting: (p8<=0)
states: 512
abstracting: (p7<=0)
states: 512
abstracting: (p1<=0)
states: 512
abstracting: (p6<=0)
states: 512
abstracting: (p1<=0)
states: 512
abstracting: (p7<=0)
states: 512
abstracting: (p0<=0)
states: 512
abstracting: (p6<=0)
states: 512
abstracting: (p0<=0)
states: 512
.
EG iterations: 0
-> the formula is FALSE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[AF [[EX [[[[[[1<=p5 & [1<=p6 & 2<=p8]] | [[[1<=p4 & 1<=p6] & [1<=p8 & 1<=p9]] | [1<=p5 & [1<=p6 & 2<=p9]]]] | [[1<=p5 & [1<=p7 & 2<=p8]] | [[[1<=p4 & 1<=p7] & [1<=p8 & 1<=p9]] | [1<=p4 & [1<=p6 & 2<=p8]]]]] | [[[1<=p4 & [1<=p6 & 2<=p9]] | [[[1<=p5 & 1<=p6] & [1<=p8 & 1<=p9]] | [1<=p4 & [1<=p7 & 2<=p8]]]] | [[[1<=p5 & 1<=p7] & [1<=p8 & 1<=p9]] | [[1<=p4 & [1<=p7 & 2<=p9]] | [1<=p5 & [1<=p7 & 2<=p9]]]]]] & [[1<=p14 | [1<=p15 | 1<=p10]] | [1<=p11 | [1<=p12 | 1<=p13]]]]] & [p16<=0 & p18<=0]]] | [1<=p16 | 1<=p18]]]
normalized: ~ [E [true U ~ [[[1<=p16 | 1<=p18] | ~ [EG [~ [[[p16<=0 & p18<=0] & EX [[[[[1<=p12 | 1<=p13] | 1<=p11] | [[1<=p15 | 1<=p10] | 1<=p14]] & [[[[[1<=p8 & 1<=p9] & [1<=p5 & 1<=p7]] | [[[1<=p7 & 2<=p9] & 1<=p5] | [[1<=p7 & 2<=p9] & 1<=p4]]] | [[[[1<=p7 & 2<=p8] & 1<=p4] | [[1<=p8 & 1<=p9] & [1<=p5 & 1<=p6]]] | [[1<=p6 & 2<=p9] & 1<=p4]]] | [[[[1<=p7 & 2<=p8] & 1<=p5] | [[[1<=p6 & 2<=p8] & 1<=p4] | [[1<=p8 & 1<=p9] & [1<=p4 & 1<=p7]]]] | [[[[1<=p6 & 2<=p9] & 1<=p5] | [[1<=p8 & 1<=p9] & [1<=p4 & 1<=p6]]] | [[1<=p6 & 2<=p8] & 1<=p5]]]]]]]]]]]]]]
abstracting: (1<=p5)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p14)
states: 512
abstracting: (1<=p10)
states: 512
abstracting: (1<=p15)
states: 512
abstracting: (1<=p11)
states: 512
abstracting: (1<=p13)
states: 512
abstracting: (1<=p12)
states: 512
.abstracting: (p18<=0)
states: 512
abstracting: (p16<=0)
states: 512
.
EG iterations: 1
abstracting: (1<=p18)
states: 512
abstracting: (1<=p16)
states: 512
-> the formula is FALSE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [EX [0<=0] | AX [AX [AX [~ [A [[[[[1<=p5 & [1<=p6 & 2<=p8]] | [[[1<=p4 & 1<=p6] & [1<=p8 & 1<=p9]] | [1<=p5 & [1<=p6 & 2<=p9]]]] | [[1<=p5 & [1<=p7 & 2<=p8]] | [[[1<=p4 & 1<=p7] & [1<=p8 & 1<=p9]] | [1<=p4 & [1<=p6 & 2<=p8]]]]] | [[[1<=p4 & [1<=p6 & 2<=p9]] | [[[1<=p5 & 1<=p6] & [1<=p8 & 1<=p9]] | [1<=p4 & [1<=p7 & 2<=p8]]]] | [[[1<=p5 & 1<=p7] & [1<=p8 & 1<=p9]] | [[1<=p4 & [1<=p7 & 2<=p9]] | [1<=p5 & [1<=p7 & 2<=p9]]]]]] U [[[[1<=p2 & [1<=p7 & 1<=p8]] | [1<=p2 & [1<=p6 & 1<=p9]]] | [[1<=p2 & [1<=p6 & 1<=p8]] | [1<=p2 & [1<=p7 & 1<=p9]]]] | [[[1<=p3 & [1<=p6 & 1<=p9]] | [1<=p3 & [1<=p7 & 1<=p8]]] | [[1<=p3 & [1<=p6 & 1<=p8]] | [1<=p3 & [1<=p7 & 1<=p9]]]]]]]]]]]
normalized: [~ [EX [EX [EX [[~ [EG [~ [[[[[[1<=p7 & 1<=p9] & 1<=p3] | [[1<=p6 & 1<=p8] & 1<=p3]] | [[[1<=p7 & 1<=p8] & 1<=p3] | [[1<=p6 & 1<=p9] & 1<=p3]]] | [[[[1<=p7 & 1<=p9] & 1<=p2] | [[1<=p6 & 1<=p8] & 1<=p2]] | [[[1<=p6 & 1<=p9] & 1<=p2] | [[1<=p7 & 1<=p8] & 1<=p2]]]]]]] & ~ [E [~ [[[[[[1<=p7 & 1<=p9] & 1<=p3] | [[1<=p6 & 1<=p8] & 1<=p3]] | [[[1<=p7 & 1<=p8] & 1<=p3] | [[1<=p6 & 1<=p9] & 1<=p3]]] | [[[[1<=p7 & 1<=p9] & 1<=p2] | [[1<=p6 & 1<=p8] & 1<=p2]] | [[[1<=p6 & 1<=p9] & 1<=p2] | [[1<=p7 & 1<=p8] & 1<=p2]]]]] U [~ [[[[[[1<=p6 & 2<=p9] & 1<=p4] | [[[1<=p7 & 2<=p8] & 1<=p4] | [[1<=p8 & 1<=p9] & [1<=p5 & 1<=p6]]]] | [[[[1<=p7 & 2<=p9] & 1<=p5] | [[1<=p7 & 2<=p9] & 1<=p4]] | [[1<=p8 & 1<=p9] & [1<=p5 & 1<=p7]]]] | [[[[[1<=p6 & 2<=p8] & 1<=p4] | [[1<=p8 & 1<=p9] & [1<=p4 & 1<=p7]]] | [[1<=p7 & 2<=p8] & 1<=p5]] | [[[[1<=p6 & 2<=p9] & 1<=p5] | [[1<=p8 & 1<=p9] & [1<=p4 & 1<=p6]]] | [[1<=p6 & 2<=p8] & 1<=p5]]]]] & ~ [[[[[[1<=p7 & 1<=p9] & 1<=p3] | [[1<=p6 & 1<=p8] & 1<=p3]] | [[[1<=p7 & 1<=p8] & 1<=p3] | [[1<=p6 & 1<=p9] & 1<=p3]]] | [[[[1<=p7 & 1<=p9] & 1<=p2] | [[1<=p6 & 1<=p8] & 1<=p2]] | [[[1<=p6 & 1<=p9] & 1<=p2] | [[1<=p7 & 1<=p8] & 1<=p2]]]]]]]]]]]]] | EX [0<=0]]
abstracting: (0<=0)
states: 1,024 (3)
.abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
........
EG iterations: 8
...-> the formula is TRUE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AX [AX [[AG [EX [[1<=p16 | 1<=p18]]] & AF [[[[[[[[[1<=p5 & [1<=p6 & 2<=p8]] | [[[1<=p4 & 1<=p6] & [1<=p8 & 1<=p9]] | [1<=p5 & [1<=p6 & 2<=p9]]]] | [[1<=p5 & [1<=p7 & 2<=p8]] | [[[1<=p4 & 1<=p7] & [1<=p8 & 1<=p9]] | [1<=p4 & [1<=p6 & 2<=p8]]]]] | [[[1<=p4 & [1<=p6 & 2<=p9]] | [[[1<=p5 & 1<=p6] & [1<=p8 & 1<=p9]] | [1<=p4 & [1<=p7 & 2<=p8]]]] | [[[1<=p5 & 1<=p7] & [1<=p8 & 1<=p9]] | [[1<=p4 & [1<=p7 & 2<=p9]] | [1<=p5 & [1<=p7 & 2<=p9]]]]]] & [[[[1<=p2 & [1<=p7 & 1<=p8]] | [1<=p2 & [1<=p6 & 1<=p9]]] | [[1<=p2 & [1<=p6 & 1<=p8]] | [1<=p2 & [1<=p7 & 1<=p9]]]] | [[[1<=p3 & [1<=p6 & 1<=p9]] | [1<=p3 & [1<=p7 & 1<=p8]]] | [[1<=p3 & [1<=p6 & 1<=p8]] | [1<=p3 & [1<=p7 & 1<=p9]]]]]] | [1<=p2 & [1<=p7 & 1<=p8]]] | [[1<=p2 & [1<=p6 & 1<=p9]] | [[1<=p2 & [1<=p6 & 1<=p8]] | [1<=p2 & [1<=p7 & 1<=p9]]]]] | [[[1<=p3 & [1<=p6 & 1<=p9]] | [[1<=p3 & [1<=p7 & 1<=p8]] | [1<=p3 & [1<=p6 & 1<=p8]]]] | [[1<=p3 & [1<=p7 & 1<=p9]] | [1<=p16 | 1<=p18]]]]]]]]
normalized: ~ [EX [EX [~ [[~ [EG [~ [[[[[[1<=p6 & 1<=p9] & 1<=p3] | [[[1<=p6 & 1<=p8] & 1<=p3] | [[1<=p7 & 1<=p8] & 1<=p3]]] | [[1<=p16 | 1<=p18] | [[1<=p7 & 1<=p9] & 1<=p3]]] | [[[[[1<=p7 & 1<=p9] & 1<=p2] | [[1<=p6 & 1<=p8] & 1<=p2]] | [[1<=p6 & 1<=p9] & 1<=p2]] | [[[1<=p7 & 1<=p8] & 1<=p2] | [[[[[[1<=p7 & 1<=p9] & 1<=p3] | [[1<=p6 & 1<=p8] & 1<=p3]] | [[[1<=p7 & 1<=p8] & 1<=p3] | [[1<=p6 & 1<=p9] & 1<=p3]]] | [[[[1<=p7 & 1<=p9] & 1<=p2] | [[1<=p6 & 1<=p8] & 1<=p2]] | [[[1<=p6 & 1<=p9] & 1<=p2] | [[1<=p7 & 1<=p8] & 1<=p2]]]] & [[[[[[1<=p7 & 2<=p9] & 1<=p5] | [[1<=p7 & 2<=p9] & 1<=p4]] | [[1<=p8 & 1<=p9] & [1<=p5 & 1<=p7]]] | [[[[1<=p7 & 2<=p8] & 1<=p4] | [[1<=p8 & 1<=p9] & [1<=p5 & 1<=p6]]] | [[1<=p6 & 2<=p9] & 1<=p4]]] | [[[[[1<=p6 & 2<=p8] & 1<=p4] | [[1<=p8 & 1<=p9] & [1<=p4 & 1<=p7]]] | [[1<=p7 & 2<=p8] & 1<=p5]] | [[[[1<=p6 & 2<=p9] & 1<=p5] | [[1<=p8 & 1<=p9] & [1<=p4 & 1<=p6]]] | [[1<=p6 & 2<=p8] & 1<=p5]]]]]]]]]]] & ~ [E [true U ~ [EX [[1<=p16 | 1<=p18]]]]]]]]]]
abstracting: (1<=p18)
states: 512
abstracting: (1<=p16)
states: 512
.abstracting: (1<=p5)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p6)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p8)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p4)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p5)
states: 512
abstracting: (2<=p9)
states: 0
abstracting: (1<=p7)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p2)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p18)
states: 512
abstracting: (1<=p16)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p7)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p8)
states: 512
abstracting: (1<=p6)
states: 512
abstracting: (1<=p3)
states: 512
abstracting: (1<=p9)
states: 512
abstracting: (1<=p6)
states: 512
........
EG iterations: 8
..-> the formula is FALSE
FORMULA DrinkVendingMachine-PT-02-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
totally nodes used: 7400 (7.4e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5426 19002 24428
used/not used/entry size/cache size: 23871 67084993 16 1024MB
basic ops cache: hits/miss/sum: 2193 5699 7892
used/not used/entry size/cache size: 11388 16765828 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: 406 320 726
used/not used/entry size/cache size: 320 8388288 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 67101478
1 7374
2 10
3 2
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.616sec
BK_STOP 1679013540282
--------------------
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:148 (5), effective:25 (0)
initing FirstDep: 0m 0.000sec
iterations count:29 (1), effective:2 (0)
iterations count:29 (1), effective:2 (0)
iterations count:35 (1), effective:3 (0)
iterations count:29 (1), effective:2 (0)
iterations count:35 (1), effective:3 (0)
iterations count:35 (1), effective:3 (0)
iterations count:27 (1), effective:1 (0)
iterations count:60 (2), effective:11 (0)
iterations count:39 (1), effective:4 (0)
iterations count:67 (2), effective:13 (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="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-PT-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-167819421300626"
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 [ "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 ;