About the Execution of Marcie+red for ShieldPPPs-PT-001A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5584.943 | 13589.00 | 20527.00 | 51.90 | TFTFTFTFFFFFFTFF | 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.r394-oct2-167903717800354.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPs-PT-001A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800354
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.7K Feb 26 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:55 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 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 9.4K 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 ShieldPPPs-PT-001A-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-001A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679507988053
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=ShieldPPPs-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:59:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:59:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:59:50] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-22 17:59:50] [INFO ] Transformed 34 places.
[2023-03-22 17:59:50] [INFO ] Transformed 29 transitions.
[2023-03-22 17:59:50] [INFO ] Found NUPN structural information;
[2023-03-22 17:59:50] [INFO ] Parsed PT model containing 34 places and 29 transitions and 106 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 34 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 10 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 34 cols
[2023-03-22 17:59:51] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-22 17:59:51] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-22 17:59:51] [INFO ] Invariant cache hit.
[2023-03-22 17:59:51] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-22 17:59:51] [INFO ] Invariant cache hit.
[2023-03-22 17:59:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 34/34 places, 29/29 transitions.
Support contains 34 out of 34 places after structural reductions.
[2023-03-22 17:59:51] [INFO ] Flatten gal took : 35 ms
[2023-03-22 17:59:51] [INFO ] Flatten gal took : 8 ms
[2023-03-22 17:59:51] [INFO ] Input system was already deterministic with 29 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 54) seen :49
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 17:59:52] [INFO ] Invariant cache hit.
[2023-03-22 17:59:52] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 17:59:52] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-22 17:59:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 17:59:52] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 6 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 5 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 32 transition count 27
Applied a total of 4 rules in 7 ms. Remains 32 /34 variables (removed 2) and now considering 27/29 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 32/34 places, 27/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 29/29 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 32 transition count 27
Applied a total of 2 rules in 4 ms. Remains 32 /34 variables (removed 2) and now considering 27/29 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 32/34 places, 27/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 34/34 places, 29/29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 1 ms
[2023-03-22 17:59:52] [INFO ] Input system was already deterministic with 29 transitions.
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 3 ms
[2023-03-22 17:59:52] [INFO ] Flatten gal took : 2 ms
[2023-03-22 17:59:52] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 17:59:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 29 transitions and 106 arcs took 1 ms.
Total runtime 2186 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: 34 NrTr: 29 NrArc: 106)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.920sec
RS generation: 0m 0.030sec
-> reachability set: #nodes 683 (6.8e+02) #states 61,496 (4)
starting MCC model checker
--------------------------
checking: AG [EX [AF [[p20<=0 & 0<=p20]]]]
normalized: ~ [E [true U ~ [EX [~ [EG [~ [[p20<=0 & 0<=p20]]]]]]]]
abstracting: (0<=p20)
states: 61,496 (4)
abstracting: (p20<=0)
states: 45,914 (4)
...................................
EG iterations: 35
.-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.177sec
checking: AG [EF [[[p5<=1 & 1<=p5] & [p24<=1 & 1<=p24]]]]
normalized: ~ [E [true U ~ [E [true U [[p24<=1 & 1<=p24] & [p5<=1 & 1<=p5]]]]]]
abstracting: (1<=p5)
states: 12,333 (4)
abstracting: (p5<=1)
states: 61,496 (4)
abstracting: (1<=p24)
states: 31,136 (4)
abstracting: (p24<=1)
states: 61,496 (4)
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: EX [AF [[[p32<=1 & 1<=p32] | [EX [[p27<=0 & 0<=p27]] & EG [[p22<=1 & 1<=p22]]]]]]
normalized: EX [~ [EG [~ [[[EG [[p22<=1 & 1<=p22]] & EX [[p27<=0 & 0<=p27]]] | [p32<=1 & 1<=p32]]]]]]
abstracting: (1<=p32)
states: 14,919 (4)
abstracting: (p32<=1)
states: 61,496 (4)
abstracting: (0<=p27)
states: 61,496 (4)
abstracting: (p27<=0)
states: 46,105 (4)
.abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
...................................
EG iterations: 35
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.048sec
checking: AX [EG [~ [E [[[p18<=1 & 1<=p18] & [p27<=1 & 1<=p27]] U [[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]]]]]
normalized: ~ [EX [~ [EG [~ [E [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]] U [[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]]]]]]]]
abstracting: (1<=p1)
states: 30,202 (4)
abstracting: (p1<=1)
states: 61,496 (4)
abstracting: (1<=p26)
states: 15,900 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
..........................................
EG iterations: 42
.-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.212sec
checking: ~ [E [[~ [[AG [[[p11<=1 & 1<=p11] & [p23<=1 & 1<=p23]]] & ~ [AX [[p15<=1 & 1<=p15]]]]] & ~ [[p22<=1 & 1<=p22]]] U AG [~ [[p21<=1 & 1<=p21]]]]]
normalized: ~ [E [[~ [[p22<=1 & 1<=p22]] & ~ [[EX [~ [[p15<=1 & 1<=p15]]] & ~ [E [true U ~ [[[p23<=1 & 1<=p23] & [p11<=1 & 1<=p11]]]]]]]] U ~ [E [true U [p21<=1 & 1<=p21]]]]]
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p23)
states: 15,589 (4)
abstracting: (p23<=1)
states: 61,496 (4)
abstracting: (1<=p15)
states: 12,472 (4)
abstracting: (p15<=1)
states: 61,496 (4)
.abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.062sec
checking: ~ [A [EF [[p31<=1 & 1<=p31]] U [[p20<=1 & 1<=p20] | EG [[[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]] | [p28<=1 & 1<=p28]]]]]]
normalized: ~ [[~ [EG [~ [[EG [[[p28<=1 & 1<=p28] | [[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]] | [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[EG [[[p28<=1 & 1<=p28] | [[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]] | [p20<=1 & 1<=p20]]] U [~ [E [true U [p31<=1 & 1<=p31]]] & ~ [[EG [[[p28<=1 & 1<=p28] | [[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]] | [p20<=1 & 1<=p20]]]]]]]]
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p17)
states: 24,588 (4)
abstracting: (p17<=1)
states: 61,496 (4)
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p19<=1)
states: 61,496 (4)
abstracting: (1<=p28)
states: 15,035 (4)
abstracting: (p28<=1)
states: 61,496 (4)
..................................
EG iterations: 34
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p17)
states: 24,588 (4)
abstracting: (p17<=1)
states: 61,496 (4)
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p19<=1)
states: 61,496 (4)
abstracting: (1<=p28)
states: 15,035 (4)
abstracting: (p28<=1)
states: 61,496 (4)
..................................
EG iterations: 34
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p17)
states: 24,588 (4)
abstracting: (p17<=1)
states: 61,496 (4)
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p19<=1)
states: 61,496 (4)
abstracting: (1<=p28)
states: 15,035 (4)
abstracting: (p28<=1)
states: 61,496 (4)
..................................
EG iterations: 34
................................
EG iterations: 32
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.322sec
checking: EX [AX [[AF [[[p6<=1 & 1<=p6] & [p23<=1 & 1<=p23]]] | [[p15<=0 & 0<=p15] & [[[p11<=1 & 1<=p11] & [p23<=1 & 1<=p23]] | [[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]]]]]]]
normalized: EX [~ [EX [~ [[[[[[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]] | [[p23<=1 & 1<=p23] & [p11<=1 & 1<=p11]]] & [p15<=0 & 0<=p15]] | ~ [EG [~ [[[p23<=1 & 1<=p23] & [p6<=1 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (p6<=1)
states: 61,496 (4)
abstracting: (1<=p23)
states: 15,589 (4)
abstracting: (p23<=1)
states: 61,496 (4)
...................................
EG iterations: 35
abstracting: (0<=p15)
states: 61,496 (4)
abstracting: (p15<=0)
states: 49,024 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p23)
states: 15,589 (4)
abstracting: (p23<=1)
states: 61,496 (4)
abstracting: (1<=p12)
states: 24,619 (4)
abstracting: (p12<=1)
states: 61,496 (4)
abstracting: (1<=p14)
states: 24,335 (4)
abstracting: (p14<=1)
states: 61,496 (4)
..-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.106sec
checking: EF [[AG [[[[p28<=0 & 0<=p28] & [[p8<=0 & 0<=p8] | [p28<=0 & 0<=p28]]] | [AG [[[p8<=0 & 0<=p8] | [p28<=0 & 0<=p28]]] | EX [[[p16<=0 & 0<=p16] | [p33<=0 & 0<=p33]]]]]] & [p20<=1 & 1<=p20]]]
normalized: E [true U [[p20<=1 & 1<=p20] & ~ [E [true U ~ [[[EX [[[p33<=0 & 0<=p33] | [p16<=0 & 0<=p16]]] | ~ [E [true U ~ [[[p28<=0 & 0<=p28] | [p8<=0 & 0<=p8]]]]]] | [[[p28<=0 & 0<=p28] | [p8<=0 & 0<=p8]] & [p28<=0 & 0<=p28]]]]]]]]
abstracting: (0<=p28)
states: 61,496 (4)
abstracting: (p28<=0)
states: 46,461 (4)
abstracting: (0<=p8)
states: 61,496 (4)
abstracting: (p8<=0)
states: 36,583 (4)
abstracting: (0<=p28)
states: 61,496 (4)
abstracting: (p28<=0)
states: 46,461 (4)
abstracting: (0<=p8)
states: 61,496 (4)
abstracting: (p8<=0)
states: 36,583 (4)
abstracting: (0<=p28)
states: 61,496 (4)
abstracting: (p28<=0)
states: 46,461 (4)
abstracting: (0<=p16)
states: 61,496 (4)
abstracting: (p16<=0)
states: 37,061 (4)
abstracting: (0<=p33)
states: 61,496 (4)
abstracting: (p33<=0)
states: 46,171 (4)
.abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: EG [[EX [0<=0] & AX [[[[p5<=0 & 0<=p5] | [p24<=0 & 0<=p24]] & [[[p4<=0 & 0<=p4] | [p25<=0 & 0<=p25]] & [[[p16<=0 & 0<=p16] | [p31<=0 & 0<=p31]] | [[p8<=0 & 0<=p8] | [p29<=0 & 0<=p29]]]]]]]]
normalized: EG [[~ [EX [~ [[[[[[p29<=0 & 0<=p29] | [p8<=0 & 0<=p8]] | [[p31<=0 & 0<=p31] | [p16<=0 & 0<=p16]]] & [[p25<=0 & 0<=p25] | [p4<=0 & 0<=p4]]] & [[p24<=0 & 0<=p24] | [p5<=0 & 0<=p5]]]]]] & EX [0<=0]]]
abstracting: (0<=0)
states: 61,496 (4)
.abstracting: (0<=p5)
states: 61,496 (4)
abstracting: (p5<=0)
states: 49,163 (4)
abstracting: (0<=p24)
states: 61,496 (4)
abstracting: (p24<=0)
states: 30,360 (4)
abstracting: (0<=p4)
states: 61,496 (4)
abstracting: (p4<=0)
states: 30,360 (4)
abstracting: (0<=p25)
states: 61,496 (4)
abstracting: (p25<=0)
states: 31,137 (4)
abstracting: (0<=p16)
states: 61,496 (4)
abstracting: (p16<=0)
states: 37,061 (4)
abstracting: (0<=p31)
states: 61,496 (4)
abstracting: (p31<=0)
states: 46,067 (4)
abstracting: (0<=p8)
states: 61,496 (4)
abstracting: (p8<=0)
states: 36,583 (4)
abstracting: (0<=p29)
states: 61,496 (4)
abstracting: (p29<=0)
states: 46,327 (4)
.................................................
EG iterations: 48
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.186sec
checking: E [[AF [~ [EF [~ [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]]]]] | ~ [EX [AF [[[p20<=1 & 1<=p20] | [[p18<=1 & 1<=p18] & [p29<=1 & 1<=p29]]]]]]] U [E [[[[p13<=1 & 1<=p13] & [p32<=1 & 1<=p32]] | [p0<=1 & 1<=p0]] U EG [~ [[p31<=1 & 1<=p31]]]] | [[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]]]
normalized: E [[~ [EX [~ [EG [~ [[[[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]] | [p20<=1 & 1<=p20]]]]]]] | ~ [EG [E [true U ~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]] U [[[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]] | E [[[[p13<=1 & 1<=p13] & [p32<=1 & 1<=p32]] | [p0<=1 & 1<=p0]] U EG [~ [[p31<=1 & 1<=p31]]]]]]
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
........................
EG iterations: 24
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 61,496 (4)
abstracting: (1<=p32)
states: 14,919 (4)
abstracting: (p32<=1)
states: 61,496 (4)
abstracting: (1<=p13)
states: 24,921 (4)
abstracting: (p13<=1)
states: 61,496 (4)
abstracting: (1<=p26)
states: 15,900 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (1<=p1)
states: 30,202 (4)
abstracting: (p1<=1)
states: 61,496 (4)
abstracting: (1<=p7)
states: 24,687 (4)
abstracting: (p7<=1)
states: 61,496 (4)
abstracting: (1<=p9)
states: 24,249 (4)
abstracting: (p9<=1)
states: 61,496 (4)
EG iterations: 0
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (p29<=1)
states: 61,496 (4)
..........................................
EG iterations: 42
.-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.303sec
checking: [~ [E [AF [[[p6<=1 & 1<=p6] & [p23<=1 & 1<=p23]]] U AX [[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]]]]] & [~ [A [~ [[p31<=1 & 1<=p31]] U E [[[p11<=1 & 1<=p11] & [p21<=1 & 1<=p21]] U [p20<=1 & 1<=p20]]]] & [AG [[AX [[[p3<=1 & 1<=p3] & [p30<=1 & 1<=p30]]] | EG [[[p3<=1 & 1<=p3] & [p30<=1 & 1<=p30]]]]] | EG [~ [[p32<=1 & 1<=p32]]]]]]
normalized: [[[EG [~ [[p32<=1 & 1<=p32]]] | ~ [E [true U ~ [[EG [[[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]]] | ~ [EX [~ [[[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]]]]]]]]]] & ~ [[~ [EG [~ [E [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]] U [p20<=1 & 1<=p20]]]]] & ~ [E [~ [E [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]] U [p20<=1 & 1<=p20]]] U [[p31<=1 & 1<=p31] & ~ [E [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]] U [p20<=1 & 1<=p20]]]]]]]]] & ~ [E [~ [EG [~ [[[p23<=1 & 1<=p23] & [p6<=1 & 1<=p6]]]]] U ~ [EX [~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]]]]]]
abstracting: (1<=p17)
states: 24,588 (4)
abstracting: (p17<=1)
states: 61,496 (4)
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p19<=1)
states: 61,496 (4)
.abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (p6<=1)
states: 61,496 (4)
abstracting: (1<=p23)
states: 15,589 (4)
abstracting: (p23<=1)
states: 61,496 (4)
...................................
EG iterations: 35
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
...........................................
EG iterations: 43
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
.abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
...............................
EG iterations: 31
abstracting: (1<=p32)
states: 14,919 (4)
abstracting: (p32<=1)
states: 61,496 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.169sec
checking: [A [[AF [[p31<=1 & 1<=p31]] | [[p28<=1 & 1<=p28] | [[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]]]] U [[A [[p20<=1 & 1<=p20] U [[p18<=1 & 1<=p18] & [p27<=1 & 1<=p27]]] & [EF [[[p16<=1 & 1<=p16] & [p31<=1 & 1<=p31]]] & [p4<=1 & 1<=p4]]] & [[p25<=1 & 1<=p25] & [[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]]]] | ~ [A [~ [[[p18<=1 & 1<=p18] & [p29<=1 & 1<=p29]]] U EF [AG [~ [[[p6<=1 & 1<=p6] & [p22<=1 & 1<=p22]]]]]]]]
normalized: [~ [[~ [EG [~ [E [true U ~ [E [true U [[p22<=1 & 1<=p22] & [p6<=1 & 1<=p6]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [[p22<=1 & 1<=p22] & [p6<=1 & 1<=p6]]]]]] U [[[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]] & ~ [E [true U ~ [E [true U [[p22<=1 & 1<=p22] & [p6<=1 & 1<=p6]]]]]]]]]]] | [~ [EG [~ [[[[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] & [p25<=1 & 1<=p25]] & [[[p4<=1 & 1<=p4] & E [true U [[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]]] & [~ [EG [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]] & ~ [E [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]] U [~ [[p20<=1 & 1<=p20]] & ~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]]]]]]]]] & ~ [E [~ [[[[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] & [p25<=1 & 1<=p25]] & [[[p4<=1 & 1<=p4] & E [true U [[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]]] & [~ [EG [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]] & ~ [E [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]] U [~ [[p20<=1 & 1<=p20]] & ~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]]]]]]] U [~ [[[[[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]] | [p28<=1 & 1<=p28]] | ~ [EG [~ [[p31<=1 & 1<=p31]]]]]] & ~ [[[[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] & [p25<=1 & 1<=p25]] & [[[p4<=1 & 1<=p4] & E [true U [[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]]] & [~ [EG [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]] & ~ [E [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]] U [~ [[p20<=1 & 1<=p20]] & ~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]]]]]]]]]]]]
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (1<=p4)
states: 31,136 (4)
abstracting: (p4<=1)
states: 61,496 (4)
abstracting: (1<=p25)
states: 30,359 (4)
abstracting: (p25<=1)
states: 61,496 (4)
abstracting: (1<=p2)
states: 31,293 (4)
abstracting: (p2<=1)
states: 61,496 (4)
abstracting: (1<=p10)
states: 12,239 (4)
abstracting: (p10<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
........................
EG iterations: 24
abstracting: (1<=p28)
states: 15,035 (4)
abstracting: (p28<=1)
states: 61,496 (4)
abstracting: (1<=p12)
states: 24,619 (4)
abstracting: (p12<=1)
states: 61,496 (4)
abstracting: (1<=p14)
states: 24,335 (4)
abstracting: (p14<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (1<=p4)
states: 31,136 (4)
abstracting: (p4<=1)
states: 61,496 (4)
abstracting: (1<=p25)
states: 30,359 (4)
abstracting: (p25<=1)
states: 61,496 (4)
abstracting: (1<=p2)
states: 31,293 (4)
abstracting: (p2<=1)
states: 61,496 (4)
abstracting: (1<=p10)
states: 12,239 (4)
abstracting: (p10<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (1<=p4)
states: 31,136 (4)
abstracting: (p4<=1)
states: 61,496 (4)
abstracting: (1<=p25)
states: 30,359 (4)
abstracting: (p25<=1)
states: 61,496 (4)
abstracting: (1<=p2)
states: 31,293 (4)
abstracting: (p2<=1)
states: 61,496 (4)
abstracting: (1<=p10)
states: 12,239 (4)
abstracting: (p10<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (p6<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (p29<=1)
states: 61,496 (4)
abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (p6<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (p6<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.058sec
checking: EG [A [[[AX [AX [[[p6<=1 & 1<=p6] & [p22<=1 & 1<=p22]]]] | AX [[[[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]] | [[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]]]]] | [AG [[p0<=1 & 1<=p0]] | [AF [[[p5<=1 & 1<=p5] & [p24<=1 & 1<=p24]]] & [~ [[[p6<=1 & 1<=p6] & [p22<=1 & 1<=p22]]] & [[p22<=1 & 1<=p22] | [[p16<=1 & 1<=p16] & [p33<=1 & 1<=p33]]]]]]] U EF [~ [[~ [[[p3<=1 & 1<=p3] & [p30<=1 & 1<=p30]]] | EF [[[p3<=1 & 1<=p3] & [p30<=1 & 1<=p30]]]]]]]]
normalized: EG [[~ [EG [~ [E [true U ~ [[E [true U [[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]]] | ~ [[[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]]]]]]]]] & ~ [E [~ [E [true U ~ [[E [true U [[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]]] | ~ [[[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]]]]]]] U [~ [[[[[[[[p33<=1 & 1<=p33] & [p16<=1 & 1<=p16]] | [p22<=1 & 1<=p22]] & ~ [[[p22<=1 & 1<=p22] & [p6<=1 & 1<=p6]]]] & ~ [EG [~ [[[p24<=1 & 1<=p24] & [p5<=1 & 1<=p5]]]]]] | ~ [E [true U ~ [[p0<=1 & 1<=p0]]]]] | [~ [EX [~ [[[[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]] | [[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]]]]]] | ~ [EX [EX [~ [[[p22<=1 & 1<=p22] & [p6<=1 & 1<=p6]]]]]]]]] & ~ [E [true U ~ [[E [true U [[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]]] | ~ [[[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]]]]]]]]]]]]
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (p6<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
..abstracting: (1<=p1)
states: 30,202 (4)
abstracting: (p1<=1)
states: 61,496 (4)
abstracting: (1<=p26)
states: 15,900 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (1<=p12)
states: 24,619 (4)
abstracting: (p12<=1)
states: 61,496 (4)
abstracting: (1<=p14)
states: 24,335 (4)
abstracting: (p14<=1)
states: 61,496 (4)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 61,496 (4)
abstracting: (1<=p5)
states: 12,333 (4)
abstracting: (p5<=1)
states: 61,496 (4)
abstracting: (1<=p24)
states: 31,136 (4)
abstracting: (p24<=1)
states: 61,496 (4)
...............................................................
EG iterations: 63
abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (p6<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p33)
states: 15,325 (4)
abstracting: (p33<=1)
states: 61,496 (4)
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.252sec
checking: [E [[~ [E [[[p11<=1 & 1<=p11] & [p23<=1 & 1<=p23]] U [[p4<=1 & 1<=p4] & [p25<=1 & 1<=p25]]]] & EG [AX [[p27<=1 & 1<=p27]]]] U AF [[[p18<=1 & 1<=p18] & [p29<=1 & 1<=p29]]]] & [AF [EX [EX [EX [[p27<=1 & 1<=p27]]]]] & [E [~ [AG [EX [[p15<=1 & 1<=p15]]]] U AF [[[AF [[[p18<=1 & 1<=p18] & [p29<=1 & 1<=p29]]] & [p16<=1 & 1<=p16]] & [[p31<=1 & 1<=p31] & ~ [[p15<=1 & 1<=p15]]]]]] | A [AG [[AG [[p21<=1 & 1<=p21]] | [[p18<=1 & 1<=p18] & [p29<=1 & 1<=p29]]]] U ~ [EX [AX [[[p16<=1 & 1<=p16] & [p31<=1 & 1<=p31]]]]]]]]]
normalized: [[[[~ [EG [EX [~ [EX [~ [[[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]]]]]]] & ~ [E [EX [~ [EX [~ [[[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]]]]] U [E [true U ~ [[[[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]] | ~ [E [true U ~ [[p21<=1 & 1<=p21]]]]]]] & EX [~ [EX [~ [[[p31<=1 & 1<=p31] & [p16<=1 & 1<=p16]]]]]]]]]] | E [E [true U ~ [EX [[p15<=1 & 1<=p15]]]] U ~ [EG [~ [[[~ [[p15<=1 & 1<=p15]] & [p31<=1 & 1<=p31]] & [[p16<=1 & 1<=p16] & ~ [EG [~ [[[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]]]]]]]]]]]] & ~ [EG [~ [EX [EX [EX [[p27<=1 & 1<=p27]]]]]]]] & E [[EG [~ [EX [~ [[p27<=1 & 1<=p27]]]]] & ~ [E [[[p23<=1 & 1<=p23] & [p11<=1 & 1<=p11]] U [[p25<=1 & 1<=p25] & [p4<=1 & 1<=p4]]]]] U ~ [EG [~ [[[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]]]]]]]
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (p29<=1)
states: 61,496 (4)
.........................................
EG iterations: 41
abstracting: (1<=p4)
states: 31,136 (4)
abstracting: (p4<=1)
states: 61,496 (4)
abstracting: (1<=p25)
states: 30,359 (4)
abstracting: (p25<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p23)
states: 15,589 (4)
abstracting: (p23<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
...
EG iterations: 2
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
............................
EG iterations: 25
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (p29<=1)
states: 61,496 (4)
.........................................
EG iterations: 41
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (1<=p15)
states: 12,472 (4)
abstracting: (p15<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (1<=p15)
states: 12,472 (4)
abstracting: (p15<=1)
states: 61,496 (4)
.abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
..abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (p29<=1)
states: 61,496 (4)
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
..abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
....
EG iterations: 2
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.441sec
checking: [EG [[~ [[p7<=1 & 1<=p7]] | ~ [[p9<=1 & 1<=p9]]]] | AX [[[[[[p16<=0 & 0<=p16] | [p33<=0 & 0<=p33]] & AG [[p21<=1 & 1<=p21]]] | [EF [[[p5<=0 & 0<=p5] | [p24<=0 & 0<=p24]]] & [[[[p6<=0 & 0<=p6] | [p22<=0 & 0<=p22]] | [[p13<=0 & 0<=p13] | [p33<=0 & 0<=p33]]] & ~ [A [[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]] U [[p5<=1 & 1<=p5] & [p24<=1 & 1<=p24]]]]]]] & AF [[[[[p18<=0 & 0<=p18] | [p27<=0 & 0<=p27]] & [[p13<=0 & 0<=p13] | [p33<=0 & 0<=p33]]] & [[p8<=1 & 1<=p8] & [p28<=1 & 1<=p28]]]]]]]
normalized: [~ [EX [~ [[~ [EG [~ [[[[p28<=1 & 1<=p28] & [p8<=1 & 1<=p8]] & [[[p33<=0 & 0<=p33] | [p13<=0 & 0<=p13]] & [[p27<=0 & 0<=p27] | [p18<=0 & 0<=p18]]]]]]] & [[[~ [[~ [EG [~ [[[p24<=1 & 1<=p24] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p24<=1 & 1<=p24] & [p5<=1 & 1<=p5]]] U [~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]] & ~ [[[p24<=1 & 1<=p24] & [p5<=1 & 1<=p5]]]]]]]] & [[[p33<=0 & 0<=p33] | [p13<=0 & 0<=p13]] | [[p22<=0 & 0<=p22] | [p6<=0 & 0<=p6]]]] & E [true U [[p24<=0 & 0<=p24] | [p5<=0 & 0<=p5]]]] | [~ [E [true U ~ [[p21<=1 & 1<=p21]]]] & [[p33<=0 & 0<=p33] | [p16<=0 & 0<=p16]]]]]]]] | EG [[~ [[p9<=1 & 1<=p9]] | ~ [[p7<=1 & 1<=p7]]]]]
abstracting: (1<=p7)
states: 24,687 (4)
abstracting: (p7<=1)
states: 61,496 (4)
abstracting: (1<=p9)
states: 24,249 (4)
abstracting: (p9<=1)
states: 61,496 (4)
............................................................
EG iterations: 60
abstracting: (0<=p16)
states: 61,496 (4)
abstracting: (p16<=0)
states: 37,061 (4)
abstracting: (0<=p33)
states: 61,496 (4)
abstracting: (p33<=0)
states: 46,171 (4)
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
abstracting: (0<=p5)
states: 61,496 (4)
abstracting: (p5<=0)
states: 49,163 (4)
abstracting: (0<=p24)
states: 61,496 (4)
abstracting: (p24<=0)
states: 30,360 (4)
abstracting: (0<=p6)
states: 61,496 (4)
abstracting: (p6<=0)
states: 37,021 (4)
abstracting: (0<=p22)
states: 61,496 (4)
abstracting: (p22<=0)
states: 46,257 (4)
abstracting: (0<=p13)
states: 61,496 (4)
abstracting: (p13<=0)
states: 36,575 (4)
abstracting: (0<=p33)
states: 61,496 (4)
abstracting: (p33<=0)
states: 46,171 (4)
abstracting: (1<=p5)
states: 12,333 (4)
abstracting: (p5<=1)
states: 61,496 (4)
abstracting: (1<=p24)
states: 31,136 (4)
abstracting: (p24<=1)
states: 61,496 (4)
abstracting: (1<=p17)
states: 24,588 (4)
abstracting: (p17<=1)
states: 61,496 (4)
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p19<=1)
states: 61,496 (4)
abstracting: (1<=p5)
states: 12,333 (4)
abstracting: (p5<=1)
states: 61,496 (4)
abstracting: (1<=p24)
states: 31,136 (4)
abstracting: (p24<=1)
states: 61,496 (4)
abstracting: (1<=p5)
states: 12,333 (4)
abstracting: (p5<=1)
states: 61,496 (4)
abstracting: (1<=p24)
states: 31,136 (4)
abstracting: (p24<=1)
states: 61,496 (4)
...............................................................
EG iterations: 63
abstracting: (0<=p18)
states: 61,496 (4)
abstracting: (p18<=0)
states: 36,907 (4)
abstracting: (0<=p27)
states: 61,496 (4)
abstracting: (p27<=0)
states: 46,105 (4)
abstracting: (0<=p13)
states: 61,496 (4)
abstracting: (p13<=0)
states: 36,575 (4)
abstracting: (0<=p33)
states: 61,496 (4)
abstracting: (p33<=0)
states: 46,171 (4)
abstracting: (1<=p8)
states: 24,913 (4)
abstracting: (p8<=1)
states: 61,496 (4)
abstracting: (1<=p28)
states: 15,035 (4)
abstracting: (p28<=1)
states: 61,496 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.175sec
checking: EG [[[A [[1<=p20 & p20<=1] U [[p16<=1 & 1<=p16] & [p33<=1 & 1<=p33]]] | A [[p31<=1 & 1<=p31] U [[p11<=1 & 1<=p11] & [p21<=1 & 1<=p21]]]] | [E [[p21<=1 & 1<=p21] U ~ [[~ [[[p6<=1 & 1<=p6] & [[p22<=1 & 1<=p22] & [p32<=1 & 1<=p32]]]] & E [[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]] U [p22<=1 & 1<=p22]]]]] | [[EX [~ [E [[[p8<=1 & 1<=p8] & [p28<=1 & 1<=p28]] U [[p8<=1 & 1<=p8] & [p28<=1 & 1<=p28]]]]] & [~ [E [[p31<=1 & 1<=p31] U [[p1<=1 & 1<=p1] & [p26<=1 & 1<=p26]]]] | [[[p11<=1 & 1<=p11] & [p23<=1 & 1<=p23]] | [[p3<=1 & 1<=p3] & [p30<=1 & 1<=p30]]]]] | [[AF [[[p18<=1 & 1<=p18] & [p27<=1 & 1<=p27]]] & [p18<=1 & 1<=p18]] & [[p27<=1 & 1<=p27] & [p31<=1 & 1<=p31]]]]]]]
normalized: EG [[[[[[[p31<=1 & 1<=p31] & [p27<=1 & 1<=p27]] & [[p18<=1 & 1<=p18] & ~ [EG [~ [[[p27<=1 & 1<=p27] & [p18<=1 & 1<=p18]]]]]]] | [[[[[p30<=1 & 1<=p30] & [p3<=1 & 1<=p3]] | [[p23<=1 & 1<=p23] & [p11<=1 & 1<=p11]]] | ~ [E [[p31<=1 & 1<=p31] U [[p26<=1 & 1<=p26] & [p1<=1 & 1<=p1]]]]] & EX [~ [E [[[p28<=1 & 1<=p28] & [p8<=1 & 1<=p8]] U [[p28<=1 & 1<=p28] & [p8<=1 & 1<=p8]]]]]]] | E [[p21<=1 & 1<=p21] U ~ [[E [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]] U [p22<=1 & 1<=p22]] & ~ [[[[p32<=1 & 1<=p32] & [p22<=1 & 1<=p22]] & [p6<=1 & 1<=p6]]]]]]] | [[~ [EG [~ [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]]]]] & ~ [E [~ [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]]] U [~ [[p31<=1 & 1<=p31]] & ~ [[[p21<=1 & 1<=p21] & [p11<=1 & 1<=p11]]]]]]] | [~ [EG [~ [[[p33<=1 & 1<=p33] & [p16<=1 & 1<=p16]]]]] & ~ [E [~ [[[p33<=1 & 1<=p33] & [p16<=1 & 1<=p16]]] U [~ [[1<=p20 & p20<=1]] & ~ [[[p33<=1 & 1<=p33] & [p16<=1 & 1<=p16]]]]]]]]]]
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p33)
states: 15,325 (4)
abstracting: (p33<=1)
states: 61,496 (4)
abstracting: (p20<=1)
states: 61,496 (4)
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p33)
states: 15,325 (4)
abstracting: (p33<=1)
states: 61,496 (4)
abstracting: (1<=p16)
states: 24,435 (4)
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (1<=p33)
states: 15,325 (4)
abstracting: (p33<=1)
states: 61,496 (4)
............................................
EG iterations: 44
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (p6<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
abstracting: (1<=p32)
states: 14,919 (4)
abstracting: (p32<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (p22<=1)
states: 61,496 (4)
abstracting: (1<=p17)
states: 24,588 (4)
abstracting: (p17<=1)
states: 61,496 (4)
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p19<=1)
states: 61,496 (4)
abstracting: (1<=p21)
states: 15,085 (4)
abstracting: (p21<=1)
states: 61,496 (4)
abstracting: (1<=p8)
states: 24,913 (4)
abstracting: (p8<=1)
states: 61,496 (4)
abstracting: (1<=p28)
states: 15,035 (4)
abstracting: (p28<=1)
states: 61,496 (4)
abstracting: (1<=p8)
states: 24,913 (4)
abstracting: (p8<=1)
states: 61,496 (4)
abstracting: (1<=p28)
states: 15,035 (4)
abstracting: (p28<=1)
states: 61,496 (4)
.abstracting: (1<=p1)
states: 30,202 (4)
abstracting: (p1<=1)
states: 61,496 (4)
abstracting: (1<=p26)
states: 15,900 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p11<=1)
states: 61,496 (4)
abstracting: (1<=p23)
states: 15,589 (4)
abstracting: (p23<=1)
states: 61,496 (4)
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p3<=1)
states: 61,496 (4)
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (p18<=1)
states: 61,496 (4)
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (p27<=1)
states: 61,496 (4)
abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p31<=1)
states: 61,496 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.139sec
totally nodes used: 1995931 (2.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1217137 3667148 4884285
used/not used/entry size/cache size: 5365496 61743368 16 1024MB
basic ops cache: hits/miss/sum: 442782 1037040 1479822
used/not used/entry size/cache size: 2090587 14686629 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: 5147 11865 17012
used/not used/entry size/cache size: 11860 8376748 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 65262688
1 1712091
2 119685
3 13209
4 1117
5 69
6 5
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 8.532sec
BK_STOP 1679508001642
--------------------
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:
++ 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
++ sed s/.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:2740 (94), effective:505 (17)
initing FirstDep: 0m 0.000sec
iterations count:1652 (56), effective:295 (10)
iterations count:443 (15), effective:74 (2)
iterations count:1595 (55), effective:277 (9)
iterations count:186 (6), effective:23 (0)
iterations count:436 (15), effective:74 (2)
iterations count:89 (3), effective:15 (0)
iterations count:1734 (59), effective:268 (9)
iterations count:465 (16), effective:91 (3)
iterations count:238 (8), effective:31 (1)
iterations count:743 (25), effective:125 (4)
iterations count:339 (11), effective:58 (2)
iterations count:29 (1), effective:0 (0)
iterations count:34 (1), effective:1 (0)
iterations count:60 (2), effective:4 (0)
iterations count:29 (1), effective:0 (0)
iterations count:32 (1), effective:1 (0)
iterations count:32 (1), effective:1 (0)
iterations count:339 (11), effective:51 (1)
iterations count:32 (1), effective:1 (0)
iterations count:66 (2), effective:4 (0)
iterations count:32 (1), effective:1 (0)
iterations count:553 (19), effective:109 (3)
iterations count:32 (1), effective:1 (0)
iterations count:553 (19), effective:109 (3)
iterations count:553 (19), effective:80 (2)
iterations count:32 (1), effective:1 (0)
iterations count:553 (19), effective:109 (3)
iterations count:556 (19), effective:102 (3)
iterations count:1612 (55), effective:281 (9)
iterations count:556 (19), effective:102 (3)
iterations count:1612 (55), effective:281 (9)
iterations count:556 (19), effective:102 (3)
iterations count:1612 (55), effective:281 (9)
iterations count:561 (19), effective:109 (3)
iterations count:42 (1), effective:1 (0)
iterations count:561 (19), effective:109 (3)
iterations count:242 (8), effective:44 (1)
iterations count:561 (19), effective:109 (3)
iterations count:218 (7), effective:32 (1)
iterations count:29 (1), effective:0 (0)
iterations count:46 (1), effective:4 (0)
iterations count:919 (31), effective:170 (5)
iterations count:32 (1), effective:1 (0)
iterations count:32 (1), effective:1 (0)
iterations count:29 (1), effective:0 (0)
iterations count:32 (1), effective:1 (0)
iterations count:33 (1), effective:1 (0)
iterations count:30 (1), effective:1 (0)
iterations count:32 (1), effective:1 (0)
iterations count:141 (4), effective:19 (0)
iterations count:192 (6), effective:29 (1)
iterations count:30 (1), effective:1 (0)
iterations count:29 (1), effective:0 (0)
iterations count:164 (5), effective:31 (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="ShieldPPPs-PT-001A"
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 ShieldPPPs-PT-001A, 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 r394-oct2-167903717800354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-001A.tgz
mv ShieldPPPs-PT-001A 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 ;