fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r362-smll-167891812200113
Last Updated
May 14, 2023

About the Execution of Marcie+red for RwMutex-PT-r0010w0020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5452.987 13422.00 21770.00 378.20 FFTFTTFFFTTFTFTF normal

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-167891812200113.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-r0010w0020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812200113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.7K Feb 25 22:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 22:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 22:45 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 4.1K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 22:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:46 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 44K 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-r0010w0020-CTLCardinality-00
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-01
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-02
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-03
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-04
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-05
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-06
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-07
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-08
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-09
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678991962537

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-r0010w0020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 18:39:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 18:39:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:39:25] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-16 18:39:25] [INFO ] Transformed 70 places.
[2023-03-16 18:39:25] [INFO ] Transformed 60 transitions.
[2023-03-16 18:39:25] [INFO ] Found NUPN structural information;
[2023-03-16 18:39:25] [INFO ] Parsed PT model containing 70 places and 60 transitions and 540 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Initial state reduction rules removed 5 formulas.
FORMULA RwMutex-PT-r0010w0020-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 60/60 transitions.
Applied a total of 0 rules in 22 ms. Remains 70 /70 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 70 cols
[2023-03-16 18:39:26] [INFO ] Computed 40 place invariants in 27 ms
[2023-03-16 18:39:26] [INFO ] Implicit Places using invariants in 445 ms returned [1, 5, 6, 7, 8, 9, 55, 66]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 514 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/70 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 540 ms. Remains : 62/70 places, 60/60 transitions.
Support contains 51 out of 62 places after structural reductions.
[2023-03-16 18:39:26] [INFO ] Flatten gal took : 75 ms
[2023-03-16 18:39:26] [INFO ] Flatten gal took : 35 ms
[2023-03-16 18:39:27] [INFO ] Input system was already deterministic with 60 transitions.
Support contains 50 out of 62 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1020 ms. (steps per millisecond=9 ) properties (out of 48) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 60 rows 62 cols
[2023-03-16 18:39:28] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-16 18:39:28] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-16 18:39:28] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 14 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 60 transitions.
Support contains 42 out of 62 places (down from 44) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Graph (trivial) has 6 edges and 62 vertex of which 6 / 62 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 59 transition count 35
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 79 place count 19 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 19 transition count 18
Applied a total of 80 rules in 18 ms. Remains 19 /62 variables (removed 43) and now considering 18/60 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 19/62 places, 18/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 7 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 56
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 58 transition count 52
Applied a total of 12 rules in 8 ms. Remains 58 /62 variables (removed 4) and now considering 52/60 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 58/62 places, 52/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 56
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 58 transition count 52
Applied a total of 12 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 52/60 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 58/62 places, 52/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 56
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 58 transition count 52
Applied a total of 12 rules in 5 ms. Remains 58 /62 variables (removed 4) and now considering 52/60 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 58/62 places, 52/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Graph (trivial) has 6 edges and 62 vertex of which 6 / 62 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 59 transition count 32
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 90 place count 13 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 13 transition count 13
Applied a total of 91 rules in 5 ms. Remains 13 /62 variables (removed 49) and now considering 13/60 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 13/62 places, 13/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 0 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Graph (trivial) has 6 edges and 62 vertex of which 6 / 62 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 59 transition count 34
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 82 place count 18 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 18 transition count 16
Applied a total of 83 rules in 6 ms. Remains 18 /62 variables (removed 44) and now considering 16/60 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 18/62 places, 16/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 56
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 58 transition count 52
Applied a total of 12 rules in 5 ms. Remains 58 /62 variables (removed 4) and now considering 52/60 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 58/62 places, 52/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 56
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 58 transition count 52
Applied a total of 12 rules in 6 ms. Remains 58 /62 variables (removed 4) and now considering 52/60 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 58/62 places, 52/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 12 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 58
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 58
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 60 transition count 56
Applied a total of 6 rules in 5 ms. Remains 60 /62 variables (removed 2) and now considering 56/60 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 60/62 places, 56/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 14 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 57
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 59 transition count 54
Applied a total of 9 rules in 7 ms. Remains 59 /62 variables (removed 3) and now considering 54/60 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 59/62 places, 54/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 14 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 60/60 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 56
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 58 transition count 52
Applied a total of 12 rules in 7 ms. Remains 58 /62 variables (removed 4) and now considering 52/60 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 58/62 places, 52/60 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 11 ms
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:39:28] [INFO ] Input system was already deterministic with 52 transitions.
[2023-03-16 18:39:28] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:39:29] [INFO ] Flatten gal took : 12 ms
[2023-03-16 18:39:29] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-16 18:39:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 60 transitions and 524 arcs took 2 ms.
Total runtime 3460 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: 62 NrTr: 60 NrArc: 524)

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

net check time: 0m 0.000sec

init dd package: 0m 3.593sec


RS generation: 0m 0.049sec


-> reachability set: #nodes 7909 (7.9e+03) #states 1,044 (3)



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

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

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

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: EX [EF [AG [~ [[p50<=1 & 1<=p50]]]]]
normalized: EX [E [true U ~ [E [true U [p50<=1 & 1<=p50]]]]]

abstracting: (1<=p50)
states: 1
abstracting: (p50<=1)
states: 1,044 (3)
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

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

abstracting: (1<=p10)
states: 1,043 (3)
abstracting: (p10<=1)
states: 1,044 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [EF [[EG [[p16<=0 & 0<=p16]] & AG [~ [[p44<=1 & 1<=p44]]]]]]
normalized: EG [E [true U [~ [E [true U [p44<=1 & 1<=p44]]] & EG [[p16<=0 & 0<=p16]]]]]

abstracting: (0<=p16)
states: 1,044 (3)
abstracting: (p16<=0)
states: 512
.
EG iterations: 1
abstracting: (1<=p44)
states: 1
abstracting: (p44<=1)
states: 1,044 (3)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.018sec

checking: [EG [[[[p48<=0 & 0<=p48] & [p9<=1 & 1<=p9]] | EG [[p48<=1 & 1<=p48]]]] | EX [[p18<=0 & 0<=p18]]]
normalized: [EX [[p18<=0 & 0<=p18]] | EG [[EG [[p48<=1 & 1<=p48]] | [[p9<=1 & 1<=p9] & [p48<=0 & 0<=p48]]]]]

abstracting: (0<=p48)
states: 1,044 (3)
abstracting: (p48<=0)
states: 1,043 (3)
abstracting: (1<=p9)
states: 1,043 (3)
abstracting: (p9<=1)
states: 1,044 (3)
abstracting: (1<=p48)
states: 1
abstracting: (p48<=1)
states: 1,044 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (0<=p18)
states: 1,044 (3)
abstracting: (p18<=0)
states: 1
.-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: [AX [[[p61<=1 & 1<=p61] | AG [[p0<=1 & 1<=p0]]]] | EG [AG [AF [[~ [[p11<=0 & 0<=p11]] & ~ [[p12<=1 & 1<=p12]]]]]]]
normalized: [EG [~ [E [true U EG [~ [[~ [[p12<=1 & 1<=p12]] & ~ [[p11<=0 & 0<=p11]]]]]]]] | ~ [EX [~ [[~ [E [true U ~ [[p0<=1 & 1<=p0]]]] | [p61<=1 & 1<=p61]]]]]]

abstracting: (1<=p61)
states: 532
abstracting: (p61<=1)
states: 1,044 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,044 (3)
.abstracting: (0<=p11)
states: 1,044 (3)
abstracting: (p11<=0)
states: 1
abstracting: (1<=p12)
states: 1,043 (3)
abstracting: (p12<=1)
states: 1,044 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: A [EF [~ [[AG [[[p38<=1 & 1<=p38] & [p45<=1 & 1<=p45]]] | [[p14<=0 & 0<=p14] | [p49<=1 & 1<=p49]]]]] U [p27<=0 & 0<=p27]]
normalized: [~ [EG [~ [[p27<=0 & 0<=p27]]]] & ~ [E [~ [[p27<=0 & 0<=p27]] U [~ [E [true U ~ [[[[p49<=1 & 1<=p49] | [p14<=0 & 0<=p14]] | ~ [E [true U ~ [[[p45<=1 & 1<=p45] & [p38<=1 & 1<=p38]]]]]]]]] & ~ [[p27<=0 & 0<=p27]]]]]]

abstracting: (0<=p27)
states: 1,044 (3)
abstracting: (p27<=0)
states: 512
abstracting: (1<=p38)
states: 532
abstracting: (p38<=1)
states: 1,044 (3)
abstracting: (1<=p45)
states: 1
abstracting: (p45<=1)
states: 1,044 (3)
abstracting: (0<=p14)
states: 1,044 (3)
abstracting: (p14<=0)
states: 1
abstracting: (1<=p49)
states: 1
abstracting: (p49<=1)
states: 1,044 (3)
abstracting: (0<=p27)
states: 1,044 (3)
abstracting: (p27<=0)
states: 512
abstracting: (0<=p27)
states: 1,044 (3)
abstracting: (p27<=0)
states: 512
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.019sec

checking: AG [A [AF [[p25<=1 & 1<=p25]] U EG [~ [[EF [[[p5<=0 & 0<=p5] | [p19<=1 & 1<=p19]]] & EF [[[p4<=0 & 0<=p4] | [p15<=1 & 1<=p15]]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EG [~ [[E [true U [[p15<=1 & 1<=p15] | [p4<=0 & 0<=p4]]] & E [true U [[p19<=1 & 1<=p19] | [p5<=0 & 0<=p5]]]]]]]]] & ~ [E [~ [EG [~ [[E [true U [[p15<=1 & 1<=p15] | [p4<=0 & 0<=p4]]] & E [true U [[p19<=1 & 1<=p19] | [p5<=0 & 0<=p5]]]]]]] U [EG [~ [[p25<=1 & 1<=p25]]] & ~ [EG [~ [[E [true U [[p15<=1 & 1<=p15] | [p4<=0 & 0<=p4]]] & E [true U [[p19<=1 & 1<=p19] | [p5<=0 & 0<=p5]]]]]]]]]]]]]]

abstracting: (0<=p5)
states: 1,044 (3)
abstracting: (p5<=0)
states: 512
abstracting: (1<=p19)
states: 512
abstracting: (p19<=1)
states: 1,044 (3)
abstracting: (0<=p4)
states: 1,044 (3)
abstracting: (p4<=0)
states: 1
abstracting: (1<=p15)
states: 1,043 (3)
abstracting: (p15<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (1<=p25)
states: 512
abstracting: (p25<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (0<=p5)
states: 1,044 (3)
abstracting: (p5<=0)
states: 512
abstracting: (1<=p19)
states: 512
abstracting: (p19<=1)
states: 1,044 (3)
abstracting: (0<=p4)
states: 1,044 (3)
abstracting: (p4<=0)
states: 1
abstracting: (1<=p15)
states: 1,043 (3)
abstracting: (p15<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (0<=p5)
states: 1,044 (3)
abstracting: (p5<=0)
states: 512
abstracting: (1<=p19)
states: 512
abstracting: (p19<=1)
states: 1,044 (3)
abstracting: (0<=p4)
states: 1,044 (3)
abstracting: (p4<=0)
states: 1
abstracting: (1<=p15)
states: 1,043 (3)
abstracting: (p15<=1)
states: 1,044 (3)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: [AF [EX [[p50<=0 & 0<=p50]]] & [AG [EF [[[p15<=0 & 0<=p15] & [[p43<=0 & 0<=p43] | [p40<=1 & 1<=p40]]]]] & E [AG [[[p20<=0 & 0<=p20] & [[p14<=1 & 1<=p14] & [p43<=1 & 1<=p43]]]] U ~ [EF [[p22<=1 & 1<=p22]]]]]]
normalized: [[E [~ [E [true U ~ [[[[p43<=1 & 1<=p43] & [p14<=1 & 1<=p14]] & [p20<=0 & 0<=p20]]]]] U ~ [E [true U [p22<=1 & 1<=p22]]]] & ~ [E [true U ~ [E [true U [[[p40<=1 & 1<=p40] | [p43<=0 & 0<=p43]] & [p15<=0 & 0<=p15]]]]]]] & ~ [EG [~ [EX [[p50<=0 & 0<=p50]]]]]]

abstracting: (0<=p50)
states: 1,044 (3)
abstracting: (p50<=0)
states: 1,043 (3)
..
EG iterations: 1
abstracting: (0<=p15)
states: 1,044 (3)
abstracting: (p15<=0)
states: 1
abstracting: (0<=p43)
states: 1,044 (3)
abstracting: (p43<=0)
states: 1,043 (3)
abstracting: (1<=p40)
states: 512
abstracting: (p40<=1)
states: 1,044 (3)
abstracting: (1<=p22)
states: 512
abstracting: (p22<=1)
states: 1,044 (3)
abstracting: (0<=p20)
states: 1,044 (3)
abstracting: (p20<=0)
states: 532
abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (p14<=1)
states: 1,044 (3)
abstracting: (1<=p43)
states: 1
abstracting: (p43<=1)
states: 1,044 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: E [[~ [[A [[[p6<=1 & 1<=p6] | [p18<=0 & 0<=p18]] U EX [[p20<=0 & 0<=p20]]] | [[[p19<=0 & 0<=p19] & [p9<=1 & 1<=p9]] | [p49<=1 & 1<=p49]]]] & [AG [[p50<=0 & 0<=p50]] | [EF [[[p1<=0 & 0<=p1] | [p44<=1 & 1<=p44]]] & [[p2<=0 & 0<=p2] | [~ [AG [[p4<=1 & 1<=p4]]] | ~ [[[p21<=0 & 0<=p21] | [p47<=1 & 1<=p47]]]]]]]] U EF [[[[p53<=0 & 0<=p53] | [p29<=1 & 1<=p29]] & [~ [EF [[p6<=1 & 1<=p6]]] | EG [[[p7<=0 & 0<=p7] | [p4<=1 & 1<=p4]]]]]]]
normalized: E [[[[[[~ [[[p47<=1 & 1<=p47] | [p21<=0 & 0<=p21]]] | E [true U ~ [[p4<=1 & 1<=p4]]]] | [p2<=0 & 0<=p2]] & E [true U [[p44<=1 & 1<=p44] | [p1<=0 & 0<=p1]]]] | ~ [E [true U ~ [[p50<=0 & 0<=p50]]]]] & ~ [[[[p49<=1 & 1<=p49] | [[p9<=1 & 1<=p9] & [p19<=0 & 0<=p19]]] | [~ [EG [~ [EX [[p20<=0 & 0<=p20]]]]] & ~ [E [~ [EX [[p20<=0 & 0<=p20]]] U [~ [[[p18<=0 & 0<=p18] | [p6<=1 & 1<=p6]]] & ~ [EX [[p20<=0 & 0<=p20]]]]]]]]]] U E [true U [[EG [[[p4<=1 & 1<=p4] | [p7<=0 & 0<=p7]]] | ~ [E [true U [p6<=1 & 1<=p6]]]] & [[p29<=1 & 1<=p29] | [p53<=0 & 0<=p53]]]]]

abstracting: (0<=p53)
states: 1,044 (3)
abstracting: (p53<=0)
states: 1,043 (3)
abstracting: (1<=p29)
states: 512
abstracting: (p29<=1)
states: 1,044 (3)
abstracting: (1<=p6)
states: 1,043 (3)
abstracting: (p6<=1)
states: 1,044 (3)
abstracting: (0<=p7)
states: 1,044 (3)
abstracting: (p7<=0)
states: 1
abstracting: (1<=p4)
states: 1,043 (3)
abstracting: (p4<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (0<=p20)
states: 1,044 (3)
abstracting: (p20<=0)
states: 532
.abstracting: (1<=p6)
states: 1,043 (3)
abstracting: (p6<=1)
states: 1,044 (3)
abstracting: (0<=p18)
states: 1,044 (3)
abstracting: (p18<=0)
states: 1
abstracting: (0<=p20)
states: 1,044 (3)
abstracting: (p20<=0)
states: 532
.abstracting: (0<=p20)
states: 1,044 (3)
abstracting: (p20<=0)
states: 532
..
EG iterations: 1
abstracting: (0<=p19)
states: 1,044 (3)
abstracting: (p19<=0)
states: 532
abstracting: (1<=p9)
states: 1,043 (3)
abstracting: (p9<=1)
states: 1,044 (3)
abstracting: (1<=p49)
states: 1
abstracting: (p49<=1)
states: 1,044 (3)
abstracting: (0<=p50)
states: 1,044 (3)
abstracting: (p50<=0)
states: 1,043 (3)
abstracting: (0<=p1)
states: 1,044 (3)
abstracting: (p1<=0)
states: 512
abstracting: (1<=p44)
states: 1
abstracting: (p44<=1)
states: 1,044 (3)
abstracting: (0<=p2)
states: 1,044 (3)
abstracting: (p2<=0)
states: 1
abstracting: (1<=p4)
states: 1,043 (3)
abstracting: (p4<=1)
states: 1,044 (3)
abstracting: (0<=p21)
states: 1,044 (3)
abstracting: (p21<=0)
states: 532
abstracting: (1<=p47)
states: 1
abstracting: (p47<=1)
states: 1,044 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: [[E [EG [[p17<=1 & 1<=p17]] U EX [[AG [[p18<=0 & 0<=p18]] & [[[p24<=0 & 0<=p24] | [p33<=1 & 1<=p33]] & [p4<=1 & 1<=p4]]]]] & EX [~ [A [~ [[[p9<=0 & 0<=p9] | [p61<=1 & 1<=p61]]] U [[p11<=0 & 0<=p11] | [p1<=1 & 1<=p1]]]]]] & [EG [[[EG [[p42<=0 & 0<=p42]] & [[p4<=0 & 0<=p4] | [p14<=1 & 1<=p14]]] | [[[p49<=0 & 0<=p49] & [p55<=1 & 1<=p55]] | [p48<=0 & 0<=p48]]]] & E [EX [E [[[[p60<=0 & 0<=p60] | [p16<=1 & 1<=p16]] & [[p27<=0 & 0<=p27] | [p40<=1 & 1<=p40]]] U A [[p41<=1 & 1<=p41] U [p54<=1 & 1<=p54]]]] U EG [AG [[[p39<=0 & 0<=p39] | [p24<=1 & 1<=p24]]]]]]]
normalized: [[E [EX [E [[[[p40<=1 & 1<=p40] | [p27<=0 & 0<=p27]] & [[p16<=1 & 1<=p16] | [p60<=0 & 0<=p60]]] U [~ [EG [~ [[p54<=1 & 1<=p54]]]] & ~ [E [~ [[p54<=1 & 1<=p54]] U [~ [[p41<=1 & 1<=p41]] & ~ [[p54<=1 & 1<=p54]]]]]]]] U EG [~ [E [true U ~ [[[p24<=1 & 1<=p24] | [p39<=0 & 0<=p39]]]]]]] & EG [[[[p48<=0 & 0<=p48] | [[p55<=1 & 1<=p55] & [p49<=0 & 0<=p49]]] | [[[p14<=1 & 1<=p14] | [p4<=0 & 0<=p4]] & EG [[p42<=0 & 0<=p42]]]]]] & [EX [~ [[~ [EG [~ [[[p1<=1 & 1<=p1] | [p11<=0 & 0<=p11]]]]] & ~ [E [~ [[[p1<=1 & 1<=p1] | [p11<=0 & 0<=p11]]] U [[[p61<=1 & 1<=p61] | [p9<=0 & 0<=p9]] & ~ [[[p1<=1 & 1<=p1] | [p11<=0 & 0<=p11]]]]]]]]] & E [EG [[p17<=1 & 1<=p17]] U EX [[[[p4<=1 & 1<=p4] & [[p33<=1 & 1<=p33] | [p24<=0 & 0<=p24]]] & ~ [E [true U ~ [[p18<=0 & 0<=p18]]]]]]]]]

abstracting: (0<=p18)
states: 1,044 (3)
abstracting: (p18<=0)
states: 1
abstracting: (0<=p24)
states: 1,044 (3)
abstracting: (p24<=0)
states: 532
abstracting: (1<=p33)
states: 512
abstracting: (p33<=1)
states: 1,044 (3)
abstracting: (1<=p4)
states: 1,043 (3)
abstracting: (p4<=1)
states: 1,044 (3)
.abstracting: (1<=p17)
states: 1,043 (3)
abstracting: (p17<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (0<=p11)
states: 1,044 (3)
abstracting: (p11<=0)
states: 1
abstracting: (1<=p1)
states: 532
abstracting: (p1<=1)
states: 1,044 (3)
abstracting: (0<=p9)
states: 1,044 (3)
abstracting: (p9<=0)
states: 1
abstracting: (1<=p61)
states: 532
abstracting: (p61<=1)
states: 1,044 (3)
abstracting: (0<=p11)
states: 1,044 (3)
abstracting: (p11<=0)
states: 1
abstracting: (1<=p1)
states: 532
abstracting: (p1<=1)
states: 1,044 (3)
abstracting: (0<=p11)
states: 1,044 (3)
abstracting: (p11<=0)
states: 1
abstracting: (1<=p1)
states: 532
abstracting: (p1<=1)
states: 1,044 (3)
.
EG iterations: 1
.abstracting: (0<=p42)
states: 1,044 (3)
abstracting: (p42<=0)
states: 1,043 (3)
.
EG iterations: 1
abstracting: (0<=p4)
states: 1,044 (3)
abstracting: (p4<=0)
states: 1
abstracting: (1<=p14)
states: 1,043 (3)
abstracting: (p14<=1)
states: 1,044 (3)
abstracting: (0<=p49)
states: 1,044 (3)
abstracting: (p49<=0)
states: 1,043 (3)
abstracting: (1<=p55)
states: 1
abstracting: (p55<=1)
states: 1,044 (3)
abstracting: (0<=p48)
states: 1,044 (3)
abstracting: (p48<=0)
states: 1,043 (3)

EG iterations: 0
abstracting: (0<=p39)
states: 1,044 (3)
abstracting: (p39<=0)
states: 532
abstracting: (1<=p24)
states: 512
abstracting: (p24<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (1<=p54)
states: 1
abstracting: (p54<=1)
states: 1,044 (3)
abstracting: (1<=p41)
states: 1
abstracting: (p41<=1)
states: 1,044 (3)
abstracting: (1<=p54)
states: 1
abstracting: (p54<=1)
states: 1,044 (3)
abstracting: (1<=p54)
states: 1
abstracting: (p54<=1)
states: 1,044 (3)
.
EG iterations: 1
abstracting: (0<=p60)
states: 1,044 (3)
abstracting: (p60<=0)
states: 512
abstracting: (1<=p16)
states: 532
abstracting: (p16<=1)
states: 1,044 (3)
abstracting: (0<=p27)
states: 1,044 (3)
abstracting: (p27<=0)
states: 512
abstracting: (1<=p40)
states: 512
abstracting: (p40<=1)
states: 1,044 (3)
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

totally nodes used: 23923 (2.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 70953 406192 477145
used/not used/entry size/cache size: 421062 66687802 16 1024MB
basic ops cache: hits/miss/sum: 31159 229795 260954
used/not used/entry size/cache size: 262443 16514773 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: 3441 15033 18474
used/not used/entry size/cache size: 15033 8373575 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 67085089
1 23628
2 146
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.506sec


BK_STOP 1678991975959

--------------------
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:870 (14), effective:30 (0)

initing FirstDep: 0m 0.000sec


iterations count:899 (14), effective:30 (0)

iterations count:899 (14), effective:30 (0)

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

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

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

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

iterations count:887 (14), effective:21 (0)

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

iterations count:887 (14), effective:21 (0)

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

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

iterations count:887 (14), effective:21 (0)

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

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

iterations count:899 (14), effective:30 (0)

iterations count:888 (14), effective:21 (0)

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

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

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

iterations count:899 (14), effective:30 (0)

iterations count:863 (14), effective:20 (0)

iterations count:899 (14), effective:30 (0)

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

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

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

iterations count:888 (14), effective:22 (0)

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

iterations count:121 (2), 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-r0010w0020"
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-r0010w0020, 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-167891812200113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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