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.r289-tall-167873939800001.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 PhaseVariation-PT-D02CS010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r289-tall-167873939800001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73K 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 PhaseVariation-PT-D02CS010-CTLCardinality-00
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-01
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-02
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-03
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-04
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-05
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-06
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-07
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-08
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-09
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-10
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-11
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-12
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-13
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-14
FORMULA_NAME PhaseVariation-PT-D02CS010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678747494738

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=PhaseVariation-PT-D02CS010
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: PhaseVariation_PT_D02CS010
(NrP: 14 NrTr: 65 NrArc: 443)

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

net check time: 0m 0.000sec

init dd package: 0m 2.796sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 187 (1.9e+02) #states 7,716 (3)



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

checking: AF [AG [~ [cell___1_2__A_<=1]]]
normalized: ~ [EG [E [true U cell___1_2__A_<=1]]]

abstracting: (cell___1_2__A_<=1)
states: 5,182 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EG [EF [AX [EF [2<=run_dot]]]]
normalized: EG [E [true U ~ [EX [~ [E [true U 2<=run_dot]]]]]]

abstracting: (2<=run_dot)
states: 0
.
EG iterations: 0
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [AF [EF [cell___1_2__A_<=0]]]
normalized: EG [~ [EG [~ [E [true U cell___1_2__A_<=0]]]]]

abstracting: (cell___1_2__A_<=0)
states: 2,891 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [EX [~ [EG [AF [cell___2_2__A_<=cell___2_1__A_]]]]]
normalized: ~ [E [true U ~ [EX [~ [EG [~ [EG [~ [cell___2_2__A_<=cell___2_1__A_]]]]]]]]]

abstracting: (cell___2_2__A_<=cell___2_1__A_)
states: 4,977 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [A [1<=cell___2_2__A_ U 2<=cell___2_1__A_]]
normalized: ~ [EG [~ [[~ [EG [~ [2<=cell___2_1__A_]]] & ~ [E [~ [2<=cell___2_1__A_] U [~ [1<=cell___2_2__A_] & ~ [2<=cell___2_1__A_]]]]]]]]

abstracting: (2<=cell___2_1__A_)
states: 2,534 (3)
abstracting: (1<=cell___2_2__A_)
states: 4,825 (3)
abstracting: (2<=cell___2_1__A_)
states: 2,534 (3)
abstracting: (2<=cell___2_1__A_)
states: 2,534 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [~ [AF [[pool__2_1_<=1 | size_dot<=cell___1_2__A_]]]]
normalized: ~ [EX [~ [EG [~ [[pool__2_1_<=1 | size_dot<=cell___1_2__A_]]]]]]

abstracting: (size_dot<=cell___1_2__A_)
states: 0
abstracting: (pool__2_1_<=1)
states: 5,820 (3)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [[EF [~ [E [AF [size_dot<=1] U [3<=run_dot | cell___1_2__A_<=0]]]] & cell___1_2__A_<=size_dot]]
normalized: ~ [EX [~ [[cell___1_2__A_<=size_dot & E [true U ~ [E [~ [EG [~ [size_dot<=1]]] U [3<=run_dot | cell___1_2__A_<=0]]]]]]]]

abstracting: (cell___1_2__A_<=0)
states: 2,891 (3)
abstracting: (3<=run_dot)
states: 0
abstracting: (size_dot<=1)
states: 1
.
EG iterations: 1
abstracting: (cell___1_2__A_<=size_dot)
states: 7,716 (3)
.-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [AF [EX [[AX [AX [cell___2_1__B_<=cell___2_1__B_]] & ~ [[~ [3<=cell___2_1__A_] | AX [pool__1_2_<=cell___1_1__B_]]]]]]]
normalized: EG [~ [EX [[~ [[~ [EX [~ [pool__1_2_<=cell___1_1__B_]]] | ~ [3<=cell___2_1__A_]]] & ~ [EX [EX [~ [cell___2_1__B_<=cell___2_1__B_]]]]]]]]

abstracting: (cell___2_1__B_<=cell___2_1__B_)
states: 7,716 (3)
..abstracting: (3<=cell___2_1__A_)
states: 891
abstracting: (pool__1_2_<=cell___1_1__B_)
states: 4,984 (3)
...
EG iterations: 1
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: ~ [A [AF [[EF [AG [cell___1_1__B_<=1]] | A [A [cell___1_2__A_<=1 U 3<=run_dot] U [cell___1_1__B_<=0 | pool__2_2_<=cell___1_1__A_]]]] U ~ [EF [AG [1<=run_dot]]]]]
normalized: ~ [[~ [EG [E [true U ~ [E [true U ~ [1<=run_dot]]]]]] & ~ [E [E [true U ~ [E [true U ~ [1<=run_dot]]]] U [EG [~ [[E [true U ~ [E [true U ~ [cell___1_1__B_<=1]]]] | [~ [EG [~ [[cell___1_1__B_<=0 | pool__2_2_<=cell___1_1__A_]]]] & ~ [E [~ [[cell___1_1__B_<=0 | pool__2_2_<=cell___1_1__A_]] U [~ [[~ [EG [~ [3<=run_dot]]] & ~ [E [~ [3<=run_dot] U [~ [cell___1_2__A_<=1] & ~ [3<=run_dot]]]]]] & ~ [[cell___1_1__B_<=0 | pool__2_2_<=cell___1_1__A_]]]]]]]]] & E [true U ~ [E [true U ~ [1<=run_dot]]]]]]]]]

abstracting: (1<=run_dot)
states: 6,000 (3)
abstracting: (pool__2_2_<=cell___1_1__A_)
states: 6,584 (3)
abstracting: (cell___1_1__B_<=0)
states: 3,684 (3)
abstracting: (3<=run_dot)
states: 0
abstracting: (cell___1_2__A_<=1)
states: 5,182 (3)
abstracting: (3<=run_dot)
states: 0
abstracting: (3<=run_dot)
states: 0

EG iterations: 0
abstracting: (pool__2_2_<=cell___1_1__A_)
states: 6,584 (3)
abstracting: (cell___1_1__B_<=0)
states: 3,684 (3)
abstracting: (pool__2_2_<=cell___1_1__A_)
states: 6,584 (3)
abstracting: (cell___1_1__B_<=0)
states: 3,684 (3)
........
EG iterations: 8
abstracting: (cell___1_1__B_<=1)
states: 6,304 (3)
.
EG iterations: 1
abstracting: (1<=run_dot)
states: 6,000 (3)
abstracting: (1<=run_dot)
states: 6,000 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EX [[~ [AF [[size_dot<=cell___1_1__B_ & [[cell___1_2__B_<=cell___2_1__A_ & 1<=cell___1_2__A_] | A [1<=cell___1_1__B_ U pool__2_2_<=3]]]]] & ~ [EG [~ [EF [2<=run_dot]]]]]]
normalized: EX [[~ [EG [~ [E [true U 2<=run_dot]]]] & EG [~ [[size_dot<=cell___1_1__B_ & [[~ [EG [~ [pool__2_2_<=3]]] & ~ [E [~ [pool__2_2_<=3] U [~ [1<=cell___1_1__B_] & ~ [pool__2_2_<=3]]]]] | [cell___1_2__B_<=cell___2_1__A_ & 1<=cell___1_2__A_]]]]]]]

abstracting: (1<=cell___1_2__A_)
states: 4,825 (3)
abstracting: (cell___1_2__B_<=cell___2_1__A_)
states: 4,977 (3)
abstracting: (pool__2_2_<=3)
states: 7,716 (3)
abstracting: (1<=cell___1_1__B_)
states: 4,032 (3)
abstracting: (pool__2_2_<=3)
states: 7,716 (3)
abstracting: (pool__2_2_<=3)
states: 7,716 (3)
.
EG iterations: 1
abstracting: (size_dot<=cell___1_1__B_)
states: 0

EG iterations: 0
abstracting: (2<=run_dot)
states: 0

EG iterations: 0
.-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [[EG [3<=cell___2_1__B_] | AX [[[~ [[2<=cell___2_2__A_ & 3<=cell___2_2__B_]] | cell___1_1__A_<=cell___2_1__A_] | [E [pool__1_1_<=pool__2_2_ U run_dot<=1] & AX [cell___2_2__B_<=3]]]]]]
normalized: EG [[~ [EX [~ [[[~ [EX [~ [cell___2_2__B_<=3]]] & E [pool__1_1_<=pool__2_2_ U run_dot<=1]] | [cell___1_1__A_<=cell___2_1__A_ | ~ [[2<=cell___2_2__A_ & 3<=cell___2_2__B_]]]]]]] | EG [3<=cell___2_1__B_]]]

abstracting: (3<=cell___2_1__B_)
states: 891
.
EG iterations: 1
abstracting: (3<=cell___2_2__B_)
states: 891
abstracting: (2<=cell___2_2__A_)
states: 2,534 (3)
abstracting: (cell___1_1__A_<=cell___2_1__A_)
states: 3,322 (3)
abstracting: (run_dot<=1)
states: 7,716 (3)
abstracting: (pool__1_1_<=pool__2_2_)
states: 5,832 (3)
abstracting: (cell___2_2__B_<=3)
states: 7,716 (3)
..
EG iterations: 0
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[A [EX [[AG [pool__1_2_<=cell___2_1__B_] & [cell___2_1__B_<=3 & cell___1_1__A_<=run_dot]]] U [AF [E [1<=pool__1_1_ U cell___2_1__A_<=1]] | AX [EG [size_dot<=0]]]] | AX [~ [[AX [pool__2_2_<=2] | ~ [1<=cell___2_2__B_]]]]]]
normalized: EG [[~ [EX [[~ [1<=cell___2_2__B_] | ~ [EX [~ [pool__2_2_<=2]]]]]] | [~ [EG [~ [[~ [EX [~ [EG [size_dot<=0]]]] | ~ [EG [~ [E [1<=pool__1_1_ U cell___2_1__A_<=1]]]]]]]] & ~ [E [~ [[~ [EX [~ [EG [size_dot<=0]]]] | ~ [EG [~ [E [1<=pool__1_1_ U cell___2_1__A_<=1]]]]]] U [~ [EX [[[cell___2_1__B_<=3 & cell___1_1__A_<=run_dot] & ~ [E [true U ~ [pool__1_2_<=cell___2_1__B_]]]]]] & ~ [[~ [EX [~ [EG [size_dot<=0]]]] | ~ [EG [~ [E [1<=pool__1_1_ U cell___2_1__A_<=1]]]]]]]]]]]]

abstracting: (cell___2_1__A_<=1)
states: 5,182 (3)
abstracting: (1<=pool__1_1_)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (size_dot<=0)
states: 0
.
EG iterations: 1
.abstracting: (pool__1_2_<=cell___2_1__B_)
states: 5,445 (3)
abstracting: (cell___1_1__A_<=run_dot)
states: 3,000 (3)
abstracting: (cell___2_1__B_<=3)
states: 7,716 (3)
.abstracting: (cell___2_1__A_<=1)
states: 5,182 (3)
abstracting: (1<=pool__1_1_)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (size_dot<=0)
states: 0
.
EG iterations: 1
.abstracting: (cell___2_1__A_<=1)
states: 5,182 (3)
abstracting: (1<=pool__1_1_)
states: 3,480 (3)
.
EG iterations: 1
abstracting: (size_dot<=0)
states: 0
.
EG iterations: 1
............
EG iterations: 11
abstracting: (pool__2_2_<=2)
states: 7,116 (3)
.abstracting: (1<=cell___2_2__B_)
states: 4,825 (3)
..
EG iterations: 1
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: ~ [[EF [AG [[1<=pool__1_2_ | cell___1_2__A_<=3]]] & ~ [[A [[[3<=cell___1_1__B_ & cell___1_2__A_<=2] | [cell___2_2__B_<=3 & pool__2_1_<=2]] U [[3<=cell___2_1__B_ & cell___2_2__A_<=pool__1_2_] | AG [pool__1_2_<=cell___1_2__A_]]] & ~ [A [~ [2<=cell___1_2__A_] U ~ [cell___2_2__A_<=pool__1_2_]]]]]]]
normalized: ~ [[~ [[~ [[~ [EG [cell___2_2__A_<=pool__1_2_]] & ~ [E [cell___2_2__A_<=pool__1_2_ U [2<=cell___1_2__A_ & cell___2_2__A_<=pool__1_2_]]]]] & [~ [EG [~ [[~ [E [true U ~ [pool__1_2_<=cell___1_2__A_]]] | [3<=cell___2_1__B_ & cell___2_2__A_<=pool__1_2_]]]]] & ~ [E [~ [[~ [E [true U ~ [pool__1_2_<=cell___1_2__A_]]] | [3<=cell___2_1__B_ & cell___2_2__A_<=pool__1_2_]]] U [~ [[[cell___2_2__B_<=3 & pool__2_1_<=2] | [3<=cell___1_1__B_ & cell___1_2__A_<=2]]] & ~ [[~ [E [true U ~ [pool__1_2_<=cell___1_2__A_]]] | [3<=cell___2_1__B_ & cell___2_2__A_<=pool__1_2_]]]]]]]]] & E [true U ~ [E [true U ~ [[1<=pool__1_2_ | cell___1_2__A_<=3]]]]]]]

abstracting: (cell___1_2__A_<=3)
states: 7,716 (3)
abstracting: (1<=pool__1_2_)
states: 4,152 (3)
abstracting: (cell___2_2__A_<=pool__1_2_)
states: 4,562 (3)
abstracting: (3<=cell___2_1__B_)
states: 891
abstracting: (pool__1_2_<=cell___1_2__A_)
states: 5,068 (3)
abstracting: (cell___1_2__A_<=2)
states: 6,825 (3)
abstracting: (3<=cell___1_1__B_)
states: 0
abstracting: (pool__2_1_<=2)
states: 7,116 (3)
abstracting: (cell___2_2__B_<=3)
states: 7,716 (3)
abstracting: (cell___2_2__A_<=pool__1_2_)
states: 4,562 (3)
abstracting: (3<=cell___2_1__B_)
states: 891
abstracting: (pool__1_2_<=cell___1_2__A_)
states: 5,068 (3)
abstracting: (cell___2_2__A_<=pool__1_2_)
states: 4,562 (3)
abstracting: (3<=cell___2_1__B_)
states: 891
abstracting: (pool__1_2_<=cell___1_2__A_)
states: 5,068 (3)
.
EG iterations: 1
abstracting: (cell___2_2__A_<=pool__1_2_)
states: 4,562 (3)
abstracting: (2<=cell___1_2__A_)
states: 2,534 (3)
abstracting: (cell___2_2__A_<=pool__1_2_)
states: 4,562 (3)
abstracting: (cell___2_2__A_<=pool__1_2_)
states: 4,562 (3)
.......
EG iterations: 7
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AF [~ [[[EF [[[cell___1_1__A_<=0 & cell___2_2__B_<=cell___2_1__B_] & ~ [2<=size_dot]]] | [~ [[cell___2_1__B_<=0 | cell___2_2__B_<=cell___1_2__A_]] & [cell___1_2__B_<=0 & EX [pool__1_2_<=0]]]] & [[[AF [cell___2_2__B_<=pool__1_1_] | ~ [cell___1_2__B_<=cell___2_2__B_]] | 1<=pool__2_1_] | EG [[[pool__1_1_<=2 & 2<=pool__2_1_] | A [run_dot<=2 U size_dot<=pool__2_1_]]]]]]]
normalized: ~ [EG [[[EG [[[~ [EG [~ [size_dot<=pool__2_1_]]] & ~ [E [~ [size_dot<=pool__2_1_] U [~ [run_dot<=2] & ~ [size_dot<=pool__2_1_]]]]] | [pool__1_1_<=2 & 2<=pool__2_1_]]] | [[~ [cell___1_2__B_<=cell___2_2__B_] | ~ [EG [~ [cell___2_2__B_<=pool__1_1_]]]] | 1<=pool__2_1_]] & [[[EX [pool__1_2_<=0] & cell___1_2__B_<=0] & ~ [[cell___2_1__B_<=0 | cell___2_2__B_<=cell___1_2__A_]]] | E [true U [~ [2<=size_dot] & [cell___1_1__A_<=0 & cell___2_2__B_<=cell___2_1__B_]]]]]]]

abstracting: (cell___2_2__B_<=cell___2_1__B_)
states: 4,977 (3)
abstracting: (cell___1_1__A_<=0)
states: 0
abstracting: (2<=size_dot)
states: 7,715 (3)
abstracting: (cell___2_2__B_<=cell___1_2__A_)
states: 4,977 (3)
abstracting: (cell___2_1__B_<=0)
states: 2,891 (3)
abstracting: (cell___1_2__B_<=0)
states: 2,891 (3)
abstracting: (pool__1_2_<=0)
states: 3,564 (3)
.abstracting: (1<=pool__2_1_)
states: 4,152 (3)
abstracting: (cell___2_2__B_<=pool__1_1_)
states: 4,135 (3)
.
EG iterations: 1
abstracting: (cell___1_2__B_<=cell___2_2__B_)
states: 4,977 (3)
abstracting: (2<=pool__2_1_)
states: 1,896 (3)
abstracting: (pool__1_1_<=2)
states: 7,716 (3)
abstracting: (size_dot<=pool__2_1_)
states: 30
abstracting: (run_dot<=2)
states: 7,716 (3)
abstracting: (size_dot<=pool__2_1_)
states: 30
abstracting: (size_dot<=pool__2_1_)
states: 30
.
EG iterations: 1
.
EG iterations: 1
.....
EG iterations: 5
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: A [A [A [AX [[1<=cell___2_2__B_ | pool__1_2_<=1]] U EF [[cell___1_2__A_<=pool__1_1_ | cell___1_1__A_<=3]]] U [[~ [[[cell___1_1__B_<=size_dot | 3<=size_dot] | ~ [cell___1_2__B_<=size_dot]]] & 3<=pool__2_2_] | [[cell___1_1__B_<=0 | AG [size_dot<=0]] & A [[2<=pool__2_1_ | cell___1_2__B_<=2] U AG [pool__1_2_<=cell___2_2__B_]]]]] U AF [~ [[pool__2_1_<=3 & ~ [run_dot<=cell___1_1__B_]]]]]
normalized: [~ [EG [EG [[pool__2_1_<=3 & ~ [run_dot<=cell___1_1__B_]]]]] & ~ [E [EG [[pool__2_1_<=3 & ~ [run_dot<=cell___1_1__B_]]] U [~ [[~ [EG [~ [[[[~ [EG [E [true U ~ [pool__1_2_<=cell___2_2__B_]]]] & ~ [E [E [true U ~ [pool__1_2_<=cell___2_2__B_]] U [~ [[2<=pool__2_1_ | cell___1_2__B_<=2]] & E [true U ~ [pool__1_2_<=cell___2_2__B_]]]]]] & [cell___1_1__B_<=0 | ~ [E [true U ~ [size_dot<=0]]]]] | [3<=pool__2_2_ & ~ [[~ [cell___1_2__B_<=size_dot] | [cell___1_1__B_<=size_dot | 3<=size_dot]]]]]]]] & ~ [E [~ [[[[~ [EG [E [true U ~ [pool__1_2_<=cell___2_2__B_]]]] & ~ [E [E [true U ~ [pool__1_2_<=cell___2_2__B_]] U [~ [[2<=pool__2_1_ | cell___1_2__B_<=2]] & E [true U ~ [pool__1_2_<=cell___2_2__B_]]]]]] & [cell___1_1__B_<=0 | ~ [E [true U ~ [size_dot<=0]]]]] | [3<=pool__2_2_ & ~ [[~ [cell___1_2__B_<=size_dot] | [cell___1_1__B_<=size_dot | 3<=size_dot]]]]]] U [~ [[~ [EG [~ [E [true U [cell___1_2__A_<=pool__1_1_ | cell___1_1__A_<=3]]]]] & ~ [E [~ [E [true U [cell___1_2__A_<=pool__1_1_ | cell___1_1__A_<=3]]] U [EX [~ [[1<=cell___2_2__B_ | pool__1_2_<=1]]] & ~ [E [true U [cell___1_2__A_<=pool__1_1_ | cell___1_1__A_<=3]]]]]]]] & ~ [[[[~ [EG [E [true U ~ [pool__1_2_<=cell___2_2__B_]]]] & ~ [E [E [true U ~ [pool__1_2_<=cell___2_2__B_]] U [~ [[2<=pool__2_1_ | cell___1_2__B_<=2]] & E [true U ~ [pool__1_2_<=cell___2_2__B_]]]]]] & [cell___1_1__B_<=0 | ~ [E [true U ~ [size_dot<=0]]]]] | [3<=pool__2_2_ & ~ [[~ [cell___1_2__B_<=size_dot] | [cell___1_1__B_<=size_dot | 3<=size_dot]]]]]]]]]]] & EG [[pool__2_1_<=3 & ~ [run_dot<=cell___1_1__B_]]]]]]]

abstracting: (run_dot<=cell___1_1__B_)
states: 4,716 (3)
abstracting: (pool__2_1_<=3)
states: 7,716 (3)
.............
EG iterations: 13
abstracting: (3<=size_dot)
states: 7,707 (3)
abstracting: (cell___1_1__B_<=size_dot)
states: 7,716 (3)
abstracting: (cell___1_2__B_<=size_dot)
states: 7,716 (3)
abstracting: (3<=pool__2_2_)
states: 600
abstracting: (size_dot<=0)
states: 0
abstracting: (cell___1_1__B_<=0)
states: 3,684 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
abstracting: (cell___1_2__B_<=2)
states: 6,825 (3)
abstracting: (2<=pool__2_1_)
states: 1,896 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
........
EG iterations: 8
abstracting: (cell___1_1__A_<=3)
states: 7,716 (3)
abstracting: (cell___1_2__A_<=pool__1_1_)
states: 4,135 (3)
abstracting: (pool__1_2_<=1)
states: 5,820 (3)
abstracting: (1<=cell___2_2__B_)
states: 4,825 (3)
.abstracting: (cell___1_1__A_<=3)
states: 7,716 (3)
abstracting: (cell___1_2__A_<=pool__1_1_)
states: 4,135 (3)
abstracting: (cell___1_1__A_<=3)
states: 7,716 (3)
abstracting: (cell___1_2__A_<=pool__1_1_)
states: 4,135 (3)
.
EG iterations: 1
abstracting: (3<=size_dot)
states: 7,707 (3)
abstracting: (cell___1_1__B_<=size_dot)
states: 7,716 (3)
abstracting: (cell___1_2__B_<=size_dot)
states: 7,716 (3)
abstracting: (3<=pool__2_2_)
states: 600
abstracting: (size_dot<=0)
states: 0
abstracting: (cell___1_1__B_<=0)
states: 3,684 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
abstracting: (cell___1_2__B_<=2)
states: 6,825 (3)
abstracting: (2<=pool__2_1_)
states: 1,896 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
........
EG iterations: 8
abstracting: (3<=size_dot)
states: 7,707 (3)
abstracting: (cell___1_1__B_<=size_dot)
states: 7,716 (3)
abstracting: (cell___1_2__B_<=size_dot)
states: 7,716 (3)
abstracting: (3<=pool__2_2_)
states: 600
abstracting: (size_dot<=0)
states: 0
abstracting: (cell___1_1__B_<=0)
states: 3,684 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
abstracting: (cell___1_2__B_<=2)
states: 6,825 (3)
abstracting: (2<=pool__2_1_)
states: 1,896 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
abstracting: (pool__1_2_<=cell___2_2__B_)
states: 5,445 (3)
........
EG iterations: 8
.
EG iterations: 1
abstracting: (run_dot<=cell___1_1__B_)
states: 4,716 (3)
abstracting: (pool__2_1_<=3)
states: 7,716 (3)
.............
EG iterations: 13
abstracting: (run_dot<=cell___1_1__B_)
states: 4,716 (3)
abstracting: (pool__2_1_<=3)
states: 7,716 (3)
.............
EG iterations: 13
.
EG iterations: 1
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: [A [[cell___2_1__B_<=pool__1_1_ | ~ [A [[~ [pool__2_1_<=run_dot] | E [1<=pool__1_2_ U cell___2_2__A_<=cell___2_1__A_]] U [AX [run_dot<=1] | [cell___1_2__A_<=cell___2_1__B_ | cell___1_1__B_<=1]]]]] U [pool__1_2_<=1 | E [[~ [AF [pool__1_2_<=cell___1_2__B_]] | [size_dot<=pool__1_1_ & ~ [cell___1_2__B_<=pool__2_1_]]] U 2<=pool__2_1_]]] & AF [[[A [~ [cell___2_2__A_<=1] U A [1<=cell___2_2__B_ U 2<=run_dot]] & EG [[1<=pool__2_2_ & cell___1_1__A_<=1]]] | pool__1_2_<=cell___1_1__B_]]]
normalized: [~ [EG [~ [[pool__1_2_<=cell___1_1__B_ | [EG [[1<=pool__2_2_ & cell___1_1__A_<=1]] & [~ [EG [~ [[~ [EG [~ [2<=run_dot]]] & ~ [E [~ [2<=run_dot] U [~ [1<=cell___2_2__B_] & ~ [2<=run_dot]]]]]]]] & ~ [E [~ [[~ [EG [~ [2<=run_dot]]] & ~ [E [~ [2<=run_dot] U [~ [1<=cell___2_2__B_] & ~ [2<=run_dot]]]]]] U [cell___2_2__A_<=1 & ~ [[~ [EG [~ [2<=run_dot]]] & ~ [E [~ [2<=run_dot] U [~ [1<=cell___2_2__B_] & ~ [2<=run_dot]]]]]]]]]]]]]]] & [~ [EG [~ [[pool__1_2_<=1 | E [[[size_dot<=pool__1_1_ & ~ [cell___1_2__B_<=pool__2_1_]] | EG [~ [pool__1_2_<=cell___1_2__B_]]] U 2<=pool__2_1_]]]]] & ~ [E [~ [[pool__1_2_<=1 | E [[[size_dot<=pool__1_1_ & ~ [cell___1_2__B_<=pool__2_1_]] | EG [~ [pool__1_2_<=cell___1_2__B_]]] U 2<=pool__2_1_]]] U [~ [[cell___2_1__B_<=pool__1_1_ | ~ [[~ [EG [~ [[[cell___1_2__A_<=cell___2_1__B_ | cell___1_1__B_<=1] | ~ [EX [~ [run_dot<=1]]]]]]] & ~ [E [~ [[[cell___1_2__A_<=cell___2_1__B_ | cell___1_1__B_<=1] | ~ [EX [~ [run_dot<=1]]]]] U [~ [[E [1<=pool__1_2_ U cell___2_2__A_<=cell___2_1__A_] | ~ [pool__2_1_<=run_dot]]] & ~ [[[cell___1_2__A_<=cell___2_1__B_ | cell___1_1__B_<=1] | ~ [EX [~ [run_dot<=1]]]]]]]]]]]] & ~ [[pool__1_2_<=1 | E [[[size_dot<=pool__1_1_ & ~ [cell___1_2__B_<=pool__2_1_]] | EG [~ [pool__1_2_<=cell___1_2__B_]]] U 2<=pool__2_1_]]]]]]]]

abstracting: (2<=pool__2_1_)
states: 1,896 (3)
abstracting: (pool__1_2_<=cell___1_2__B_)
states: 5,068 (3)
.
EG iterations: 1
abstracting: (cell___1_2__B_<=pool__2_1_)
states: 4,562 (3)
abstracting: (size_dot<=pool__1_1_)
states: 7
abstracting: (pool__1_2_<=1)
states: 5,820 (3)
abstracting: (run_dot<=1)
states: 7,716 (3)
.abstracting: (cell___1_1__B_<=1)
states: 6,304 (3)
abstracting: (cell___1_2__A_<=cell___2_1__B_)
states: 4,977 (3)
abstracting: (pool__2_1_<=run_dot)
states: 5,364 (3)
abstracting: (cell___2_2__A_<=cell___2_1__A_)
states: 4,977 (3)
abstracting: (1<=pool__1_2_)
states: 4,152 (3)
abstracting: (run_dot<=1)
states: 7,716 (3)
.abstracting: (cell___1_1__B_<=1)
states: 6,304 (3)
abstracting: (cell___1_2__A_<=cell___2_1__B_)
states: 4,977 (3)
abstracting: (run_dot<=1)
states: 7,716 (3)
.abstracting: (cell___1_1__B_<=1)
states: 6,304 (3)
abstracting: (cell___1_2__A_<=cell___2_1__B_)
states: 4,977 (3)
.
EG iterations: 1
abstracting: (cell___2_1__B_<=pool__1_1_)
states: 4,135 (3)
abstracting: (2<=pool__2_1_)
states: 1,896 (3)
abstracting: (pool__1_2_<=cell___1_2__B_)
states: 5,068 (3)
.
EG iterations: 1
abstracting: (cell___1_2__B_<=pool__2_1_)
states: 4,562 (3)
abstracting: (size_dot<=pool__1_1_)
states: 7
abstracting: (pool__1_2_<=1)
states: 5,820 (3)
abstracting: (2<=pool__2_1_)
states: 1,896 (3)
abstracting: (pool__1_2_<=cell___1_2__B_)
states: 5,068 (3)
.
EG iterations: 1
abstracting: (cell___1_2__B_<=pool__2_1_)
states: 4,562 (3)
abstracting: (size_dot<=pool__1_1_)
states: 7
abstracting: (pool__1_2_<=1)
states: 5,820 (3)
.
EG iterations: 1
abstracting: (2<=run_dot)
states: 0
abstracting: (1<=cell___2_2__B_)
states: 4,825 (3)
abstracting: (2<=run_dot)
states: 0
abstracting: (2<=run_dot)
states: 0

EG iterations: 0
abstracting: (cell___2_2__A_<=1)
states: 5,182 (3)
abstracting: (2<=run_dot)
states: 0
abstracting: (1<=cell___2_2__B_)
states: 4,825 (3)
abstracting: (2<=run_dot)
states: 0
abstracting: (2<=run_dot)
states: 0

EG iterations: 0
abstracting: (2<=run_dot)
states: 0
abstracting: (1<=cell___2_2__B_)
states: 4,825 (3)
abstracting: (2<=run_dot)
states: 0
abstracting: (2<=run_dot)
states: 0

EG iterations: 0

EG iterations: 0
abstracting: (cell___1_1__A_<=1)
states: 3,684 (3)
abstracting: (1<=pool__2_2_)
states: 4,152 (3)
.
EG iterations: 1
abstracting: (pool__1_2_<=cell___1_1__B_)
states: 4,984 (3)
........
EG iterations: 8
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

totally nodes used: 42161 (4.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 247030 348759 595789
used/not used/entry size/cache size: 351874 66756990 16 1024MB
basic ops cache: hits/miss/sum: 33617 40092 73709
used/not used/entry size/cache size: 72643 16704573 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: 3122 3306 6428
used/not used/entry size/cache size: 3306 8385302 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 67069970
1 36793
2 1532
3 347
4 115
5 20
6 45
7 8
8 9
9 2
>= 10 23

Total processing time: 0m 4.576sec


BK_STOP 1678747499358

--------------------
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:592 (9), effective:28 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:203 (3), effective:10 (0)

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

iterations count:181 (2), effective:9 (0)

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

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

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

iterations count:203 (3), effective:10 (0)

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

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

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

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

iterations count:203 (3), effective:10 (0)

iterations count:203 (3), effective:10 (0)

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

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

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

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

iterations count:236 (3), effective:7 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:131 (2), effective:3 (0)

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

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

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

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

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

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhaseVariation-PT-D02CS010"
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 PhaseVariation-PT-D02CS010, 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 r289-tall-167873939800001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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