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.r362-smll-167891812200105.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 RwMutex-PT-r0010w0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812200105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 4.9K Feb 25 22:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 22:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 22:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 27K 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 RwMutex-PT-r0010w0010-CTLCardinality-00
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-01
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-02
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-03
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-04
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-05
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-06
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-07
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-08
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-09
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678991761085

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RwMutex-PT-r0010w0010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 18:36:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 18:36:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:36:04] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-16 18:36:04] [INFO ] Transformed 50 places.
[2023-03-16 18:36:04] [INFO ] Transformed 40 transitions.
[2023-03-16 18:36:04] [INFO ] Found NUPN structural information;
[2023-03-16 18:36:04] [INFO ] Parsed PT model containing 50 places and 40 transitions and 300 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 40/40 transitions.
Applied a total of 0 rules in 23 ms. Remains 50 /50 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 50 cols
[2023-03-16 18:36:05] [INFO ] Computed 30 place invariants in 9 ms
[2023-03-16 18:36:05] [INFO ] Implicit Places using invariants in 362 ms returned [2, 5, 6, 8, 10, 12, 44, 47, 48]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 454 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/50 places, 40/40 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 39 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 39 transition count 36
Applied a total of 6 rules in 9 ms. Remains 39 /41 variables (removed 2) and now considering 36/40 (removed 4) transitions.
// Phase 1: matrix 36 rows 39 cols
[2023-03-16 18:36:05] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 18:36:05] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-16 18:36:05] [INFO ] Invariant cache hit.
[2023-03-16 18:36:05] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/50 places, 36/40 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 654 ms. Remains : 39/50 places, 36/40 transitions.
Support contains 25 out of 39 places after structural reductions.
[2023-03-16 18:36:05] [INFO ] Flatten gal took : 64 ms
[2023-03-16 18:36:06] [INFO ] Flatten gal took : 20 ms
[2023-03-16 18:36:06] [INFO ] Input system was already deterministic with 36 transitions.
Support contains 24 out of 39 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 18:36:06] [INFO ] Invariant cache hit.
[2023-03-16 18:36:06] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-16 18:36:06] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-16 18:36:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-16 18:36:07] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 8 ms.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
[2023-03-16 18:36:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 9 ms
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 36 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 37 transition count 32
Applied a total of 6 rules in 6 ms. Remains 37 /39 variables (removed 2) and now considering 32/36 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 37/39 places, 32/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 37 transition count 32
Applied a total of 6 rules in 3 ms. Remains 37 /39 variables (removed 2) and now considering 32/36 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 37/39 places, 32/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 37 transition count 32
Applied a total of 6 rules in 3 ms. Remains 37 /39 variables (removed 2) and now considering 32/36 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 37/39 places, 32/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 37 transition count 32
Applied a total of 6 rules in 4 ms. Remains 37 /39 variables (removed 2) and now considering 32/36 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 37/39 places, 32/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Graph (trivial) has 8 edges and 39 vertex of which 8 / 39 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 35 transition count 21
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 16 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 16 transition count 15
Applied a total of 37 rules in 14 ms. Remains 16 /39 variables (removed 23) and now considering 15/36 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 16/39 places, 15/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Graph (trivial) has 4 edges and 39 vertex of which 4 / 39 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 37 transition count 29
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 25 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 25 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 25 transition count 25
Applied a total of 22 rules in 7 ms. Remains 25 /39 variables (removed 14) and now considering 25/36 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 25/39 places, 25/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 4 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 4 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 39/39 places, 36/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 36 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 38 transition count 35
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 38 transition count 34
Applied a total of 3 rules in 3 ms. Remains 38 /39 variables (removed 1) and now considering 34/36 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 38/39 places, 34/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 4 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 4 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 39/39 places, 36/36 transitions.
Graph (trivial) has 6 edges and 39 vertex of which 6 / 39 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 36 transition count 20
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 59 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 5 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 4 transition count 5
Applied a total of 61 rules in 3 ms. Remains 4 /39 variables (removed 35) and now considering 5/36 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 4/39 places, 5/36 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:36:07] [INFO ] Input system was already deterministic with 5 transitions.
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:36:07] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:36:07] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-16 18:36:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 39 places, 36 transitions and 238 arcs took 1 ms.
Total runtime 2760 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 39 NrTr: 36 NrArc: 238)

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

net check time: 0m 0.000sec

init dd package: 0m 3.579sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 656 (6.6e+02) #states 1,032 (3)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 1,032 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EX [[p33<=1 & 1<=p33]]
normalized: EX [[p33<=1 & 1<=p33]]

abstracting: (1<=p33)
states: 1
abstracting: (p33<=1)
states: 1,032 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [EX [[[p18<=1 & 1<=p18] | [p36<=0 & 0<=p36]]]]
normalized: ~ [EG [~ [EX [[[p36<=0 & 0<=p36] | [p18<=1 & 1<=p18]]]]]]

abstracting: (1<=p18)
states: 512
abstracting: (p18<=1)
states: 1,032 (3)
abstracting: (0<=p36)
states: 1,032 (3)
abstracting: (p36<=0)
states: 1,031 (3)
..
EG iterations: 1
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [AX [AX [[[p7<=0 & 0<=p7] | [p16<=1 & 1<=p16]]]]]
normalized: E [true U ~ [EX [EX [~ [[[p16<=1 & 1<=p16] | [p7<=0 & 0<=p7]]]]]]]

abstracting: (0<=p7)
states: 1,032 (3)
abstracting: (p7<=0)
states: 1
abstracting: (1<=p16)
states: 520
abstracting: (p16<=1)
states: 1,032 (3)
..-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [EF [[EF [[p12<=0 & 0<=p12]] | [p13<=1 & 1<=p13]]]]
normalized: EG [E [true U [[p13<=1 & 1<=p13] | E [true U [p12<=0 & 0<=p12]]]]]

abstracting: (0<=p12)
states: 1,032 (3)
abstracting: (p12<=0)
states: 520
abstracting: (1<=p13)
states: 512
abstracting: (p13<=1)
states: 1,032 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[p3<=0 & 0<=p3] | AG [[[p8<=0 & 0<=p8] & [p36<=0 & 0<=p36]]]]]
normalized: E [true U [~ [E [true U ~ [[[p36<=0 & 0<=p36] & [p8<=0 & 0<=p8]]]]] | [p3<=0 & 0<=p3]]]

abstracting: (0<=p3)
states: 1,032 (3)
abstracting: (p3<=0)
states: 1
abstracting: (0<=p8)
states: 1,032 (3)
abstracting: (p8<=0)
states: 520
abstracting: (0<=p36)
states: 1,032 (3)
abstracting: (p36<=0)
states: 1,031 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: A [~ [[[p37<=0 & 0<=p37] | [p24<=1 & 1<=p24]]] U AF [[p25<=0 & 0<=p25]]]
normalized: [~ [EG [EG [~ [[p25<=0 & 0<=p25]]]]] & ~ [E [EG [~ [[p25<=0 & 0<=p25]]] U [[[p24<=1 & 1<=p24] | [p37<=0 & 0<=p37]] & EG [~ [[p25<=0 & 0<=p25]]]]]]]

abstracting: (0<=p25)
states: 1,032 (3)
abstracting: (p25<=0)
states: 520
.
EG iterations: 1
abstracting: (0<=p37)
states: 1,032 (3)
abstracting: (p37<=0)
states: 512
abstracting: (1<=p24)
states: 512
abstracting: (p24<=1)
states: 1,032 (3)
abstracting: (0<=p25)
states: 1,032 (3)
abstracting: (p25<=0)
states: 520
.
EG iterations: 1
abstracting: (0<=p25)
states: 1,032 (3)
abstracting: (p25<=0)
states: 520
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [AF [[[AX [1<=0] | AX [[[p1<=0 & 0<=p1] & [p38<=1 & 1<=p38]]]] | [AX [AF [[[p26<=0 & 0<=p26] & [p17<=1 & 1<=p17]]]] | [[p33<=0 & 0<=p33] & [p35<=1 & 1<=p35]]]]]]
normalized: ~ [E [true U EG [~ [[[[[p35<=1 & 1<=p35] & [p33<=0 & 0<=p33]] | ~ [EX [EG [~ [[[p17<=1 & 1<=p17] & [p26<=0 & 0<=p26]]]]]]] | [~ [EX [~ [[[p38<=1 & 1<=p38] & [p1<=0 & 0<=p1]]]]] | ~ [EX [~ [1<=0]]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (0<=p1)
states: 1,032 (3)
abstracting: (p1<=0)
states: 512
abstracting: (1<=p38)
states: 520
abstracting: (p38<=1)
states: 1,032 (3)
.abstracting: (0<=p26)
states: 1,032 (3)
abstracting: (p26<=0)
states: 520
abstracting: (1<=p17)
states: 512
abstracting: (p17<=1)
states: 1,032 (3)
.
EG iterations: 1
.abstracting: (0<=p33)
states: 1,032 (3)
abstracting: (p33<=0)
states: 1,031 (3)
abstracting: (1<=p35)
states: 1
abstracting: (p35<=1)
states: 1,032 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AF [AG [[EX [[[p16<=0 & 0<=p16] | [p2<=1 & 1<=p2]]] & [E [E [[[p5<=0 & 0<=p5] | [p36<=1 & 1<=p36]] U [p26<=1 & 1<=p26]] U [[p36<=0 & 0<=p36] & [p10<=1 & 1<=p10]]] & [[p5<=0 & 0<=p5] | [p1<=1 & 1<=p1]]]]]]
normalized: ~ [EG [E [true U ~ [[[[[p1<=1 & 1<=p1] | [p5<=0 & 0<=p5]] & E [E [[[p36<=1 & 1<=p36] | [p5<=0 & 0<=p5]] U [p26<=1 & 1<=p26]] U [[p10<=1 & 1<=p10] & [p36<=0 & 0<=p36]]]] & EX [[[p2<=1 & 1<=p2] | [p16<=0 & 0<=p16]]]]]]]]

abstracting: (0<=p16)
states: 1,032 (3)
abstracting: (p16<=0)
states: 512
abstracting: (1<=p2)
states: 1,031 (3)
abstracting: (p2<=1)
states: 1,032 (3)
.abstracting: (0<=p36)
states: 1,032 (3)
abstracting: (p36<=0)
states: 1,031 (3)
abstracting: (1<=p10)
states: 512
abstracting: (p10<=1)
states: 1,032 (3)
abstracting: (1<=p26)
states: 512
abstracting: (p26<=1)
states: 1,032 (3)
abstracting: (0<=p5)
states: 1,032 (3)
abstracting: (p5<=0)
states: 1
abstracting: (1<=p36)
states: 1
abstracting: (p36<=1)
states: 1,032 (3)
abstracting: (0<=p5)
states: 1,032 (3)
abstracting: (p5<=0)
states: 1
abstracting: (1<=p1)
states: 520
abstracting: (p1<=1)
states: 1,032 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 7201 (7.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7593 70329 77922
used/not used/entry size/cache size: 73676 67035188 16 1024MB
basic ops cache: hits/miss/sum: 1676 17305 18981
used/not used/entry size/cache size: 27653 16749563 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: 401 3496 3897
used/not used/entry size/cache size: 3496 8385112 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 67101679
1 7169
2 16
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.259sec


BK_STOP 1678991773961

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:294 (8), effective:18 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:166 (4), effective:8 (0)

iterations count:303 (8), effective:18 (0)

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

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

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

iterations count:82 (2), effective:2 (0)

iterations count:138 (3), effective:10 (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="RwMutex-PT-r0010w0010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is RwMutex-PT-r0010w0010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r362-smll-167891812200105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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