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-167903717600198.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600198
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-002A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679497780345

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=ReachabilityCardinality
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:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 15:09:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:09:43] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-22 15:09:43] [INFO ] Transformed 41 places.
[2023-03-22 15:09:43] [INFO ] Transformed 31 transitions.
[2023-03-22 15:09:43] [INFO ] Found NUPN structural information;
[2023-03-22 15:09:43] [INFO ] Parsed PT model containing 41 places and 31 transitions and 126 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 9) seen :6
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 30 rows 41 cols
[2023-03-22 15:09:43] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-22 15:09:43] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:09:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 36 ms returned sat
[2023-03-22 15:09:44] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-22 15:09:44] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-22 15:09:44] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 17 ms.
All properties solved without resorting to model-checking.
Total runtime 1448 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPt_PT_002A
(NrP: 41 NrTr: 31 NrArc: 126)

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

net check time: 0m 0.000sec

init dd package: 0m 2.976sec


RS generation: 0m 0.004sec


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



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

checking: AG [p20<=1]
normalized: ~ [E [true U ~ [p20<=1]]]

abstracting: (p20<=1)
states: 819,201 (5)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p16<=1]
normalized: ~ [E [true U ~ [p16<=1]]]

abstracting: (p16<=1)
states: 819,201 (5)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [p37<=0]
normalized: ~ [E [true U ~ [p37<=0]]]

abstracting: (p37<=0)
states: 409,601 (5)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [~ [p32<=p4]]
normalized: ~ [E [true U p32<=p4]]

abstracting: (p32<=p4)
states: 614,401 (5)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [p9<=p3]
normalized: ~ [E [true U ~ [p9<=p3]]]

abstracting: (p9<=p3)
states: 655,361 (5)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[p32<=p7 | [p13<=1 | ~ [[~ [[[[1<=p40 | p26<=0] | p22<=p3] | [[p14<=0 & 1<=p34] | [p6<=p38 | 1<=p4]]]] | p27<=1]]]] & [[~ [p23<=0] | 1<=p18] & p2<=0]]]
normalized: ~ [E [true U ~ [[[[~ [p23<=0] | 1<=p18] & p2<=0] & [[~ [[~ [[[[p6<=p38 | 1<=p4] | [p14<=0 & 1<=p34]] | [[1<=p40 | p26<=0] | p22<=p3]]] | p27<=1]] | p13<=1] | p32<=p7]]]]]

abstracting: (p32<=p7)
states: 573,441 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (p27<=1)
states: 819,201 (5)
abstracting: (p22<=p3)
states: 614,401 (5)
abstracting: (p26<=0)
states: 491,521 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p14<=0)
states: 409,601 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p6<=p38)
states: 655,361 (5)
abstracting: (p2<=0)
states: 409,601 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p23<=0)
states: 409,601 (5)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[p22<=p40 & [~ [1<=p21] & ~ [[[~ [[[[p16<=p25 & p4<=p17] | [1<=p4 & 1<=p12]] | ~ [1<=p23]]] | [~ [1<=p20] | [1<=p28 | 1<=p32]]] | ~ [[[~ [[p25<=0 & 1<=p6]] & ~ [p34<=p1]] & [p19<=p27 & [[1<=p18 | 1<=p39] & [p10<=0 & p11<=p27]]]]]]]]]]
normalized: E [true U [[~ [[~ [[[[[p10<=0 & p11<=p27] & [1<=p18 | 1<=p39]] & p19<=p27] & [~ [p34<=p1] & ~ [[p25<=0 & 1<=p6]]]]] | [[[1<=p28 | 1<=p32] | ~ [1<=p20]] | ~ [[~ [1<=p23] | [[1<=p4 & 1<=p12] | [p16<=p25 & p4<=p17]]]]]]] & ~ [1<=p21]] & p22<=p40]]

abstracting: (p22<=p40)
states: 614,401 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p4<=p17)
states: 614,401 (5)
abstracting: (p16<=p25)
states: 573,441 (5)
abstracting: (1<=p12)
states: 409,600 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (1<=p23)
states: 409,600 (5)
abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (1<=p32)
states: 409,600 (5)
abstracting: (1<=p28)
states: 327,680 (5)
abstracting: (1<=p6)
states: 327,680 (5)
abstracting: (p25<=0)
states: 491,521 (5)
abstracting: (p34<=p1)
states: 614,401 (5)
abstracting: (p19<=p27)
states: 573,441 (5)
abstracting: (1<=p39)
states: 409,600 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p11<=p27)
states: 573,441 (5)
abstracting: (p10<=0)
states: 409,601 (5)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [[[[~ [[[p9<=p1 | ~ [[~ [p37<=0] & ~ [p12<=0]]]] | [[[~ [p39<=p15] & [p5<=p14 & p28<=p29]] & ~ [p27<=1]] | 1<=p19]]] | [[1<=p23 | p16<=p3] & [~ [p33<=1] | 1<=p36]]] & ~ [[p7<=1 | [[~ [[p5<=p5 & 1<=p19]] | p16<=1] & p13<=1]]]] | p39<=p10]]
normalized: ~ [E [true U ~ [[[~ [[[[~ [[p5<=p5 & 1<=p19]] | p16<=1] & p13<=1] | p7<=1]] & [[[~ [p33<=1] | 1<=p36] & [1<=p23 | p16<=p3]] | ~ [[[[~ [p27<=1] & [[p5<=p14 & p28<=p29] & ~ [p39<=p15]]] | 1<=p19] | [~ [[~ [p12<=0] & ~ [p37<=0]]] | p9<=p1]]]]] | p39<=p10]]]]

abstracting: (p39<=p10)
states: 614,401 (5)
abstracting: (p9<=p1)
states: 655,361 (5)
abstracting: (p37<=0)
states: 409,601 (5)
abstracting: (p12<=0)
states: 409,601 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p39<=p15)
states: 614,401 (5)
abstracting: (p28<=p29)
states: 655,361 (5)
abstracting: (p5<=p14)
states: 737,281 (5)
abstracting: (p27<=1)
states: 819,201 (5)
abstracting: (p16<=p3)
states: 614,401 (5)
abstracting: (1<=p23)
states: 409,600 (5)
abstracting: (1<=p36)
states: 409,600 (5)
abstracting: (p33<=1)
states: 819,201 (5)
abstracting: (p7<=1)
states: 819,201 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (p16<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p5<=p5)
states: 819,201 (5)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[p2<=1 & [[[p15<=1 & [[[1<=p1 | [p23<=p25 | [p26<=1 | p18<=0]]] & [~ [p18<=p38] | p10<=p29]] | ~ [[p7<=0 & [[p28<=p5 & p31<=0] & p28<=p36]]]]] | [[~ [p23<=p13] | [p8<=1 & p31<=p16]] | [[1<=p1 & [[[p16<=p8 | p39<=1] & 1<=p9] & [~ [1<=p35] & ~ [1<=p24]]]] & 1<=p28]]] | p31<=0]]]
normalized: ~ [E [true U ~ [[p2<=1 & [[[[[[[~ [1<=p24] & ~ [1<=p35]] & [[p16<=p8 | p39<=1] & 1<=p9]] & 1<=p1] & 1<=p28] | [[p8<=1 & p31<=p16] | ~ [p23<=p13]]] | [p15<=1 & [~ [[[[p28<=p5 & p31<=0] & p28<=p36] & p7<=0]] | [[~ [p18<=p38] | p10<=p29] & [1<=p1 | [p23<=p25 | [p26<=1 | p18<=0]]]]]]] | p31<=0]]]]]

abstracting: (p31<=0)
states: 409,601 (5)
abstracting: (p18<=0)
states: 409,601 (5)
abstracting: (p26<=1)
states: 819,201 (5)
abstracting: (p23<=p25)
states: 573,441 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (p10<=p29)
states: 614,401 (5)
abstracting: (p18<=p38)
states: 614,401 (5)
abstracting: (p7<=0)
states: 491,521 (5)
abstracting: (p28<=p36)
states: 655,361 (5)
abstracting: (p31<=0)
states: 409,601 (5)
abstracting: (p28<=p5)
states: 557,057 (5)
abstracting: (p15<=1)
states: 819,201 (5)
abstracting: (p23<=p13)
states: 614,401 (5)
abstracting: (p31<=p16)
states: 614,401 (5)
abstracting: (p8<=1)
states: 819,201 (5)
abstracting: (1<=p28)
states: 327,680 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (1<=p9)
states: 327,680 (5)
abstracting: (p39<=1)
states: 819,201 (5)
abstracting: (p16<=p8)
states: 573,441 (5)
abstracting: (1<=p35)
states: 409,600 (5)
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p2<=1)
states: 819,201 (5)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[~ [[[[[[[p20<=0 & p1<=1] | ~ [p10<=0]] | [[1<=p34 & 1<=p11] & p38<=0]] | 1<=p16] | [p24<=p27 | p7<=1]] & ~ [[[p7<=p13 & p6<=p34] | ~ [[~ [p6<=p33] & ~ [p35<=1]]]]]]] | [p39<=1 | [p25<=1 | ~ [p13<=p0]]]] & [~ [[~ [1<=p24] & [[~ [[[1<=p27 & p1<=0] & [p0<=p4 | p31<=1]]] & ~ [1<=p12]] | 1<=p5]]] | ~ [p20<=p17]]]]
normalized: ~ [E [true U ~ [[[~ [[[[~ [1<=p12] & ~ [[[p0<=p4 | p31<=1] & [1<=p27 & p1<=0]]]] | 1<=p5] & ~ [1<=p24]]] | ~ [p20<=p17]] & [[[~ [p13<=p0] | p25<=1] | p39<=1] | ~ [[~ [[~ [[~ [p35<=1] & ~ [p6<=p33]]] | [p7<=p13 & p6<=p34]]] & [[p24<=p27 | p7<=1] | [[[[1<=p34 & 1<=p11] & p38<=0] | [~ [p10<=0] | [p20<=0 & p1<=1]]] | 1<=p16]]]]]]]]]

abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (p1<=1)
states: 819,201 (5)
abstracting: (p20<=0)
states: 409,601 (5)
abstracting: (p10<=0)
states: 409,601 (5)
abstracting: (p38<=0)
states: 409,601 (5)
abstracting: (1<=p11)
states: 409,600 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p7<=1)
states: 819,201 (5)
abstracting: (p24<=p27)
states: 655,361 (5)
abstracting: (p6<=p34)
states: 655,361 (5)
abstracting: (p7<=p13)
states: 655,361 (5)
abstracting: (p6<=p33)
states: 655,361 (5)
abstracting: (p35<=1)
states: 819,201 (5)
abstracting: (p39<=1)
states: 819,201 (5)
abstracting: (p25<=1)
states: 819,201 (5)
abstracting: (p13<=p0)
states: 409,601 (5)
abstracting: (p20<=p17)
states: 614,401 (5)
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (1<=p5)
states: 163,840 (5)
abstracting: (p1<=0)
states: 409,601 (5)
abstracting: (1<=p27)
states: 327,680 (5)
abstracting: (p31<=1)
states: 819,201 (5)
abstracting: (p0<=p4)
states: 819,200 (5)
abstracting: (1<=p12)
states: 409,600 (5)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [[~ [[~ [[[p9<=p34 & 1<=p13] | p9<=0]] & [~ [1<=p7] & [1<=p2 | p39<=0]]]] | p20<=1]] & [p35<=p0 & [~ [[[1<=p33 | [[[p17<=p38 & 1<=p16] & ~ [p36<=p24]] & p11<=0]] & [p8<=p34 | ~ [[p21<=1 | 1<=p34]]]]] & ~ [[[~ [[p29<=1 | p8<=p40]] | [[[p28<=p39 & p34<=0] | [p30<=p13 | 1<=p16]] & [[p31<=p38 & 1<=p28] & ~ [p36<=0]]]] | p2<=p12]]]]]]
normalized: E [true U [[[~ [[[[[~ [p36<=0] & [p31<=p38 & 1<=p28]] & [[p30<=p13 | 1<=p16] | [p28<=p39 & p34<=0]]] | ~ [[p29<=1 | p8<=p40]]] | p2<=p12]] & ~ [[[~ [[p21<=1 | 1<=p34]] | p8<=p34] & [[[~ [p36<=p24] & [p17<=p38 & 1<=p16]] & p11<=0] | 1<=p33]]]] & p35<=p0] & ~ [[~ [[[[1<=p2 | p39<=0] & ~ [1<=p7]] & ~ [[[p9<=p34 & 1<=p13] | p9<=0]]]] | p20<=1]]]]

abstracting: (p20<=1)
states: 819,201 (5)
abstracting: (p9<=0)
states: 491,521 (5)
abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (p9<=p34)
states: 655,361 (5)
abstracting: (1<=p7)
states: 327,680 (5)
abstracting: (p39<=0)
states: 409,601 (5)
abstracting: (1<=p2)
states: 409,600 (5)
abstracting: (p35<=p0)
states: 409,601 (5)
abstracting: (1<=p33)
states: 409,600 (5)
abstracting: (p11<=0)
states: 409,601 (5)
abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (p17<=p38)
states: 614,401 (5)
abstracting: (p36<=p24)
states: 491,521 (5)
abstracting: (p8<=p34)
states: 655,361 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p21<=1)
states: 819,201 (5)
abstracting: (p2<=p12)
states: 614,401 (5)
abstracting: (p8<=p40)
states: 655,361 (5)
abstracting: (p29<=1)
states: 819,201 (5)
abstracting: (p34<=0)
states: 409,601 (5)
abstracting: (p28<=p39)
states: 655,361 (5)
abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (p30<=p13)
states: 614,401 (5)
abstracting: (1<=p28)
states: 327,680 (5)
abstracting: (p31<=p38)
states: 614,401 (5)
abstracting: (p36<=0)
states: 409,601 (5)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [[~ [[1<=p6 | [[[[~ [p1<=p15] & p20<=p24] | p19<=0] | ~ [[[p9<=1 | [p4<=p15 | p24<=p2]] & [1<=p16 & ~ [1<=p24]]]]] & [[~ [[p33<=1 & p24<=0]] & [[[p17<=p23 & p16<=p18] & [p21<=p21 | p39<=p25]] & [[1<=p36 & p33<=p16] | p37<=0]]] & ~ [[p25<=p13 | [[p19<=p40 | 1<=p15] & [p39<=0 | p30<=p0]]]]]]]] | [p32<=p3 | [~ [p8<=p34] | 1<=p30]]]]
normalized: ~ [E [true U ~ [[[[~ [p8<=p34] | 1<=p30] | p32<=p3] | ~ [[[[~ [[[[p39<=0 | p30<=p0] & [p19<=p40 | 1<=p15]] | p25<=p13]] & [[[[1<=p36 & p33<=p16] | p37<=0] & [[p21<=p21 | p39<=p25] & [p17<=p23 & p16<=p18]]] & ~ [[p33<=1 & p24<=0]]]] & [~ [[[~ [1<=p24] & 1<=p16] & [[p4<=p15 | p24<=p2] | p9<=1]]] | [[~ [p1<=p15] & p20<=p24] | p19<=0]]] | 1<=p6]]]]]]

abstracting: (1<=p6)
states: 327,680 (5)
abstracting: (p19<=0)
states: 409,601 (5)
abstracting: (p20<=p24)
states: 491,521 (5)
abstracting: (p1<=p15)
states: 614,401 (5)
abstracting: (p9<=1)
states: 819,201 (5)
abstracting: (p24<=p2)
states: 737,281 (5)
abstracting: (p4<=p15)
states: 614,401 (5)
abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p24<=0)
states: 655,361 (5)
abstracting: (p33<=1)
states: 819,201 (5)
abstracting: (p16<=p18)
states: 614,401 (5)
abstracting: (p17<=p23)
states: 614,401 (5)
abstracting: (p39<=p25)
states: 573,441 (5)
abstracting: (p21<=p21)
states: 819,201 (5)
abstracting: (p37<=0)
states: 409,601 (5)
abstracting: (p33<=p16)
states: 614,401 (5)
abstracting: (1<=p36)
states: 409,600 (5)
abstracting: (p25<=p13)
states: 655,361 (5)
abstracting: (1<=p15)
states: 409,600 (5)
abstracting: (p19<=p40)
states: 614,401 (5)
abstracting: (p30<=p0)
states: 409,601 (5)
abstracting: (p39<=0)
states: 409,601 (5)
abstracting: (p32<=p3)
states: 614,401 (5)
abstracting: (1<=p30)
states: 409,600 (5)
abstracting: (p8<=p34)
states: 655,361 (5)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[[~ [1<=p15] | [[~ [[[~ [[1<=p10 & 1<=p9]] | [[p5<=p15 | p1<=p13] | p31<=p40]] | [~ [[p12<=p10 | 1<=p4]] | p9<=p30]]] & [[p35<=1 | [p34<=0 & ~ [p37<=0]]] & p20<=0]] & [p26<=p5 & [1<=p7 | [[p14<=p10 | 1<=p23] | 1<=p37]]]]] | [[~ [1<=p3] & [[[[[[1<=p29 & p27<=p6] & [1<=p25 | p4<=p40]] | p5<=1] | p25<=p24] | p28<=0] | 1<=p5]] & [[p33<=0 & p22<=1] & p21<=1]]]]
normalized: ~ [E [true U ~ [[[[[[[[p14<=p10 | 1<=p23] | 1<=p37] | 1<=p7] & p26<=p5] & [[[[~ [p37<=0] & p34<=0] | p35<=1] & p20<=0] & ~ [[[~ [[p12<=p10 | 1<=p4]] | p9<=p30] | [[[p5<=p15 | p1<=p13] | p31<=p40] | ~ [[1<=p10 & 1<=p9]]]]]]] | ~ [1<=p15]] | [[[p33<=0 & p22<=1] & p21<=1] & [[[[[[[1<=p25 | p4<=p40] & [1<=p29 & p27<=p6]] | p5<=1] | p25<=p24] | p28<=0] | 1<=p5] & ~ [1<=p3]]]]]]]

abstracting: (1<=p3)
states: 409,600 (5)
abstracting: (1<=p5)
states: 163,840 (5)
abstracting: (p28<=0)
states: 491,521 (5)
abstracting: (p25<=p24)
states: 491,521 (5)
abstracting: (p5<=1)
states: 819,201 (5)
abstracting: (p27<=p6)
states: 622,593 (5)
abstracting: (1<=p29)
states: 409,600 (5)
abstracting: (p4<=p40)
states: 614,401 (5)
abstracting: (1<=p25)
states: 327,680 (5)
abstracting: (p21<=1)
states: 819,201 (5)
abstracting: (p22<=1)
states: 819,201 (5)
abstracting: (p33<=0)
states: 409,601 (5)
abstracting: (1<=p15)
states: 409,600 (5)
abstracting: (1<=p9)
states: 327,680 (5)
abstracting: (1<=p10)
states: 409,600 (5)
abstracting: (p31<=p40)
states: 614,401 (5)
abstracting: (p1<=p13)
states: 614,401 (5)
abstracting: (p5<=p15)
states: 737,281 (5)
abstracting: (p9<=p30)
states: 655,361 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p12<=p10)
states: 614,401 (5)
abstracting: (p20<=0)
states: 409,601 (5)
abstracting: (p35<=1)
states: 819,201 (5)
abstracting: (p34<=0)
states: 409,601 (5)
abstracting: (p37<=0)
states: 409,601 (5)
abstracting: (p26<=p5)
states: 557,057 (5)
abstracting: (1<=p7)
states: 327,680 (5)
abstracting: (1<=p37)
states: 409,600 (5)
abstracting: (1<=p23)
states: 409,600 (5)
abstracting: (p14<=p10)
states: 614,401 (5)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[[[~ [[[1<=p13 & p27<=p7] & [1<=p7 & [p36<=1 | p20<=p6]]]] | p5<=0] | ~ [[[~ [[1<=p21 & p35<=0]] | ~ [p5<=p38]] | [[[p34<=p10 & p34<=p11] | [p13<=p17 & p23<=0]] & ~ [[1<=p26 & p17<=1]]]]]] & [[[[[p33<=p8 | [p2<=1 & p35<=1]] & [[p22<=0 & p40<=p23] & [1<=p0 & p20<=p27]]] & [p15<=p12 | ~ [1<=p3]]] & [~ [p4<=0] | ~ [1<=p38]]] | ~ [[p24<=1 | ~ [p27<=p40]]]]] & ~ [[1<=p33 & [[~ [p31<=1] & p31<=0] | [[1<=p21 | ~ [p8<=p21]] & ~ [[p36<=p40 | p14<=0]]]]]]]]]
normalized: E [true U ~ [[~ [[[[~ [[p36<=p40 | p14<=0]] & [~ [p8<=p21] | 1<=p21]] | [~ [p31<=1] & p31<=0]] & 1<=p33]] & [[~ [[~ [p27<=p40] | p24<=1]] | [[~ [1<=p38] | ~ [p4<=0]] & [[~ [1<=p3] | p15<=p12] & [[[1<=p0 & p20<=p27] & [p22<=0 & p40<=p23]] & [[p2<=1 & p35<=1] | p33<=p8]]]]] & [~ [[[~ [[1<=p26 & p17<=1]] & [[p13<=p17 & p23<=0] | [p34<=p10 & p34<=p11]]] | [~ [p5<=p38] | ~ [[1<=p21 & p35<=0]]]]] | [~ [[[[p36<=1 | p20<=p6] & 1<=p7] & [1<=p13 & p27<=p7]]] | p5<=0]]]]]]

abstracting: (p5<=0)
states: 655,361 (5)
abstracting: (p27<=p7)
states: 622,593 (5)
abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (1<=p7)
states: 327,680 (5)
abstracting: (p20<=p6)
states: 573,441 (5)
abstracting: (p36<=1)
states: 819,201 (5)
abstracting: (p35<=0)
states: 409,601 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p5<=p38)
states: 737,281 (5)
abstracting: (p34<=p11)
states: 614,401 (5)
abstracting: (p34<=p10)
states: 614,401 (5)
abstracting: (p23<=0)
states: 409,601 (5)
abstracting: (p13<=p17)
states: 614,401 (5)
abstracting: (p17<=1)
states: 819,201 (5)
abstracting: (1<=p26)
states: 327,680 (5)
abstracting: (p33<=p8)
states: 573,441 (5)
abstracting: (p35<=1)
states: 819,201 (5)
abstracting: (p2<=1)
states: 819,201 (5)
abstracting: (p40<=p23)
states: 614,401 (5)
abstracting: (p22<=0)
states: 409,601 (5)
abstracting: (p20<=p27)
states: 573,441 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p15<=p12)
states: 614,401 (5)
abstracting: (1<=p3)
states: 409,600 (5)
abstracting: (p4<=0)
states: 409,601 (5)
abstracting: (1<=p38)
states: 409,600 (5)
abstracting: (p24<=1)
states: 819,201 (5)
abstracting: (p27<=p40)
states: 655,361 (5)
abstracting: (1<=p33)
states: 409,600 (5)
abstracting: (p31<=0)
states: 409,601 (5)
abstracting: (p31<=1)
states: 819,201 (5)
abstracting: (1<=p21)
states: 409,600 (5)
abstracting: (p8<=p21)
states: 655,361 (5)
abstracting: (p14<=0)
states: 409,601 (5)
abstracting: (p36<=p40)
states: 614,401 (5)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[~ [[[[~ [p4<=0] & ~ [[p6<=p16 & 1<=p10]]] & [~ [[p5<=1 | 1<=p7]] | [1<=p4 & 1<=p1]]] | [~ [[~ [p9<=p36] & [p30<=1 | p21<=1]]] | [[[1<=p40 & p10<=0] | ~ [p4<=p26]] & p19<=p21]]]] & [[1<=p7 & [[1<=p4 & [~ [p19<=p18] & [p11<=0 & p33<=p19]]] | [[~ [1<=p7] & ~ [p40<=p35]] | [~ [1<=p39] | [p39<=p13 & p34<=p39]]]]] & ~ [[[~ [[1<=p25 | p26<=p20]] | [~ [p24<=p37] & [p7<=1 & 1<=p12]]] | p40<=0]]]] | p20<=1] | ~ [[[[~ [[p31<=1 | p7<=1]] & [[p10<=p11 | [[p20<=1 & p16<=p31] | 1<=p30]] | ~ [[[p19<=p22 & 1<=p20] & [p24<=0 & 1<=p9]]]]] | ~ [[[p2<=1 | p13<=1] & ~ [[[p4<=p21 & 1<=p39] | [1<=p38 & p17<=p17]]]]]] | 1<=p17]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[~ [[[1<=p38 & p17<=p17] | [p4<=p21 & 1<=p39]]] & [p2<=1 | p13<=1]]] | [[~ [[[p24<=0 & 1<=p9] & [p19<=p22 & 1<=p20]]] | [[[p20<=1 & p16<=p31] | 1<=p30] | p10<=p11]] & ~ [[p31<=1 | p7<=1]]]] | 1<=p17]] | [[[~ [[[[[p7<=1 & 1<=p12] & ~ [p24<=p37]] | ~ [[1<=p25 | p26<=p20]]] | p40<=0]] & [[[[[p39<=p13 & p34<=p39] | ~ [1<=p39]] | [~ [p40<=p35] & ~ [1<=p7]]] | [[[p11<=0 & p33<=p19] & ~ [p19<=p18]] & 1<=p4]] & 1<=p7]] & ~ [[[[[~ [p4<=p26] | [1<=p40 & p10<=0]] & p19<=p21] | ~ [[[p30<=1 | p21<=1] & ~ [p9<=p36]]]] | [[[1<=p4 & 1<=p1] | ~ [[p5<=1 | 1<=p7]]] & [~ [[p6<=p16 & 1<=p10]] & ~ [p4<=0]]]]]] | p20<=1]]]]]

abstracting: (p20<=1)
states: 819,201 (5)
abstracting: (p4<=0)
states: 409,601 (5)
abstracting: (1<=p10)
states: 409,600 (5)
abstracting: (p6<=p16)
states: 655,361 (5)
abstracting: (1<=p7)
states: 327,680 (5)
abstracting: (p5<=1)
states: 819,201 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p9<=p36)
states: 655,361 (5)
abstracting: (p21<=1)
states: 819,201 (5)
abstracting: (p30<=1)
states: 819,201 (5)
abstracting: (p19<=p21)
states: 614,401 (5)
abstracting: (p10<=0)
states: 409,601 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (p4<=p26)
states: 573,441 (5)
abstracting: (1<=p7)
states: 327,680 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (p19<=p18)
states: 409,601 (5)
abstracting: (p33<=p19)
states: 614,401 (5)
abstracting: (p11<=0)
states: 409,601 (5)
abstracting: (1<=p7)
states: 327,680 (5)
abstracting: (p40<=p35)
states: 614,401 (5)
abstracting: (1<=p39)
states: 409,600 (5)
abstracting: (p34<=p39)
states: 614,401 (5)
abstracting: (p39<=p13)
states: 614,401 (5)
abstracting: (p40<=0)
states: 409,601 (5)
abstracting: (p26<=p20)
states: 655,361 (5)
abstracting: (1<=p25)
states: 327,680 (5)
abstracting: (p24<=p37)
states: 737,281 (5)
abstracting: (1<=p12)
states: 409,600 (5)
abstracting: (p7<=1)
states: 819,201 (5)
abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (p7<=1)
states: 819,201 (5)
abstracting: (p31<=1)
states: 819,201 (5)
abstracting: (p10<=p11)
states: 409,601 (5)
abstracting: (1<=p30)
states: 409,600 (5)
abstracting: (p16<=p31)
states: 614,401 (5)
abstracting: (p20<=1)
states: 819,201 (5)
abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (p19<=p22)
states: 614,401 (5)
abstracting: (1<=p9)
states: 327,680 (5)
abstracting: (p24<=0)
states: 655,361 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (p2<=1)
states: 819,201 (5)
abstracting: (1<=p39)
states: 409,600 (5)
abstracting: (p4<=p21)
states: 614,401 (5)
abstracting: (p17<=p17)
states: 819,201 (5)
abstracting: (1<=p38)
states: 409,600 (5)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[~ [[~ [[p28<=1 & ~ [[p8<=p4 & [p30<=0 | 1<=p36]]]]] & p22<=1]] & [[~ [[[[1<=p2 & 1<=p18] & [p11<=0 & p25<=p24]] | ~ [1<=p20]]] & p34<=1] & ~ [[[[[[1<=p22 | 1<=p16] & ~ [1<=p13]] | [p22<=0 | ~ [p2<=0]]] | [[[p24<=p33 & 1<=p13] | p18<=p10] | [~ [p0<=1] & [1<=p4 | 1<=p10]]]] | ~ [[1<=p5 | [p35<=p12 | 1<=p24]]]]]]] & [[[[[[[~ [p32<=0] | ~ [p31<=p17]] & [~ [1<=p4] | p29<=p9]] & p30<=0] & [~ [[p39<=p0 & 1<=p39]] | ~ [p24<=1]]] | [p9<=p35 & p17<=0]] | [[[[[[p27<=1 | p19<=p35] & ~ [1<=p22]] | [[p31<=1 | 1<=p5] | ~ [1<=p17]]] | [~ [p1<=1] | p5<=p30]] | [[[[1<=p12 & p1<=p31] & [1<=p17 | 1<=p40]] | [[p20<=1 & p1<=0] & 1<=p32]] & [~ [1<=p4] & [[p33<=p12 | 1<=p34] | [p12<=p10 | p38<=1]]]]] | [~ [1<=p15] | p18<=p31]]] | [1<=p19 | p34<=0]]]]
normalized: E [true U [[[1<=p19 | p34<=0] | [[[~ [1<=p15] | p18<=p31] | [[[[[p12<=p10 | p38<=1] | [p33<=p12 | 1<=p34]] & ~ [1<=p4]] & [[[p20<=1 & p1<=0] & 1<=p32] | [[1<=p17 | 1<=p40] & [1<=p12 & p1<=p31]]]] | [[~ [p1<=1] | p5<=p30] | [[~ [1<=p17] | [p31<=1 | 1<=p5]] | [~ [1<=p22] & [p27<=1 | p19<=p35]]]]]] | [[p9<=p35 & p17<=0] | [[~ [p24<=1] | ~ [[p39<=p0 & 1<=p39]]] & [[[~ [1<=p4] | p29<=p9] & [~ [p31<=p17] | ~ [p32<=0]]] & p30<=0]]]]] & [[~ [[~ [[[p35<=p12 | 1<=p24] | 1<=p5]] | [[[[1<=p4 | 1<=p10] & ~ [p0<=1]] | [[p24<=p33 & 1<=p13] | p18<=p10]] | [[~ [p2<=0] | p22<=0] | [~ [1<=p13] & [1<=p22 | 1<=p16]]]]]] & [~ [[~ [1<=p20] | [[p11<=0 & p25<=p24] & [1<=p2 & 1<=p18]]]] & p34<=1]] & ~ [[~ [[~ [[[p30<=0 | 1<=p36] & p8<=p4]] & p28<=1]] & p22<=1]]]]]

abstracting: (p22<=1)
states: 819,201 (5)
abstracting: (p28<=1)
states: 819,201 (5)
abstracting: (p8<=p4)
states: 655,361 (5)
abstracting: (1<=p36)
states: 409,600 (5)
abstracting: (p30<=0)
states: 409,601 (5)
abstracting: (p34<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (1<=p2)
states: 409,600 (5)
abstracting: (p25<=p24)
states: 491,521 (5)
abstracting: (p11<=0)
states: 409,601 (5)
abstracting: (1<=p20)
states: 409,600 (5)
abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (1<=p22)
states: 409,600 (5)
abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (p22<=0)
states: 409,601 (5)
abstracting: (p2<=0)
states: 409,601 (5)
abstracting: (p18<=p10)
states: 614,401 (5)
abstracting: (1<=p13)
states: 409,600 (5)
abstracting: (p24<=p33)
states: 737,281 (5)
abstracting: (p0<=1)
states: 819,201 (5)
abstracting: (1<=p10)
states: 409,600 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (1<=p5)
states: 163,840 (5)
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p35<=p12)
states: 614,401 (5)
abstracting: (p30<=0)
states: 409,601 (5)
abstracting: (p32<=0)
states: 409,601 (5)
abstracting: (p31<=p17)
states: 614,401 (5)
abstracting: (p29<=p9)
states: 573,441 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (1<=p39)
states: 409,600 (5)
abstracting: (p39<=p0)
states: 409,601 (5)
abstracting: (p24<=1)
states: 819,201 (5)
abstracting: (p17<=0)
states: 409,601 (5)
abstracting: (p9<=p35)
states: 655,361 (5)
abstracting: (p19<=p35)
states: 614,401 (5)
abstracting: (p27<=1)
states: 819,201 (5)
abstracting: (1<=p22)
states: 409,600 (5)
abstracting: (1<=p5)
states: 163,840 (5)
abstracting: (p31<=1)
states: 819,201 (5)
abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (p5<=p30)
states: 737,281 (5)
abstracting: (p1<=1)
states: 819,201 (5)
abstracting: (p1<=p31)
states: 614,401 (5)
abstracting: (1<=p12)
states: 409,600 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (1<=p32)
states: 409,600 (5)
abstracting: (p1<=0)
states: 409,601 (5)
abstracting: (p20<=1)
states: 819,201 (5)
abstracting: (1<=p4)
states: 409,600 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p33<=p12)
states: 614,401 (5)
abstracting: (p38<=1)
states: 819,201 (5)
abstracting: (p12<=p10)
states: 614,401 (5)
abstracting: (p18<=p31)
states: 614,401 (5)
abstracting: (1<=p15)
states: 409,600 (5)
abstracting: (p34<=0)
states: 409,601 (5)
abstracting: (1<=p19)
states: 409,600 (5)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002A-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

totally nodes used: 29188 (2.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 22737 71995 94732
used/not used/entry size/cache size: 89408 67019456 16 1024MB
basic ops cache: hits/miss/sum: 13000 40317 53317
used/not used/entry size/cache size: 78465 16698751 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: 1615 3488 5103
used/not used/entry size/cache size: 3488 8385120 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 67079927
1 28686
2 251
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.784sec


BK_STOP 1679497789372

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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:795 (25), effective:193 (6)

initing FirstDep: 0m 0.000sec


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

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

iterations count:309 (9), effective:68 (2)

iterations count:51 (1), effective:7 (0)

iterations count:367 (11), effective:87 (2)

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

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

iterations count:363 (11), effective:88 (2)

iterations count:121 (3), effective:21 (0)

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

iterations count:326 (10), effective:71 (2)

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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167903717600198"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;