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.r257-smll-167863532200081.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 NeighborGrid-PT-d2n3m1t12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532200081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 09:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 19K 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 NeighborGrid-PT-d2n3m1t12-CTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678681807199

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=NeighborGrid-PT-d2n3m1t12
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: NeighborGrid_PT_d2n3m1t12
(NrP: 9 NrTr: 72 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 3.555sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 81 (8.1e+01) #states 24,310 (4)



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

checking: ~ [A [AX [1<=p_0_2] U p_0_1<=0]]
normalized: ~ [[~ [EG [~ [p_0_1<=0]]] & ~ [E [~ [p_0_1<=0] U [~ [p_0_1<=0] & EX [~ [1<=p_0_2]]]]]]]

abstracting: (1<=p_0_2)
states: 12,870 (4)
.abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [AG [[AG [p_1_2<=p_2_1] | p_0_2<=p_0_1]]]
normalized: E [true U ~ [E [true U ~ [[~ [E [true U ~ [p_1_2<=p_2_1]]] | p_0_2<=p_0_1]]]]]

abstracting: (p_0_2<=p_0_1)
states: 15,792 (4)
abstracting: (p_1_2<=p_2_1)
states: 15,792 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EX [EG [A [AX [~ [1<=p_0_2]] U ~ [A [p_0_2<=1 U p_1_1<=p_0_2]]]]]
normalized: EX [EG [[~ [EG [[~ [EG [~ [p_1_1<=p_0_2]]] & ~ [E [~ [p_1_1<=p_0_2] U [~ [p_0_2<=1] & ~ [p_1_1<=p_0_2]]]]]]] & ~ [E [[~ [EG [~ [p_1_1<=p_0_2]]] & ~ [E [~ [p_1_1<=p_0_2] U [~ [p_0_2<=1] & ~ [p_1_1<=p_0_2]]]]] U [EX [1<=p_0_2] & [~ [EG [~ [p_1_1<=p_0_2]]] & ~ [E [~ [p_1_1<=p_0_2] U [~ [p_0_2<=1] & ~ [p_1_1<=p_0_2]]]]]]]]]]]

abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (1<=p_0_2)
states: 12,870 (4)
.abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AF [~ [[EX [E [[p_1_2<=p_0_0 | p_1_2<=1] U p_2_1<=0]] | p_1_0<=1]]]
normalized: ~ [EG [[EX [E [[p_1_2<=p_0_0 | p_1_2<=1] U p_2_1<=0]] | p_1_0<=1]]]

abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_1_2<=p_0_0)
states: 15,792 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EX [EF [[[A [EG [p_1_1<=p_2_2] U ~ [1<=p_1_0]] & AG [EF [1<=p_2_1]]] & [EX [EG [p_1_1<=1]] | EX [1<=p_1_0]]]]]
normalized: EX [E [true U [[[~ [E [1<=p_1_0 U [~ [EG [p_1_1<=p_2_2]] & 1<=p_1_0]]] & ~ [EG [1<=p_1_0]]] & ~ [E [true U ~ [E [true U 1<=p_2_1]]]]] & [EX [1<=p_1_0] | EX [EG [p_1_1<=1]]]]]]

abstracting: (p_1_1<=1)
states: 17,875 (4)
.
EG iterations: 1
.abstracting: (1<=p_1_0)
states: 12,870 (4)
.abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_1_1<=p_2_2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 12,870 (4)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[[p_0_1<=p_2_1 | p_0_2<=p_1_1] | E [AF [p_0_0<=1] U AX [[~ [1<=p_2_2] | EG [1<=p_2_2]]]]]]
normalized: ~ [E [true U ~ [[E [~ [EG [~ [p_0_0<=1]]] U ~ [EX [~ [[EG [1<=p_2_2] | ~ [1<=p_2_2]]]]]] | [p_0_1<=p_2_1 | p_0_2<=p_1_1]]]]]

abstracting: (p_0_2<=p_1_1)
states: 15,792 (4)
abstracting: (p_0_1<=p_2_1)
states: 15,792 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
.
EG iterations: 1
.abstracting: (p_0_0<=1)
states: 17,875 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[AF [A [~ [p_0_2<=p_0_0] U 1<=p_1_2]] & ~ [AF [~ [1<=p_0_1]]]] | AX [[~ [A [1<=p_0_1 U 1<=p_0_1]] | EF [~ [p_1_1<=1]]]]]]
normalized: E [true U [~ [EX [~ [[E [true U ~ [p_1_1<=1]] | ~ [[~ [EG [~ [1<=p_0_1]]] & ~ [E [~ [1<=p_0_1] U [~ [1<=p_0_1] & ~ [1<=p_0_1]]]]]]]]]] | [EG [1<=p_0_1] & ~ [EG [~ [[~ [EG [~ [1<=p_1_2]]] & ~ [E [~ [1<=p_1_2] U [~ [1<=p_1_2] & p_0_2<=p_0_0]]]]]]]]]]

abstracting: (p_0_2<=p_0_0)
states: 15,792 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p_0_1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_1_1<=1)
states: 17,875 (4)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: [A [~ [AF [A [[p_0_0<=p_2_2 | p_2_1<=p_0_1] U AX [p_0_0<=p_2_0]]]] U ~ [AX [p_0_2<=0]]] & AF [EF [AF [AX [p_1_0<=0]]]]]
normalized: [~ [EG [~ [E [true U ~ [EG [EX [~ [p_1_0<=0]]]]]]]] & [~ [EG [~ [EX [~ [p_0_2<=0]]]]] & ~ [E [~ [EX [~ [p_0_2<=0]]] U [~ [EG [~ [[~ [EG [EX [~ [p_0_0<=p_2_0]]]] & ~ [E [EX [~ [p_0_0<=p_2_0]] U [~ [[p_0_0<=p_2_2 | p_2_1<=p_0_1]] & EX [~ [p_0_0<=p_2_0]]]]]]]]] & ~ [EX [~ [p_0_2<=0]]]]]]]]

abstracting: (p_0_2<=0)
states: 11,440 (4)
.abstracting: (p_0_0<=p_2_0)
states: 15,792 (4)
.abstracting: (p_2_1<=p_0_1)
states: 15,792 (4)
abstracting: (p_0_0<=p_2_2)
states: 15,792 (4)
abstracting: (p_0_0<=p_2_0)
states: 15,792 (4)
.abstracting: (p_0_0<=p_2_0)
states: 15,792 (4)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (p_0_2<=0)
states: 11,440 (4)
.abstracting: (p_0_2<=0)
states: 11,440 (4)
..
EG iterations: 1
abstracting: (p_1_0<=0)
states: 11,440 (4)
.
EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: E [AX [AF [~ [EG [1<=p_1_1]]]] U AG [[p_0_0<=p_0_0 | [AG [[1<=p_1_0 | p_0_2<=p_2_1]] | [~ [AG [p_1_2<=0]] & AX [p_2_2<=1]]]]]]
normalized: E [~ [EX [EG [EG [1<=p_1_1]]]] U ~ [E [true U ~ [[[[~ [EX [~ [p_2_2<=1]]] & E [true U ~ [p_1_2<=0]]] | ~ [E [true U ~ [[1<=p_1_0 | p_0_2<=p_2_1]]]]] | p_0_0<=p_0_0]]]]]

abstracting: (p_0_0<=p_0_0)
states: 24,310 (4)
abstracting: (p_0_2<=p_2_1)
states: 15,792 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
.abstracting: (1<=p_1_1)
states: 12,870 (4)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: [AX [[[E [~ [EG [p_0_2<=1]] U 1<=p_1_1] | [1<=p_1_0 & [AX [p_0_1<=0] & 1<=p_2_2]]] & AG [p_0_2<=p_0_0]]] & EG [1<=p_1_2]]
normalized: [EG [1<=p_1_2] & ~ [EX [~ [[~ [E [true U ~ [p_0_2<=p_0_0]]] & [[[~ [EX [~ [p_0_1<=0]]] & 1<=p_2_2] & 1<=p_1_0] | E [~ [EG [p_0_2<=1]] U 1<=p_1_1]]]]]]]

abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
.abstracting: (p_0_2<=p_0_0)
states: 15,792 (4)
.abstracting: (1<=p_1_2)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: E [[[p_0_2<=1 & EX [[[1<=p_1_2 & [1<=p_0_1 & 1<=p_0_1]] & [~ [1<=p_1_1] & [p_2_0<=p_2_2 | 1<=p_0_1]]]]] | EF [A [p_1_0<=0 U AF [1<=p_0_2]]]] U AG [1<=p_0_0]]
normalized: E [[E [true U [~ [EG [EG [~ [1<=p_0_2]]]] & ~ [E [EG [~ [1<=p_0_2]] U [~ [p_1_0<=0] & EG [~ [1<=p_0_2]]]]]]] | [EX [[[[p_2_0<=p_2_2 | 1<=p_0_1] & ~ [1<=p_1_1]] & [[1<=p_0_1 & 1<=p_0_1] & 1<=p_1_2]]] & p_0_2<=1]] U ~ [E [true U ~ [1<=p_0_0]]]]

abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_2_0<=p_2_2)
states: 15,792 (4)
.abstracting: (1<=p_0_2)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_1_0<=0)
states: 11,440 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p_0_2)
states: 12,870 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [AG [[p_2_0<=p_2_2 | [[p_1_2<=0 | [A [1<=p_1_0 U p_2_0<=p_2_2] & [p_0_1<=1 & p_2_0<=p_0_1]]] | [EX [p_0_2<=0] | p_0_2<=p_0_1]]]]]
normalized: E [true U ~ [E [true U ~ [[[[EX [p_0_2<=0] | p_0_2<=p_0_1] | [[[p_0_1<=1 & p_2_0<=p_0_1] & [~ [EG [~ [p_2_0<=p_2_2]]] & ~ [E [~ [p_2_0<=p_2_2] U [~ [1<=p_1_0] & ~ [p_2_0<=p_2_2]]]]]] | p_1_2<=0]] | p_2_0<=p_2_2]]]]]

abstracting: (p_2_0<=p_2_2)
states: 15,792 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (p_2_0<=p_2_2)
states: 15,792 (4)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_2_0<=p_2_2)
states: 15,792 (4)
abstracting: (p_2_0<=p_2_2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (p_2_0<=p_0_1)
states: 15,792 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (p_0_2<=p_0_1)
states: 15,792 (4)
abstracting: (p_0_2<=0)
states: 11,440 (4)
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AX [E [~ [[AG [p_0_1<=p_1_1] & ~ [[[p_0_2<=p_2_2 & p_0_1<=p_1_1] | [p_1_0<=0 & p_1_0<=p_0_0]]]]] U EX [EG [[p_2_1<=p_2_1 & 1<=p_1_2]]]]]
normalized: ~ [EX [~ [E [~ [[~ [[[p_1_0<=0 & p_1_0<=p_0_0] | [p_0_2<=p_2_2 & p_0_1<=p_1_1]]] & ~ [E [true U ~ [p_0_1<=p_1_1]]]]] U EX [EG [[p_2_1<=p_2_1 & 1<=p_1_2]]]]]]]

abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_2_1<=p_2_1)
states: 24,310 (4)
.
EG iterations: 1
.abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
abstracting: (p_0_2<=p_2_2)
states: 15,792 (4)
abstracting: (p_1_0<=p_0_0)
states: 15,792 (4)
abstracting: (p_1_0<=0)
states: 11,440 (4)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [A [1<=p_0_2 U [~ [[~ [[[p_0_2<=0 | 1<=p_0_1] & [p_2_2<=0 & 1<=p_2_1]]] | [AG [p_1_2<=1] & A [p_1_2<=0 U p_2_0<=1]]]] | [[EF [EG [p_2_0<=0]] & ~ [1<=p_2_1]] | [p_1_1<=1 & [[1<=p_0_2 & E [p_2_2<=p_1_2 U p_1_0<=1]] & ~ [A [p_2_1<=p_1_2 U p_1_1<=1]]]]]]] & AX [AX [[~ [1<=p_2_0] | [E [p_0_1<=1 U p_0_2<=1] & EF [p_2_2<=1]]]]]]
normalized: [~ [EX [EX [~ [[[E [true U p_2_2<=1] & E [p_0_1<=1 U p_0_2<=1]] | ~ [1<=p_2_0]]]]]] & [~ [EG [~ [[[[p_1_1<=1 & [~ [[~ [EG [~ [p_1_1<=1]]] & ~ [E [~ [p_1_1<=1] U [~ [p_2_1<=p_1_2] & ~ [p_1_1<=1]]]]]] & [1<=p_0_2 & E [p_2_2<=p_1_2 U p_1_0<=1]]]] | [~ [1<=p_2_1] & E [true U EG [p_2_0<=0]]]] | ~ [[[[~ [EG [~ [p_2_0<=1]]] & ~ [E [~ [p_2_0<=1] U [~ [p_1_2<=0] & ~ [p_2_0<=1]]]]] & ~ [E [true U ~ [p_1_2<=1]]]] | ~ [[[p_2_2<=0 & 1<=p_2_1] & [p_0_2<=0 | 1<=p_0_1]]]]]]]]] & ~ [E [~ [[[[p_1_1<=1 & [~ [[~ [EG [~ [p_1_1<=1]]] & ~ [E [~ [p_1_1<=1] U [~ [p_2_1<=p_1_2] & ~ [p_1_1<=1]]]]]] & [1<=p_0_2 & E [p_2_2<=p_1_2 U p_1_0<=1]]]] | [~ [1<=p_2_1] & E [true U EG [p_2_0<=0]]]] | ~ [[[[~ [EG [~ [p_2_0<=1]]] & ~ [E [~ [p_2_0<=1] U [~ [p_1_2<=0] & ~ [p_2_0<=1]]]]] & ~ [E [true U ~ [p_1_2<=1]]]] | ~ [[[p_2_2<=0 & 1<=p_2_1] & [p_0_2<=0 | 1<=p_0_1]]]]]]] U [~ [1<=p_0_2] & ~ [[[[p_1_1<=1 & [~ [[~ [EG [~ [p_1_1<=1]]] & ~ [E [~ [p_1_1<=1] U [~ [p_2_1<=p_1_2] & ~ [p_1_1<=1]]]]]] & [1<=p_0_2 & E [p_2_2<=p_1_2 U p_1_0<=1]]]] | [~ [1<=p_2_1] & E [true U EG [p_2_0<=0]]]] | ~ [[[[~ [EG [~ [p_2_0<=1]]] & ~ [E [~ [p_2_0<=1] U [~ [p_1_2<=0] & ~ [p_2_0<=1]]]]] & ~ [E [true U ~ [p_1_2<=1]]]] | ~ [[[p_2_2<=0 & 1<=p_2_1] & [p_0_2<=0 | 1<=p_0_1]]]]]]]]]]]]

abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_0_2<=0)
states: 11,440 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_2_0<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (p_2_2<=p_1_2)
states: 15,792 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_2_1<=p_1_2)
states: 15,792 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_0_2<=0)
states: 11,440 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_2_0<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (p_2_2<=p_1_2)
states: 15,792 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_2_1<=p_1_2)
states: 15,792 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_0_2<=0)
states: 11,440 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_1_2<=0)
states: 11,440 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_2_0<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (p_2_2<=p_1_2)
states: 15,792 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_2_1<=p_1_2)
states: 15,792 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
abstracting: (p_1_1<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_1<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
..-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: [[A [[AG [[[p_0_1<=0 & p_1_1<=p_0_1] & ~ [p_2_0<=0]]] & [p_2_2<=1 | AF [A [1<=p_1_2 U p_1_0<=1]]]] U EX [EF [p_0_0<=p_0_1]]] | [AX [A [[EG [1<=p_2_1] & ~ [p_2_0<=1]] U p_2_0<=p_2_0]] | [[[[EG [1<=p_2_2] & A [1<=p_0_0 U p_2_2<=1]] & AX [[p_0_0<=p_1_0 & p_1_1<=0]]] | AG [[p_0_1<=1 | 1<=p_0_0]]] & [AG [~ [AF [p_0_1<=1]]] | [AF [[p_2_1<=0 & 1<=p_2_0]] & [A [p_2_1<=p_1_0 U p_1_2<=1] & AX [p_2_0<=0]]]]]]] & AX [EX [EF [~ [EX [p_1_2<=p_2_0]]]]]]
normalized: [~ [EX [~ [EX [E [true U ~ [EX [p_1_2<=p_2_0]]]]]]] & [[[[[[~ [EX [~ [p_2_0<=0]]] & [~ [EG [~ [p_1_2<=1]]] & ~ [E [~ [p_1_2<=1] U [~ [p_2_1<=p_1_0] & ~ [p_1_2<=1]]]]]] & ~ [EG [~ [[p_2_1<=0 & 1<=p_2_0]]]]] | ~ [E [true U ~ [EG [~ [p_0_1<=1]]]]]] & [~ [E [true U ~ [[p_0_1<=1 | 1<=p_0_0]]]] | [~ [EX [~ [[p_0_0<=p_1_0 & p_1_1<=0]]]] & [[~ [EG [~ [p_2_2<=1]]] & ~ [E [~ [p_2_2<=1] U [~ [1<=p_0_0] & ~ [p_2_2<=1]]]]] & EG [1<=p_2_2]]]]] | ~ [EX [~ [[~ [EG [~ [p_2_0<=p_2_0]]] & ~ [E [~ [p_2_0<=p_2_0] U [~ [[~ [p_2_0<=1] & EG [1<=p_2_1]]] & ~ [p_2_0<=p_2_0]]]]]]]]] | [~ [EG [~ [EX [E [true U p_0_0<=p_0_1]]]]] & ~ [E [~ [EX [E [true U p_0_0<=p_0_1]]] U [~ [[[p_2_2<=1 | ~ [EG [~ [[~ [EG [~ [p_1_0<=1]]] & ~ [E [~ [p_1_0<=1] U [~ [1<=p_1_2] & ~ [p_1_0<=1]]]]]]]]] & ~ [E [true U ~ [[~ [p_2_0<=0] & [p_0_1<=0 & p_1_1<=p_0_1]]]]]]] & ~ [EX [E [true U p_0_0<=p_0_1]]]]]]]]]

abstracting: (p_0_0<=p_0_1)
states: 15,792 (4)
.abstracting: (p_1_1<=p_0_1)
states: 15,792 (4)
abstracting: (p_0_1<=0)
states: 11,440 (4)
abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
abstracting: (p_1_0<=1)
states: 17,875 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (p_0_0<=p_0_1)
states: 15,792 (4)
.abstracting: (p_0_0<=p_0_1)
states: 15,792 (4)
..
EG iterations: 1
abstracting: (p_2_0<=p_2_0)
states: 24,310 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=p_2_0)
states: 24,310 (4)
abstracting: (p_2_0<=p_2_0)
states: 24,310 (4)
.
EG iterations: 1
.abstracting: (1<=p_2_2)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
abstracting: (p_2_2<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_1<=0)
states: 11,440 (4)
abstracting: (p_0_0<=p_1_0)
states: 15,792 (4)
.abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
abstracting: (p_0_1<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_2_1<=p_1_0)
states: 15,792 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
abstracting: (p_1_2<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_2_0<=0)
states: 11,440 (4)
.abstracting: (p_1_2<=p_2_0)
states: 15,792 (4)
...-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: A [E [1<=p_1_1 U [[1<=p_0_2 | A [[1<=p_0_1 | p_1_2<=p_1_2] U [p_2_2<=0 | p_2_1<=0]]] & [E [~ [p_1_2<=p_0_2] U AX [p_2_2<=p_2_0]] & EF [[p_0_2<=p_2_2 | p_0_2<=1]]]]] U E [[[AX [1<=p_0_2] | p_2_0<=0] & [~ [[AG [1<=p_1_2] | p_0_2<=p_1_0]] | ~ [[1<=p_2_0 & p_0_2<=p_2_2]]]] U [[AX [1<=p_0_1] & [[~ [1<=p_2_2] & A [p_2_0<=p_0_1 U p_2_0<=1]] | ~ [AX [p_1_0<=p_2_1]]]] | p_0_0<=p_2_1]]]
normalized: [~ [EG [~ [E [[[~ [[1<=p_2_0 & p_0_2<=p_2_2]] | ~ [[p_0_2<=p_1_0 | ~ [E [true U ~ [1<=p_1_2]]]]]] & [p_2_0<=0 | ~ [EX [~ [1<=p_0_2]]]]] U [p_0_0<=p_2_1 | [[EX [~ [p_1_0<=p_2_1]] | [[~ [EG [~ [p_2_0<=1]]] & ~ [E [~ [p_2_0<=1] U [~ [p_2_0<=p_0_1] & ~ [p_2_0<=1]]]]] & ~ [1<=p_2_2]]] & ~ [EX [~ [1<=p_0_1]]]]]]]]] & ~ [E [~ [E [[[~ [[1<=p_2_0 & p_0_2<=p_2_2]] | ~ [[p_0_2<=p_1_0 | ~ [E [true U ~ [1<=p_1_2]]]]]] & [p_2_0<=0 | ~ [EX [~ [1<=p_0_2]]]]] U [p_0_0<=p_2_1 | [[EX [~ [p_1_0<=p_2_1]] | [[~ [EG [~ [p_2_0<=1]]] & ~ [E [~ [p_2_0<=1] U [~ [p_2_0<=p_0_1] & ~ [p_2_0<=1]]]]] & ~ [1<=p_2_2]]] & ~ [EX [~ [1<=p_0_1]]]]]]] U [~ [E [1<=p_1_1 U [[E [true U [p_0_2<=p_2_2 | p_0_2<=1]] & E [~ [p_1_2<=p_0_2] U ~ [EX [~ [p_2_2<=p_2_0]]]]] & [1<=p_0_2 | [~ [EG [~ [[p_2_2<=0 | p_2_1<=0]]]] & ~ [E [~ [[p_2_2<=0 | p_2_1<=0]] U [~ [[1<=p_0_1 | p_1_2<=p_1_2]] & ~ [[p_2_2<=0 | p_2_1<=0]]]]]]]]]] & ~ [E [[[~ [[1<=p_2_0 & p_0_2<=p_2_2]] | ~ [[p_0_2<=p_1_0 | ~ [E [true U ~ [1<=p_1_2]]]]]] & [p_2_0<=0 | ~ [EX [~ [1<=p_0_2]]]]] U [p_0_0<=p_2_1 | [[EX [~ [p_1_0<=p_2_1]] | [[~ [EG [~ [p_2_0<=1]]] & ~ [E [~ [p_2_0<=1] U [~ [p_2_0<=p_0_1] & ~ [p_2_0<=1]]]]] & ~ [1<=p_2_2]]] & ~ [EX [~ [1<=p_0_1]]]]]]]]]]]

abstracting: (1<=p_0_1)
states: 12,870 (4)
.abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=p_0_1)
states: 15,792 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_0<=p_2_1)
states: 15,792 (4)
.abstracting: (p_0_0<=p_2_1)
states: 15,792 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
.abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_0_2<=p_1_0)
states: 15,792 (4)
abstracting: (p_0_2<=p_2_2)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_1_2<=p_1_2)
states: 24,310 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
abstracting: (p_2_1<=0)
states: 11,440 (4)
abstracting: (p_2_2<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (1<=p_0_2)
states: 12,870 (4)
abstracting: (p_2_2<=p_2_0)
states: 15,792 (4)
.abstracting: (p_1_2<=p_0_2)
states: 15,792 (4)
abstracting: (p_0_2<=1)
states: 17,875 (4)
abstracting: (p_0_2<=p_2_2)
states: 15,792 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
.abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=p_0_1)
states: 15,792 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_0<=p_2_1)
states: 15,792 (4)
.abstracting: (p_0_0<=p_2_1)
states: 15,792 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
.abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_0_2<=p_1_0)
states: 15,792 (4)
abstracting: (p_0_2<=p_2_2)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (1<=p_0_1)
states: 12,870 (4)
.abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=p_0_1)
states: 15,792 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
abstracting: (p_2_0<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p_1_0<=p_2_1)
states: 15,792 (4)
.abstracting: (p_0_0<=p_2_1)
states: 15,792 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
.abstracting: (p_2_0<=0)
states: 11,440 (4)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (p_0_2<=p_1_0)
states: 15,792 (4)
abstracting: (p_0_2<=p_2_2)
states: 15,792 (4)
abstracting: (1<=p_2_0)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

totally nodes used: 45652 (4.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 981867 311323 1293190
used/not used/entry size/cache size: 343545 66765319 16 1024MB
basic ops cache: hits/miss/sum: 166022 48804 214826
used/not used/entry size/cache size: 86172 16691044 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: 9025 2056 11081
used/not used/entry size/cache size: 2056 8386552 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 67067891
1 38607
2 1542
3 380
4 159
5 89
6 56
7 34
8 33
9 17
>= 10 56

Total processing time: 0m 5.702sec


BK_STOP 1678681812969

--------------------
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:1720 (23), effective:72 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:729 (10), effective:36 (0)

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

iterations count:777 (10), effective:31 (0)

iterations count:777 (10), effective:31 (0)

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

iterations count:777 (10), effective:31 (0)

iterations count:459 (6), effective:9 (0)

iterations count:249 (3), effective:8 (0)

iterations count:837 (11), effective:33 (0)

iterations count:135 (1), effective:9 (0)

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

iterations count:91 (1), effective:9 (0)

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

iterations count:426 (5), effective:16 (0)

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

iterations count:952 (13), effective:43 (0)

iterations count:757 (10), effective:40 (0)

iterations count:249 (3), effective:8 (0)

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

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

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

iterations count:90 (1), effective:9 (0)

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

iterations count:249 (3), effective:8 (0)

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

iterations count:1195 (16), effective:53 (0)

iterations count:349 (4), effective:24 (0)

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

iterations count:426 (5), effective:16 (0)

iterations count:249 (3), effective:8 (0)

iterations count:351 (4), effective:9 (0)

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

iterations count:375 (5), effective:14 (0)

iterations count:426 (5), effective:16 (0)

iterations count:249 (3), effective:8 (0)

iterations count:351 (4), effective:9 (0)

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

iterations count:375 (5), effective:14 (0)

iterations count:269 (3), effective:14 (0)

iterations count:426 (5), effective:16 (0)

iterations count:249 (3), effective:8 (0)

iterations count:351 (4), effective:9 (0)

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

iterations count:375 (5), effective:14 (0)

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

iterations count:528 (7), effective:8 (0)

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

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

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

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

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

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

iterations count:440 (6), effective:23 (0)

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

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

iterations count:834 (11), effective:42 (0)

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

iterations count:261 (3), effective:9 (0)

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

iterations count:1241 (17), effective:63 (0)

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

iterations count:391 (5), effective:27 (0)

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

iterations count:261 (3), effective:9 (0)

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

iterations count:522 (7), effective:25 (0)

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

iterations count:261 (3), effective:9 (0)

iterations count:80 (1), effective:4 (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="NeighborGrid-PT-d2n3m1t12"
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 NeighborGrid-PT-d2n3m1t12, 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 r257-smll-167863532200081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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