fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903717600194
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldIIPt-PT-002A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5451.180 9808.00 17089.00 24.80 FFFFFTFFTFFTTTFT 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-167903717600194.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 ShieldIIPt-PT-002A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 17:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 17:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 12K 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 ShieldIIPt-PT-002A-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-002A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679497753170

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=ShieldIIPt-PT-002A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:09:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:09:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:09:16] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-22 15:09:16] [INFO ] Transformed 41 places.
[2023-03-22 15:09:16] [INFO ] Transformed 31 transitions.
[2023-03-22 15:09:16] [INFO ] Found NUPN structural information;
[2023-03-22 15:09:16] [INFO ] Parsed PT model containing 41 places and 31 transitions and 126 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-002A-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 12 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 41 cols
[2023-03-22 15:09:16] [INFO ] Computed 19 place invariants in 8 ms
[2023-03-22 15:09:16] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-22 15:09:16] [INFO ] Invariant cache hit.
[2023-03-22 15:09:16] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-22 15:09:16] [INFO ] Invariant cache hit.
[2023-03-22 15:09:16] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 41/41 places, 30/30 transitions.
Support contains 41 out of 41 places after structural reductions.
[2023-03-22 15:09:16] [INFO ] Flatten gal took : 24 ms
[2023-03-22 15:09:16] [INFO ] Flatten gal took : 8 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 49) seen :47
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 15:09:17] [INFO ] Invariant cache hit.
[2023-03-22 15:09:17] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-22 15:09:17] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 41 transition count 29
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 40 transition count 29
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 4 place count 39 transition count 28
Applied a total of 4 rules in 8 ms. Remains 39 /41 variables (removed 2) and now considering 28/30 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 39/41 places, 28/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 8 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 40 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 38 transition count 28
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 36 transition count 26
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 8 place count 35 transition count 26
Applied a total of 8 rules in 4 ms. Remains 35 /41 variables (removed 6) and now considering 26/30 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 35/41 places, 26/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 26 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA ShieldIIPt-PT-002A-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 41/41 places, 30/30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:09:17] [INFO ] Input system was already deterministic with 30 transitions.
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:09:17] [INFO ] Flatten gal took : 19 ms
[2023-03-22 15:09:17] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2023-03-22 15:09:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 41 places, 30 transitions and 124 arcs took 1 ms.
Total runtime 1851 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: 41 NrTr: 30 NrArc: 124)

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

net check time: 0m 0.000sec

init dd package: 0m 3.033sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 101 (1.0e+02) #states 819,201 (5)



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

checking: EF [AG [AF [[[p22<=1 & 1<=p22] & [p39<=1 & 1<=p39]]]]]
normalized: E [true U ~ [E [true U EG [~ [[[p39<=1 & 1<=p39] & [p22<=1 & 1<=p22]]]]]]]

abstracting: (1<=p22)
states: 409,600 (5)
abstracting: (p22<=1)
states: 819,201 (5)
abstracting: (1<=p39)
states: 409,600 (5)
abstracting: (p39<=1)
states: 819,201 (5)
...........
EG iterations: 11
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [AF [[p20<=1 & 1<=p20]] | EX [EF [[AX [[[p27<=1 & 1<=p27] & [p38<=1 & 1<=p38]]] & [[p22<=0 & 0<=p22] | [p39<=0 & 0<=p39]]]]]]
normalized: [EX [E [true U [[[p39<=0 & 0<=p39] | [p22<=0 & 0<=p22]] & ~ [EX [~ [[[p38<=1 & 1<=p38] & [p27<=1 & 1<=p27]]]]]]]] | ~ [EG [~ [[p20<=1 & 1<=p20]]]]]

abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (p20<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p27)
states: 327,680 (5)
abstracting: (p27<=1)
states: 819,201 (5)
abstracting: (1<=p38)
states: 409,600 (5)
abstracting: (p38<=1)
states: 819,201 (5)
.abstracting: (0<=p22)
states: 819,201 (5)
abstracting: (p22<=0)
states: 409,601 (5)
abstracting: (0<=p39)
states: 819,201 (5)
abstracting: (p39<=0)
states: 409,601 (5)
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[AG [AX [EX [[[p24<=1 & 1<=p24] & [p35<=1 & 1<=p35]]]]] & [EF [[p33<=0 & 0<=p33]] & [[p24<=0 & 0<=p24] | [p35<=0 & 0<=p35]]]]]
normalized: E [true U [[[[p35<=0 & 0<=p35] | [p24<=0 & 0<=p24]] & E [true U [p33<=0 & 0<=p33]]] & ~ [E [true U EX [~ [EX [[[p35<=1 & 1<=p35] & [p24<=1 & 1<=p24]]]]]]]]]

abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p24<=1)
states: 819,201 (5)
abstracting: (1<=p35)
states: 409,600 (5)
abstracting: (p35<=1)
states: 819,201 (5)
..abstracting: (0<=p33)
states: 819,201 (5)
abstracting: (p33<=0)
states: 409,601 (5)
abstracting: (0<=p24)
states: 819,201 (5)
abstracting: (p24<=0)
states: 655,361 (5)
abstracting: (0<=p35)
states: 819,201 (5)
abstracting: (p35<=0)
states: 409,601 (5)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[EG [EF [[[p24<=1 & 1<=p24] & [p35<=1 & 1<=p35]]]] & AX [[[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]]]
normalized: E [true U [~ [EX [~ [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]] & EG [E [true U [[p35<=1 & 1<=p35] & [p24<=1 & 1<=p24]]]]]]

abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p24<=1)
states: 819,201 (5)
abstracting: (1<=p35)
states: 409,600 (5)
abstracting: (p35<=1)
states: 819,201 (5)

EG iterations: 0
abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p19<=1)
states: 819,201 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p21<=1)
states: 819,201 (5)
.-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [E [[[p24<=1 & 1<=p24] & [p35<=1 & 1<=p35]] U EX [[~ [[p20<=1 & 1<=p20]] & [[p24<=1 & 1<=p24] & [p35<=1 & 1<=p35]]]]]] & EF [AG [[p18<=0 & 0<=p18]]]]
normalized: [E [true U ~ [E [true U ~ [[p18<=0 & 0<=p18]]]]] & ~ [E [[[p35<=1 & 1<=p35] & [p24<=1 & 1<=p24]] U EX [[[[p35<=1 & 1<=p35] & [p24<=1 & 1<=p24]] & ~ [[p20<=1 & 1<=p20]]]]]]]

abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (p20<=1)
states: 819,201 (5)
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p24<=1)
states: 819,201 (5)
abstracting: (1<=p35)
states: 409,600 (5)
abstracting: (p35<=1)
states: 819,201 (5)
.abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p24<=1)
states: 819,201 (5)
abstracting: (1<=p35)
states: 409,600 (5)
abstracting: (p35<=1)
states: 819,201 (5)
abstracting: (0<=p18)
states: 819,201 (5)
abstracting: (p18<=0)
states: 409,601 (5)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AG [[p20<=0 & 0<=p20]] | [EG [AF [[[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]] | [[p25<=1 & 1<=p25] & [p34<=1 & 1<=p34]]]]] | AG [[p31<=1 & 1<=p31]]]]
normalized: [[~ [E [true U ~ [[p31<=1 & 1<=p31]]]] | EG [~ [EG [~ [[[[p34<=1 & 1<=p34] & [p25<=1 & 1<=p25]] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]]] | ~ [E [true U ~ [[p20<=0 & 0<=p20]]]]]

abstracting: (0<=p20)
states: 819,201 (5)
abstracting: (p20<=0)
states: 409,601 (5)
abstracting: (1<=p7)
states: 327,680 (5)
abstracting: (p7<=1)
states: 819,201 (5)
abstracting: (1<=p9)
states: 327,680 (5)
abstracting: (p9<=1)
states: 819,201 (5)
abstracting: (1<=p25)
states: 327,680 (5)
abstracting: (p25<=1)
states: 819,201 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p34<=1)
states: 819,201 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p31)
states: 409,600 (5)
abstracting: (p31<=1)
states: 819,201 (5)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [EF [[[~ [E [[[p1<=1 & 1<=p1] & [p18<=1 & 1<=p18]] U [[p32<=1 & 1<=p32] & [[p38<=1 & 1<=p38] & [p40<=1 & 1<=p40]]]]] & [p35<=1 & 1<=p35]] & [AX [[p20<=0 & 0<=p20]] & AG [[[[p22<=0 & 0<=p22] | [p39<=0 & 0<=p39]] & [p14<=0 & 0<=p14]]]]]]]
normalized: EG [E [true U [[~ [E [true U ~ [[[p14<=0 & 0<=p14] & [[p39<=0 & 0<=p39] | [p22<=0 & 0<=p22]]]]]] & ~ [EX [~ [[p20<=0 & 0<=p20]]]]] & [[p35<=1 & 1<=p35] & ~ [E [[[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]] U [[[p40<=1 & 1<=p40] & [p38<=1 & 1<=p38]] & [p32<=1 & 1<=p32]]]]]]]]

abstracting: (1<=p32)
states: 409,600 (5)
abstracting: (p32<=1)
states: 819,201 (5)
abstracting: (1<=p38)
states: 409,600 (5)
abstracting: (p38<=1)
states: 819,201 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (p40<=1)
states: 819,201 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (p1<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p18<=1)
states: 819,201 (5)
abstracting: (1<=p35)
states: 409,600 (5)
abstracting: (p35<=1)
states: 819,201 (5)
abstracting: (0<=p20)
states: 819,201 (5)
abstracting: (p20<=0)
states: 409,601 (5)
.abstracting: (0<=p22)
states: 819,201 (5)
abstracting: (p22<=0)
states: 409,601 (5)
abstracting: (0<=p39)
states: 819,201 (5)
abstracting: (p39<=0)
states: 409,601 (5)
abstracting: (0<=p14)
states: 819,201 (5)
abstracting: (p14<=0)
states: 409,601 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [E [[~ [AX [[[p30<=1 & 1<=p30] & [[p34<=1 & 1<=p34] & [p40<=1 & 1<=p40]]]]] & [[[p12<=1 & 1<=p12] & [[p37<=1 & 1<=p37] & ~ [[[p5<=1 & 1<=p5] & [p16<=1 & 1<=p16]]]]] | EF [[[p14<=1 & 1<=p14] & [p29<=1 & 1<=p29]]]]] U AX [EG [[p0<=1 & 1<=p0]]]]]]
normalized: E [true U ~ [E [[[E [true U [[p29<=1 & 1<=p29] & [p14<=1 & 1<=p14]]] | [[~ [[[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]]] & [p37<=1 & 1<=p37]] & [p12<=1 & 1<=p12]]] & EX [~ [[[[p40<=1 & 1<=p40] & [p34<=1 & 1<=p34]] & [p30<=1 & 1<=p30]]]]] U ~ [EX [~ [EG [[p0<=1 & 1<=p0]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 819,201 (5)
..
EG iterations: 2
.abstracting: (1<=p30)
states: 409,600 (5)
abstracting: (p30<=1)
states: 819,201 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p34<=1)
states: 819,201 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (p40<=1)
states: 819,201 (5)
.abstracting: (1<=p12)
states: 409,600 (5)
abstracting: (p12<=1)
states: 819,201 (5)
abstracting: (1<=p37)
states: 409,600 (5)
abstracting: (p37<=1)
states: 819,201 (5)
abstracting: (1<=p5)
states: 163,840 (5)
abstracting: (p5<=1)
states: 819,201 (5)
abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (p16<=1)
states: 819,201 (5)
abstracting: (1<=p14)
states: 409,600 (5)
abstracting: (p14<=1)
states: 819,201 (5)
abstracting: (1<=p29)
states: 409,600 (5)
abstracting: (p29<=1)
states: 819,201 (5)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [EF [[[[p11<=1 & 1<=p11] & [p15<=1 & 1<=p15]] & [[p21<=1 & 1<=p21] & [EF [[[p1<=0 & 0<=p1] | [p18<=0 & 0<=p18]]] | [EF [[[p23<=1 & 1<=p23] & [p36<=1 & 1<=p36]]] & [AF [[[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]] & EF [[[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]]]]]]]]]]
normalized: EX [E [true U [[[[[E [true U [[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]] & ~ [EG [~ [[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]]]]] & E [true U [[p36<=1 & 1<=p36] & [p23<=1 & 1<=p23]]]] | E [true U [[p18<=0 & 0<=p18] | [p1<=0 & 0<=p1]]]] & [p21<=1 & 1<=p21]] & [[p15<=1 & 1<=p15] & [p11<=1 & 1<=p11]]]]]

abstracting: (1<=p11)
states: 409,600 (5)
abstracting: (p11<=1)
states: 819,201 (5)
abstracting: (1<=p15)
states: 409,600 (5)
abstracting: (p15<=1)
states: 819,201 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p21<=1)
states: 819,201 (5)
abstracting: (0<=p1)
states: 819,201 (5)
abstracting: (p1<=0)
states: 409,601 (5)
abstracting: (0<=p18)
states: 819,201 (5)
abstracting: (p18<=0)
states: 409,601 (5)
abstracting: (1<=p23)
states: 409,600 (5)
abstracting: (p23<=1)
states: 819,201 (5)
abstracting: (1<=p36)
states: 409,600 (5)
abstracting: (p36<=1)
states: 819,201 (5)
abstracting: (1<=p8)
states: 327,680 (5)
abstracting: (p8<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p19<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p6)
states: 327,680 (5)
abstracting: (p6<=1)
states: 819,201 (5)
abstracting: (1<=p15)
states: 409,600 (5)
abstracting: (p15<=1)
states: 819,201 (5)
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [[AX [[[p3<=1 & 1<=p3] & [p20<=1 & 1<=p20]]] & [[p0<=1 & 1<=p0] | [[AG [AF [[p14<=1 & 1<=p14]]] & [p2<=1 & 1<=p2]] & [[p10<=1 & 1<=p10] & [[AF [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]] | [[p5<=1 & 1<=p5] & [p16<=1 & 1<=p16]]] & [A [[[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]] U [[p27<=1 & 1<=p27] & [p38<=1 & 1<=p38]]] | [[p14<=1 & 1<=p14] | [p18<=1 & 1<=p18]]]]]]]]]
normalized: EX [[[[[[[[[p18<=1 & 1<=p18] | [p14<=1 & 1<=p14]] | [~ [EG [~ [[[p38<=1 & 1<=p38] & [p27<=1 & 1<=p27]]]]] & ~ [E [~ [[[p38<=1 & 1<=p38] & [p27<=1 & 1<=p27]]] U [~ [[[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]] & ~ [[[p38<=1 & 1<=p38] & [p27<=1 & 1<=p27]]]]]]]] & [[[p16<=1 & 1<=p16] & [p5<=1 & 1<=p5]] | ~ [EG [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]]]] & [p10<=1 & 1<=p10]] & [[p2<=1 & 1<=p2] & ~ [E [true U EG [~ [[p14<=1 & 1<=p14]]]]]]] | [p0<=1 & 1<=p0]] & ~ [EX [~ [[[p20<=1 & 1<=p20] & [p3<=1 & 1<=p3]]]]]]]

abstracting: (1<=p3)
states: 409,600 (5)
abstracting: (p3<=1)
states: 819,201 (5)
abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (p20<=1)
states: 819,201 (5)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 819,201 (5)
abstracting: (1<=p14)
states: 409,600 (5)
abstracting: (p14<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p2)
states: 409,600 (5)
abstracting: (p2<=1)
states: 819,201 (5)
abstracting: (1<=p10)
states: 409,600 (5)
abstracting: (p10<=1)
states: 819,201 (5)
abstracting: (1<=p2)
states: 409,600 (5)
abstracting: (p2<=1)
states: 819,201 (5)
abstracting: (1<=p10)
states: 409,600 (5)
abstracting: (p10<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p5)
states: 163,840 (5)
abstracting: (p5<=1)
states: 819,201 (5)
abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (p16<=1)
states: 819,201 (5)
abstracting: (1<=p27)
states: 327,680 (5)
abstracting: (p27<=1)
states: 819,201 (5)
abstracting: (1<=p38)
states: 409,600 (5)
abstracting: (p38<=1)
states: 819,201 (5)
abstracting: (1<=p6)
states: 327,680 (5)
abstracting: (p6<=1)
states: 819,201 (5)
abstracting: (1<=p15)
states: 409,600 (5)
abstracting: (p15<=1)
states: 819,201 (5)
abstracting: (1<=p27)
states: 327,680 (5)
abstracting: (p27<=1)
states: 819,201 (5)
abstracting: (1<=p38)
states: 409,600 (5)
abstracting: (p38<=1)
states: 819,201 (5)
abstracting: (1<=p27)
states: 327,680 (5)
abstracting: (p27<=1)
states: 819,201 (5)
abstracting: (1<=p38)
states: 409,600 (5)
abstracting: (p38<=1)
states: 819,201 (5)
...............................
EG iterations: 31
abstracting: (1<=p14)
states: 409,600 (5)
abstracting: (p14<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p18<=1)
states: 819,201 (5)
.-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AF [E [[~ [A [~ [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]] U EG [[[p1<=1 & 1<=p1] & [p18<=1 & 1<=p18]]]]] & ~ [EF [[p33<=1 & 1<=p33]]]] U ~ [[[[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]] | [[AX [[p33<=1 & 1<=p33]] & A [[p18<=1 & 1<=p18] U [[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]] | [~ [EF [[[p30<=1 & 1<=p30] & [[p34<=1 & 1<=p34] & [p40<=1 & 1<=p40]]]]] & EF [[p18<=1 & 1<=p18]]]]]]]]
normalized: ~ [EG [~ [E [[~ [E [true U [p33<=1 & 1<=p33]]] & ~ [[~ [EG [~ [EG [[[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [EG [[[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]]] U [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] & ~ [EG [[[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]]]]]]]]] U ~ [[[[E [true U [p18<=1 & 1<=p18]] & ~ [E [true U [[[p40<=1 & 1<=p40] & [p34<=1 & 1<=p34]] & [p30<=1 & 1<=p30]]]]] | [[~ [EG [~ [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]] U [~ [[p18<=1 & 1<=p18]] & ~ [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]]]] & ~ [EX [~ [[p33<=1 & 1<=p33]]]]]] | [[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]]]]]]]]

abstracting: (1<=p6)
states: 327,680 (5)
abstracting: (p6<=1)
states: 819,201 (5)
abstracting: (1<=p15)
states: 409,600 (5)
abstracting: (p15<=1)
states: 819,201 (5)
abstracting: (1<=p33)
states: 409,600 (5)
abstracting: (p33<=1)
states: 819,201 (5)
.abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p19<=1)
states: 819,201 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p21<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p18<=1)
states: 819,201 (5)
abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p19<=1)
states: 819,201 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p21<=1)
states: 819,201 (5)
abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p19<=1)
states: 819,201 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p21<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p30)
states: 409,600 (5)
abstracting: (p30<=1)
states: 819,201 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p34<=1)
states: 819,201 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (p40<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p18<=1)
states: 819,201 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (p1<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p18<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p2)
states: 409,600 (5)
abstracting: (p2<=1)
states: 819,201 (5)
abstracting: (1<=p10)
states: 409,600 (5)
abstracting: (p10<=1)
states: 819,201 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (p1<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p18<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (p1<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p18<=1)
states: 819,201 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p33)
states: 409,600 (5)
abstracting: (p33<=1)
states: 819,201 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [E [[[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]] U AX [~ [[EF [[[p25<=1 & 1<=p25] & [p34<=1 & 1<=p34]]] & EG [[p0<=1 & 1<=p0]]]]]] & [EX [A [AF [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]] U ~ [EF [[[p26<=1 & 1<=p26] & [p28<=1 & 1<=p28]]]]]] | EF [[[E [[[p3<=1 & 1<=p3] & [p20<=1 & 1<=p20]] U [p16<=1 & 1<=p16]] & [[[p2<=0 & 0<=p2] | [p10<=0 & 0<=p10]] & [p39<=0 & 0<=p39]]] & [[p20<=1 & 1<=p20] & [[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]]]]]]]
normalized: [[E [true U [[[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]] & [p20<=1 & 1<=p20]] & [[[p39<=0 & 0<=p39] & [[p10<=0 & 0<=p10] | [p2<=0 & 0<=p2]]] & E [[[p20<=1 & 1<=p20] & [p3<=1 & 1<=p3]] U [p16<=1 & 1<=p16]]]]] | EX [[~ [EG [E [true U [[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]]]]] & ~ [E [E [true U [[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]]] U [EG [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]] & E [true U [[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]]]]]]]]] & E [[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]] U ~ [EX [[EG [[p0<=1 & 1<=p0]] & E [true U [[p34<=1 & 1<=p34] & [p25<=1 & 1<=p25]]]]]]]]

abstracting: (1<=p25)
states: 327,680 (5)
abstracting: (p25<=1)
states: 819,201 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p34<=1)
states: 819,201 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 819,201 (5)
..
EG iterations: 2
.abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p4<=1)
states: 819,201 (5)
abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (p17<=1)
states: 819,201 (5)
abstracting: (1<=p26)
states: 327,680 (5)
abstracting: (p26<=1)
states: 819,201 (5)
abstracting: (1<=p28)
states: 327,680 (5)
abstracting: (p28<=1)
states: 819,201 (5)
abstracting: (1<=p2)
states: 409,600 (5)
abstracting: (p2<=1)
states: 819,201 (5)
abstracting: (1<=p10)
states: 409,600 (5)
abstracting: (p10<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p26)
states: 327,680 (5)
abstracting: (p26<=1)
states: 819,201 (5)
abstracting: (1<=p28)
states: 327,680 (5)
abstracting: (p28<=1)
states: 819,201 (5)
abstracting: (1<=p26)
states: 327,680 (5)
abstracting: (p26<=1)
states: 819,201 (5)
abstracting: (1<=p28)
states: 327,680 (5)
abstracting: (p28<=1)
states: 819,201 (5)

EG iterations: 0
.abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (p16<=1)
states: 819,201 (5)
abstracting: (1<=p3)
states: 409,600 (5)
abstracting: (p3<=1)
states: 819,201 (5)
abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (p20<=1)
states: 819,201 (5)
abstracting: (0<=p2)
states: 819,201 (5)
abstracting: (p2<=0)
states: 409,601 (5)
abstracting: (0<=p10)
states: 819,201 (5)
abstracting: (p10<=0)
states: 409,601 (5)
abstracting: (0<=p39)
states: 819,201 (5)
abstracting: (p39<=0)
states: 409,601 (5)
abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (p20<=1)
states: 819,201 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p4<=1)
states: 819,201 (5)
abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (p17<=1)
states: 819,201 (5)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EF [[[AF [[[[p3<=0 & 0<=p3] | [p20<=0 & 0<=p20]] | [[p18<=1 & 1<=p18] | [[p23<=1 & 1<=p23] & [p36<=1 & 1<=p36]]]]] | [[p25<=1 & 1<=p25] & [p34<=1 & 1<=p34]]] & [AX [[p20<=1 & 1<=p20]] & [[[AF [[[p14<=1 & 1<=p14] & [p29<=1 & 1<=p29]]] & [A [[p20<=1 & 1<=p20] U [[p4<=1 & 1<=p4] & [p17<=1 & 1<=p17]]] & [[p33<=1 & 1<=p33] | [p35<=1 & 1<=p35]]]] | EF [[[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]] | [[[p8<=1 & 1<=p8] & [[p19<=1 & 1<=p19] & [p37<=1 & 1<=p37]]] | [[p27<=1 & 1<=p27] & [p38<=1 & 1<=p38]]]]]]] & EG [[[p27<=0 & 0<=p27] | [p38<=0 & 0<=p38]]]]
normalized: [EG [[[p38<=0 & 0<=p38] | [p27<=0 & 0<=p27]]] & E [true U [[[[[[p38<=1 & 1<=p38] & [p27<=1 & 1<=p27]] | [[[p37<=1 & 1<=p37] & [p19<=1 & 1<=p19]] & [p8<=1 & 1<=p8]]] | [E [true U [[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]] | [[[[p35<=1 & 1<=p35] | [p33<=1 & 1<=p33]] & [~ [EG [~ [[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]]]] & ~ [E [~ [[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]] U [~ [[p20<=1 & 1<=p20]] & ~ [[[p17<=1 & 1<=p17] & [p4<=1 & 1<=p4]]]]]]]] & ~ [EG [~ [[[p29<=1 & 1<=p29] & [p14<=1 & 1<=p14]]]]]]]] & ~ [EX [~ [[p20<=1 & 1<=p20]]]]] & [[[p34<=1 & 1<=p34] & [p25<=1 & 1<=p25]] | ~ [EG [~ [[[[[p36<=1 & 1<=p36] & [p23<=1 & 1<=p23]] | [p18<=1 & 1<=p18]] | [[p20<=0 & 0<=p20] | [p3<=0 & 0<=p3]]]]]]]]]]

abstracting: (0<=p3)
states: 819,201 (5)
abstracting: (p3<=0)
states: 409,601 (5)
abstracting: (0<=p20)
states: 819,201 (5)
abstracting: (p20<=0)
states: 409,601 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p18<=1)
states: 819,201 (5)
abstracting: (1<=p23)
states: 409,600 (5)
abstracting: (p23<=1)
states: 819,201 (5)
abstracting: (1<=p36)
states: 409,600 (5)
abstracting: (p36<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p25)
states: 327,680 (5)
abstracting: (p25<=1)
states: 819,201 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p34<=1)
states: 819,201 (5)
abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (p20<=1)
states: 819,201 (5)
.abstracting: (1<=p14)
states: 409,600 (5)
abstracting: (p14<=1)
states: 819,201 (5)
abstracting: (1<=p29)
states: 409,600 (5)
abstracting: (p29<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p4<=1)
states: 819,201 (5)
abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (p17<=1)
states: 819,201 (5)
abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (p20<=1)
states: 819,201 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p4<=1)
states: 819,201 (5)
abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (p17<=1)
states: 819,201 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p4<=1)
states: 819,201 (5)
abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (p17<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p33)
states: 409,600 (5)
abstracting: (p33<=1)
states: 819,201 (5)
abstracting: (1<=p35)
states: 409,600 (5)
abstracting: (p35<=1)
states: 819,201 (5)
abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p19<=1)
states: 819,201 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p21<=1)
states: 819,201 (5)
abstracting: (1<=p8)
states: 327,680 (5)
abstracting: (p8<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p19<=1)
states: 819,201 (5)
abstracting: (1<=p37)
states: 409,600 (5)
abstracting: (p37<=1)
states: 819,201 (5)
abstracting: (1<=p27)
states: 327,680 (5)
abstracting: (p27<=1)
states: 819,201 (5)
abstracting: (1<=p38)
states: 409,600 (5)
abstracting: (p38<=1)
states: 819,201 (5)
abstracting: (0<=p27)
states: 819,201 (5)
abstracting: (p27<=0)
states: 491,521 (5)
abstracting: (0<=p38)
states: 819,201 (5)
abstracting: (p38<=0)
states: 409,601 (5)
...............................
EG iterations: 31
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 39864 (4.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 37654 102010 139664
used/not used/entry size/cache size: 137947 66970917 16 1024MB
basic ops cache: hits/miss/sum: 9941 25480 35421
used/not used/entry size/cache size: 48314 16728902 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: 803 1536 2339
used/not used/entry size/cache size: 1536 8387072 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 67069417
1 39041
2 396
3 9
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.965sec


BK_STOP 1679497762978

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:775 (25), effective:193 (6)

initing FirstDep: 0m 0.000sec


iterations count:69 (2), effective:4 (0)

iterations count:457 (15), effective:130 (4)

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

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

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

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

iterations count:108 (3), effective:13 (0)

iterations count:144 (4), effective:25 (0)

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

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

iterations count:81 (2), effective:10 (0)

iterations count:146 (4), effective:26 (0)

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

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

iterations count:81 (2), effective:10 (0)

iterations count:238 (7), effective:54 (1)

iterations count:144 (4), effective:26 (0)

iterations count:57 (1), effective:10 (0)

iterations count:97 (3), effective:13 (0)

iterations count:71 (2), effective:15 (0)

iterations count:142 (4), effective:26 (0)

iterations count:108 (3), effective:13 (0)

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

iterations count:90 (3), effective:11 (0)

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

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

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

iterations count:90 (3), effective:11 (0)

iterations count:90 (3), effective:11 (0)

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

iterations count:90 (3), effective:11 (0)

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

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

iterations count:129 (4), effective:26 (0)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-002A"
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 ShieldIIPt-PT-002A, 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-167903717600194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-002A.tgz
mv ShieldIIPt-PT-002A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;