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.r161-tall-167838844800193.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 FMS-PT-00005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838844800193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.7K Feb 25 19:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 19:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 19:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 19:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 19:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 25 19:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K Mar 5 18:22 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 FMS-PT-00005-CTLCardinality-00
FORMULA_NAME FMS-PT-00005-CTLCardinality-01
FORMULA_NAME FMS-PT-00005-CTLCardinality-02
FORMULA_NAME FMS-PT-00005-CTLCardinality-03
FORMULA_NAME FMS-PT-00005-CTLCardinality-04
FORMULA_NAME FMS-PT-00005-CTLCardinality-05
FORMULA_NAME FMS-PT-00005-CTLCardinality-06
FORMULA_NAME FMS-PT-00005-CTLCardinality-07
FORMULA_NAME FMS-PT-00005-CTLCardinality-08
FORMULA_NAME FMS-PT-00005-CTLCardinality-09
FORMULA_NAME FMS-PT-00005-CTLCardinality-10
FORMULA_NAME FMS-PT-00005-CTLCardinality-11
FORMULA_NAME FMS-PT-00005-CTLCardinality-12
FORMULA_NAME FMS-PT-00005-CTLCardinality-13
FORMULA_NAME FMS-PT-00005-CTLCardinality-14
FORMULA_NAME FMS-PT-00005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679420365299

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=FMS-PT-00005
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: FMS_PT_00005
(NrP: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.911sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 1005 (1.0e+03) #states 2,895,018 (6)



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

checking: EF [EF [5<=P2wP1]]
normalized: E [true U E [true U 5<=P2wP1]]

abstracting: (5<=P2wP1)
states: 5,166 (3)
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: E [~ [AX [AG [~ [M2<=P3]]]] U EG [P3<=0]]
normalized: E [EX [E [true U M2<=P3]] U EG [P3<=0]]

abstracting: (P3<=0)
states: 827,148 (5)
.
EG iterations: 1
abstracting: (M2<=P3)
states: 2,339,676 (6)
.-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EX [[~ [AG [EF [AF [P1wP2<=P1]]]] | ~ [P2M2<=4]]]
normalized: EX [[~ [P2M2<=4] | E [true U ~ [E [true U ~ [EG [~ [P1wP2<=P1]]]]]]]]

abstracting: (P1wP2<=P1)
states: 1,980,552 (6)
.
EG iterations: 1
abstracting: (P2M2<=4)
states: 2,895,018 (6)
.-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [AG [~ [EF [[E [3<=P12 U 2<=P3s] | ~ [4<=P2wM2]]]]]]
normalized: E [true U ~ [E [true U E [true U [~ [4<=P2wM2] | E [3<=P12 U 2<=P3s]]]]]]

abstracting: (2<=P3s)
states: 1,378,580 (6)
abstracting: (3<=P12)
states: 12,054 (4)
abstracting: (4<=P2wM2)
states: 41,496 (4)
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [E [[5<=P3 | P1<=P1d] U P12M3<=2]]
normalized: EX [E [[5<=P3 | P1<=P1d] U P12M3<=2]]

abstracting: (P12M3<=2)
states: 2,895,018 (6)
abstracting: (P1<=P1d)
states: 1,980,552 (6)
abstracting: (5<=P3)
states: 137,858 (5)
.-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[~ [AX [EG [P1<=P3M2]]] | AG [[~ [3<=P2M2] | AF [P2M2<=P2d]]]]]]
normalized: E [true U ~ [[~ [E [true U ~ [[~ [EG [~ [P2M2<=P2d]]] | ~ [3<=P2M2]]]]] | EX [~ [EG [P1<=P3M2]]]]]]

abstracting: (P1<=P3M2)
states: 2,379,498 (6)
.
EG iterations: 1
.abstracting: (3<=P2M2)
states: 0
abstracting: (P2M2<=P2d)
states: 2,349,186 (6)
....................
EG iterations: 20
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AF [AG [[AX [AF [2<=P2wP1]] | [EF [P2s<=3] | [M1<=P1wP2 | EG [4<=P12M3]]]]]]
normalized: ~ [EG [E [true U ~ [[[[M1<=P1wP2 | EG [4<=P12M3]] | E [true U P2s<=3]] | ~ [EX [EG [~ [2<=P2wP1]]]]]]]]]

abstracting: (2<=P2wP1)
states: 547,239 (5)
.
EG iterations: 1
.abstracting: (P2s<=3)
states: 2,853,522 (6)
abstracting: (4<=P12M3)
states: 0
.
EG iterations: 1
abstracting: (M1<=P1wP2)
states: 465,360 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EX [[A [AF [AG [P1wM1<=P1wP2]] U EF [[~ [P3<=P2s] | AF [1<=P3]]]] & EX [[EF [AX [3<=P2wM2]] & 3<=P2wM2]]]]
normalized: EX [[EX [[3<=P2wM2 & E [true U ~ [EX [~ [3<=P2wM2]]]]]] & [~ [EG [~ [E [true U [~ [EG [~ [1<=P3]]] | ~ [P3<=P2s]]]]]] & ~ [E [~ [E [true U [~ [EG [~ [1<=P3]]] | ~ [P3<=P2s]]]] U [EG [E [true U ~ [P1wM1<=P1wP2]]] & ~ [E [true U [~ [EG [~ [1<=P3]]] | ~ [P3<=P2s]]]]]]]]]]

abstracting: (P3<=P2s)
states: 1,284,072 (6)
abstracting: (1<=P3)
states: 2,067,870 (6)
.
EG iterations: 1
abstracting: (P1wM1<=P1wP2)
states: 1,980,552 (6)

EG iterations: 0
abstracting: (P3<=P2s)
states: 1,284,072 (6)
abstracting: (1<=P3)
states: 2,067,870 (6)
.
EG iterations: 1
abstracting: (P3<=P2s)
states: 1,284,072 (6)
abstracting: (1<=P3)
states: 2,067,870 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (3<=P2wM2)
states: 178,080 (5)
.abstracting: (3<=P2wM2)
states: 178,080 (5)
..-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: ~ [AG [[A [~ [[P2d<=2 | [P12M3<=P3M2 | P3s<=1]]] U P1s<=P3M2] | [3<=P3 & AX [P2<=5]]]]]
normalized: E [true U ~ [[[3<=P3 & ~ [EX [~ [P2<=5]]]] | [~ [EG [~ [P1s<=P3M2]]] & ~ [E [~ [P1s<=P3M2] U [[P2d<=2 | [P12M3<=P3M2 | P3s<=1]] & ~ [P1s<=P3M2]]]]]]]]

abstracting: (P1s<=P3M2)
states: 2,379,498 (6)
abstracting: (P3s<=1)
states: 1,516,438 (6)
abstracting: (P12M3<=P3M2)
states: 2,701,352 (6)
abstracting: (P2d<=2)
states: 2,716,938 (6)
abstracting: (P1s<=P3M2)
states: 2,379,498 (6)
abstracting: (P1s<=P3M2)
states: 2,379,498 (6)
.
EG iterations: 1
abstracting: (P2<=5)
states: 2,895,018 (6)
.abstracting: (3<=P3)
states: 827,148 (5)
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: AX [[AF [[AX [[P2<=P1d & P2d<=P12wM3]] & ~ [AF [P1d<=P1s]]]] | [P3M2<=5 & EG [P1wP2<=M2]]]]
normalized: ~ [EX [~ [[[P3M2<=5 & EG [P1wP2<=M2]] | ~ [EG [~ [[EG [~ [P1d<=P1s]] & ~ [EX [~ [[P2<=P1d & P2d<=P12wM3]]]]]]]]]]]]

abstracting: (P2d<=P12wM3)
states: 1,714,902 (6)
abstracting: (P2<=P1d)
states: 1,974,378 (6)
.abstracting: (P1d<=P1s)
states: 1,980,552 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (P1wP2<=M2)
states: 2,146,116 (6)
.
EG iterations: 1
abstracting: (P3M2<=5)
states: 2,895,018 (6)
.-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: AF [[[EF [EF [~ [P2d<=2]]] & [AG [~ [EX [5<=M1]]] | AG [[[M3<=4 | P1wM1<=5] | [P1M1<=P3s | P1wP2<=5]]]]] & [~ [EG [AF [1<=P3M2]]] | [P3s<=P1M1 | ~ [P1<=4]]]]]
normalized: ~ [EG [~ [[[[P3s<=P1M1 | ~ [P1<=4]] | ~ [EG [~ [EG [~ [1<=P3M2]]]]]] & [[~ [E [true U ~ [[[P1M1<=P3s | P1wP2<=5] | [M3<=4 | P1wM1<=5]]]]] | ~ [E [true U EX [5<=M1]]]] & E [true U E [true U ~ [P2d<=2]]]]]]]]

abstracting: (P2d<=2)
states: 2,716,938 (6)
abstracting: (5<=M1)
states: 0
.abstracting: (P1wM1<=5)
states: 2,895,018 (6)
abstracting: (M3<=4)
states: 2,895,018 (6)
abstracting: (P1wP2<=5)
states: 2,895,018 (6)
abstracting: (P1M1<=P3s)
states: 2,407,442 (6)
abstracting: (1<=P3M2)
states: 2,067,870 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (P1<=4)
states: 2,890,902 (6)
abstracting: (P3s<=P1M1)
states: 1,228,018 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: ~ [[~ [[AF [[EG [P12s<=P1s] & E [P1wP2<=M3 U P2<=P2d]]] | EF [[~ [P2d<=P12wM3] & AG [P2M2<=P12]]]]] | E [EF [~ [AG [P12s<=3]]] U 4<=P2M2]]]
normalized: ~ [[E [E [true U E [true U ~ [P12s<=3]]] U 4<=P2M2] | ~ [[E [true U [~ [E [true U ~ [P2M2<=P12]]] & ~ [P2d<=P12wM3]]] | ~ [EG [~ [[E [P1wP2<=M3 U P2<=P2d] & EG [P12s<=P1s]]]]]]]]]

abstracting: (P12s<=P1s)
states: 2,494,422 (6)
.
EG iterations: 1
abstracting: (P2<=P2d)
states: 1,943,697 (6)
abstracting: (P1wP2<=M3)
states: 2,664,501 (6)
............
EG iterations: 12
abstracting: (P2d<=P12wM3)
states: 1,714,902 (6)
abstracting: (P2M2<=P12)
states: 2,130,576 (6)
abstracting: (4<=P2M2)
states: 0
abstracting: (P12s<=3)
states: 2,894,178 (6)
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

checking: [EF [AX [[[~ [[P1d<=P12wM3 & P1d<=4]] & [[3<=P2wP1 & 1<=P3s] & A [P12s<=3 U P1M1<=0]]] & EX [[5<=P3s & M1<=P1wP2]]]]] | AX [[EX [[AG [1<=P2s] & 4<=P2wP1]] & EG [AG [[P2M2<=2 & P12M3<=1]]]]]]
normalized: [~ [EX [~ [[EG [~ [E [true U ~ [[P2M2<=2 & P12M3<=1]]]]] & EX [[4<=P2wP1 & ~ [E [true U ~ [1<=P2s]]]]]]]]] | E [true U ~ [EX [~ [[EX [[5<=P3s & M1<=P1wP2]] & [[[~ [EG [~ [P1M1<=0]]] & ~ [E [~ [P1M1<=0] U [~ [P12s<=3] & ~ [P1M1<=0]]]]] & [3<=P2wP1 & 1<=P3s]] & ~ [[P1d<=P12wM3 & P1d<=4]]]]]]]]]

abstracting: (P1d<=4)
states: 2,890,902 (6)
abstracting: (P1d<=P12wM3)
states: 1,784,811 (6)
abstracting: (1<=P3s)
states: 2,067,870 (6)
abstracting: (3<=P2wP1)
states: 178,080 (5)
abstracting: (P1M1<=0)
states: 1,643,712 (6)
abstracting: (P12s<=3)
states: 2,894,178 (6)
abstracting: (P1M1<=0)
states: 1,643,712 (6)
abstracting: (P1M1<=0)
states: 1,643,712 (6)
.
EG iterations: 1
abstracting: (M1<=P1wP2)
states: 465,360 (5)
abstracting: (5<=P3s)
states: 137,858 (5)
..abstracting: (1<=P2s)
states: 1,356,810 (6)
abstracting: (4<=P2wP1)
states: 41,496 (4)
.abstracting: (P12M3<=1)
states: 2,805,012 (6)
abstracting: (P2M2<=2)
states: 2,895,018 (6)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: A [E [[[AG [[M3<=P3 & 3<=P1d]] & P2wP1<=1] | AX [[[4<=P2 | 1<=P3M2] & EX [5<=P12]]]] U [P1M1<=P2d & P2<=3]] U [A [EX [~ [[P12<=0 & M3<=3]]] U E [~ [AX [4<=P1d]] U ~ [P1s<=3]]] | AF [~ [P1s<=3]]]]
normalized: [~ [EG [~ [[~ [EG [P1s<=3]] | [~ [EG [~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]]]] & ~ [E [~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]] U [~ [EX [~ [[P12<=0 & M3<=3]]]] & ~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]]]]]]]]]] & ~ [E [~ [[~ [EG [P1s<=3]] | [~ [EG [~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]]]] & ~ [E [~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]] U [~ [EX [~ [[P12<=0 & M3<=3]]]] & ~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]]]]]]]] U [~ [E [[~ [EX [~ [[EX [5<=P12] & [4<=P2 | 1<=P3M2]]]]] | [P2wP1<=1 & ~ [E [true U ~ [[M3<=P3 & 3<=P1d]]]]]] U [P1M1<=P2d & P2<=3]]] & ~ [[~ [EG [P1s<=3]] | [~ [EG [~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]]]] & ~ [E [~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]] U [~ [EX [~ [[P12<=0 & M3<=3]]]] & ~ [E [EX [~ [4<=P1d]] U ~ [P1s<=3]]]]]]]]]]]]]

abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
.abstracting: (M3<=3)
states: 2,895,018 (6)
abstracting: (P12<=0)
states: 2,280,978 (6)
.abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
.abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
..
EG iterations: 1
abstracting: (P1s<=3)
states: 2,861,502 (6)
.
EG iterations: 1
abstracting: (P2<=3)
states: 2,853,522 (6)
abstracting: (P1M1<=P2d)
states: 2,098,362 (6)
abstracting: (3<=P1d)
states: 149,856 (5)
abstracting: (M3<=P3)
states: 1,547,826 (6)
abstracting: (P2wP1<=1)
states: 2,347,779 (6)
abstracting: (1<=P3M2)
states: 2,067,870 (6)
abstracting: (4<=P2)
states: 41,496 (4)
abstracting: (5<=P12)
states: 21
..abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
.abstracting: (M3<=3)
states: 2,895,018 (6)
abstracting: (P12<=0)
states: 2,280,978 (6)
.abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
.abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
..
EG iterations: 1
abstracting: (P1s<=3)
states: 2,861,502 (6)
.
EG iterations: 1
abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
.abstracting: (M3<=3)
states: 2,895,018 (6)
abstracting: (P12<=0)
states: 2,280,978 (6)
.abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
.abstracting: (P1s<=3)
states: 2,861,502 (6)
abstracting: (4<=P1d)
states: 33,516 (4)
..
EG iterations: 1
abstracting: (P1s<=3)
states: 2,861,502 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: ~ [AG [[[~ [AG [P1wM1<=P2]] & EF [AX [P12wM3<=P1s]]] | [[[P12M3<=1 | [P12M3<=P12M3 | [P12<=P12s | 3<=P1wM1]]] & ~ [EF [P1wP2<=P1wM1]]] & E [[P1M1<=P12wM3 | [2<=P12 & P2M2<=P1d]] U A [P1wM1<=3 U P12<=4]]]]]]
normalized: E [true U ~ [[[E [[P1M1<=P12wM3 | [2<=P12 & P2M2<=P1d]] U [~ [EG [~ [P12<=4]]] & ~ [E [~ [P12<=4] U [~ [P1wM1<=3] & ~ [P12<=4]]]]]] & [~ [E [true U P1wP2<=P1wM1]] & [P12M3<=1 | [P12M3<=P12M3 | [P12<=P12s | 3<=P1wM1]]]]] | [E [true U ~ [EX [~ [P12wM3<=P1s]]]] & E [true U ~ [P1wM1<=P2]]]]]]

abstracting: (P1wM1<=P2)
states: 2,067,492 (6)
abstracting: (P12wM3<=P1s)
states: 2,494,422 (6)
.abstracting: (3<=P1wM1)
states: 149,856 (5)
abstracting: (P12<=P12s)
states: 2,371,782 (6)
abstracting: (P12M3<=P12M3)
states: 2,895,018 (6)
abstracting: (P12M3<=1)
states: 2,805,012 (6)
abstracting: (P1wP2<=P1wM1)
states: 1,980,552 (6)
abstracting: (P12<=4)
states: 2,894,997 (6)
abstracting: (P1wM1<=3)
states: 2,861,502 (6)
abstracting: (P12<=4)
states: 2,894,997 (6)
abstracting: (P12<=4)
states: 2,894,997 (6)
.
EG iterations: 1
abstracting: (P2M2<=P1d)
states: 2,370,858 (6)
abstracting: (2<=P12)
states: 102,039 (5)
abstracting: (P1M1<=P12wM3)
states: 1,814,211 (6)
-> the formula is FALSE

FORMULA FMS-PT-00005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: [EF [~ [[[~ [[[P3s<=P12M3 | P12s<=P12s] | ~ [P1d<=4]]] & E [[M3<=P2wP1 | P1<=P2] U [M3<=4 | P12<=P12wM3]]] | AF [~ [P1wM1<=0]]]]] & E [[~ [P1wM1<=2] | [A [AF [5<=P1d] U M3<=2] & [AX [[4<=P2 & P12wM3<=0]] & A [~ [P1s<=M2] U [P2wP1<=1 | M1<=P2wP1]]]]] U [[AG [[E [3<=P12s U 1<=P2s] | AG [P3<=P3s]]] | [3<=P2M2 & EX [AG [2<=P2s]]]] | [[M1<=0 & ~ [A [P12s<=P2wP1 U 4<=P12]]] | AG [~ [P3s<=P2]]]]]]
normalized: [E [[[[[~ [EG [~ [[P2wP1<=1 | M1<=P2wP1]]]] & ~ [E [~ [[P2wP1<=1 | M1<=P2wP1]] U [P1s<=M2 & ~ [[P2wP1<=1 | M1<=P2wP1]]]]]] & ~ [EX [~ [[4<=P2 & P12wM3<=0]]]]] & [~ [EG [~ [M3<=2]]] & ~ [E [~ [M3<=2] U [EG [~ [5<=P1d]] & ~ [M3<=2]]]]]] | ~ [P1wM1<=2]] U [[~ [E [true U P3s<=P2]] | [M1<=0 & ~ [[~ [EG [~ [4<=P12]]] & ~ [E [~ [4<=P12] U [~ [P12s<=P2wP1] & ~ [4<=P12]]]]]]]] | [[3<=P2M2 & EX [~ [E [true U ~ [2<=P2s]]]]] | ~ [E [true U ~ [[~ [E [true U ~ [P3<=P3s]]] | E [3<=P12s U 1<=P2s]]]]]]]] & E [true U ~ [[~ [EG [P1wM1<=0]] | [E [[M3<=P2wP1 | P1<=P2] U [M3<=4 | P12<=P12wM3]] & ~ [[~ [P1d<=4] | [P3s<=P12M3 | P12s<=P12s]]]]]]]]

abstracting: (P12s<=P12s)
states: 2,895,018 (6)
abstracting: (P3s<=P12M3)
states: 987,822 (5)
abstracting: (P1d<=4)
states: 2,890,902 (6)
abstracting: (P12<=P12wM3)
states: 2,371,782 (6)
abstracting: (M3<=4)
states: 2,895,018 (6)
abstracting: (P1<=P2)
states: 2,067,492 (6)
abstracting: (M3<=P2wP1)
states: 771,498 (5)
abstracting: (P1wM1<=0)
states: 1,614,312 (6)
.
EG iterations: 1
abstracting: (1<=P2s)
states: 1,356,810 (6)
abstracting: (3<=P12s)
states: 12,054 (4)
abstracting: (P3<=P3s)
states: 1,654,296 (6)
abstracting: (2<=P2s)
states: 547,239 (5)
.abstracting: (3<=P2M2)
states: 0
abstracting: (4<=P12)
states: 840
abstracting: (P12s<=P2wP1)
states: 2,508,177 (6)
abstracting: (4<=P12)
states: 840
abstracting: (4<=P12)
states: 840
.
EG iterations: 1
abstracting: (M1<=0)
states: 116,340 (5)
abstracting: (P3s<=P2)
states: 1,284,072 (6)
abstracting: (P1wM1<=2)
states: 2,745,162 (6)
abstracting: (M3<=2)
states: 2,895,018 (6)
abstracting: (5<=P1d)
states: 4,116 (3)
.
EG iterations: 1
abstracting: (M3<=2)
states: 2,895,018 (6)
abstracting: (M3<=2)
states: 2,895,018 (6)
.
EG iterations: 1
abstracting: (P12wM3<=0)
states: 2,280,978 (6)
abstracting: (4<=P2)
states: 41,496 (4)
.abstracting: (M1<=P2wP1)
states: 528,654 (5)
abstracting: (P2wP1<=1)
states: 2,347,779 (6)
abstracting: (P1s<=M2)
states: 2,146,116 (6)
abstracting: (M1<=P2wP1)
states: 528,654 (5)
abstracting: (P2wP1<=1)
states: 2,347,779 (6)
abstracting: (M1<=P2wP1)
states: 528,654 (5)
abstracting: (P2wP1<=1)
states: 2,347,779 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

totally nodes used: 279481 (2.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 994769 803489 1798258
used/not used/entry size/cache size: 1022618 66086246 16 1024MB
basic ops cache: hits/miss/sum: 395103 312766 707869
used/not used/entry size/cache size: 532735 16244481 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: 48365 34623 82988
used/not used/entry size/cache size: 34564 8354044 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 66843615
1 256967
2 6654
3 606
4 232
5 198
6 216
7 154
8 53
9 33
>= 10 136

Total processing time: 0m 5.166sec


BK_STOP 1679420370528

--------------------
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.000sec


iterations count:405 (20), effective:85 (4)

initing FirstDep: 0m 0.000sec


iterations count:225 (11), effective:45 (2)

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

iterations count:39 (1), effective:7 (0)

iterations count:35 (1), effective:5 (0)

iterations count:162 (8), effective:36 (1)

iterations count:38 (1), effective:6 (0)

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

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

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

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

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

iterations count:191 (9), effective:44 (2)

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

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

iterations count:252 (12), effective:52 (2)

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

iterations count:156 (7), effective:47 (2)

iterations count:206 (10), effective:42 (2)

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

iterations count:40 (2), effective:5 (0)

iterations count:89 (4), effective:18 (0)

iterations count:304 (15), effective:56 (2)

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

iterations count:304 (15), effective:56 (2)

iterations count:30 (1), effective:5 (0)

iterations count:148 (7), effective:28 (1)

iterations count:241 (12), effective:59 (2)

iterations count:241 (12), effective:59 (2)

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

iterations count:241 (12), effective:59 (2)

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

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

iterations count:241 (12), effective:59 (2)

iterations count:241 (12), effective:59 (2)

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

iterations count:241 (12), effective:59 (2)

iterations count:60 (3), effective:16 (0)

iterations count:241 (12), effective:59 (2)

iterations count:241 (12), effective:59 (2)

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

iterations count:241 (12), effective:59 (2)

iterations count:131 (6), effective:33 (1)

iterations count:91 (4), effective:22 (1)

iterations count:164 (8), effective:36 (1)

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

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

iterations count:34 (1), effective:7 (0)

iterations count:82 (4), effective:14 (0)

iterations count:32 (1), effective:5 (0)

iterations count:39 (1), effective:8 (0)

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

iterations count:185 (9), effective:32 (1)

iterations count:95 (4), effective:30 (1)

iterations count:40 (2), effective:5 (0)

iterations count:142 (7), effective:42 (2)

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="FMS-PT-00005"
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 FMS-PT-00005, 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 r161-tall-167838844800193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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