About the Execution of Marcie+red for ShieldRVs-PT-001A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.796 | 9066.00 | 14076.00 | 82.90 | TTTTFTTFFFTFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978300001.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-001A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978300001
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.8K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679338351438
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:33] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-20 18:52:33] [INFO ] Transformed 17 places.
[2023-03-20 18:52:33] [INFO ] Transformed 22 transitions.
[2023-03-20 18:52:33] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:33] [INFO ] Parsed PT model containing 17 places and 22 transitions and 92 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
FORMULA ShieldRVs-PT-001A-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 17 cols
[2023-03-20 18:52:33] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 18:52:33] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:34] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 17/17 places, 22/22 transitions.
Support contains 17 out of 17 places after structural reductions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 17 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 2878 steps, including 61 resets, run visited all 58 properties in 79 ms. (steps per millisecond=36 )
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17/17 places, 22/22 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 16 transition count 21
Applied a total of 2 rules in 6 ms. Remains 16 /17 variables (removed 1) and now considering 21/22 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 16/17 places, 21/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17/17 places, 22/22 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 16 transition count 21
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 21/22 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 16/17 places, 21/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17/17 places, 22/22 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 15 transition count 20
Applied a total of 2 rules in 2 ms. Remains 15 /17 variables (removed 2) and now considering 20/22 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 15/17 places, 20/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/17 places, 22/22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-20 18:52:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17 places, 22 transitions and 92 arcs took 0 ms.
Total runtime 1020 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 17 NrTr: 22 NrArc: 92)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.408sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 186 (1.9e+02) #states 171
starting MCC model checker
--------------------------
checking: EF [EX [0<=0]]
normalized: E [true U EX [0<=0]]
abstracting: (0<=0)
states: 171
.-> the formula is TRUE
FORMULA ShieldRVs-PT-001A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [EF [[p4<=0 & 0<=p4]]]
normalized: EG [E [true U [p4<=0 & 0<=p4]]]
abstracting: (0<=p4)
states: 171
abstracting: (p4<=0)
states: 136
EG iterations: 0
-> the formula is TRUE
FORMULA ShieldRVs-PT-001A-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [[[p8<=0 & 0<=p8] | [p7<=1 & 1<=p7]]]
normalized: EX [[[p7<=1 & 1<=p7] | [p8<=0 & 0<=p8]]]
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
.-> the formula is FALSE
FORMULA ShieldRVs-PT-001A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[AX [[[p15<=0 & 0<=p15] | [[p9<=1 & 1<=p9] | [p10<=0 & 0<=p10]]]] | EX [[p2<=0 & 0<=p2]]]]
normalized: ~ [EG [~ [[~ [EX [~ [[[[p10<=0 & 0<=p10] | [p9<=1 & 1<=p9]] | [p15<=0 & 0<=p15]]]]] | EX [[p2<=0 & 0<=p2]]]]]]
abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
.abstracting: (0<=p15)
states: 171
abstracting: (p15<=0)
states: 136
abstracting: (1<=p9)
states: 54
abstracting: (p9<=1)
states: 171
abstracting: (0<=p10)
states: 171
abstracting: (p10<=0)
states: 135
....
EG iterations: 3
-> the formula is TRUE
FORMULA ShieldRVs-PT-001A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AX [AF [[EF [[p14<=0 & 0<=p14]] & [[p4<=0 & 0<=p4] | EG [[[p11<=0 & 0<=p11] | [p0<=1 & 1<=p0]]]]]]]
normalized: ~ [EX [EG [~ [[E [true U [p14<=0 & 0<=p14]] & [EG [[[p0<=1 & 1<=p0] | [p11<=0 & 0<=p11]]] | [p4<=0 & 0<=p4]]]]]]]
abstracting: (0<=p4)
states: 171
abstracting: (p4<=0)
states: 136
abstracting: (0<=p11)
states: 171
abstracting: (p11<=0)
states: 136
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
...
EG iterations: 3
abstracting: (0<=p14)
states: 171
abstracting: (p14<=0)
states: 135
....
EG iterations: 4
.-> the formula is TRUE
FORMULA ShieldRVs-PT-001A-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [EF [[AX [[[p2<=0 & 0<=p2] | [[p6<=0 & 0<=p6] & [p1<=1 & 1<=p1]]]] & EF [[[p6<=0 & 0<=p6] & [p16<=1 & 1<=p16]]]]]]
normalized: EX [E [true U [E [true U [[p16<=1 & 1<=p16] & [p6<=0 & 0<=p6]]] & ~ [EX [~ [[[[p1<=1 & 1<=p1] & [p6<=0 & 0<=p6]] | [p2<=0 & 0<=p2]]]]]]]]
abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (0<=p6)
states: 171
abstracting: (p6<=0)
states: 120
abstracting: (1<=p1)
states: 82
abstracting: (p1<=1)
states: 171
.abstracting: (0<=p6)
states: 171
abstracting: (p6<=0)
states: 120
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
.-> the formula is TRUE
FORMULA ShieldRVs-PT-001A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [E [EG [A [[[p12<=0 & 0<=p12] | [p11<=1 & 1<=p11]] U [p0<=1 & 1<=p0]]] U AF [[p5<=1 & 1<=p5]]] U ~ [AF [[[p11<=0 & 0<=p11] | [p10<=1 & 1<=p10]]]]]
normalized: E [E [EG [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[[p11<=1 & 1<=p11] | [p12<=0 & 0<=p12]]] & ~ [[p0<=1 & 1<=p0]]]]]]] U ~ [EG [~ [[p5<=1 & 1<=p5]]]]] U EG [~ [[[p10<=1 & 1<=p10] | [p11<=0 & 0<=p11]]]]]
abstracting: (0<=p11)
states: 171
abstracting: (p11<=0)
states: 136
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
..........
EG iterations: 10
abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
......
EG iterations: 6
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
abstracting: (0<=p12)
states: 171
abstracting: (p12<=0)
states: 126
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
.
EG iterations: 1
..
EG iterations: 2
-> the formula is FALSE
FORMULA ShieldRVs-PT-001A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[[p9<=0 & 0<=p9] | [[E [AG [[p9<=0 & 0<=p9]] U [p2<=1 & 1<=p2]] & AX [A [[p0<=0 & 0<=p0] U [p10<=1 & 1<=p10]]]] | [EX [[[p8<=1 & 1<=p8] | [p10<=1 & 1<=p10]]] & AX [1<=0]]]]]
normalized: ~ [E [true U ~ [[[[~ [EX [~ [[~ [EG [~ [[p10<=1 & 1<=p10]]]] & ~ [E [~ [[p10<=1 & 1<=p10]] U [~ [[p0<=0 & 0<=p0]] & ~ [[p10<=1 & 1<=p10]]]]]]]]] & E [~ [E [true U ~ [[p9<=0 & 0<=p9]]]] U [p2<=1 & 1<=p2]]] | [~ [EX [~ [1<=0]]] & EX [[[p10<=1 & 1<=p10] | [p8<=1 & 1<=p8]]]]] | [p9<=0 & 0<=p9]]]]]
abstracting: (0<=p9)
states: 171
abstracting: (p9<=0)
states: 117
abstracting: (1<=p8)
states: 82
abstracting: (p8<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (0<=p9)
states: 171
abstracting: (p9<=0)
states: 117
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (0<=p0)
states: 171
abstracting: (p0<=0)
states: 170
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
........
EG iterations: 8
.-> the formula is FALSE
FORMULA ShieldRVs-PT-001A-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.036sec
checking: A [[p8<=0 & 0<=p8] U E [[[AG [[p6<=1 & 1<=p6]] | AF [[p14<=1 & 1<=p14]]] | [EF [[[p2<=0 & 0<=p2] | [p0<=1 & 1<=p0]]] | [[p12<=0 & 0<=p12] | [p16<=1 & 1<=p16]]]] U EX [EX [~ [[[p10<=0 & 0<=p10] | [p3<=1 & 1<=p3]]]]]]]
normalized: [~ [EG [~ [E [[[[[p16<=1 & 1<=p16] | [p12<=0 & 0<=p12]] | E [true U [[p0<=1 & 1<=p0] | [p2<=0 & 0<=p2]]]] | [~ [EG [~ [[p14<=1 & 1<=p14]]]] | ~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]] U EX [EX [~ [[[p10<=0 & 0<=p10] | [p3<=1 & 1<=p3]]]]]]]]] & ~ [E [~ [E [[[[[p16<=1 & 1<=p16] | [p12<=0 & 0<=p12]] | E [true U [[p0<=1 & 1<=p0] | [p2<=0 & 0<=p2]]]] | [~ [EG [~ [[p14<=1 & 1<=p14]]]] | ~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]] U EX [EX [~ [[[p10<=0 & 0<=p10] | [p3<=1 & 1<=p3]]]]]]] U [~ [[p8<=0 & 0<=p8]] & ~ [E [[[[[p16<=1 & 1<=p16] | [p12<=0 & 0<=p12]] | E [true U [[p0<=1 & 1<=p0] | [p2<=0 & 0<=p2]]]] | [~ [EG [~ [[p14<=1 & 1<=p14]]]] | ~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]] U EX [EX [~ [[[p10<=0 & 0<=p10] | [p3<=1 & 1<=p3]]]]]]]]]]]
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (0<=p10)
states: 171
abstracting: (p10<=0)
states: 135
..abstracting: (1<=p6)
states: 51
abstracting: (p6<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
........
EG iterations: 8
abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
abstracting: (0<=p12)
states: 171
abstracting: (p12<=0)
states: 126
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (0<=p10)
states: 171
abstracting: (p10<=0)
states: 135
..abstracting: (1<=p6)
states: 51
abstracting: (p6<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
........
EG iterations: 8
abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
abstracting: (0<=p12)
states: 171
abstracting: (p12<=0)
states: 126
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (0<=p10)
states: 171
abstracting: (p10<=0)
states: 135
..abstracting: (1<=p6)
states: 51
abstracting: (p6<=1)
states: 171
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
........
EG iterations: 8
abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
abstracting: (0<=p12)
states: 171
abstracting: (p12<=0)
states: 126
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVs-PT-001A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [EF [[AX [[p1<=1 & 1<=p1]] & [EX [[[p14<=0 & 0<=p14] | [p13<=1 & 1<=p13]]] & [[p7<=1 & 1<=p7] | [[p10<=1 & 1<=p10] | AF [[p7<=1 & 1<=p7]]]]]]] U ~ [EF [[~ [[[p8<=0 & 0<=p8] | [p13<=1 & 1<=p13]]] | [[EX [0<=0] & ~ [[p15<=1 & 1<=p15]]] | ~ [[p9<=0 & 0<=p9]]]]]]]
normalized: [~ [EG [E [true U [[~ [[p9<=0 & 0<=p9]] | [~ [[p15<=1 & 1<=p15]] & EX [0<=0]]] | ~ [[[p13<=1 & 1<=p13] | [p8<=0 & 0<=p8]]]]]]] & ~ [E [E [true U [[~ [[p9<=0 & 0<=p9]] | [~ [[p15<=1 & 1<=p15]] & EX [0<=0]]] | ~ [[[p13<=1 & 1<=p13] | [p8<=0 & 0<=p8]]]]] U [~ [E [true U [[[[~ [EG [~ [[p7<=1 & 1<=p7]]]] | [p10<=1 & 1<=p10]] | [p7<=1 & 1<=p7]] & EX [[[p13<=1 & 1<=p13] | [p14<=0 & 0<=p14]]]] & ~ [EX [~ [[p1<=1 & 1<=p1]]]]]]] & E [true U [[~ [[p9<=0 & 0<=p9]] | [~ [[p15<=1 & 1<=p15]] & EX [0<=0]]] | ~ [[[p13<=1 & 1<=p13] | [p8<=0 & 0<=p8]]]]]]]]]
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
abstracting: (0<=0)
states: 171
.abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (0<=p9)
states: 171
abstracting: (p9<=0)
states: 117
abstracting: (1<=p1)
states: 82
abstracting: (p1<=1)
states: 171
.abstracting: (0<=p14)
states: 171
abstracting: (p14<=0)
states: 135
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
.abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
............
EG iterations: 12
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
abstracting: (0<=0)
states: 171
.abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (0<=p9)
states: 171
abstracting: (p9<=0)
states: 117
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
abstracting: (0<=0)
states: 171
.abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (0<=p9)
states: 171
abstracting: (p9<=0)
states: 117
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldRVs-PT-001A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [AF [AX [AF [EG [[p0<=0 & 0<=p0]]]]] | EG [[EG [[[p11<=0 & 0<=p11] & [p10<=0 & 0<=p10]]] & [~ [E [[[p2<=0 & 0<=p2] & [p8<=0 & 0<=p8]] U [[p1<=0 & 0<=p1] | [p11<=1 & 1<=p11]]]] | [[[[p7<=0 & 0<=p7] | [p12<=1 & 1<=p12]] | [[p2<=0 & 0<=p2] | [p15<=1 & 1<=p15]]] & [AX [1<=0] | EG [[[p7<=0 & 0<=p7] & [p10<=1 & 1<=p10]]]]]]]]]
normalized: [EG [[[[[EG [[[p10<=1 & 1<=p10] & [p7<=0 & 0<=p7]]] | ~ [EX [~ [1<=0]]]] & [[[p15<=1 & 1<=p15] | [p2<=0 & 0<=p2]] | [[p12<=1 & 1<=p12] | [p7<=0 & 0<=p7]]]] | ~ [E [[[p8<=0 & 0<=p8] & [p2<=0 & 0<=p2]] U [[p11<=1 & 1<=p11] | [p1<=0 & 0<=p1]]]]] & EG [[[p10<=0 & 0<=p10] & [p11<=0 & 0<=p11]]]]] | ~ [EG [EX [EG [~ [EG [[p0<=0 & 0<=p0]]]]]]]]
abstracting: (0<=p0)
states: 171
abstracting: (p0<=0)
states: 170
.
EG iterations: 1
..
EG iterations: 2
..
EG iterations: 1
abstracting: (0<=p11)
states: 171
abstracting: (p11<=0)
states: 136
abstracting: (0<=p10)
states: 171
abstracting: (p10<=0)
states: 135
..............
EG iterations: 14
abstracting: (0<=p1)
states: 171
abstracting: (p1<=0)
states: 89
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (0<=p7)
states: 171
abstracting: (p7<=0)
states: 83
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
abstracting: (0<=p2)
states: 171
abstracting: (p2<=0)
states: 83
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=0)
states: 0
.abstracting: (0<=p7)
states: 171
abstracting: (p7<=0)
states: 83
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
........
EG iterations: 8
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVs-PT-001A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AF [[[[p14<=1 & 1<=p14] & [p12<=1 & 1<=p12]] & [~ [E [[p15<=0 & 0<=p15] U [[p15<=1 & 1<=p15] | [p9<=1 & 1<=p9]]]] & [AG [[AG [[[p13<=0 & 0<=p13] & [p16<=1 & 1<=p16]]] & [[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]]]] & [[p7<=0 & 0<=p7] | [EF [[[p8<=0 & 0<=p8] & [p11<=1 & 1<=p11]]] & [[p10<=1 & 1<=p10] | [[p8<=0 & 0<=p8] | [p0<=1 & 1<=p0]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[[p0<=1 & 1<=p0] | [p8<=0 & 0<=p8]] | [p10<=1 & 1<=p10]] & E [true U [[p11<=1 & 1<=p11] & [p8<=0 & 0<=p8]]]] | [p7<=0 & 0<=p7]] & ~ [E [true U ~ [[[[p1<=1 & 1<=p1] & [p16<=1 & 1<=p16]] & ~ [E [true U ~ [[[p16<=1 & 1<=p16] & [p13<=0 & 0<=p13]]]]]]]]]] & ~ [E [[p15<=0 & 0<=p15] U [[p9<=1 & 1<=p9] | [p15<=1 & 1<=p15]]]]] & [[p12<=1 & 1<=p12] & [p14<=1 & 1<=p14]]]]]]
abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
abstracting: (1<=p15)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=p9)
states: 54
abstracting: (p9<=1)
states: 171
abstracting: (0<=p15)
states: 171
abstracting: (p15<=0)
states: 136
abstracting: (0<=p13)
states: 171
abstracting: (p13<=0)
states: 117
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p1)
states: 82
abstracting: (p1<=1)
states: 171
abstracting: (0<=p7)
states: 171
abstracting: (p7<=0)
states: 83
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (1<=p10)
states: 36
abstracting: (p10<=1)
states: 171
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 171
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldRVs-PT-001A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [~ [E [[p13<=1 & 1<=p13] U [A [[p12<=1 & 1<=p12] U [p16<=1 & 1<=p16]] | [AF [[p5<=0 & 0<=p5]] | E [AF [[[p14<=0 & 0<=p14] | [p5<=1 & 1<=p5]]] U [[p9<=0 & 0<=p9] | [p11<=1 & 1<=p11]]]]]]] | ~ [E [[[~ [AX [[[p1<=0 & 0<=p1] | [p16<=1 & 1<=p16]]]] & [p3<=1 & 1<=p3]] | AX [EG [[p1<=1 & 1<=p1]]]] U [[p5<=1 & 1<=p5] & [~ [[[p5<=0 & 0<=p5] | [p7<=1 & 1<=p7]]] | [p4<=1 & 1<=p4]]]]]]
normalized: [~ [E [[p13<=1 & 1<=p13] U [[~ [EG [~ [[p5<=0 & 0<=p5]]]] | E [~ [EG [~ [[[p5<=1 & 1<=p5] | [p14<=0 & 0<=p14]]]]] U [[p11<=1 & 1<=p11] | [p9<=0 & 0<=p9]]]] | [~ [EG [~ [[p16<=1 & 1<=p16]]]] & ~ [E [~ [[p16<=1 & 1<=p16]] U [~ [[p12<=1 & 1<=p12]] & ~ [[p16<=1 & 1<=p16]]]]]]]]] | ~ [E [[~ [EX [~ [EG [[p1<=1 & 1<=p1]]]]] | [[p3<=1 & 1<=p3] & EX [~ [[[p16<=1 & 1<=p16] | [p1<=0 & 0<=p1]]]]]] U [[[p4<=1 & 1<=p4] | ~ [[[p7<=1 & 1<=p7] | [p5<=0 & 0<=p5]]]] & [p5<=1 & 1<=p5]]]]]
abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
abstracting: (0<=p5)
states: 171
abstracting: (p5<=0)
states: 136
abstracting: (1<=p7)
states: 88
abstracting: (p7<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
abstracting: (0<=p1)
states: 171
abstracting: (p1<=0)
states: 89
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
.abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
abstracting: (1<=p1)
states: 82
abstracting: (p1<=1)
states: 171
............
EG iterations: 12
.abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p12)
states: 45
abstracting: (p12<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
abstracting: (1<=p16)
states: 45
abstracting: (p16<=1)
states: 171
..............
EG iterations: 14
abstracting: (0<=p9)
states: 171
abstracting: (p9<=0)
states: 117
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (0<=p14)
states: 171
abstracting: (p14<=0)
states: 135
abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
.........
EG iterations: 9
abstracting: (0<=p5)
states: 171
abstracting: (p5<=0)
states: 136
.........
EG iterations: 9
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
-> the formula is TRUE
FORMULA ShieldRVs-PT-001A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: [EX [~ [E [[E [[p11<=1 & 1<=p11] U [[p8<=0 & 0<=p8] | [p1<=1 & 1<=p1]]] | [[p5<=1 & 1<=p5] | ~ [[p3<=1 & 1<=p3]]]] U [p11<=1 & 1<=p11]]]] | [AX [EX [[[p14<=1 & 1<=p14] | [[p3<=0 & 0<=p3] | [p9<=1 & 1<=p9]]]]] & [EG [[~ [E [[p2<=1 & 1<=p2] U [p14<=1 & 1<=p14]]] | EG [[[p7<=0 & 0<=p7] & [p4<=1 & 1<=p4]]]]] & [~ [A [AX [[[p13<=0 & 0<=p13] | [p8<=1 & 1<=p8]]] U AF [[p13<=1 & 1<=p13]]]] | [EG [[p5<=1 & 1<=p5]] & EX [[p16<=0 & 0<=p16]]]]]]]
normalized: [[[[[EX [[p16<=0 & 0<=p16]] & EG [[p5<=1 & 1<=p5]]] | ~ [[~ [EG [EG [~ [[p13<=1 & 1<=p13]]]]] & ~ [E [EG [~ [[p13<=1 & 1<=p13]]] U [EX [~ [[[p8<=1 & 1<=p8] | [p13<=0 & 0<=p13]]]] & EG [~ [[p13<=1 & 1<=p13]]]]]]]]] & EG [[EG [[[p4<=1 & 1<=p4] & [p7<=0 & 0<=p7]]] | ~ [E [[p2<=1 & 1<=p2] U [p14<=1 & 1<=p14]]]]]] & ~ [EX [~ [EX [[[[p9<=1 & 1<=p9] | [p3<=0 & 0<=p3]] | [p14<=1 & 1<=p14]]]]]]] | EX [~ [E [[[~ [[p3<=1 & 1<=p3]] | [p5<=1 & 1<=p5]] | E [[p11<=1 & 1<=p11] U [[p1<=1 & 1<=p1] | [p8<=0 & 0<=p8]]]] U [p11<=1 & 1<=p11]]]]]
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (0<=p8)
states: 171
abstracting: (p8<=0)
states: 89
abstracting: (1<=p1)
states: 82
abstracting: (p1<=1)
states: 171
abstracting: (1<=p11)
states: 35
abstracting: (p11<=1)
states: 171
abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
abstracting: (1<=p3)
states: 49
abstracting: (p3<=1)
states: 171
.abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
abstracting: (0<=p3)
states: 171
abstracting: (p3<=0)
states: 122
abstracting: (1<=p9)
states: 54
abstracting: (p9<=1)
states: 171
..abstracting: (1<=p14)
states: 36
abstracting: (p14<=1)
states: 171
abstracting: (1<=p2)
states: 88
abstracting: (p2<=1)
states: 171
abstracting: (0<=p7)
states: 171
abstracting: (p7<=0)
states: 83
abstracting: (1<=p4)
states: 35
abstracting: (p4<=1)
states: 171
.......
EG iterations: 7
...........
EG iterations: 11
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
..............
EG iterations: 14
abstracting: (0<=p13)
states: 171
abstracting: (p13<=0)
states: 117
abstracting: (1<=p8)
states: 82
abstracting: (p8<=1)
states: 171
.abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
..............
EG iterations: 14
abstracting: (1<=p13)
states: 54
abstracting: (p13<=1)
states: 171
..............
EG iterations: 14
.
EG iterations: 1
abstracting: (1<=p5)
states: 35
abstracting: (p5<=1)
states: 171
.........
EG iterations: 9
abstracting: (0<=p16)
states: 171
abstracting: (p16<=0)
states: 126
.-> the formula is FALSE
FORMULA ShieldRVs-PT-001A-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
totally nodes used: 24524 (2.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 31123 69110 100233
used/not used/entry size/cache size: 86792 67022072 16 1024MB
basic ops cache: hits/miss/sum: 15654 25262 40916
used/not used/entry size/cache size: 48015 16729201 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: 764 1074 1838
used/not used/entry size/cache size: 1074 8387534 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 67084571
1 24064
2 227
3 2
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.605sec
BK_STOP 1679338360504
--------------------
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'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:446 (20), effective:62 (2)
initing FirstDep: 0m 0.000sec
iterations count:22 (1), effective:0 (0)
iterations count:30 (1), effective:2 (0)
iterations count:30 (1), effective:1 (0)
iterations count:260 (11), effective:34 (1)
iterations count:156 (7), effective:25 (1)
iterations count:206 (9), effective:29 (1)
iterations count:22 (1), effective:0 (0)
iterations count:236 (10), effective:33 (1)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:236 (10), effective:33 (1)
iterations count:191 (8), effective:17 (0)
iterations count:115 (5), effective:18 (0)
iterations count:242 (11), effective:36 (1)
iterations count:191 (8), effective:17 (0)
iterations count:115 (5), effective:18 (0)
iterations count:242 (11), effective:36 (1)
iterations count:191 (8), effective:17 (0)
iterations count:115 (5), effective:18 (0)
iterations count:242 (11), effective:36 (1)
iterations count:45 (2), effective:5 (0)
iterations count:172 (7), effective:29 (1)
iterations count:45 (2), effective:5 (0)
iterations count:394 (17), effective:55 (2)
iterations count:45 (2), effective:5 (0)
iterations count:110 (5), effective:6 (0)
iterations count:186 (8), effective:23 (1)
iterations count:122 (5), effective:13 (0)
iterations count:22 (1), effective:0 (0)
iterations count:288 (13), effective:41 (1)
iterations count:22 (1), effective:0 (0)
iterations count:61 (2), effective:5 (0)
iterations count:79 (3), effective:11 (0)
iterations count:22 (1), effective:0 (0)
iterations count:44 (2), effective:4 (0)
iterations count:265 (12), effective:35 (1)
iterations count:94 (4), effective:14 (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="ShieldRVs-PT-001A"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVs-PT-001A, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978300001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-001A.tgz
mv ShieldRVs-PT-001A execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;