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-167905978600182.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 ShieldRVt-PT-001A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 23:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 23:01 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.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 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 3.7K 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 ShieldRVt-PT-001A-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-001A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679346092719

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=ShieldRVt-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:01:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:01:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:01:35] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-20 21:01:35] [INFO ] Transformed 11 places.
[2023-03-20 21:01:35] [INFO ] Transformed 11 transitions.
[2023-03-20 21:01:35] [INFO ] Found NUPN structural information;
[2023-03-20 21:01:35] [INFO ] Parsed PT model containing 11 places and 11 transitions and 40 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :9
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 11 cols
[2023-03-20 21:01:35] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 21:01:35] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:01:35] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 768 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: ShieldRVt_PT_001A
(NrP: 11 NrTr: 11 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 3.184sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 25 (2.5e+01) #states 33



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

checking: EF [1<=p10]
normalized: E [true U 1<=p10]

abstracting: (1<=p10)
states: 16
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [1<=p8]
normalized: E [true U 1<=p8]

abstracting: (1<=p8)
states: 16
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p8)
states: 16
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p9<=p2)
states: 25
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[[~ [p3<=0] & p6<=0] & [[1<=p10 | 1<=p8] & ~ [p8<=p10]]] | ~ [1<=p8]]]]
normalized: E [true U ~ [[~ [1<=p8] | [[~ [p8<=p10] & [1<=p10 | 1<=p8]] & [~ [p3<=0] & p6<=0]]]]]

abstracting: (p6<=0)
states: 17
abstracting: (p3<=0)
states: 17
abstracting: (1<=p8)
states: 16
abstracting: (1<=p10)
states: 16
abstracting: (p8<=p10)
states: 25
abstracting: (1<=p8)
states: 16
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[1<=p4 | [[[p3<=1 | 1<=p7] & [[[[[p0<=p7 & 1<=p8] | ~ [p5<=1]] & p7<=1] | [p9<=1 | [[p6<=0 & 1<=p7] | ~ [1<=p3]]]] | ~ [1<=p5]]] | p2<=1]]]]
normalized: E [true U ~ [[[[[p3<=1 | 1<=p7] & [~ [1<=p5] | [[[~ [1<=p3] | [p6<=0 & 1<=p7]] | p9<=1] | [[~ [p5<=1] | [p0<=p7 & 1<=p8]] & p7<=1]]]] | p2<=1] | 1<=p4]]]

abstracting: (1<=p4)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (p7<=1)
states: 33
abstracting: (1<=p8)
states: 16
abstracting: (p0<=p7)
states: 32
abstracting: (p5<=1)
states: 33
abstracting: (p9<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p6<=0)
states: 17
abstracting: (1<=p3)
states: 16
abstracting: (1<=p5)
states: 16
abstracting: (1<=p7)
states: 16
abstracting: (p3<=1)
states: 33
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [[~ [p7<=1] | p6<=p3]] & ~ [p1<=p3]] | [~ [[[p1<=p5 | 1<=p5] | ~ [[p5<=0 & 1<=p10]]]] & ~ [[[[p8<=p7 | ~ [[p2<=p9 | ~ [1<=p5]]]] | p10<=p10] & ~ [1<=p1]]]]]]
normalized: E [true U [[~ [[~ [p7<=1] | p6<=p3]] & ~ [p1<=p3]] | [~ [[~ [[p5<=0 & 1<=p10]] | [p1<=p5 | 1<=p5]]] & ~ [[[[~ [[~ [1<=p5] | p2<=p9]] | p8<=p7] | p10<=p10] & ~ [1<=p1]]]]]]

abstracting: (1<=p1)
states: 16
abstracting: (p10<=p10)
states: 33
abstracting: (p8<=p7)
states: 17
abstracting: (p2<=p9)
states: 25
abstracting: (1<=p5)
states: 16
abstracting: (1<=p5)
states: 16
abstracting: (p1<=p5)
states: 25
abstracting: (1<=p10)
states: 16
abstracting: (p5<=0)
states: 17
abstracting: (p1<=p3)
states: 25
abstracting: (p6<=p3)
states: 25
abstracting: (p7<=1)
states: 33
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[1<=p1 | [[1<=p9 | 1<=p2] | [~ [[[[[[p6<=p9 & p3<=1] | 1<=p2] & [~ [p1<=p10] & [1<=p10 & p3<=p2]]] | [[~ [p3<=1] & ~ [p10<=p3]] | p4<=0]] | ~ [[p9<=0 | ~ [[1<=p8 & p2<=p5]]]]]] & 1<=p10]]]]
normalized: ~ [E [true U ~ [[[[~ [[[[[[1<=p10 & p3<=p2] & ~ [p1<=p10]] & [[p6<=p9 & p3<=1] | 1<=p2]] | [[~ [p10<=p3] & ~ [p3<=1]] | p4<=0]] | ~ [[~ [[1<=p8 & p2<=p5]] | p9<=0]]]] & 1<=p10] | [1<=p9 | 1<=p2]] | 1<=p1]]]]

abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p9)
states: 16
abstracting: (1<=p10)
states: 16
abstracting: (p9<=0)
states: 17
abstracting: (p2<=p5)
states: 25
abstracting: (1<=p8)
states: 16
abstracting: (p4<=0)
states: 17
abstracting: (p3<=1)
states: 33
abstracting: (p10<=p3)
states: 25
abstracting: (1<=p2)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (p6<=p9)
states: 25
abstracting: (p1<=p10)
states: 25
abstracting: (p3<=p2)
states: 25
abstracting: (1<=p10)
states: 16
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[p7<=p1 | [[[~ [[p9<=p5 & [1<=p2 & 1<=p2]]] & [[~ [[p8<=p5 & 1<=p7]] & [[p0<=p3 & p10<=p8] & [p5<=p7 & p6<=1]]] | p0<=p1]] & [p5<=p4 | p1<=p2]] | 1<=p10]] | p10<=p7]]
normalized: ~ [E [true U ~ [[[[[[p5<=p4 | p1<=p2] & [[[[[p5<=p7 & p6<=1] & [p0<=p3 & p10<=p8]] & ~ [[p8<=p5 & 1<=p7]]] | p0<=p1] & ~ [[[1<=p2 & 1<=p2] & p9<=p5]]]] | 1<=p10] | p7<=p1] | p10<=p7]]]]

abstracting: (p10<=p7)
states: 25
abstracting: (p7<=p1)
states: 25
abstracting: (1<=p10)
states: 16
abstracting: (p9<=p5)
states: 25
abstracting: (1<=p2)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (p0<=p1)
states: 32
abstracting: (1<=p7)
states: 16
abstracting: (p8<=p5)
states: 25
abstracting: (p10<=p8)
states: 25
abstracting: (p0<=p3)
states: 32
abstracting: (p6<=1)
states: 33
abstracting: (p5<=p7)
states: 25
abstracting: (p1<=p2)
states: 17
abstracting: (p5<=p4)
states: 25
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[~ [[p8<=0 | [~ [[[p6<=p10 | p10<=1] & [p3<=p8 | 1<=p4]]] & [~ [p5<=p2] | [1<=p6 & [p6<=p9 | 1<=p4]]]]]] & [[~ [[~ [1<=p6] | 1<=p5]] | 1<=p6] | ~ [[p7<=p3 & [~ [[[1<=p6 & p3<=1] | [1<=p9 | 1<=p0]]] & ~ [[[p2<=1 | 1<=p8] & [p5<=0 | p3<=p4]]]]]]]]]]
normalized: ~ [E [true U [[~ [[[~ [[[p5<=0 | p3<=p4] & [p2<=1 | 1<=p8]]] & ~ [[[1<=p9 | 1<=p0] | [1<=p6 & p3<=1]]]] & p7<=p3]] | [~ [[~ [1<=p6] | 1<=p5]] | 1<=p6]] & ~ [[[[[[p6<=p9 | 1<=p4] & 1<=p6] | ~ [p5<=p2]] & ~ [[[p3<=p8 | 1<=p4] & [p6<=p10 | p10<=1]]]] | p8<=0]]]]]

abstracting: (p8<=0)
states: 17
abstracting: (p10<=1)
states: 33
abstracting: (p6<=p10)
states: 25
abstracting: (1<=p4)
states: 16
abstracting: (p3<=p8)
states: 25
abstracting: (p5<=p2)
states: 25
abstracting: (1<=p6)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p6<=p9)
states: 25
abstracting: (1<=p6)
states: 16
abstracting: (1<=p5)
states: 16
abstracting: (1<=p6)
states: 16
abstracting: (p7<=p3)
states: 25
abstracting: (p3<=1)
states: 33
abstracting: (1<=p6)
states: 16
abstracting: (1<=p0)
states: 1
abstracting: (1<=p9)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (p3<=p4)
states: 17
abstracting: (p5<=0)
states: 17
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[[~ [1<=p8] & ~ [1<=p5]] & [[[p4<=1 & 1<=p10] | [[p5<=0 & ~ [[1<=p1 & p3<=0]]] & ~ [[[1<=p1 | 1<=p4] | [p3<=1 & 1<=p6]]]]] | [[[[~ [p1<=p0] | [p7<=p6 & p2<=0]] | [~ [p1<=1] | ~ [p8<=1]]] | p2<=1] & [p6<=1 | [[p9<=p8 | ~ [1<=p1]] & [[p0<=p5 | p5<=1] | p5<=0]]]]]] & [p5<=1 | ~ [[[~ [p8<=p6] | ~ [[~ [p3<=0] | [1<=p9 & p3<=p5]]]] & ~ [[p4<=p6 | p8<=0]]]]]] | 1<=p2]]
normalized: E [true U [[[~ [[~ [[p4<=p6 | p8<=0]] & [~ [[[1<=p9 & p3<=p5] | ~ [p3<=0]]] | ~ [p8<=p6]]]] | p5<=1] & [[[[[[[p0<=p5 | p5<=1] | p5<=0] & [~ [1<=p1] | p9<=p8]] | p6<=1] & [[[~ [p8<=1] | ~ [p1<=1]] | [[p7<=p6 & p2<=0] | ~ [p1<=p0]]] | p2<=1]] | [[~ [[[p3<=1 & 1<=p6] | [1<=p1 | 1<=p4]]] & [p5<=0 & ~ [[1<=p1 & p3<=0]]]] | [p4<=1 & 1<=p10]]] & [~ [1<=p5] & ~ [1<=p8]]]] | 1<=p2]]

abstracting: (1<=p2)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (1<=p5)
states: 16
abstracting: (1<=p10)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (p3<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p5<=0)
states: 17
abstracting: (1<=p4)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p6)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (p2<=1)
states: 33
abstracting: (p1<=p0)
states: 17
abstracting: (p2<=0)
states: 17
abstracting: (p7<=p6)
states: 25
abstracting: (p1<=1)
states: 33
abstracting: (p8<=1)
states: 33
abstracting: (p6<=1)
states: 33
abstracting: (p9<=p8)
states: 25
abstracting: (1<=p1)
states: 16
abstracting: (p5<=0)
states: 17
abstracting: (p5<=1)
states: 33
abstracting: (p0<=p5)
states: 32
abstracting: (p5<=1)
states: 33
abstracting: (p8<=p6)
states: 25
abstracting: (p3<=0)
states: 17
abstracting: (p3<=p5)
states: 25
abstracting: (1<=p9)
states: 16
abstracting: (p8<=0)
states: 17
abstracting: (p4<=p6)
states: 25
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p0<=p9 & [p5<=p4 | [p7<=p6 & [[[p1<=p6 & [[[1<=p3 | p7<=0] & ~ [1<=p9]] | 1<=p8]] & [~ [[[p8<=1 & p2<=0] | ~ [p5<=1]]] | ~ [[[p0<=p7 | p6<=p2] & [p7<=0 & p8<=p2]]]]] | [~ [[[[p7<=p7 & p4<=p6] | [1<=p7 & p3<=p0]] & p6<=p4]] | ~ [[[p10<=p6 & p6<=p1] & [[1<=p9 | 1<=p7] | ~ [p7<=p1]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[~ [[[p7<=0 & p8<=p2] & [p0<=p7 | p6<=p2]]] | ~ [[~ [p5<=1] | [p8<=1 & p2<=0]]]] & [[[~ [1<=p9] & [1<=p3 | p7<=0]] | 1<=p8] & p1<=p6]] | [~ [[[~ [p7<=p1] | [1<=p9 | 1<=p7]] & [p10<=p6 & p6<=p1]]] | ~ [[[[1<=p7 & p3<=p0] | [p7<=p7 & p4<=p6]] & p6<=p4]]]] & p7<=p6] | p5<=p4] & p0<=p9]]]]

abstracting: (p0<=p9)
states: 32
abstracting: (p5<=p4)
states: 25
abstracting: (p7<=p6)
states: 25
abstracting: (p6<=p4)
states: 25
abstracting: (p4<=p6)
states: 25
abstracting: (p7<=p7)
states: 33
abstracting: (p3<=p0)
states: 17
abstracting: (1<=p7)
states: 16
abstracting: (p6<=p1)
states: 25
abstracting: (p10<=p6)
states: 25
abstracting: (1<=p7)
states: 16
abstracting: (1<=p9)
states: 16
abstracting: (p7<=p1)
states: 25
abstracting: (p1<=p6)
states: 25
abstracting: (1<=p8)
states: 16
abstracting: (p7<=0)
states: 17
abstracting: (1<=p3)
states: 16
abstracting: (1<=p9)
states: 16
abstracting: (p2<=0)
states: 17
abstracting: (p8<=1)
states: 33
abstracting: (p5<=1)
states: 33
abstracting: (p6<=p2)
states: 25
abstracting: (p0<=p7)
states: 32
abstracting: (p8<=p2)
states: 25
abstracting: (p7<=0)
states: 17
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[1<=p6 | [[[[[[[p7<=1 & p7<=0] & [p2<=p10 & p0<=0]] & [[1<=p9 | p5<=1] & [p3<=p3 | p7<=p4]]] & ~ [p1<=p9]] & [[1<=p3 & [[p3<=1 & p9<=0] & ~ [p7<=p3]]] & [[~ [p7<=p3] & ~ [p7<=1]] | p8<=1]]] | [p1<=p7 & [[[[p2<=p1 | p6<=p2] | ~ [p0<=p8]] & p5<=p9] & [[~ [p9<=0] & [1<=p4 & p9<=1]] & p9<=p1]]]] | ~ [[[[1<=p4 | [[1<=p0 | p8<=p4] & ~ [p5<=p0]]] & 1<=p2] | ~ [p3<=0]]]]]]]
normalized: E [true U ~ [[[~ [[~ [p3<=0] | [[[~ [p5<=p0] & [1<=p0 | p8<=p4]] | 1<=p4] & 1<=p2]]] | [[[[[[1<=p4 & p9<=1] & ~ [p9<=0]] & p9<=p1] & [[~ [p0<=p8] | [p2<=p1 | p6<=p2]] & p5<=p9]] & p1<=p7] | [[[[~ [p7<=1] & ~ [p7<=p3]] | p8<=1] & [[~ [p7<=p3] & [p3<=1 & p9<=0]] & 1<=p3]] & [~ [p1<=p9] & [[[p3<=p3 | p7<=p4] & [1<=p9 | p5<=1]] & [[p2<=p10 & p0<=0] & [p7<=1 & p7<=0]]]]]]] | 1<=p6]]]

abstracting: (1<=p6)
states: 16
abstracting: (p7<=0)
states: 17
abstracting: (p7<=1)
states: 33
abstracting: (p0<=0)
states: 32
abstracting: (p2<=p10)
states: 25
abstracting: (p5<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p7<=p4)
states: 25
abstracting: (p3<=p3)
states: 33
abstracting: (p1<=p9)
states: 25
abstracting: (1<=p3)
states: 16
abstracting: (p9<=0)
states: 17
abstracting: (p3<=1)
states: 33
abstracting: (p7<=p3)
states: 25
abstracting: (p8<=1)
states: 33
abstracting: (p7<=p3)
states: 25
abstracting: (p7<=1)
states: 33
abstracting: (p1<=p7)
states: 25
abstracting: (p5<=p9)
states: 25
abstracting: (p6<=p2)
states: 25
abstracting: (p2<=p1)
states: 17
abstracting: (p0<=p8)
states: 32
abstracting: (p9<=p1)
states: 25
abstracting: (p9<=0)
states: 17
abstracting: (p9<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p8<=p4)
states: 25
abstracting: (1<=p0)
states: 1
abstracting: (p5<=p0)
states: 17
abstracting: (p3<=0)
states: 17
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[[[~ [[[[p1<=p3 | p4<=p9] | ~ [1<=p3]] & [[p9<=p3 | p4<=p6] & [1<=p3 & 1<=p3]]]] & p0<=p0] | [1<=p5 & p8<=0]] & p9<=p4] | 1<=p6] | [[[~ [[[[p0<=1 & p6<=0] & 1<=p4] | [[p5<=1 | p5<=0] & [p0<=p3 | p4<=0]]]] & p0<=p0] & [p1<=0 & p1<=1]] & [~ [[~ [p5<=p4] & [[[[p1<=p8 & p5<=1] & p10<=0] | ~ [p0<=p6]] | [[~ [p5<=p4] | [1<=p4 & p2<=p10]] & ~ [[p3<=p10 & 1<=p0]]]]]] | [[[1<=p1 | ~ [[[1<=p4 | 1<=p3] | ~ [p8<=1]]]] & p5<=p5] | [[[[[p2<=p5 | 1<=p9] & p8<=0] | ~ [p10<=0]] | p9<=0] & [~ [1<=p2] | 1<=p6]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[~ [1<=p2] | 1<=p6] & [[~ [p10<=0] | [[p2<=p5 | 1<=p9] & p8<=0]] | p9<=0]] | [[~ [[~ [p8<=1] | [1<=p4 | 1<=p3]]] | 1<=p1] & p5<=p5]] | ~ [[[[~ [[p3<=p10 & 1<=p0]] & [[1<=p4 & p2<=p10] | ~ [p5<=p4]]] | [~ [p0<=p6] | [[p1<=p8 & p5<=1] & p10<=0]]] & ~ [p5<=p4]]]] & [[p1<=0 & p1<=1] & [~ [[[[p0<=p3 | p4<=0] & [p5<=1 | p5<=0]] | [[p0<=1 & p6<=0] & 1<=p4]]] & p0<=p0]]] | [[[[1<=p5 & p8<=0] | [~ [[[[1<=p3 & 1<=p3] & [p9<=p3 | p4<=p6]] & [~ [1<=p3] | [p1<=p3 | p4<=p9]]]] & p0<=p0]] & p9<=p4] | 1<=p6]]]]]

abstracting: (1<=p6)
states: 16
abstracting: (p9<=p4)
states: 25
abstracting: (p0<=p0)
states: 33
abstracting: (p4<=p9)
states: 25
abstracting: (p1<=p3)
states: 25
abstracting: (1<=p3)
states: 16
abstracting: (p4<=p6)
states: 25
abstracting: (p9<=p3)
states: 25
abstracting: (1<=p3)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (p8<=0)
states: 17
abstracting: (1<=p5)
states: 16
abstracting: (p0<=p0)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p6<=0)
states: 17
abstracting: (p0<=1)
states: 33
abstracting: (p5<=0)
states: 17
abstracting: (p5<=1)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (p0<=p3)
states: 32
abstracting: (p1<=1)
states: 33
abstracting: (p1<=0)
states: 17
abstracting: (p5<=p4)
states: 25
abstracting: (p10<=0)
states: 17
abstracting: (p5<=1)
states: 33
abstracting: (p1<=p8)
states: 25
abstracting: (p0<=p6)
states: 32
abstracting: (p5<=p4)
states: 25
abstracting: (p2<=p10)
states: 25
abstracting: (1<=p4)
states: 16
abstracting: (1<=p0)
states: 1
abstracting: (p3<=p10)
states: 25
abstracting: (p5<=p5)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (p9<=0)
states: 17
abstracting: (p8<=0)
states: 17
abstracting: (1<=p9)
states: 16
abstracting: (p2<=p5)
states: 25
abstracting: (p10<=0)
states: 17
abstracting: (1<=p6)
states: 16
abstracting: (1<=p2)
states: 16
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[[p3<=1 | [p2<=1 & p4<=0]] & [p9<=p10 | [[[[~ [1<=p4] | [p1<=p7 | p1<=1]] | [p1<=p8 | ~ [p0<=1]]] & [~ [p3<=p7] | ~ [[p9<=1 & p0<=0]]]] & [[~ [p6<=p8] | [~ [p7<=p2] & ~ [p3<=p0]]] & p9<=p8]]]] | ~ [[[p2<=1 | [[[[1<=p1 & 1<=p3] | [1<=p5 | 1<=p1]] & [[p5<=p10 & p5<=0] & [1<=p8 & 1<=p5]]] & [[1<=p9 & [p0<=1 & 1<=p1]] | p3<=p6]]] | [[[[[p7<=0 & 1<=p6] & [1<=p6 & p10<=1]] & [1<=p0 & ~ [p4<=p6]]] & [[[1<=p4 | p2<=0] & ~ [p0<=p10]] & p3<=p7]] & [[1<=p2 | [[p2<=1 | 1<=p8] | p0<=1]] | [p8<=p6 & ~ [[p1<=p5 & p5<=p3]]]]]]]] | [~ [1<=p5] & [[p1<=p5 & [[~ [p6<=p10] & ~ [[~ [p6<=1] | [p6<=p0 | p2<=p10]]]] & [~ [p0<=p5] | [~ [p10<=p8] & [[1<=p6 | p4<=p5] & ~ [1<=p3]]]]]] & 1<=p10]]]]
normalized: E [true U [[[[[[~ [p0<=p5] | [~ [p10<=p8] & [~ [1<=p3] & [1<=p6 | p4<=p5]]]] & [~ [p6<=p10] & ~ [[~ [p6<=1] | [p6<=p0 | p2<=p10]]]]] & p1<=p5] & 1<=p10] & ~ [1<=p5]] | [[[[[[[[p1<=p7 | p1<=1] | ~ [1<=p4]] | [~ [p0<=1] | p1<=p8]] & [~ [[p9<=1 & p0<=0]] | ~ [p3<=p7]]] & [[[~ [p3<=p0] & ~ [p7<=p2]] | ~ [p6<=p8]] & p9<=p8]] | p9<=p10] & [[p2<=1 & p4<=0] | p3<=1]] | ~ [[[[[~ [[p1<=p5 & p5<=p3]] & p8<=p6] | [[[p2<=1 | 1<=p8] | p0<=1] | 1<=p2]] & [[[~ [p0<=p10] & [1<=p4 | p2<=0]] & p3<=p7] & [[~ [p4<=p6] & 1<=p0] & [[1<=p6 & p10<=1] & [p7<=0 & 1<=p6]]]]] | [[[[[p0<=1 & 1<=p1] & 1<=p9] | p3<=p6] & [[[1<=p8 & 1<=p5] & [p5<=p10 & p5<=0]] & [[1<=p5 | 1<=p1] | [1<=p1 & 1<=p3]]]] | p2<=1]]]]]]

abstracting: (p2<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (1<=p5)
states: 16
abstracting: (p5<=0)
states: 17
abstracting: (p5<=p10)
states: 25
abstracting: (1<=p5)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (p3<=p6)
states: 25
abstracting: (1<=p9)
states: 16
abstracting: (1<=p1)
states: 16
abstracting: (p0<=1)
states: 33
abstracting: (1<=p6)
states: 16
abstracting: (p7<=0)
states: 17
abstracting: (p10<=1)
states: 33
abstracting: (1<=p6)
states: 16
abstracting: (1<=p0)
states: 1
abstracting: (p4<=p6)
states: 25
abstracting: (p3<=p7)
states: 25
abstracting: (p2<=0)
states: 17
abstracting: (1<=p4)
states: 16
abstracting: (p0<=p10)
states: 32
abstracting: (1<=p2)
states: 16
abstracting: (p0<=1)
states: 33
abstracting: (1<=p8)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (p8<=p6)
states: 25
abstracting: (p5<=p3)
states: 25
abstracting: (p1<=p5)
states: 25
abstracting: (p3<=1)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (p2<=1)
states: 33
abstracting: (p9<=p10)
states: 17
abstracting: (p9<=p8)
states: 25
abstracting: (p6<=p8)
states: 25
abstracting: (p7<=p2)
states: 25
abstracting: (p3<=p0)
states: 17
abstracting: (p3<=p7)
states: 25
abstracting: (p0<=0)
states: 32
abstracting: (p9<=1)
states: 33
abstracting: (p1<=p8)
states: 25
abstracting: (p0<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (p1<=p7)
states: 25
abstracting: (1<=p5)
states: 16
abstracting: (1<=p10)
states: 16
abstracting: (p1<=p5)
states: 25
abstracting: (p2<=p10)
states: 25
abstracting: (p6<=p0)
states: 17
abstracting: (p6<=1)
states: 33
abstracting: (p6<=p10)
states: 25
abstracting: (p4<=p5)
states: 25
abstracting: (1<=p6)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (p10<=p8)
states: 25
abstracting: (p0<=p5)
states: 32
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[[[p2<=p1 & [[[[p5<=1 & 1<=p6] & p3<=1] & [[1<=p9 | 1<=p7] | [p9<=p1 | 1<=p0]]] & [1<=p6 & ~ [p4<=1]]]] & ~ [[[1<=p6 & p7<=p2] | [p4<=0 & p5<=p7]]]] | [1<=p4 & [[~ [[[1<=p6 | 1<=p2] & 1<=p1]] | p7<=0] | [~ [[[p1<=p6 & p3<=p7] & ~ [p2<=p7]]] & [[[1<=p7 | p2<=p9] | [p8<=p10 & p0<=p4]] | ~ [p10<=p0]]]]]] & [[~ [[~ [p10<=p5] & ~ [1<=p0]]] | [~ [[[~ [1<=p10] | [p6<=0 & 1<=p7]] | [[p6<=p6 & p3<=p4] & ~ [p10<=1]]]] & [[1<=p3 | [~ [1<=p7] | 1<=p3]] & [~ [[p6<=1 | 1<=p1]] | p5<=0]]]] & [~ [1<=p3] | [[p6<=1 | [p5<=p4 & [[1<=p9 | 1<=p5] | ~ [p1<=1]]]] | ~ [[p5<=1 & 1<=p4]]]]]] | [p3<=p7 | [[[[[[[p0<=p10 | p6<=p9] | [p9<=p10 | 1<=p2]] | ~ [p4<=p6]] | [[[p9<=p8 & 1<=p10] & [p0<=1 | p8<=0]] & p0<=p8]] & p8<=p10] | [p3<=p6 & [[[[p3<=0 | p10<=0] & [1<=p6 | p9<=p7]] & [~ [p5<=p8] & [p2<=0 & p7<=0]]] & [[[p8<=p7 & 1<=p10] | ~ [1<=p4]] | [p8<=p8 & p7<=p2]]]]] | p2<=p7]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p0<=1 | p8<=0] & [p9<=p8 & 1<=p10]] & p0<=p8] | [~ [p4<=p6] | [[p9<=p10 | 1<=p2] | [p0<=p10 | p6<=p9]]]] & p8<=p10] | [[[[p8<=p8 & p7<=p2] | [~ [1<=p4] | [p8<=p7 & 1<=p10]]] & [[[p2<=0 & p7<=0] & ~ [p5<=p8]] & [[1<=p6 | p9<=p7] & [p3<=0 | p10<=0]]]] & p3<=p6]] | p2<=p7] | p3<=p7] | [[[[~ [[p5<=1 & 1<=p4]] | [[[~ [p1<=1] | [1<=p9 | 1<=p5]] & p5<=p4] | p6<=1]] | ~ [1<=p3]] & [[[[~ [[p6<=1 | 1<=p1]] | p5<=0] & [[~ [1<=p7] | 1<=p3] | 1<=p3]] & ~ [[[~ [p10<=1] & [p6<=p6 & p3<=p4]] | [[p6<=0 & 1<=p7] | ~ [1<=p10]]]]] | ~ [[~ [1<=p0] & ~ [p10<=p5]]]]] & [[[[[~ [p10<=p0] | [[p8<=p10 & p0<=p4] | [1<=p7 | p2<=p9]]] & ~ [[~ [p2<=p7] & [p1<=p6 & p3<=p7]]]] | [~ [[[1<=p6 | 1<=p2] & 1<=p1]] | p7<=0]] & 1<=p4] | [~ [[[p4<=0 & p5<=p7] | [1<=p6 & p7<=p2]]] & [[[~ [p4<=1] & 1<=p6] & [[[p9<=p1 | 1<=p0] | [1<=p9 | 1<=p7]] & [[p5<=1 & 1<=p6] & p3<=1]]] & p2<=p1]]]]]]]]

abstracting: (p2<=p1)
states: 17
abstracting: (p3<=1)
states: 33
abstracting: (1<=p6)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (1<=p9)
states: 16
abstracting: (1<=p0)
states: 1
abstracting: (p9<=p1)
states: 25
abstracting: (1<=p6)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (p7<=p2)
states: 25
abstracting: (1<=p6)
states: 16
abstracting: (p5<=p7)
states: 25
abstracting: (p4<=0)
states: 17
abstracting: (1<=p4)
states: 16
abstracting: (p7<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (1<=p6)
states: 16
abstracting: (p3<=p7)
states: 25
abstracting: (p1<=p6)
states: 25
abstracting: (p2<=p7)
states: 25
abstracting: (p2<=p9)
states: 25
abstracting: (1<=p7)
states: 16
abstracting: (p0<=p4)
states: 32
abstracting: (p8<=p10)
states: 25
abstracting: (p10<=p0)
states: 17
abstracting: (p10<=p5)
states: 25
abstracting: (1<=p0)
states: 1
abstracting: (1<=p10)
states: 16
abstracting: (1<=p7)
states: 16
abstracting: (p6<=0)
states: 17
abstracting: (p3<=p4)
states: 17
abstracting: (p6<=p6)
states: 33
abstracting: (p10<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (1<=p7)
states: 16
abstracting: (p5<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (p5<=p4)
states: 25
abstracting: (1<=p5)
states: 16
abstracting: (1<=p9)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (p3<=p7)
states: 25
abstracting: (p2<=p7)
states: 25
abstracting: (p3<=p6)
states: 25
abstracting: (p10<=0)
states: 17
abstracting: (p3<=0)
states: 17
abstracting: (p9<=p7)
states: 25
abstracting: (1<=p6)
states: 16
abstracting: (p5<=p8)
states: 25
abstracting: (p7<=0)
states: 17
abstracting: (p2<=0)
states: 17
abstracting: (1<=p10)
states: 16
abstracting: (p8<=p7)
states: 17
abstracting: (1<=p4)
states: 16
abstracting: (p7<=p2)
states: 25
abstracting: (p8<=p8)
states: 33
abstracting: (p8<=p10)
states: 25
abstracting: (p6<=p9)
states: 25
abstracting: (p0<=p10)
states: 32
abstracting: (1<=p2)
states: 16
abstracting: (p9<=p10)
states: 17
abstracting: (p4<=p6)
states: 25
abstracting: (p0<=p8)
states: 32
abstracting: (1<=p10)
states: 16
abstracting: (p9<=p8)
states: 25
abstracting: (p8<=0)
states: 17
abstracting: (p0<=1)
states: 33
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1212 (1.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 700 1305 2005
used/not used/entry size/cache size: 1598 67107266 16 1024MB
basic ops cache: hits/miss/sum: 1508 3046 4554
used/not used/entry size/cache size: 5792 16771424 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: 492 269 761
used/not used/entry size/cache size: 269 8388339 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 67107666
1 1184
2 14
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.206sec


BK_STOP 1679346101341

--------------------
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 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:56 (5), effective:16 (1)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:37 (3), effective:6 (0)

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

iterations count:36 (3), effective:6 (0)

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

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

iterations count:17 (1), effective:3 (0)

iterations count:41 (3), effective:11 (1)

iterations count:33 (3), effective:8 (0)

iterations count:46 (4), effective:12 (1)

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

iterations count:45 (4), effective:12 (1)

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001A.tgz
mv ShieldRVt-PT-001A 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 ;