About the Execution of Marcie for RwMutex-PT-r0010w0100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.655 | 8612.00 | 8882.00 | 279.20 | TTTTFFTFFTFFFFFF | 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.r353-smll-167891800600129.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 marcie
Input is RwMutex-PT-r0010w0100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r353-smll-167891800600129
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.7K Feb 25 22:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 22:48 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 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 10K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 22:52 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 183K 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-r0010w0100-CTLCardinality-00
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-01
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-02
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-03
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-04
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-05
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-06
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-07
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-08
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-09
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0100-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679851276042
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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RwMutex-PT-r0010w0100
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: RwMutex_PT_r0010w0100
(NrP: 230 NrTr: 220 NrArc: 2460)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.016sec
net check time: 0m 0.001sec
init dd package: 0m 3.623sec
RS generation: 0m 0.598sec
-> reachability set: #nodes 34893 (3.5e+04) #states 1,124 (3)
starting MCC model checker
--------------------------
checking: EG [AG [~ [p81<=1]]]
normalized: EG [~ [E [true U p81<=1]]]
abstracting: (p81<=1)
states: 1,124 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.359sec
checking: ~ [EG [p159<=0]]
normalized: ~ [EG [p159<=0]]
abstracting: (p159<=0)
states: 1,123 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: EG [~ [p43<=p125]]
normalized: EG [~ [p43<=p125]]
abstracting: (p43<=p125)
states: 513
..
EG iterations: 2
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: A [[EG [1<=p131] & 1<=p210] U AF [p189<=0]]
normalized: [~ [EG [EG [~ [p189<=0]]]] & ~ [E [EG [~ [p189<=0]] U [~ [[1<=p210 & EG [1<=p131]]] & EG [~ [p189<=0]]]]]]
abstracting: (p189<=0)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (1<=p131)
states: 512
.
EG iterations: 1
abstracting: (1<=p210)
states: 1
abstracting: (p189<=0)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (p189<=0)
states: 1,123 (3)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: AF [[[AG [p41<=p16] & ~ [AG [EG [p134<=1]]]] & p198<=1]]
normalized: ~ [EG [~ [[p198<=1 & [E [true U ~ [EG [p134<=1]]] & ~ [E [true U ~ [p41<=p16]]]]]]]]
abstracting: (p41<=p16)
states: 1,123 (3)
abstracting: (p134<=1)
states: 1,124 (3)
EG iterations: 0
abstracting: (p198<=1)
states: 1,124 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.327sec
checking: E [~ [[~ [AX [p147<=1]] & AX [E [p49<=p29 U p40<=1]]]] U EF [p49<=1]]
normalized: E [~ [[~ [EX [~ [E [p49<=p29 U p40<=1]]]] & EX [~ [p147<=1]]]] U E [true U p49<=1]]
abstracting: (p49<=1)
states: 1,124 (3)
abstracting: (p147<=1)
states: 1,124 (3)
.abstracting: (p40<=1)
states: 1,124 (3)
abstracting: (p49<=p29)
states: 1,123 (3)
.-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [AX [[[p56<=p9 | ~ [p229<=p215]] & p189<=p229]]]
normalized: ~ [E [true U EX [~ [[p189<=p229 & [p56<=p9 | ~ [p229<=p215]]]]]]]
abstracting: (p229<=p215)
states: 1,123 (3)
abstracting: (p56<=p9)
states: 612
abstracting: (p189<=p229)
states: 1,123 (3)
.-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.059sec
checking: ~ [EG [[[p54<=0 & ~ [AG [1<=p44]]] & [p156<=p169 & AF [[E [p62<=1 U p33<=p183] & p194<=p156]]]]]]
normalized: ~ [EG [[[p156<=p169 & ~ [EG [~ [[p194<=p156 & E [p62<=1 U p33<=p183]]]]]] & [p54<=0 & E [true U ~ [1<=p44]]]]]]
abstracting: (1<=p44)
states: 1,123 (3)
abstracting: (p54<=0)
states: 1
abstracting: (p33<=p183)
states: 2
abstracting: (p62<=1)
states: 1,124 (3)
abstracting: (p194<=p156)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (p156<=p169)
states: 1,123 (3)
..
EG iterations: 2
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.255sec
checking: AG [[~ [A [[E [p148<=p203 U 1<=p103] & [1<=p127 & p182<=p92]] U AF [p154<=p227]]] & p101<=1]]
normalized: ~ [E [true U ~ [[p101<=1 & ~ [[~ [EG [EG [~ [p154<=p227]]]] & ~ [E [EG [~ [p154<=p227]] U [~ [[[1<=p127 & p182<=p92] & E [p148<=p203 U 1<=p103]]] & EG [~ [p154<=p227]]]]]]]]]]]
abstracting: (p154<=p227)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (1<=p103)
states: 1,123 (3)
abstracting: (p148<=p203)
states: 1,123 (3)
abstracting: (p182<=p92)
states: 1,124 (3)
abstracting: (1<=p127)
states: 512
abstracting: (p154<=p227)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (p154<=p227)
states: 1,123 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p101<=1)
states: 1,124 (3)
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: EF [[A [AG [EG [1<=p92]] U [E [EX [p176<=p117] U EF [p154<=1]] & A [~ [p151<=1] U [p87<=1 & p203<=1]]]] & AX [EF [[p194<=p164 | ~ [p207<=p62]]]]]]
normalized: E [true U [~ [EX [~ [E [true U [p194<=p164 | ~ [p207<=p62]]]]]] & [~ [EG [~ [[[~ [EG [~ [[p87<=1 & p203<=1]]]] & ~ [E [~ [[p87<=1 & p203<=1]] U [p151<=1 & ~ [[p87<=1 & p203<=1]]]]]] & E [EX [p176<=p117] U E [true U p154<=1]]]]]] & ~ [E [~ [[[~ [EG [~ [[p87<=1 & p203<=1]]]] & ~ [E [~ [[p87<=1 & p203<=1]] U [p151<=1 & ~ [[p87<=1 & p203<=1]]]]]] & E [EX [p176<=p117] U E [true U p154<=1]]]] U [E [true U ~ [EG [1<=p92]]] & ~ [[[~ [EG [~ [[p87<=1 & p203<=1]]]] & ~ [E [~ [[p87<=1 & p203<=1]] U [p151<=1 & ~ [[p87<=1 & p203<=1]]]]]] & E [EX [p176<=p117] U E [true U p154<=1]]]]]]]]]]
abstracting: (p154<=1)
states: 1,124 (3)
abstracting: (p176<=p117)
states: 1,123 (3)
.abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
abstracting: (p151<=1)
states: 1,124 (3)
abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
.
EG iterations: 1
abstracting: (1<=p92)
states: 1,123 (3)
.
EG iterations: 1
abstracting: (p154<=1)
states: 1,124 (3)
abstracting: (p176<=p117)
states: 1,123 (3)
.abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
abstracting: (p151<=1)
states: 1,124 (3)
abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
.
EG iterations: 1
abstracting: (p154<=1)
states: 1,124 (3)
abstracting: (p176<=p117)
states: 1,123 (3)
.abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
abstracting: (p151<=1)
states: 1,124 (3)
abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
abstracting: (p203<=1)
states: 1,124 (3)
abstracting: (p87<=1)
states: 1,124 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p207<=p62)
states: 1,124 (3)
abstracting: (p194<=p164)
states: 1,123 (3)
.-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.158sec
checking: ~ [[A [[~ [EG [p1<=p192]] | AF [[EX [p89<=0] & [p110<=p45 & 1<=p97]]]] U AG [1<=p32]] | E [1<=p197 U ~ [[~ [AF [1<=p199]] & [~ [AG [p138<=1]] | EX [1<=p89]]]]]]]
normalized: ~ [[E [1<=p197 U ~ [[[EX [1<=p89] | E [true U ~ [p138<=1]]] & EG [~ [1<=p199]]]]] | [~ [EG [E [true U ~ [1<=p32]]]] & ~ [E [E [true U ~ [1<=p32]] U [~ [[~ [EG [~ [[[p110<=p45 & 1<=p97] & EX [p89<=0]]]]] | ~ [EG [p1<=p192]]]] & E [true U ~ [1<=p32]]]]]]]]
abstracting: (1<=p32)
states: 1,123 (3)
abstracting: (p1<=p192)
states: 1,123 (3)
.
EG iterations: 1
abstracting: (p89<=0)
states: 1
.abstracting: (1<=p97)
states: 1,123 (3)
abstracting: (p110<=p45)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (1<=p32)
states: 1,123 (3)
abstracting: (1<=p32)
states: 1,123 (3)
EG iterations: 0
abstracting: (1<=p199)
states: 1
.
EG iterations: 1
abstracting: (p138<=1)
states: 1,124 (3)
abstracting: (1<=p89)
states: 1,123 (3)
.abstracting: (1<=p197)
states: 1
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.186sec
checking: [EX [[AG [[EX [p139<=0] & ~ [p119<=p179]]] | E [~ [EX [1<=p80]] U EG [p178<=p186]]]] & EX [EX [~ [[[[1<=p126 | p210<=1] | EX [p191<=1]] & [[1<=p129 | p49<=p201] | ~ [1<=p140]]]]]]]
normalized: [EX [EX [~ [[[~ [1<=p140] | [1<=p129 | p49<=p201]] & [EX [p191<=1] | [1<=p126 | p210<=1]]]]]] & EX [[E [~ [EX [1<=p80]] U EG [p178<=p186]] | ~ [E [true U ~ [[~ [p119<=p179] & EX [p139<=0]]]]]]]]
abstracting: (p139<=0)
states: 1,123 (3)
.abstracting: (p119<=p179)
states: 612
abstracting: (p178<=p186)
states: 1,123 (3)
.
EG iterations: 1
abstracting: (1<=p80)
states: 1,123 (3)
..abstracting: (p210<=1)
states: 1,124 (3)
abstracting: (1<=p126)
states: 512
abstracting: (p191<=1)
states: 1,124 (3)
.abstracting: (p49<=p201)
states: 2
abstracting: (1<=p129)
states: 512
abstracting: (1<=p140)
states: 1
..-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.102sec
checking: ~ [[EG [[p22<=0 & EG [[[1<=p115 & p188<=1] | [p134<=1 | 1<=p117]]]]] | E [[p186<=0 & ~ [[p205<=1 | ~ [[1<=p225 & p115<=p146]]]]] U E [[p183<=0 | EF [1<=p146]] U EF [p159<=p148]]]]]
normalized: ~ [[E [[p186<=0 & ~ [[p205<=1 | ~ [[1<=p225 & p115<=p146]]]]] U E [[p183<=0 | E [true U 1<=p146]] U E [true U p159<=p148]]] | EG [[p22<=0 & EG [[[p134<=1 | 1<=p117] | [1<=p115 & p188<=1]]]]]]]
abstracting: (p188<=1)
states: 1,124 (3)
abstracting: (1<=p115)
states: 512
abstracting: (1<=p117)
states: 512
abstracting: (p134<=1)
states: 1,124 (3)
EG iterations: 0
abstracting: (p22<=0)
states: 1
..
EG iterations: 2
abstracting: (p159<=p148)
states: 1,123 (3)
abstracting: (1<=p146)
states: 1
abstracting: (p183<=0)
states: 1,123 (3)
abstracting: (p115<=p146)
states: 612
abstracting: (1<=p225)
states: 1
abstracting: (p205<=1)
states: 1,124 (3)
abstracting: (p186<=0)
states: 1,123 (3)
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.122sec
checking: EF [EX [[[[[p181<=p5 & ~ [1<=p190]] & E [p180<=p187 U p221<=p123]] | [[1<=p6 | AG [1<=p189]] | [EX [p168<=p98] | [p65<=p135 | p198<=p77]]]] & AX [[E [p63<=p33 U p1<=1] & ~ [p90<=1]]]]]]
normalized: E [true U EX [[~ [EX [~ [[~ [p90<=1] & E [p63<=p33 U p1<=1]]]]] & [[[[p65<=p135 | p198<=p77] | EX [p168<=p98]] | [1<=p6 | ~ [E [true U ~ [1<=p189]]]]] | [E [p180<=p187 U p221<=p123] & [p181<=p5 & ~ [1<=p190]]]]]]]
abstracting: (1<=p190)
states: 1
abstracting: (p181<=p5)
states: 1,124 (3)
abstracting: (p221<=p123)
states: 1,123 (3)
abstracting: (p180<=p187)
states: 1,123 (3)
abstracting: (1<=p189)
states: 1
abstracting: (1<=p6)
states: 612
abstracting: (p168<=p98)
states: 1,124 (3)
.abstracting: (p198<=p77)
states: 1,124 (3)
abstracting: (p65<=p135)
states: 2
abstracting: (p1<=1)
states: 1,124 (3)
abstracting: (p63<=p33)
states: 1,123 (3)
abstracting: (p90<=1)
states: 1,124 (3)
..-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.071sec
checking: [E [[~ [A [[1<=p42 & 1<=p160] U [p116<=1 & p132<=p1]]] & ~ [[[[~ [p225<=p104] & ~ [1<=p72]] | A [p205<=0 U p175<=1]] | E [EX [p191<=p200] U ~ [p157<=0]]]]] U EG [EX [AF [1<=p36]]]] | AX [[AG [[p143<=0 | [~ [1<=p59] & AX [1<=p230]]]] | AG [~ [[[p15<=1 | 1<=p135] & [p67<=0 & p159<=0]]]]]]]
normalized: [~ [EX [~ [[~ [E [true U [[p67<=0 & p159<=0] & [p15<=1 | 1<=p135]]]] | ~ [E [true U ~ [[p143<=0 | [~ [EX [~ [1<=p230]]] & ~ [1<=p59]]]]]]]]]] | E [[~ [[E [EX [p191<=p200] U ~ [p157<=0]] | [[~ [EG [~ [p175<=1]]] & ~ [E [~ [p175<=1] U [~ [p205<=0] & ~ [p175<=1]]]]] | [~ [1<=p72] & ~ [p225<=p104]]]]] & ~ [[~ [EG [~ [[p116<=1 & p132<=p1]]]] & ~ [E [~ [[p116<=1 & p132<=p1]] U [~ [[1<=p42 & 1<=p160]] & ~ [[p116<=1 & p132<=p1]]]]]]]] U EG [EX [~ [EG [~ [1<=p36]]]]]]]
abstracting: (1<=p36)
states: 1,123 (3)
..
EG iterations: 2
.
EG iterations: 0
abstracting: (p132<=p1)
states: 1,123 (3)
abstracting: (p116<=1)
states: 1,124 (3)
abstracting: (1<=p160)
states: 1
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p132<=p1)
states: 1,123 (3)
abstracting: (p116<=1)
states: 1,124 (3)
abstracting: (p132<=p1)
states: 1,123 (3)
abstracting: (p116<=1)
states: 1,124 (3)
..
EG iterations: 2
abstracting: (p225<=p104)
states: 1,124 (3)
abstracting: (1<=p72)
states: 1,123 (3)
abstracting: (p175<=1)
states: 1,124 (3)
abstracting: (p205<=0)
states: 1,123 (3)
abstracting: (p175<=1)
states: 1,124 (3)
abstracting: (p175<=1)
states: 1,124 (3)
.
EG iterations: 1
abstracting: (p157<=0)
states: 1,123 (3)
abstracting: (p191<=p200)
states: 1,123 (3)
.abstracting: (1<=p59)
states: 1,123 (3)
abstracting: (1<=p230)
states: 1
.abstracting: (p143<=0)
states: 1,123 (3)
abstracting: (1<=p135)
states: 1
abstracting: (p15<=1)
states: 1,124 (3)
abstracting: (p159<=0)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
.-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.352sec
checking: A [[~ [[EF [[p228<=p228 | p212<=p190]] & [AG [p141<=0] | [AF [1<=p154] & [1<=p33 | p116<=0]]]]] | 1<=p141] U [~ [EF [[~ [[p143<=1 | 1<=p6]] & EG [1<=p74]]]] & A [EG [[A [p113<=p33 U 1<=p61] & [p74<=1 | p25<=p120]]] U [~ [1<=p42] & A [[1<=p60 & p119<=0] U ~ [p67<=0]]]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]]]] & ~ [E [~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]] U [~ [EG [[[p74<=1 | p25<=p120] & [~ [EG [~ [1<=p61]]] & ~ [E [~ [1<=p61] U [~ [p113<=p33] & ~ [1<=p61]]]]]]]] & ~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]]]]]] & ~ [E [true U [EG [1<=p74] & ~ [[p143<=1 | 1<=p6]]]]]]]]] & ~ [E [~ [[[~ [EG [~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]]]] & ~ [E [~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]] U [~ [EG [[[p74<=1 | p25<=p120] & [~ [EG [~ [1<=p61]]] & ~ [E [~ [1<=p61] U [~ [p113<=p33] & ~ [1<=p61]]]]]]]] & ~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]]]]]] & ~ [E [true U [EG [1<=p74] & ~ [[p143<=1 | 1<=p6]]]]]]] U [~ [[1<=p141 | ~ [[[[[1<=p33 | p116<=0] & ~ [EG [~ [1<=p154]]]] | ~ [E [true U ~ [p141<=0]]]] & E [true U [p228<=p228 | p212<=p190]]]]]] & ~ [[[~ [EG [~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]]]] & ~ [E [~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]] U [~ [EG [[[p74<=1 | p25<=p120] & [~ [EG [~ [1<=p61]]] & ~ [E [~ [1<=p61] U [~ [p113<=p33] & ~ [1<=p61]]]]]]]] & ~ [[[~ [EG [p67<=0]] & ~ [E [p67<=0 U [p67<=0 & ~ [[1<=p60 & p119<=0]]]]]] & ~ [1<=p42]]]]]]] & ~ [E [true U [EG [1<=p74] & ~ [[p143<=1 | 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 612
abstracting: (p143<=1)
states: 1,124 (3)
abstracting: (1<=p74)
states: 1,123 (3)
.
EG iterations: 1
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p61)
states: 1,123 (3)
abstracting: (p113<=p33)
states: 1,124 (3)
abstracting: (1<=p61)
states: 1,123 (3)
abstracting: (1<=p61)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (p25<=p120)
states: 513
abstracting: (p74<=1)
states: 1,124 (3)
EG iterations: 0
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p212<=p190)
states: 1,123 (3)
abstracting: (p228<=p228)
states: 1,124 (3)
abstracting: (p141<=0)
states: 1,123 (3)
abstracting: (1<=p154)
states: 1
.
EG iterations: 1
abstracting: (p116<=0)
states: 612
abstracting: (1<=p33)
states: 1,123 (3)
abstracting: (1<=p141)
states: 1
abstracting: (1<=p6)
states: 612
abstracting: (p143<=1)
states: 1,124 (3)
abstracting: (1<=p74)
states: 1,123 (3)
.
EG iterations: 1
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p61)
states: 1,123 (3)
abstracting: (p113<=p33)
states: 1,124 (3)
abstracting: (1<=p61)
states: 1,123 (3)
abstracting: (1<=p61)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (p25<=p120)
states: 513
abstracting: (p74<=1)
states: 1,124 (3)
EG iterations: 0
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p6)
states: 612
abstracting: (p143<=1)
states: 1,124 (3)
abstracting: (1<=p74)
states: 1,123 (3)
.
EG iterations: 1
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p61)
states: 1,123 (3)
abstracting: (p113<=p33)
states: 1,124 (3)
abstracting: (1<=p61)
states: 1,123 (3)
abstracting: (1<=p61)
states: 1,123 (3)
..
EG iterations: 2
abstracting: (p25<=p120)
states: 513
abstracting: (p74<=1)
states: 1,124 (3)
EG iterations: 0
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
abstracting: (1<=p42)
states: 1,123 (3)
abstracting: (p119<=0)
states: 612
abstracting: (1<=p60)
states: 1,123 (3)
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
abstracting: (p67<=0)
states: 1
..
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0100-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.390sec
totally nodes used: 160955 (1.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 520324 7056771 7577095
used/not used/entry size/cache size: 6880878 60227986 16 1024MB
basic ops cache: hits/miss/sum: 198732 846995 1045727
used/not used/entry size/cache size: 997455 15779761 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: 4033 45394 49427
used/not used/entry size/cache size: 45376 8343232 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 66949422
1 157932
2 1507
3 3
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 8.511sec
BK_STOP 1679851284654
--------------------
content from stderr:
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.001sec
iterations count:12403 (56), effective:110 (0)
initing FirstDep: 0m 0.000sec
iterations count:220 (1), effective:0 (0)
iterations count:12168 (55), effective:110 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:12155 (55), effective:100 (0)
iterations count:12168 (55), effective:110 (0)
iterations count:12055 (54), effective:109 (0)
iterations count:426 (1), effective:1 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:12168 (55), effective:110 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:367 (1), effective:1 (0)
iterations count:220 (1), effective:0 (0)
iterations count:12180 (55), effective:110 (0)
iterations count:12180 (55), effective:110 (0)
iterations count:12157 (55), effective:101 (0)
iterations count:12180 (55), effective:110 (0)
iterations count:220 (1), effective:0 (0)
iterations count:221 (1), effective:1 (0)
iterations count:220 (1), effective:0 (0)
iterations count:297 (1), effective:1 (0)
iterations count:12180 (55), effective:110 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:422 (1), effective:1 (0)
iterations count:357 (1), effective:1 (0)
iterations count:220 (1), effective:0 (0)
iterations count:220 (1), effective:0 (0)
iterations count:12168 (55), effective:110 (0)
iterations count:220 (1), effective:0 (0)
iterations count:12168 (55), effective:110 (0)
iterations count:12168 (55), effective:110 (0)
iterations count:220 (1), effective:0 (0)
iterations count:12168 (55), effective:110 (0)
iterations count:12097 (54), effective:109 (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-r0010w0100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is RwMutex-PT-r0010w0100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r353-smll-167891800600129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0010w0100.tgz
mv RwMutex-PT-r0010w0100 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 '
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 ;