Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978400017.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-002A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978400017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.1K Feb 26 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:23 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 ShieldRVs-PT-002A-CTLCardinality-00
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-01
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-02
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-03
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-04
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-05
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-06
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-07
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-08
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-09
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-10
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-11
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-12
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-13
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-14
FORMULA_NAME ShieldRVs-PT-002A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679338351065

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:32] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-20 18:52:32] [INFO ] Transformed 31 places.
[2023-03-20 18:52:32] [INFO ] Transformed 41 transitions.
[2023-03-20 18:52:32] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:32] [INFO ] Parsed PT model containing 31 places and 41 transitions and 184 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 11 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2023-03-20 18:52:33] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-20 18:52:33] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:33] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:35] [INFO ] Dead Transitions using invariants and state equation in 2115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2488 ms. Remains : 31/31 places, 41/41 transitions.
Support contains 31 out of 31 places after structural reductions.
[2023-03-20 18:52:35] [INFO ] Flatten gal took : 39 ms
[2023-03-20 18:52:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-002A-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:52:35] [INFO ] Flatten gal took : 8 ms
[2023-03-20 18:52:35] [INFO ] Input system was already deterministic with 41 transitions.
Incomplete random walk after 10000 steps, including 255 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 57) seen :56
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 18:52:36] [INFO ] Invariant cache hit.
[2023-03-20 18:52:36] [INFO ] [Real]Absence check using 9 positive place invariants in 91 ms returned sat
[2023-03-20 18:52:36] [INFO ] After 350ms 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 15 simplifications.
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 33 ms
[2023-03-20 18:52:36] [INFO ] Input system was already deterministic with 41 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 39
Applied a total of 2 rules in 27 ms. Remains 29 /31 variables (removed 2) and now considering 39/41 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 29/31 places, 39/41 transitions.
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 25 ms
[2023-03-20 18:52:36] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:36] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:36] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 17 ms
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:36] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 39
Applied a total of 2 rules in 5 ms. Remains 29 /31 variables (removed 2) and now considering 39/41 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 29/31 places, 39/41 transitions.
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:36] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 40
Applied a total of 2 rules in 4 ms. Remains 30 /31 variables (removed 1) and now considering 40/41 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 30/31 places, 40/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 16 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:37] [INFO ] Input system was already deterministic with 41 transitions.
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:37] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:37] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 16 ms.
[2023-03-20 18:52:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 41 transitions and 184 arcs took 1 ms.
Total runtime 4676 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 31 NrTr: 41 NrArc: 184)

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

net check time: 0m 0.000sec

init dd package: 0m 3.526sec


RS generation: 0m 0.020sec


-> reachability set: #nodes 441 (4.4e+02) #states 16,021 (4)



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

checking: EX [EF [AG [[[p23<=0 & 0<=p23] | [p14<=1 & 1<=p14]]]]]
normalized: EX [E [true U ~ [E [true U ~ [[[p23<=0 & 0<=p23] | [p14<=1 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
abstracting: (0<=p23)
states: 16,021 (4)
abstracting: (p23<=0)
states: 11,257 (4)
.-> the formula is FALSE

FORMULA ShieldRVs-PT-002A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AX [AG [[EF [[p0<=0 & 0<=p0]] & EG [AF [[p2<=0 & 0<=p2]]]]]]
normalized: ~ [EX [E [true U ~ [[EG [~ [EG [~ [[p2<=0 & 0<=p2]]]]] & E [true U [p0<=0 & 0<=p0]]]]]]]

abstracting: (0<=p0)
states: 16,021 (4)
abstracting: (p0<=0)
states: 16,020 (4)
abstracting: (0<=p2)
states: 16,021 (4)
abstracting: (p2<=0)
states: 7,621 (3)
.....................
EG iterations: 21
................................
EG iterations: 32
.-> the formula is FALSE

FORMULA ShieldRVs-PT-002A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.105sec

checking: EF [AG [[~ [[p27<=0 & 0<=p27]] & ~ [[p14<=1 & 1<=p14]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [[p14<=1 & 1<=p14]] & ~ [[p27<=0 & 0<=p27]]]]]]]

abstracting: (0<=p27)
states: 16,021 (4)
abstracting: (p27<=0)
states: 11,094 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: [AF [[p24<=1 & 1<=p24]] | AG [[EF [[p15<=0 & 0<=p15]] | AF [EX [[p19<=0 & 0<=p19]]]]]]
normalized: [~ [E [true U ~ [[E [true U [p15<=0 & 0<=p15]] | ~ [EG [~ [EX [[p19<=0 & 0<=p19]]]]]]]]] | ~ [EG [~ [[p24<=1 & 1<=p24]]]]]

abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
.........................
EG iterations: 25
abstracting: (0<=p19)
states: 16,021 (4)
abstracting: (p19<=0)
states: 12,622 (4)
...
EG iterations: 2
abstracting: (0<=p15)
states: 16,021 (4)
abstracting: (p15<=0)
states: 12,731 (4)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: EF [AG [[EF [[[0<=p10 & p10<=0] & [p21<=1 & 1<=p21]]] | [[p15<=1 & 1<=p15] | [p29<=1 & 1<=p29]]]]]
normalized: E [true U ~ [E [true U ~ [[[[p29<=1 & 1<=p29] | [p15<=1 & 1<=p15]] | E [true U [[p21<=1 & 1<=p21] & [0<=p10 & p10<=0]]]]]]]]

abstracting: (p10<=0)
states: 12,781 (4)
abstracting: (0<=p10)
states: 16,021 (4)
abstracting: (1<=p21)
states: 8,468 (3)
abstracting: (p21<=1)
states: 16,021 (4)
abstracting: (1<=p15)
states: 3,290 (3)
abstracting: (p15<=1)
states: 16,021 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: AF [[AF [[p12<=1 & 1<=p12]] & [[p27<=0 & 0<=p27] & ~ [E [AF [[p29<=1 & 1<=p29]] U ~ [[p15<=1 & 1<=p15]]]]]]]
normalized: ~ [EG [~ [[[~ [E [~ [EG [~ [[p29<=1 & 1<=p29]]]] U ~ [[p15<=1 & 1<=p15]]]] & [p27<=0 & 0<=p27]] & ~ [EG [~ [[p12<=1 & 1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
............................
EG iterations: 28
abstracting: (0<=p27)
states: 16,021 (4)
abstracting: (p27<=0)
states: 11,094 (4)
abstracting: (1<=p15)
states: 3,290 (3)
abstracting: (p15<=1)
states: 16,021 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
....
EG iterations: 4
.....
EG iterations: 5
-> the formula is FALSE

FORMULA ShieldRVs-PT-002A-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: A [~ [[EG [~ [EF [[[p7<=0 & 0<=p7] | [p10<=1 & 1<=p10]]]]] | EX [EF [[p6<=1 & 1<=p6]]]]] U EG [[p26<=1 & 1<=p26]]]
normalized: [~ [EG [~ [EG [[p26<=1 & 1<=p26]]]]] & ~ [E [~ [EG [[p26<=1 & 1<=p26]]] U [[EX [E [true U [p6<=1 & 1<=p6]]] | EG [~ [E [true U [[p10<=1 & 1<=p10] | [p7<=0 & 0<=p7]]]]]] & ~ [EG [[p26<=1 & 1<=p26]]]]]]]

abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
...................................
EG iterations: 35
abstracting: (0<=p7)
states: 16,021 (4)
abstracting: (p7<=0)
states: 7,621 (3)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
.abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
...................................
EG iterations: 35
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
...................................
EG iterations: 35

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVs-PT-002A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.114sec

checking: [EG [[[p9<=0 & 0<=p9] & [~ [E [[[p9<=0 & 0<=p9] | [p4<=1 & 1<=p4]] U [[p29<=0 & 0<=p29] | [p8<=1 & 1<=p8]]]] & [EX [[[p4<=1 & 1<=p4] & [p24<=1 & 1<=p24]]] | [p8<=0 & 0<=p8]]]]] | EG [AF [[p9<=1 & 1<=p9]]]]
normalized: [EG [[[~ [E [[[p9<=0 & 0<=p9] | [p4<=1 & 1<=p4]] U [[p8<=1 & 1<=p8] | [p29<=0 & 0<=p29]]]] & [[p8<=0 & 0<=p8] | EX [[[p24<=1 & 1<=p24] & [p4<=1 & 1<=p4]]]]] & [p9<=0 & 0<=p9]]] | EG [~ [EG [~ [[p9<=1 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
................................
EG iterations: 32
.................
EG iterations: 17
abstracting: (0<=p9)
states: 16,021 (4)
abstracting: (p9<=0)
states: 10,789 (4)
abstracting: (1<=p4)
states: 3,272 (3)
abstracting: (p4<=1)
states: 16,021 (4)
abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
.abstracting: (0<=p8)
states: 16,021 (4)
abstracting: (p8<=0)
states: 8,401 (3)
abstracting: (0<=p29)
states: 16,021 (4)
abstracting: (p29<=0)
states: 12,552 (4)
abstracting: (1<=p8)
states: 7,620 (3)
abstracting: (p8<=1)
states: 16,021 (4)
abstracting: (1<=p4)
states: 3,272 (3)
abstracting: (p4<=1)
states: 16,021 (4)
abstracting: (0<=p9)
states: 16,021 (4)
abstracting: (p9<=0)
states: 10,789 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-002A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: [E [[[AF [[[[p30<=0 & 0<=p30] | [p19<=1 & 1<=p19]] | [[p28<=1 & 1<=p28] | [p22<=1 & 1<=p22]]]] | ~ [[[p21<=0 & 0<=p21] | [p23<=1 & 1<=p23]]]] | [[p30<=0 & 0<=p30] | [p8<=1 & 1<=p8]]] U [p4<=1 & 1<=p4]] | AF [AG [[~ [[p12<=0 & 0<=p12]] | AX [1<=0]]]]]
normalized: [~ [EG [E [true U ~ [[~ [EX [~ [1<=0]]] | ~ [[p12<=0 & 0<=p12]]]]]]] | E [[[[p8<=1 & 1<=p8] | [p30<=0 & 0<=p30]] | [~ [[[p23<=1 & 1<=p23] | [p21<=0 & 0<=p21]]] | ~ [EG [~ [[[[p22<=1 & 1<=p22] | [p28<=1 & 1<=p28]] | [[p19<=1 & 1<=p19] | [p30<=0 & 0<=p30]]]]]]]] U [p4<=1 & 1<=p4]]]

abstracting: (1<=p4)
states: 3,272 (3)
abstracting: (p4<=1)
states: 16,021 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
abstracting: (1<=p22)
states: 7,552 (3)
abstracting: (p22<=1)
states: 16,021 (4)
..................
EG iterations: 18
abstracting: (0<=p21)
states: 16,021 (4)
abstracting: (p21<=0)
states: 7,553 (3)
abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
abstracting: (1<=p8)
states: 7,620 (3)
abstracting: (p8<=1)
states: 16,021 (4)
abstracting: (0<=p12)
states: 16,021 (4)
abstracting: (p12<=0)
states: 11,763 (4)
abstracting: (1<=0)
states: 0
.................
EG iterations: 16
-> the formula is TRUE

FORMULA ShieldRVs-PT-002A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

checking: A [[~ [[[EF [[p14<=1 & 1<=p14]] | ~ [[[p24<=0 & 0<=p24] | [p19<=1 & 1<=p19]]]] & EX [0<=0]]] | [A [~ [AG [[[p0<=0 & 0<=p0] | [p14<=1 & 1<=p14]]]] U [EF [[[p13<=0 & 0<=p13] | [p17<=1 & 1<=p17]]] & [p12<=1 & 1<=p12]]] & [[p18<=1 & 1<=p18] | AX [EG [[p1<=0 & 0<=p1]]]]]] U EG [~ [[p23<=1 & 1<=p23]]]]
normalized: [~ [EG [~ [EG [~ [[p23<=1 & 1<=p23]]]]]] & ~ [E [~ [EG [~ [[p23<=1 & 1<=p23]]]] U [~ [[[[~ [EX [~ [EG [[p1<=0 & 0<=p1]]]]] | [p18<=1 & 1<=p18]] & [~ [EG [~ [[[p12<=1 & 1<=p12] & E [true U [[p17<=1 & 1<=p17] | [p13<=0 & 0<=p13]]]]]]] & ~ [E [~ [[[p12<=1 & 1<=p12] & E [true U [[p17<=1 & 1<=p17] | [p13<=0 & 0<=p13]]]]] U [~ [E [true U ~ [[[p14<=1 & 1<=p14] | [p0<=0 & 0<=p0]]]]] & ~ [[[p12<=1 & 1<=p12] & E [true U [[p17<=1 & 1<=p17] | [p13<=0 & 0<=p13]]]]]]]]]] | ~ [[EX [0<=0] & [~ [[[p19<=1 & 1<=p19] | [p24<=0 & 0<=p24]]] | E [true U [p14<=1 & 1<=p14]]]]]]] & ~ [EG [~ [[p23<=1 & 1<=p23]]]]]]]]

abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
.................................................
EG iterations: 49
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
abstracting: (0<=p24)
states: 16,021 (4)
abstracting: (p24<=0)
states: 12,397 (4)
abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
abstracting: (0<=0)
states: 16,021 (4)
.abstracting: (0<=p13)
states: 16,021 (4)
abstracting: (p13<=0)
states: 10,789 (4)
abstracting: (1<=p17)
states: 4,549 (3)
abstracting: (p17<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
abstracting: (0<=p0)
states: 16,021 (4)
abstracting: (p0<=0)
states: 16,020 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
abstracting: (0<=p13)
states: 16,021 (4)
abstracting: (p13<=0)
states: 10,789 (4)
abstracting: (1<=p17)
states: 4,549 (3)
abstracting: (p17<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
abstracting: (0<=p13)
states: 16,021 (4)
abstracting: (p13<=0)
states: 10,789 (4)
abstracting: (1<=p17)
states: 4,549 (3)
abstracting: (p17<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
...........................
EG iterations: 27
abstracting: (1<=p18)
states: 3,509 (3)
abstracting: (p18<=1)
states: 16,021 (4)
abstracting: (0<=p1)
states: 16,021 (4)
abstracting: (p1<=0)
states: 8,401 (3)
.....................
EG iterations: 21
.abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
.................................................
EG iterations: 49
abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
.................................................
EG iterations: 49

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVs-PT-002A-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.178sec

checking: EF [EG [[E [[[p17<=1 & 1<=p17] & [[[p15<=0 & 0<=p15] | [p10<=1 & 1<=p10]] & [[p13<=0 & 0<=p13] | [p16<=1 & 1<=p16]]]] U AG [[[p5<=0 & 0<=p5] | [p0<=1 & 1<=p0]]]] & [EF [[[p1<=1 & 1<=p1] & [p10<=0 & 0<=p10]]] & A [EX [[p9<=0 & 0<=p9]] U [p25<=1 & 1<=p25]]]]]]
normalized: E [true U EG [[[[~ [EG [~ [[p25<=1 & 1<=p25]]]] & ~ [E [~ [[p25<=1 & 1<=p25]] U [~ [EX [[p9<=0 & 0<=p9]]] & ~ [[p25<=1 & 1<=p25]]]]]] & E [true U [[p10<=0 & 0<=p10] & [p1<=1 & 1<=p1]]]] & E [[[[[p16<=1 & 1<=p16] | [p13<=0 & 0<=p13]] & [[p10<=1 & 1<=p10] | [p15<=0 & 0<=p15]]] & [p17<=1 & 1<=p17]] U ~ [E [true U ~ [[[p0<=1 & 1<=p0] | [p5<=0 & 0<=p5]]]]]]]]]

abstracting: (0<=p5)
states: 16,021 (4)
abstracting: (p5<=0)
states: 12,749 (4)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 16,021 (4)
abstracting: (1<=p17)
states: 4,549 (3)
abstracting: (p17<=1)
states: 16,021 (4)
abstracting: (0<=p15)
states: 16,021 (4)
abstracting: (p15<=0)
states: 12,731 (4)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (0<=p13)
states: 16,021 (4)
abstracting: (p13<=0)
states: 10,789 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (0<=p10)
states: 16,021 (4)
abstracting: (p10<=0)
states: 12,781 (4)
abstracting: (1<=p25)
states: 3,327 (3)
abstracting: (p25<=1)
states: 16,021 (4)
abstracting: (0<=p9)
states: 16,021 (4)
abstracting: (p9<=0)
states: 10,789 (4)
.abstracting: (1<=p25)
states: 3,327 (3)
abstracting: (p25<=1)
states: 16,021 (4)
abstracting: (1<=p25)
states: 3,327 (3)
abstracting: (p25<=1)
states: 16,021 (4)
....
EG iterations: 4
........
EG iterations: 8
-> the formula is FALSE

FORMULA ShieldRVs-PT-002A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: EX [E [[[p9<=0 & 0<=p9] & [~ [[p3<=1 & 1<=p3]] & [[p5<=0 & 0<=p5] | [p6<=1 & 1<=p6]]]] U [AG [AF [[[p9<=0 & 0<=p9] | [p22<=1 & 1<=p22]]]] & [~ [[[p17<=0 & 0<=p17] | [p10<=1 & 1<=p10]]] | [~ [AG [[p27<=0 & 0<=p27]]] | ~ [A [[[p26<=0 & 0<=p26] | [p4<=1 & 1<=p4]] U [p20<=1 & 1<=p20]]]]]]]]
normalized: EX [E [[[[[p6<=1 & 1<=p6] | [p5<=0 & 0<=p5]] & ~ [[p3<=1 & 1<=p3]]] & [p9<=0 & 0<=p9]] U [[[~ [[~ [EG [~ [[p20<=1 & 1<=p20]]]] & ~ [E [~ [[p20<=1 & 1<=p20]] U [~ [[[p4<=1 & 1<=p4] | [p26<=0 & 0<=p26]]] & ~ [[p20<=1 & 1<=p20]]]]]]] | E [true U ~ [[p27<=0 & 0<=p27]]]] | ~ [[[p10<=1 & 1<=p10] | [p17<=0 & 0<=p17]]]] & ~ [E [true U EG [~ [[[p22<=1 & 1<=p22] | [p9<=0 & 0<=p9]]]]]]]]]

abstracting: (0<=p9)
states: 16,021 (4)
abstracting: (p9<=0)
states: 10,789 (4)
abstracting: (1<=p22)
states: 7,552 (3)
abstracting: (p22<=1)
states: 16,021 (4)
...............
EG iterations: 15
abstracting: (0<=p17)
states: 16,021 (4)
abstracting: (p17<=0)
states: 11,472 (4)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (0<=p27)
states: 16,021 (4)
abstracting: (p27<=0)
states: 11,094 (4)
abstracting: (1<=p20)
states: 4,563 (3)
abstracting: (p20<=1)
states: 16,021 (4)
abstracting: (0<=p26)
states: 16,021 (4)
abstracting: (p26<=0)
states: 11,716 (4)
abstracting: (1<=p4)
states: 3,272 (3)
abstracting: (p4<=1)
states: 16,021 (4)
abstracting: (1<=p20)
states: 4,563 (3)
abstracting: (p20<=1)
states: 16,021 (4)
abstracting: (1<=p20)
states: 4,563 (3)
abstracting: (p20<=1)
states: 16,021 (4)
.............................
EG iterations: 29
abstracting: (0<=p9)
states: 16,021 (4)
abstracting: (p9<=0)
states: 10,789 (4)
abstracting: (1<=p3)
states: 4,936 (3)
abstracting: (p3<=1)
states: 16,021 (4)
abstracting: (0<=p5)
states: 16,021 (4)
abstracting: (p5<=0)
states: 12,749 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
.-> the formula is FALSE

FORMULA ShieldRVs-PT-002A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.196sec

checking: [~ [E [~ [[~ [[p23<=0 & 0<=p23]] | AX [[p14<=1 & 1<=p14]]]] U [[[p29<=0 & 0<=p29] | [p4<=1 & 1<=p4]] & [[p0<=0 & 0<=p0] | [p29<=1 & 1<=p29]]]]] & EF [[[[[p18<=0 & 0<=p18] & [p10<=1 & 1<=p10]] | [[p8<=0 & 0<=p8] & [[p6<=1 & 1<=p6] & [p29<=0 & 0<=p29]]]] & EX [[p6<=1 & 1<=p6]]]]]
normalized: [E [true U [EX [[p6<=1 & 1<=p6]] & [[[[p29<=0 & 0<=p29] & [p6<=1 & 1<=p6]] & [p8<=0 & 0<=p8]] | [[p10<=1 & 1<=p10] & [p18<=0 & 0<=p18]]]]] & ~ [E [~ [[~ [EX [~ [[p14<=1 & 1<=p14]]]] | ~ [[p23<=0 & 0<=p23]]]] U [[[p29<=1 & 1<=p29] | [p0<=0 & 0<=p0]] & [[p4<=1 & 1<=p4] | [p29<=0 & 0<=p29]]]]]]

abstracting: (0<=p29)
states: 16,021 (4)
abstracting: (p29<=0)
states: 12,552 (4)
abstracting: (1<=p4)
states: 3,272 (3)
abstracting: (p4<=1)
states: 16,021 (4)
abstracting: (0<=p0)
states: 16,021 (4)
abstracting: (p0<=0)
states: 16,020 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
abstracting: (0<=p23)
states: 16,021 (4)
abstracting: (p23<=0)
states: 11,257 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
.abstracting: (0<=p18)
states: 16,021 (4)
abstracting: (p18<=0)
states: 12,512 (4)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (0<=p8)
states: 16,021 (4)
abstracting: (p8<=0)
states: 8,401 (3)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (0<=p29)
states: 16,021 (4)
abstracting: (p29<=0)
states: 12,552 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
.-> the formula is FALSE

FORMULA ShieldRVs-PT-002A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: [AG [~ [A [EF [[p10<=1 & 1<=p10]] U AG [[p12<=0 & 0<=p12]]]]] | EX [[[p19<=1 & 1<=p19] | AX [[[[[[[p16<=0 & 0<=p16] | [p28<=1 & 1<=p28]] | [[p11<=0 & 0<=p11] | [p8<=1 & 1<=p8]]] & [[p9<=1 & 1<=p9] | [[p22<=0 & 0<=p22] | [p20<=1 & 1<=p20]]]] | [p11<=0 & 0<=p11]] | [[p30<=1 & 1<=p30] | [[p20<=0 & 0<=p20] & [p3<=1 & 1<=p3]]]]]]]]
normalized: [EX [[~ [EX [~ [[[[[p3<=1 & 1<=p3] & [p20<=0 & 0<=p20]] | [p30<=1 & 1<=p30]] | [[p11<=0 & 0<=p11] | [[[[p20<=1 & 1<=p20] | [p22<=0 & 0<=p22]] | [p9<=1 & 1<=p9]] & [[[p8<=1 & 1<=p8] | [p11<=0 & 0<=p11]] | [[p28<=1 & 1<=p28] | [p16<=0 & 0<=p16]]]]]]]]] | [p19<=1 & 1<=p19]]] | ~ [E [true U [~ [EG [E [true U ~ [[p12<=0 & 0<=p12]]]]] & ~ [E [E [true U ~ [[p12<=0 & 0<=p12]]] U [~ [E [true U [p10<=1 & 1<=p10]]] & E [true U ~ [[p12<=0 & 0<=p12]]]]]]]]]]

abstracting: (0<=p12)
states: 16,021 (4)
abstracting: (p12<=0)
states: 11,763 (4)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (0<=p12)
states: 16,021 (4)
abstracting: (p12<=0)
states: 11,763 (4)
abstracting: (0<=p12)
states: 16,021 (4)
abstracting: (p12<=0)
states: 11,763 (4)
.
EG iterations: 1
abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
abstracting: (0<=p16)
states: 16,021 (4)
abstracting: (p16<=0)
states: 11,763 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
abstracting: (0<=p11)
states: 16,021 (4)
abstracting: (p11<=0)
states: 12,731 (4)
abstracting: (1<=p8)
states: 7,620 (3)
abstracting: (p8<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (0<=p22)
states: 16,021 (4)
abstracting: (p22<=0)
states: 8,469 (3)
abstracting: (1<=p20)
states: 4,563 (3)
abstracting: (p20<=1)
states: 16,021 (4)
abstracting: (0<=p11)
states: 16,021 (4)
abstracting: (p11<=0)
states: 12,731 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
abstracting: (0<=p20)
states: 16,021 (4)
abstracting: (p20<=0)
states: 11,458 (4)
abstracting: (1<=p3)
states: 4,936 (3)
abstracting: (p3<=1)
states: 16,021 (4)
..-> the formula is TRUE

FORMULA ShieldRVs-PT-002A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: [~ [A [[[~ [[AG [[p20<=0 & 0<=p20]] & ~ [[p5<=1 & 1<=p5]]]] & ~ [[[[[p4<=0 & 0<=p4] | [p28<=1 & 1<=p28]] | [[p25<=0 & 0<=p25] | [p21<=1 & 1<=p21]]] & [[p19<=1 & 1<=p19] | [[p2<=0 & 0<=p2] | [p29<=1 & 1<=p29]]]]]] & [[[EX [0<=0] | [[p25<=0 & 0<=p25] | [p1<=0 & 0<=p1]]] | [[[p13<=1 & 1<=p13] | [p29<=1 & 1<=p29]] | [[p6<=1 & 1<=p6] | ~ [[p7<=1 & 1<=p7]]]]] & EF [AX [[[p30<=0 & 0<=p30] | [p19<=1 & 1<=p19]]]]]] U [EG [[[[p6<=0 & 0<=p6] | [p27<=1 & 1<=p27]] & ~ [[p30<=0 & 0<=p30]]]] | ~ [[[p7<=0 & 0<=p7] | [p2<=1 & 1<=p2]]]]]] & EG [[[p21<=0 & 0<=p21] | [p16<=1 & 1<=p16]]]]
normalized: [EG [[[p16<=1 & 1<=p16] | [p21<=0 & 0<=p21]]] & ~ [[~ [EG [~ [[~ [[[p2<=1 & 1<=p2] | [p7<=0 & 0<=p7]]] | EG [[~ [[p30<=0 & 0<=p30]] & [[p27<=1 & 1<=p27] | [p6<=0 & 0<=p6]]]]]]]] & ~ [E [~ [[~ [[[p2<=1 & 1<=p2] | [p7<=0 & 0<=p7]]] | EG [[~ [[p30<=0 & 0<=p30]] & [[p27<=1 & 1<=p27] | [p6<=0 & 0<=p6]]]]]] U [~ [[[~ [[~ [E [true U ~ [[p20<=0 & 0<=p20]]]] & ~ [[p5<=1 & 1<=p5]]]] & ~ [[[[[p21<=1 & 1<=p21] | [p25<=0 & 0<=p25]] | [[p28<=1 & 1<=p28] | [p4<=0 & 0<=p4]]] & [[[p29<=1 & 1<=p29] | [p2<=0 & 0<=p2]] | [p19<=1 & 1<=p19]]]]] & [E [true U ~ [EX [~ [[[p19<=1 & 1<=p19] | [p30<=0 & 0<=p30]]]]]] & [[[~ [[p7<=1 & 1<=p7]] | [p6<=1 & 1<=p6]] | [[p29<=1 & 1<=p29] | [p13<=1 & 1<=p13]]] | [[[p1<=0 & 0<=p1] | [p25<=0 & 0<=p25]] | EX [0<=0]]]]]] & ~ [[~ [[[p2<=1 & 1<=p2] | [p7<=0 & 0<=p7]]] | EG [[~ [[p30<=0 & 0<=p30]] & [[p27<=1 & 1<=p27] | [p6<=0 & 0<=p6]]]]]]]]]]]]

abstracting: (0<=p6)
states: 16,021 (4)
abstracting: (p6<=0)
states: 11,481 (4)
abstracting: (1<=p27)
states: 4,927 (3)
abstracting: (p27<=1)
states: 16,021 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
...................
EG iterations: 19
abstracting: (0<=p7)
states: 16,021 (4)
abstracting: (p7<=0)
states: 7,621 (3)
abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (0<=0)
states: 16,021 (4)
.abstracting: (0<=p25)
states: 16,021 (4)
abstracting: (p25<=0)
states: 12,694 (4)
abstracting: (0<=p1)
states: 16,021 (4)
abstracting: (p1<=0)
states: 8,401 (3)
abstracting: (1<=p13)
states: 5,232 (3)
abstracting: (p13<=1)
states: 16,021 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p7)
states: 8,400 (3)
abstracting: (p7<=1)
states: 16,021 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
.abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
abstracting: (0<=p2)
states: 16,021 (4)
abstracting: (p2<=0)
states: 7,621 (3)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
abstracting: (0<=p4)
states: 16,021 (4)
abstracting: (p4<=0)
states: 12,749 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
abstracting: (0<=p25)
states: 16,021 (4)
abstracting: (p25<=0)
states: 12,694 (4)
abstracting: (1<=p21)
states: 8,468 (3)
abstracting: (p21<=1)
states: 16,021 (4)
abstracting: (1<=p5)
states: 3,272 (3)
abstracting: (p5<=1)
states: 16,021 (4)
abstracting: (0<=p20)
states: 16,021 (4)
abstracting: (p20<=0)
states: 11,458 (4)
abstracting: (0<=p6)
states: 16,021 (4)
abstracting: (p6<=0)
states: 11,481 (4)
abstracting: (1<=p27)
states: 4,927 (3)
abstracting: (p27<=1)
states: 16,021 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
...................
EG iterations: 19
abstracting: (0<=p7)
states: 16,021 (4)
abstracting: (p7<=0)
states: 7,621 (3)
abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (0<=p6)
states: 16,021 (4)
abstracting: (p6<=0)
states: 11,481 (4)
abstracting: (1<=p27)
states: 4,927 (3)
abstracting: (p27<=1)
states: 16,021 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
...................
EG iterations: 19
abstracting: (0<=p7)
states: 16,021 (4)
abstracting: (p7<=0)
states: 7,621 (3)
abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
.................
EG iterations: 17
abstracting: (0<=p21)
states: 16,021 (4)
abstracting: (p21<=0)
states: 7,553 (3)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
...................
EG iterations: 19
-> the formula is TRUE

FORMULA ShieldRVs-PT-002A-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

totally nodes used: 1219149 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 842664 2328403 3171067
used/not used/entry size/cache size: 3318421 63790443 16 1024MB
basic ops cache: hits/miss/sum: 322719 687340 1010059
used/not used/entry size/cache size: 1372523 15404693 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: 3364 8161 11525
used/not used/entry size/cache size: 8157 8380451 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 65964267
1 1076981
2 61164
3 5995
4 431
5 25
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.550sec


BK_STOP 1679338365802

--------------------
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 CTLCardinality -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:3812 (92), effective:549 (13)

initing FirstDep: 0m 0.000sec


iterations count:498 (12), effective:76 (1)

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

iterations count:303 (7), effective:34 (0)

iterations count:383 (9), effective:38 (0)

iterations count:1877 (45), effective:277 (6)

iterations count:345 (8), effective:46 (1)

iterations count:396 (9), effective:31 (0)

iterations count:2047 (49), effective:266 (6)

iterations count:760 (18), effective:81 (1)

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

iterations count:757 (18), effective:120 (2)

iterations count:522 (12), effective:53 (1)

iterations count:91 (2), effective:5 (0)

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

iterations count:1449 (35), effective:215 (5)

iterations count:568 (13), effective:87 (2)

iterations count:1297 (31), effective:186 (4)

iterations count:261 (6), effective:27 (0)

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

iterations count:261 (6), effective:27 (0)

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

iterations count:261 (6), effective:27 (0)

iterations count:692 (16), effective:111 (2)

iterations count:1448 (35), effective:228 (5)

iterations count:222 (5), effective:24 (0)

iterations count:996 (24), effective:150 (3)

iterations count:1183 (28), effective:189 (4)

iterations count:1819 (44), effective:268 (6)

iterations count:418 (10), effective:40 (0)

iterations count:976 (23), effective:91 (2)

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

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

iterations count:1171 (28), effective:158 (3)

iterations count:879 (21), effective:134 (3)

iterations count:1339 (32), effective:194 (4)

iterations count:879 (21), effective:134 (3)

iterations count:2186 (53), effective:325 (7)

iterations count:879 (21), effective:134 (3)

iterations count:1794 (43), effective:260 (6)

iterations count:441 (10), effective:50 (1)

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

iterations count:475 (11), effective:49 (1)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-002A"
export BK_EXAMINATION="CTLCardinality"
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 ShieldRVs-PT-002A, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978400017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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