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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:22 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.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 26 18:23 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 13K 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-001B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-001B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679338351846

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=ShieldRVs-PT-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:34] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-20 18:52:34] [INFO ] Transformed 43 places.
[2023-03-20 18:52:34] [INFO ] Transformed 48 transitions.
[2023-03-20 18:52:34] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:34] [INFO ] Parsed PT model containing 43 places and 48 transitions and 144 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 25 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 11) seen :5
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 48 rows 43 cols
[2023-03-20 18:52:35] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-20 18:52:36] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-20 18:52:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-20 18:52:36] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2023-03-20 18:52:36] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-20 18:52:36] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 48/48 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 43 transition count 44
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 39 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 38 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 38 transition count 39
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 34 transition count 39
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 24 place count 28 transition count 33
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 28 transition count 33
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 30 place count 28 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 26 transition count 31
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 20 transition count 25
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 20 transition count 25
Applied a total of 48 rules in 45 ms. Remains 20 /43 variables (removed 23) and now considering 25/48 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 20/43 places, 25/48 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Probably explored full state space saw : 230 states, properties seen :0
Probabilistic random walk after 787 steps, saw 230 distinct states, run finished after 28 ms. (steps per millisecond=28 ) properties seen :0
Explored full state space saw : 230 states, properties seen :0
Exhaustive walk after 787 steps, saw 230 distinct states, run finished after 3 ms. (steps per millisecond=262 ) properties seen :0
FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 2752 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: ShieldRVs_PT_001B
(NrP: 43 NrTr: 48 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 3.424sec


RS generation: 0m 0.020sec


-> reachability set: #nodes 907 (9.1e+02) #states 3,596 (3)



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

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

abstracting: (p39<=1)
states: 3,596 (3)
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p25<=0)
states: 3,236 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[~ [1<=p2] | p38<=1]]
normalized: ~ [E [true U ~ [[~ [1<=p2] | p38<=1]]]]

abstracting: (p38<=1)
states: 3,596 (3)
abstracting: (1<=p2)
states: 1,057 (3)
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[1<=p38 & p15<=0]]
normalized: E [true U [1<=p38 & p15<=0]]

abstracting: (p15<=0)
states: 3,053 (3)
abstracting: (1<=p38)
states: 408
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AG [p7<=p19]
normalized: ~ [E [true U ~ [p7<=p19]]]

abstracting: (p7<=p19)
states: 3,565 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [p2<=p35]]
normalized: E [true U ~ [p2<=p35]]

abstracting: (p2<=p35)
states: 2,718 (3)
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[~ [1<=p23] | ~ [[1<=p31 & [[[1<=p2 & p11<=0] | p16<=p33] | ~ [[[p3<=0 | p12<=p32] & [1<=p26 | p10<=1]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[[1<=p26 | p10<=1] & [p3<=0 | p12<=p32]]] | [[1<=p2 & p11<=0] | p16<=p33]] & 1<=p31]] | ~ [1<=p23]]]]]

abstracting: (1<=p23)
states: 431
abstracting: (1<=p31)
states: 36
abstracting: (p16<=p33)
states: 3,101 (3)
abstracting: (p11<=0)
states: 3,261 (3)
abstracting: (1<=p2)
states: 1,057 (3)
abstracting: (p12<=p32)
states: 3,282 (3)
abstracting: (p3<=0)
states: 2,321 (3)
abstracting: (p10<=1)
states: 3,596 (3)
abstracting: (1<=p26)
states: 410
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[1<=p25 & [[~ [[[[p24<=1 & p21<=p25] | p38<=p29] | p32<=p37]] & ~ [1<=p16]] & p13<=1]] & ~ [p9<=0]]]
normalized: E [true U [~ [p9<=0] & [[[~ [1<=p16] & ~ [[[[p24<=1 & p21<=p25] | p38<=p29] | p32<=p37]]] & p13<=1] & 1<=p25]]]

abstracting: (1<=p25)
states: 360
abstracting: (p13<=1)
states: 3,596 (3)
abstracting: (p32<=p37)
states: 3,559 (3)
abstracting: (p38<=p29)
states: 3,256 (3)
abstracting: (p21<=p25)
states: 2,578 (3)
abstracting: (p24<=1)
states: 3,596 (3)
abstracting: (1<=p16)
states: 543
abstracting: (p9<=0)
states: 3,101 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[~ [p20<=0] | ~ [[1<=p39 | [[p37<=p20 | ~ [[p35<=1 | p13<=1]]] & ~ [[[p41<=1 & 1<=p34] & [p13<=1 | 1<=p24]]]]]]] & [1<=p1 & 1<=p22]]]
normalized: E [true U [[1<=p1 & 1<=p22] & [~ [[1<=p39 | [~ [[[p13<=1 | 1<=p24] & [p41<=1 & 1<=p34]]] & [p37<=p20 | ~ [[p35<=1 | p13<=1]]]]]] | ~ [p20<=0]]]]

abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (p13<=1)
states: 3,596 (3)
abstracting: (p35<=1)
states: 3,596 (3)
abstracting: (p37<=p20)
states: 3,356 (3)
abstracting: (1<=p34)
states: 559
abstracting: (p41<=1)
states: 3,596 (3)
abstracting: (1<=p24)
states: 595
abstracting: (p13<=1)
states: 3,596 (3)
abstracting: (1<=p39)
states: 299
abstracting: (1<=p22)
states: 36
abstracting: (1<=p1)
states: 1,263 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[[~ [[[~ [1<=p19] | [p9<=1 | [p21<=p13 & 1<=p35]]] | p13<=0]] & [p1<=1 & ~ [[[~ [p14<=1] | [1<=p41 | 1<=p29]] & ~ [[p1<=1 | 1<=p10]]]]]] & ~ [p40<=1]]]]
normalized: ~ [E [true U [~ [p40<=1] & [[p1<=1 & ~ [[~ [[p1<=1 | 1<=p10]] & [[1<=p41 | 1<=p29] | ~ [p14<=1]]]]] & ~ [[p13<=0 | [[p9<=1 | [p21<=p13 & 1<=p35]] | ~ [1<=p19]]]]]]]]

abstracting: (1<=p19)
states: 1,018 (3)
abstracting: (1<=p35)
states: 559
abstracting: (p21<=p13)
states: 2,600 (3)
abstracting: (p9<=1)
states: 3,596 (3)
abstracting: (p13<=0)
states: 3,282 (3)
abstracting: (p14<=1)
states: 3,596 (3)
abstracting: (1<=p29)
states: 467
abstracting: (1<=p41)
states: 361
abstracting: (1<=p10)
states: 495
abstracting: (p1<=1)
states: 3,596 (3)
abstracting: (p1<=1)
states: 3,596 (3)
abstracting: (p40<=1)
states: 3,596 (3)
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[1<=p6 & 1<=p31] | [p34<=p17 & [~ [[p16<=p38 & 1<=p29]] | [~ [p4<=0] & [p28<=p14 & ~ [[~ [p31<=p36] | ~ [1<=p23]]]]]]]]]
normalized: E [true U [[p34<=p17 & [[[p28<=p14 & ~ [[~ [1<=p23] | ~ [p31<=p36]]]] & ~ [p4<=0]] | ~ [[p16<=p38 & 1<=p29]]]] | [1<=p6 & 1<=p31]]]

abstracting: (1<=p31)
states: 36
abstracting: (1<=p6)
states: 4
abstracting: (1<=p29)
states: 467
abstracting: (p16<=p38)
states: 3,116 (3)
abstracting: (p4<=0)
states: 3,595 (3)
abstracting: (p31<=p36)
states: 3,560 (3)
abstracting: (1<=p23)
states: 431
abstracting: (p28<=p14)
states: 3,290 (3)
abstracting: (p34<=p17)
states: 3,049 (3)
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [~ [[[~ [p25<=1] | [~ [[~ [p26<=p30] | p21<=0]] & [1<=p8 | p17<=0]]] | [1<=p29 & [[[[p8<=p8 | p17<=1] & ~ [p37<=p26]] | [[p14<=1 & 1<=p20] | 1<=p26]] & p18<=p32]]]]]
normalized: ~ [E [true U [[1<=p29 & [p18<=p32 & [[1<=p26 | [p14<=1 & 1<=p20]] | [~ [p37<=p26] & [p8<=p8 | p17<=1]]]]] | [[[1<=p8 | p17<=0] & ~ [[p21<=0 | ~ [p26<=p30]]]] | ~ [p25<=1]]]]]

abstracting: (p25<=1)
states: 3,596 (3)
abstracting: (p26<=p30)
states: 3,186 (3)
abstracting: (p21<=0)
states: 2,482 (3)
abstracting: (p17<=0)
states: 3,513 (3)
abstracting: (1<=p8)
states: 83
abstracting: (p17<=1)
states: 3,596 (3)
abstracting: (p8<=p8)
states: 3,596 (3)
abstracting: (p37<=p26)
states: 3,298 (3)
abstracting: (1<=p20)
states: 1,212 (3)
abstracting: (p14<=1)
states: 3,596 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p18<=p32)
states: 3,398 (3)
abstracting: (1<=p29)
states: 467
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[[[[1<=p6 & p34<=p21] | [p42<=1 & [[[~ [[p30<=0 & p5<=p9]] & p4<=1] | ~ [p5<=0]] & [[[p32<=0 | p3<=p31] & [~ [p11<=1] | p22<=p25]] | [[[1<=p21 | p2<=0] | [p33<=p42 & 1<=p14]] & [[p4<=p32 | p23<=1] | p15<=p18]]]]]] | p29<=1] | [1<=p42 & p9<=p36]]]
normalized: E [true U [[1<=p42 & p9<=p36] | [p29<=1 | [[p42<=1 & [[[[p15<=p18 | [p4<=p32 | p23<=1]] & [[p33<=p42 & 1<=p14] | [1<=p21 | p2<=0]]] | [[p22<=p25 | ~ [p11<=1]] & [p32<=0 | p3<=p31]]] & [~ [p5<=0] | [p4<=1 & ~ [[p30<=0 & p5<=p9]]]]]] | [1<=p6 & p34<=p21]]]]]

abstracting: (p34<=p21)
states: 3,217 (3)
abstracting: (1<=p6)
states: 4
abstracting: (p5<=p9)
states: 3,595 (3)
abstracting: (p30<=0)
states: 3,129 (3)
abstracting: (p4<=1)
states: 3,596 (3)
abstracting: (p5<=0)
states: 3,595 (3)
abstracting: (p3<=p31)
states: 2,321 (3)
abstracting: (p32<=0)
states: 3,559 (3)
abstracting: (p11<=1)
states: 3,596 (3)
abstracting: (p22<=p25)
states: 3,560 (3)
abstracting: (p2<=0)
states: 2,539 (3)
abstracting: (1<=p21)
states: 1,114 (3)
abstracting: (1<=p14)
states: 353
abstracting: (p33<=p42)
states: 3,272 (3)
abstracting: (p23<=1)
states: 3,596 (3)
abstracting: (p4<=p32)
states: 3,595 (3)
abstracting: (p15<=p18)
states: 3,102 (3)
abstracting: (p42<=1)
states: 3,596 (3)
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (p9<=p36)
states: 3,144 (3)
abstracting: (1<=p42)
states: 37
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [~ [[[[~ [[[[p0<=p19 | [p40<=p39 | p3<=1]] | [p1<=1 | [1<=p26 | p14<=p8]]] | [~ [[p13<=0 | 1<=p42]] | [[1<=p21 & 1<=p15] & [1<=p39 | p23<=p22]]]]] | [[~ [[[1<=p25 | p19<=p27] & [1<=p15 & p15<=1]]] | [[p35<=0 & 1<=p0] & [~ [1<=p30] & [p2<=p22 & 1<=p7]]]] & ~ [[~ [p27<=1] & [[1<=p27 & p5<=p0] & [1<=p40 & p40<=p22]]]]]] & p13<=p15] | p9<=0]]]
normalized: E [true U ~ [[p9<=0 | [p13<=p15 & [[~ [[[[1<=p40 & p40<=p22] & [1<=p27 & p5<=p0]] & ~ [p27<=1]]] & [[[[p2<=p22 & 1<=p7] & ~ [1<=p30]] & [p35<=0 & 1<=p0]] | ~ [[[1<=p15 & p15<=1] & [1<=p25 | p19<=p27]]]]] | ~ [[[[[1<=p39 | p23<=p22] & [1<=p21 & 1<=p15]] | ~ [[p13<=0 | 1<=p42]]] | [[p1<=1 | [1<=p26 | p14<=p8]] | [p0<=p19 | [p40<=p39 | p3<=1]]]]]]]]]]

abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (p40<=p39)
states: 3,235 (3)
abstracting: (p0<=p19)
states: 3,595 (3)
abstracting: (p14<=p8)
states: 3,243 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p1<=1)
states: 3,596 (3)
abstracting: (1<=p42)
states: 37
abstracting: (p13<=0)
states: 3,282 (3)
abstracting: (1<=p15)
states: 543
abstracting: (1<=p21)
states: 1,114 (3)
abstracting: (p23<=p22)
states: 3,165 (3)
abstracting: (1<=p39)
states: 299
abstracting: (p19<=p27)
states: 2,744 (3)
abstracting: (1<=p25)
states: 360
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (1<=p15)
states: 543
abstracting: (1<=p0)
states: 1
abstracting: (p35<=0)
states: 3,037 (3)
abstracting: (1<=p30)
states: 467
abstracting: (1<=p7)
states: 31
abstracting: (p2<=p22)
states: 2,539 (3)
abstracting: (p27<=1)
states: 3,596 (3)
abstracting: (p5<=p0)
states: 3,595 (3)
abstracting: (1<=p27)
states: 434
abstracting: (p40<=p22)
states: 3,244 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p13<=p15)
states: 3,282 (3)
abstracting: (p9<=0)
states: 3,101 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[[1<=p15 & 1<=p19] & [[~ [[~ [[~ [p40<=0] & p15<=1]] | [~ [[~ [p23<=p20] | p0<=p5]] & [~ [[p25<=1 | p5<=p26]] | [[p28<=p32 & p4<=p18] & [p29<=1 & 1<=p23]]]]]] & [[p10<=p40 | [[~ [p30<=p9] | [[1<=p38 & 1<=p25] & [p8<=p12 & p2<=0]]] | ~ [1<=p18]]] & [p11<=1 & p30<=p11]]] & [~ [[~ [[1<=p35 | [p11<=p13 | 1<=p24]]] | p15<=0]] & [~ [[p6<=1 | 1<=p26]] | [~ [[1<=p15 | ~ [p41<=p8]]] & [p42<=p28 | [[[1<=p8 | p35<=p10] & [p0<=0 & p0<=1]] | [p28<=0 | ~ [p10<=0]]]]]]]]]]
normalized: E [true U [[[[[[p42<=p28 | [[p28<=0 | ~ [p10<=0]] | [[p0<=0 & p0<=1] & [1<=p8 | p35<=p10]]]] & ~ [[1<=p15 | ~ [p41<=p8]]]] | ~ [[p6<=1 | 1<=p26]]] & ~ [[p15<=0 | ~ [[1<=p35 | [p11<=p13 | 1<=p24]]]]]] & [[[p11<=1 & p30<=p11] & [p10<=p40 | [~ [1<=p18] | [[[p8<=p12 & p2<=0] & [1<=p38 & 1<=p25]] | ~ [p30<=p9]]]]] & ~ [[[[[[p29<=1 & 1<=p23] & [p28<=p32 & p4<=p18]] | ~ [[p25<=1 | p5<=p26]]] & ~ [[p0<=p5 | ~ [p23<=p20]]]] | ~ [[p15<=1 & ~ [p40<=0]]]]]]] & [1<=p15 & 1<=p19]]]

abstracting: (1<=p19)
states: 1,018 (3)
abstracting: (1<=p15)
states: 543
abstracting: (p40<=0)
states: 3,235 (3)
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (p23<=p20)
states: 3,321 (3)
abstracting: (p0<=p5)
states: 3,595 (3)
abstracting: (p5<=p26)
states: 3,595 (3)
abstracting: (p25<=1)
states: 3,596 (3)
abstracting: (p4<=p18)
states: 3,595 (3)
abstracting: (p28<=p32)
states: 3,243 (3)
abstracting: (1<=p23)
states: 431
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (p30<=p9)
states: 3,192 (3)
abstracting: (1<=p25)
states: 360
abstracting: (1<=p38)
states: 408
abstracting: (p2<=0)
states: 2,539 (3)
abstracting: (p8<=p12)
states: 3,513 (3)
abstracting: (1<=p18)
states: 214
abstracting: (p10<=p40)
states: 3,149 (3)
abstracting: (p30<=p11)
states: 3,178 (3)
abstracting: (p11<=1)
states: 3,596 (3)
abstracting: (1<=p24)
states: 595
abstracting: (p11<=p13)
states: 3,261 (3)
abstracting: (1<=p35)
states: 559
abstracting: (p15<=0)
states: 3,053 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p6<=1)
states: 3,596 (3)
abstracting: (p41<=p8)
states: 3,248 (3)
abstracting: (1<=p15)
states: 543
abstracting: (p35<=p10)
states: 3,113 (3)
abstracting: (1<=p8)
states: 83
abstracting: (p0<=1)
states: 3,596 (3)
abstracting: (p0<=0)
states: 3,595 (3)
abstracting: (p10<=0)
states: 3,101 (3)
abstracting: (p28<=0)
states: 3,243 (3)
abstracting: (p42<=p28)
states: 3,559 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[[[~ [[[[[p1<=p15 | [p32<=p7 & p24<=1]] & [[1<=p31 & 1<=p25] & 1<=p35]] & [~ [p34<=0] | [[1<=p38 | p30<=0] & p8<=0]]] | ~ [[~ [p16<=p20] | [[p42<=p18 | 1<=p12] | [1<=p23 & 1<=p41]]]]]] | [1<=p36 | p12<=0]] | [p23<=p23 & ~ [[~ [[p31<=0 | [p24<=1 | p13<=1]]] | p29<=p16]]]] | [[[[[[~ [[p6<=p18 & 1<=p4]] | ~ [[p41<=0 | p11<=p2]]] | 1<=p8] & [[1<=p8 & ~ [1<=p14]] | 1<=p9]] & p9<=p35] & [[~ [1<=p41] & p42<=1] & ~ [[[~ [p7<=0] & p18<=p9] & [~ [p0<=p42] & [p38<=0 & p9<=p17]]]]]] & [p10<=0 & 1<=p16]]]]
normalized: ~ [E [true U ~ [[[[p10<=0 & 1<=p16] & [[~ [[[[p38<=0 & p9<=p17] & ~ [p0<=p42]] & [p18<=p9 & ~ [p7<=0]]]] & [p42<=1 & ~ [1<=p41]]] & [p9<=p35 & [[1<=p9 | [1<=p8 & ~ [1<=p14]]] & [1<=p8 | [~ [[p41<=0 | p11<=p2]] | ~ [[p6<=p18 & 1<=p4]]]]]]]] | [[p23<=p23 & ~ [[p29<=p16 | ~ [[p31<=0 | [p24<=1 | p13<=1]]]]]] | [[1<=p36 | p12<=0] | ~ [[~ [[[[1<=p23 & 1<=p41] | [p42<=p18 | 1<=p12]] | ~ [p16<=p20]]] | [[[p8<=0 & [1<=p38 | p30<=0]] | ~ [p34<=0]] & [[1<=p35 & [1<=p31 & 1<=p25]] & [p1<=p15 | [p32<=p7 & p24<=1]]]]]]]]]]]]

abstracting: (p24<=1)
states: 3,596 (3)
abstracting: (p32<=p7)
states: 3,563 (3)
abstracting: (p1<=p15)
states: 2,533 (3)
abstracting: (1<=p25)
states: 360
abstracting: (1<=p31)
states: 36
abstracting: (1<=p35)
states: 559
abstracting: (p34<=0)
states: 3,037 (3)
abstracting: (p30<=0)
states: 3,129 (3)
abstracting: (1<=p38)
states: 408
abstracting: (p8<=0)
states: 3,513 (3)
abstracting: (p16<=p20)
states: 3,226 (3)
abstracting: (1<=p12)
states: 314
abstracting: (p42<=p18)
states: 3,575 (3)
abstracting: (1<=p41)
states: 361
abstracting: (1<=p23)
states: 431
abstracting: (p12<=0)
states: 3,282 (3)
abstracting: (1<=p36)
states: 294
abstracting: (p13<=1)
states: 3,596 (3)
abstracting: (p24<=1)
states: 3,596 (3)
abstracting: (p31<=0)
states: 3,560 (3)
abstracting: (p29<=p16)
states: 3,203 (3)
abstracting: (p23<=p23)
states: 3,596 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p6<=p18)
states: 3,592 (3)
abstracting: (p11<=p2)
states: 3,387 (3)
abstracting: (p41<=0)
states: 3,235 (3)
abstracting: (1<=p8)
states: 83
abstracting: (1<=p14)
states: 353
abstracting: (1<=p8)
states: 83
abstracting: (1<=p9)
states: 495
abstracting: (p9<=p35)
states: 3,177 (3)
abstracting: (1<=p41)
states: 361
abstracting: (p42<=1)
states: 3,596 (3)
abstracting: (p7<=0)
states: 3,565 (3)
abstracting: (p18<=p9)
states: 3,400 (3)
abstracting: (p0<=p42)
states: 3,595 (3)
abstracting: (p9<=p17)
states: 3,101 (3)
abstracting: (p38<=0)
states: 3,188 (3)
abstracting: (1<=p16)
states: 543
abstracting: (p10<=0)
states: 3,101 (3)
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

totally nodes used: 81743 (8.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 99277 238716 337993
used/not used/entry size/cache size: 294264 66814600 16 1024MB
basic ops cache: hits/miss/sum: 60342 167710 228052
used/not used/entry size/cache size: 272867 16504349 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: 5933 14831 20764
used/not used/entry size/cache size: 14830 8373778 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 67029529
1 77032
2 2199
3 103
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.811sec


BK_STOP 1679338363178

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:2207 (45), effective:255 (5)

initing FirstDep: 0m 0.000sec


iterations count:905 (18), effective:117 (2)

iterations count:962 (20), effective:121 (2)

iterations count:62 (1), effective:4 (0)

iterations count:778 (16), effective:103 (2)

iterations count:507 (10), effective:58 (1)

iterations count:480 (10), effective:79 (1)

iterations count:48 (1), effective:0 (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-001B"
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 ShieldRVs-PT-001B, 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-167905978400014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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