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.r481-tall-167912692400721.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 TriangularGrid-PT-2011, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692400721
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 33K 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 TriangularGrid-PT-2011-CTLCardinality-00
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-01
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-02
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-03
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-04
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-05
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-06
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-07
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-08
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-09
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-10
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-11
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-12
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-13
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-14
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679864245614

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=TriangularGrid-PT-2011
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: TriangularGrid_PT_2011
(NrP: 52 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 2.853sec


RS generation: 0m 0.064sec


-> reachability set: #nodes 968 (9.7e+02) #states 940,096,149 (8)



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

checking: ~ [EX [AF [AF [~ [pi3_2_1<=0]]]]]
normalized: ~ [EX [~ [EG [EG [pi3_2_1<=0]]]]]

abstracting: (pi3_2_1<=0)
states: 660,357,832 (8)
........
EG iterations: 8
.
EG iterations: 1
.-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EX [AF [~ [AX [pil1_1_1<=1]]]]
normalized: EX [~ [EG [~ [EX [~ [pil1_1_1<=1]]]]]]

abstracting: (pil1_1_1<=1)
states: 940,096,149 (8)
.
EG iterations: 0
.-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [~ [AG [EX [EF [pil3_2_3<=pi2_2_1]]]]]
normalized: EG [E [true U ~ [EX [E [true U pil3_2_3<=pi2_2_1]]]]]

abstracting: (pil3_2_3<=pi2_2_1)
states: 480,151,719 (8)
.
EG iterations: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.388sec

checking: AF [~ [[EX [1<=po3_1_1] | po1_2_1<=0]]]
normalized: ~ [EG [[EX [1<=po3_1_1] | po1_2_1<=0]]]

abstracting: (po1_2_1<=0)
states: 660,357,832 (8)
abstracting: (1<=po3_1_1)
states: 279,747,756 (8)
.........
EG iterations: 8
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: EF [~ [AF [[EF [~ [pol1_1_1<=0]] & ~ [[EF [pol3_2_1<=pol2_2_3] & A [pi2_2_1<=1 U 1<=pb2_1_1]]]]]]]
normalized: E [true U EG [~ [[~ [[[~ [EG [~ [1<=pb2_1_1]]] & ~ [E [~ [1<=pb2_1_1] U [~ [pi2_2_1<=1] & ~ [1<=pb2_1_1]]]]] & E [true U pol3_2_1<=pol2_2_3]]] & E [true U ~ [pol1_1_1<=0]]]]]]

abstracting: (pol1_1_1<=0)
states: 279,738,317 (8)
abstracting: (pol3_2_1<=pol2_2_3)
states: 739,690,667 (8)
abstracting: (1<=pb2_1_1)
states: 361,510,402 (8)
abstracting: (pi2_2_1<=1)
states: 940,096,149 (8)
abstracting: (1<=pb2_1_1)
states: 361,510,402 (8)
abstracting: (1<=pb2_1_1)
states: 361,510,402 (8)
.
EG iterations: 1
....
EG iterations: 4
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.144sec

checking: AG [[AF [[~ [pb2_2_2<=pi3_2_3] & AX [[1<=po1_1_1 | 1<=pb1_2_3]]]] | pb2_1_1<=pb3_2_1]]
normalized: ~ [E [true U ~ [[pb2_1_1<=pb3_2_1 | ~ [EG [~ [[~ [EX [~ [[1<=po1_1_1 | 1<=pb1_2_3]]]] & ~ [pb2_2_2<=pi3_2_3]]]]]]]]]

abstracting: (pb2_2_2<=pi3_2_3)
states: 648,271,719 (8)
abstracting: (1<=pb1_2_3)
states: 361,499,225 (8)
abstracting: (1<=po1_1_1)
states: 279,738,317 (8)
........
EG iterations: 7
abstracting: (pb2_1_1<=pb3_2_1)
states: 678,365,841 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.516sec

checking: [EF [~ [[pi1_2_3<=1 | EF [~ [[pil3_2_3<=pb1_2_1 | 1<=pol3_2_1]]]]]] | [AG [pi2_1_1<=pil2_2_1] & EF [EG [EG [~ [1<=pil2_1_1]]]]]]
normalized: [[E [true U EG [EG [~ [1<=pil2_1_1]]]] & ~ [E [true U ~ [pi2_1_1<=pil2_2_1]]]] | E [true U ~ [[pi1_2_3<=1 | E [true U ~ [[pil3_2_3<=pb1_2_1 | 1<=pol3_2_1]]]]]]]

abstracting: (1<=pol3_2_1)
states: 660,357,832 (8)
abstracting: (pil3_2_3<=pb1_2_1)
states: 539,198,254 (8)
abstracting: (pi1_2_3<=1)
states: 940,096,149 (8)
abstracting: (pi2_1_1<=pil2_2_1)
states: 860,761,795 (8)
abstracting: (1<=pil2_1_1)
states: 660,357,832 (8)
.......
EG iterations: 7
.
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.217sec

checking: AX [A [~ [[pb1_2_3<=pi1_1_1 & pb2_2_2<=pol3_1_1]] U AG [A [AF [1<=po3_1_1] U [pb3_2_3<=0 & pi2_2_1<=pil2_2_3]]]]]
normalized: ~ [EX [~ [[~ [EG [E [true U ~ [[~ [EG [~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]]]] & ~ [E [~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]] U [EG [~ [1<=po3_1_1]] & ~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]]]] & ~ [E [~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]] U [EG [~ [1<=po3_1_1]] & ~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]]]]]]]] U [[pb1_2_3<=pi1_1_1 & pb2_2_2<=pol3_1_1] & E [true U ~ [[~ [EG [~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]]]] & ~ [E [~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]] U [EG [~ [1<=po3_1_1]] & ~ [[pb3_2_3<=0 & pi2_2_1<=pil2_2_3]]]]]]]]]]]]]]]

abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
abstracting: (1<=po3_1_1)
states: 279,747,756 (8)
........
EG iterations: 8
abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
............
EG iterations: 12
abstracting: (pb2_2_2<=pol3_1_1)
states: 749,519,753 (8)
abstracting: (pb1_2_3<=pi1_1_1)
states: 648,281,136 (8)
abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
abstracting: (1<=po3_1_1)
states: 279,747,756 (8)
........
EG iterations: 8
abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
............
EG iterations: 12
abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
abstracting: (1<=po3_1_1)
states: 279,747,756 (8)
........
EG iterations: 8
abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
abstracting: (pi2_2_1<=pil2_2_3)
states: 860,761,795 (8)
abstracting: (pb3_2_3<=0)
states: 578,585,747 (8)
............
EG iterations: 12
...
EG iterations: 3
.-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.287sec

checking: EF [EG [[~ [A [[pol1_2_3<=pb2_2_3 | pi3_2_3<=pol2_1_1] U [pi1_2_3<=pb3_2_1 | pb3_1_1<=pb2_2_1]]] & 1<=pb1_2_1]]]
normalized: E [true U EG [[1<=pb1_2_1 & ~ [[~ [E [~ [[pi1_2_3<=pb3_2_1 | pb3_1_1<=pb2_2_1]] U [~ [[pi1_2_3<=pb3_2_1 | pb3_1_1<=pb2_2_1]] & ~ [[pol1_2_3<=pb2_2_3 | pi3_2_3<=pol2_1_1]]]]] & ~ [EG [~ [[pi1_2_3<=pb3_2_1 | pb3_1_1<=pb2_2_1]]]]]]]]]

abstracting: (pb3_1_1<=pb2_2_1)
states: 678,375,039 (8)
abstracting: (pi1_2_3<=pb3_2_1)
states: 762,400,596 (8)
........................
EG iterations: 24
abstracting: (pi3_2_3<=pol2_1_1)
states: 860,763,314 (8)
abstracting: (pol1_2_3<=pb2_2_3)
states: 539,205,955 (8)
abstracting: (pb3_1_1<=pb2_2_1)
states: 678,375,039 (8)
abstracting: (pi1_2_3<=pb3_2_1)
states: 762,400,596 (8)
abstracting: (pb3_1_1<=pb2_2_1)
states: 678,375,039 (8)
abstracting: (pi1_2_3<=pb3_2_1)
states: 762,400,596 (8)
abstracting: (1<=pb1_2_1)
states: 361,510,402 (8)
...
EG iterations: 3
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.496sec

checking: [[AG [EG [EF [[pb1_1_1<=1 & pi3_2_1<=0]]]] & EF [[[po3_2_1<=pb2_1_1 | po2_2_1<=pi1_2_1] | ~ [pb3_2_2<=pbl_2_3]]]] & AF [pb3_1_1<=0]]
normalized: [~ [EG [~ [pb3_1_1<=0]]] & [E [true U [~ [pb3_2_2<=pbl_2_3] | [po3_2_1<=pb2_1_1 | po2_2_1<=pi1_2_1]]] & ~ [E [true U ~ [EG [E [true U [pb1_1_1<=1 & pi3_2_1<=0]]]]]]]]

abstracting: (pi3_2_1<=0)
states: 660,357,832 (8)
abstracting: (pb1_1_1<=1)
states: 819,204,983 (8)
...
EG iterations: 3
abstracting: (po2_2_1<=pi1_2_1)
states: 739,682,747 (8)
abstracting: (po3_2_1<=pb2_1_1)
states: 762,408,297 (8)
abstracting: (pb3_2_2<=pbl_2_3)
states: 889,499,851 (8)
abstracting: (pb3_1_1<=0)
states: 578,596,924 (8)
....
EG iterations: 4
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.542sec

checking: [AG [[pil2_2_1<=pol1_2_3 | [~ [AX [AG [pb3_1_1<=pbl_2_2]]] & [EF [AG [pil2_2_1<=pb3_2_1]] | AG [[1<=pil3_1_1 | 1<=pil1_2_3]]]]]] & AG [EF [[AF [AX [pbl_2_2<=0]] & [~ [AX [1<=pi2_2_1]] | [~ [pol1_2_3<=1] & EF [pol3_2_3<=pb1_2_3]]]]]]]
normalized: [~ [E [true U ~ [E [true U [[[E [true U pol3_2_3<=pb1_2_3] & ~ [pol1_2_3<=1]] | EX [~ [1<=pi2_2_1]]] & ~ [EG [EX [~ [pbl_2_2<=0]]]]]]]]] & ~ [E [true U ~ [[pil2_2_1<=pol1_2_3 | [[~ [E [true U ~ [[1<=pil3_1_1 | 1<=pil1_2_3]]]] | E [true U ~ [E [true U ~ [pil2_2_1<=pb3_2_1]]]]] & EX [E [true U ~ [pb3_1_1<=pbl_2_2]]]]]]]]]

abstracting: (pb3_1_1<=pbl_2_2)
states: 889,503,044 (8)
.abstracting: (pil2_2_1<=pb3_2_1)
states: 539,205,955 (8)
abstracting: (1<=pil1_2_3)
states: 660,348,393 (8)
abstracting: (1<=pil3_1_1)
states: 660,348,393 (8)
abstracting: (pil2_2_1<=pol1_2_3)
states: 739,684,266 (8)
abstracting: (pbl_2_2<=0)
states: 83,539,845 (7)
....
EG iterations: 3
abstracting: (1<=pi2_2_1)
states: 279,747,756 (8)
.abstracting: (pol1_2_3<=1)
states: 940,096,149 (8)
abstracting: (pol3_2_3<=pb1_2_3)
states: 539,196,516 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.720sec

checking: E [[~ [EX [[pi3_2_1<=po1_1_1 & AX [1<=po1_2_3]]]] | [~ [[EF [AF [1<=pol3_2_3]] & EG [[pol1_1_1<=po1_2_3 | pil1_1_1<=0]]]] | [[po2_2_3<=0 | AG [AF [1<=po3_2_1]]] & ~ [[pbl_2_3<=pi2_1_1 & AG [1<=pb2_1_1]]]]]] U AG [EG [[pi2_2_3<=0 | [1<=pi2_2_3 & EG [po2_2_3<=0]]]]]]
normalized: E [[~ [EX [[pi3_2_1<=po1_1_1 & ~ [EX [~ [1<=po1_2_3]]]]]] | [[~ [[pbl_2_3<=pi2_1_1 & ~ [E [true U ~ [1<=pb2_1_1]]]]] & [po2_2_3<=0 | ~ [E [true U EG [~ [1<=po3_2_1]]]]]] | ~ [[EG [[pol1_1_1<=po1_2_3 | pil1_1_1<=0]] & E [true U ~ [EG [~ [1<=pol3_2_3]]]]]]]] U ~ [E [true U ~ [EG [[pi2_2_3<=0 | [1<=pi2_2_3 & EG [po2_2_3<=0]]]]]]]]

abstracting: (po2_2_3<=0)
states: 660,357,832 (8)
........
EG iterations: 8
abstracting: (1<=pi2_2_3)
states: 279,738,317 (8)
abstracting: (pi2_2_3<=0)
states: 660,357,832 (8)
.....
EG iterations: 5
abstracting: (1<=pol3_2_3)
states: 660,357,832 (8)
.......
EG iterations: 7
abstracting: (pil1_1_1<=0)
states: 279,738,317 (8)
abstracting: (pol1_1_1<=po1_2_3)
states: 480,151,719 (8)
.......
EG iterations: 7
abstracting: (1<=po3_2_1)
states: 279,738,317 (8)
........
EG iterations: 8
abstracting: (po2_2_3<=0)
states: 660,357,832 (8)
abstracting: (1<=pb2_1_1)
states: 361,510,402 (8)
abstracting: (pbl_2_3<=pi2_1_1)
states: 125,694,203 (8)
abstracting: (1<=po1_2_3)
states: 279,747,756 (8)
.abstracting: (pi3_2_1<=po1_1_1)
states: 739,690,667 (8)
.-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.410sec

checking: EF [~ [[~ [[[EX [1<=pi1_2_1] | AX [1<=pb1_2_3]] | EF [[pb1_2_1<=1 & 1<=pol2_2_3]]]] | ~ [[[[E [pi1_2_3<=pi1_2_3 U po1_2_1<=1] & EX [1<=pol3_2_1]] | E [1<=pi1_2_1 U po1_1_1<=1]] & [AF [pol1_2_1<=po2_1_1] & [A [pi2_2_3<=po3_1_1 U 1<=po1_2_3] & AG [1<=pil1_1_1]]]]]]]]
normalized: E [true U ~ [[~ [[[~ [EG [~ [pol1_2_1<=po2_1_1]]] & [[~ [EG [~ [1<=po1_2_3]]] & ~ [E [~ [1<=po1_2_3] U [~ [1<=po1_2_3] & ~ [pi2_2_3<=po3_1_1]]]]] & ~ [E [true U ~ [1<=pil1_1_1]]]]] & [E [1<=pi1_2_1 U po1_1_1<=1] | [EX [1<=pol3_2_1] & E [pi1_2_3<=pi1_2_3 U po1_2_1<=1]]]]] | ~ [[[~ [EX [~ [1<=pb1_2_3]]] | EX [1<=pi1_2_1]] | E [true U [pb1_2_1<=1 & 1<=pol2_2_3]]]]]]]

abstracting: (1<=pol2_2_3)
states: 660,357,832 (8)
abstracting: (pb1_2_1<=1)
states: 819,204,983 (8)
abstracting: (1<=pi1_2_1)
states: 279,738,317 (8)
.abstracting: (1<=pb1_2_3)
states: 361,499,225 (8)
.abstracting: (po1_2_1<=1)
states: 940,096,149 (8)
abstracting: (pi1_2_3<=pi1_2_3)
states: 940,096,149 (8)
abstracting: (1<=pol3_2_1)
states: 660,357,832 (8)
.abstracting: (po1_1_1<=1)
states: 940,096,149 (8)
abstracting: (1<=pi1_2_1)
states: 279,738,317 (8)
abstracting: (1<=pil1_1_1)
states: 660,357,832 (8)
abstracting: (pi2_2_3<=po3_1_1)
states: 739,692,186 (8)
abstracting: (1<=po1_2_3)
states: 279,747,756 (8)
abstracting: (1<=po1_2_3)
states: 279,747,756 (8)
abstracting: (1<=po1_2_3)
states: 279,747,756 (8)
........
EG iterations: 8
abstracting: (pol1_2_1<=po2_1_1)
states: 480,143,799 (8)
....................
EG iterations: 20
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.739sec

checking: E [[~ [[~ [[[pbl_2_1<=1 | pol2_2_3<=pb2_1_1] | E [po1_2_3<=pol2_1_1 U pb1_2_3<=0]]] | ~ [[EX [1<=pol2_2_1] | [[pb3_2_2<=pil1_1_1 & pi2_2_3<=pol3_2_1] | A [pb1_2_2<=pb3_1_1 U pi1_2_3<=0]]]]]] & pi1_2_1<=pbl_2_3] U AG [E [po1_2_3<=0 U 1<=pb3_1_1]]]
normalized: E [[pi1_2_1<=pbl_2_3 & ~ [[~ [[[[~ [EG [~ [pi1_2_3<=0]]] & ~ [E [~ [pi1_2_3<=0] U [~ [pb1_2_2<=pb3_1_1] & ~ [pi1_2_3<=0]]]]] | [pb3_2_2<=pil1_1_1 & pi2_2_3<=pol3_2_1]] | EX [1<=pol2_2_1]]] | ~ [[E [po1_2_3<=pol2_1_1 U pb1_2_3<=0] | [pbl_2_1<=1 | pol2_2_3<=pb2_1_1]]]]]] U ~ [E [true U ~ [E [po1_2_3<=0 U 1<=pb3_1_1]]]]]

abstracting: (1<=pb3_1_1)
states: 361,499,225 (8)
abstracting: (po1_2_3<=0)
states: 660,348,393 (8)
abstracting: (pol2_2_3<=pb2_1_1)
states: 539,198,254 (8)
abstracting: (pbl_2_1<=1)
states: 241,697,013 (8)
abstracting: (pb1_2_3<=0)
states: 578,596,924 (8)
abstracting: (po1_2_3<=pol2_1_1)
states: 860,761,795 (8)
abstracting: (1<=pol2_2_1)
states: 660,348,393 (8)
.abstracting: (pi2_2_3<=pol3_2_1)
states: 860,763,314 (8)
abstracting: (pb3_2_2<=pil1_1_1)
states: 749,521,251 (8)
abstracting: (pi1_2_3<=0)
states: 660,348,393 (8)
abstracting: (pb1_2_2<=pb3_1_1)
states: 678,365,601 (8)
abstracting: (pi1_2_3<=0)
states: 660,348,393 (8)
abstracting: (pi1_2_3<=0)
states: 660,348,393 (8)
............
EG iterations: 12
abstracting: (pi1_2_1<=pbl_2_3)
states: 919,806,607 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.423sec

checking: E [[~ [[pi1_2_3<=1 & E [[1<=pol1_2_1 & [1<=pb2_2_2 & po3_2_1<=po3_1_1]] U 1<=pi3_2_3]]] | [[E [[[po1_2_3<=0 & 1<=pb3_1_1] & [pi1_2_1<=0 & po1_1_1<=pb3_2_2]] U AX [1<=po3_2_3]] | [1<=pb3_1_1 | EX [[pol2_2_1<=pi2_2_3 | pb1_2_2<=0]]]] & E [pb2_2_1<=0 U [[[1<=pbl_2_2 | 1<=po2_1_1] | A [pil3_2_3<=0 U pil1_2_1<=1]] & pil3_2_1<=1]]]] U ~ [E [1<=pil2_1_1 U [AF [1<=pil3_2_3] | ~ [AX [po3_1_1<=1]]]]]]
normalized: E [[~ [[pi1_2_3<=1 & E [[1<=pol1_2_1 & [1<=pb2_2_2 & po3_2_1<=po3_1_1]] U 1<=pi3_2_3]]] | [E [pb2_2_1<=0 U [pil3_2_1<=1 & [[~ [EG [~ [pil1_2_1<=1]]] & ~ [E [~ [pil1_2_1<=1] U [~ [pil1_2_1<=1] & ~ [pil3_2_3<=0]]]]] | [1<=pbl_2_2 | 1<=po2_1_1]]]] & [[1<=pb3_1_1 | EX [[pol2_2_1<=pi2_2_3 | pb1_2_2<=0]]] | E [[[pi1_2_1<=0 & po1_1_1<=pb3_2_2] & [po1_2_3<=0 & 1<=pb3_1_1]] U ~ [EX [~ [1<=po3_2_3]]]]]]] U ~ [E [1<=pil2_1_1 U [~ [EG [~ [1<=pil3_2_3]]] | EX [~ [po3_1_1<=1]]]]]]

abstracting: (po3_1_1<=1)
states: 940,096,149 (8)
.abstracting: (1<=pil3_2_3)
states: 660,357,832 (8)
.......
EG iterations: 7
abstracting: (1<=pil2_1_1)
states: 660,357,832 (8)
abstracting: (1<=po3_2_3)
states: 279,738,317 (8)
.abstracting: (1<=pb3_1_1)
states: 361,499,225 (8)
abstracting: (po1_2_3<=0)
states: 660,348,393 (8)
abstracting: (po1_1_1<=pb3_2_2)
states: 762,408,057 (8)
abstracting: (pi1_2_1<=0)
states: 660,357,832 (8)
abstracting: (pb1_2_2<=0)
states: 578,587,725 (8)
abstracting: (pol2_2_1<=pi2_2_3)
states: 480,151,719 (8)
.abstracting: (1<=pb3_1_1)
states: 361,499,225 (8)
abstracting: (1<=po2_1_1)
states: 279,738,317 (8)
abstracting: (1<=pbl_2_2)
states: 856,556,304 (8)
abstracting: (pil3_2_3<=0)
states: 279,738,317 (8)
abstracting: (pil1_2_1<=1)
states: 940,096,149 (8)
abstracting: (pil1_2_1<=1)
states: 940,096,149 (8)
abstracting: (pil1_2_1<=1)
states: 940,096,149 (8)
.
EG iterations: 1
abstracting: (pil3_2_1<=1)
states: 940,096,149 (8)
abstracting: (pb2_2_1<=0)
states: 578,596,924 (8)
abstracting: (1<=pi3_2_3)
states: 279,738,317 (8)
abstracting: (po3_2_1<=po3_1_1)
states: 739,692,186 (8)
abstracting: (1<=pb2_2_2)
states: 361,508,424 (8)
abstracting: (1<=pol1_2_1)
states: 660,357,832 (8)
abstracting: (pi1_2_3<=1)
states: 940,096,149 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.231sec

checking: EF [[[[[EG [~ [pi2_1_1<=1]] & ~ [[AF [pb2_2_2<=0] & [1<=pi2_2_3 | pb3_2_1<=pol2_2_1]]]] & pol2_2_1<=0] & [[[AG [pb3_1_1<=pb1_2_1] & [AG [pol3_2_1<=po2_2_1] | [pol3_1_1<=0 | 1<=pol3_1_1]]] | [1<=pil3_2_1 & ~ [1<=pil2_2_1]]] & [A [[pb3_2_1<=1 & pol2_2_1<=pol1_2_1] U E [pb2_2_1<=pil3_2_1 U pb3_2_1<=0]] & EG [AG [1<=pil3_1_1]]]]] & [AF [pbl_2_2<=1] & [[EG [~ [pi3_2_1<=1]] | 1<=pi2_2_3] | ~ [pil3_2_1<=pol1_2_3]]]]]
normalized: E [true U [[[[[[~ [E [true U ~ [pol3_2_1<=po2_2_1]]] | [pol3_1_1<=0 | 1<=pol3_1_1]] & ~ [E [true U ~ [pb3_1_1<=pb1_2_1]]]] | [1<=pil3_2_1 & ~ [1<=pil2_2_1]]] & [[~ [EG [~ [E [pb2_2_1<=pil3_2_1 U pb3_2_1<=0]]]] & ~ [E [~ [E [pb2_2_1<=pil3_2_1 U pb3_2_1<=0]] U [~ [[pb3_2_1<=1 & pol2_2_1<=pol1_2_1]] & ~ [E [pb2_2_1<=pil3_2_1 U pb3_2_1<=0]]]]]] & EG [~ [E [true U ~ [1<=pil3_1_1]]]]]] & [pol2_2_1<=0 & [~ [[[1<=pi2_2_3 | pb3_2_1<=pol2_2_1] & ~ [EG [~ [pb2_2_2<=0]]]]] & EG [~ [pi2_1_1<=1]]]]] & [~ [EG [~ [pbl_2_2<=1]]] & [~ [pil3_2_1<=pol1_2_3] | [1<=pi2_2_3 | EG [~ [pi3_2_1<=1]]]]]]]

abstracting: (pi3_2_1<=1)
states: 940,096,149 (8)
.
EG iterations: 1
abstracting: (1<=pi2_2_3)
states: 279,738,317 (8)
abstracting: (pil3_2_1<=pol1_2_3)
states: 739,682,747 (8)
abstracting: (pbl_2_2<=1)
states: 241,707,975 (8)
......
EG iterations: 6
abstracting: (pi2_1_1<=1)
states: 940,096,149 (8)
.
EG iterations: 1
abstracting: (pb2_2_2<=0)
states: 578,587,725 (8)
....
EG iterations: 4
abstracting: (pb3_2_1<=pol2_2_1)
states: 749,519,273 (8)
abstracting: (1<=pi2_2_3)
states: 279,738,317 (8)
abstracting: (pol2_2_1<=0)
states: 279,747,756 (8)
abstracting: (1<=pil3_1_1)
states: 660,348,393 (8)
.
EG iterations: 1
abstracting: (pb3_2_1<=0)
states: 578,585,747 (8)
abstracting: (pb2_2_1<=pil3_2_1)
states: 749,530,450 (8)
abstracting: (pol2_2_1<=pol1_2_1)
states: 739,692,186 (8)
abstracting: (pb3_2_1<=1)
states: 819,204,983 (8)
abstracting: (pb3_2_1<=0)
states: 578,585,747 (8)
abstracting: (pb2_2_1<=pil3_2_1)
states: 749,530,450 (8)
abstracting: (pb3_2_1<=0)
states: 578,585,747 (8)
abstracting: (pb2_2_1<=pil3_2_1)
states: 749,530,450 (8)
.....
EG iterations: 5
abstracting: (1<=pil2_2_1)
states: 660,348,393 (8)
abstracting: (1<=pil3_2_1)
states: 660,357,832 (8)
abstracting: (pb3_1_1<=pb1_2_1)
states: 678,377,017 (8)
abstracting: (1<=pol3_1_1)
states: 660,348,393 (8)
abstracting: (pol3_1_1<=0)
states: 279,747,756 (8)
abstracting: (pol3_2_1<=po2_2_1)
states: 480,151,719 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.342sec

totally nodes used: 4704326 (4.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18756571 20303927 39060498
used/not used/entry size/cache size: 20705008 46403856 16 1024MB
basic ops cache: hits/miss/sum: 3959965 4484859 8444824
used/not used/entry size/cache size: 5791640 10985576 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: 32446 35092 67538
used/not used/entry size/cache size: 35024 8353584 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 62816327
1 3984177
2 267043
3 27193
4 5714
5 2431
6 1457
7 1072
8 667
9 449
>= 10 2334

Total processing time: 0m14.718sec


BK_STOP 1679864260380

--------------------
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:2962 (70), effective:503 (11)

initing FirstDep: 0m 0.000sec


iterations count:454 (10), effective:67 (1)

iterations count:5656 (134), effective:981 (23)

iterations count:106 (2), effective:11 (0)

iterations count:377 (8), effective:53 (1)

iterations count:391 (9), effective:56 (1)

iterations count:1772 (42), effective:272 (6)

iterations count:791 (18), effective:112 (2)

iterations count:846 (20), effective:116 (2)

iterations count:369 (8), effective:49 (1)

iterations count:280 (6), effective:33 (0)

iterations count:608 (14), effective:100 (2)

iterations count:280 (6), effective:33 (0)

iterations count:608 (14), effective:100 (2)

iterations count:839 (19), effective:118 (2)

iterations count:280 (6), effective:33 (0)

iterations count:608 (14), effective:100 (2)

iterations count:487 (11), effective:69 (1)

iterations count:1483 (35), effective:236 (5)

iterations count:194 (4), effective:27 (0)

iterations count:4389 (104), effective:689 (16)

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

iterations count:1344 (32), effective:196 (4)

iterations count:345 (8), effective:44 (1)

iterations count:3703 (88), effective:575 (13)

iterations count:735 (17), effective:115 (2)

iterations count:4816 (114), effective:772 (18)

iterations count:327 (7), effective:53 (1)

iterations count:1985 (47), effective:334 (7)

iterations count:5977 (142), effective:995 (23)

iterations count:4227 (100), effective:760 (18)

iterations count:5112 (121), effective:868 (20)

iterations count:150 (3), effective:15 (0)

iterations count:160 (3), effective:24 (0)

iterations count:9503 (226), effective:1725 (41)

iterations count:275 (6), effective:34 (0)

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

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

iterations count:344 (8), effective:44 (1)

iterations count:418 (9), effective:67 (1)

iterations count:5146 (122), effective:824 (19)

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

iterations count:3361 (80), effective:583 (13)

iterations count:505 (12), effective:69 (1)

iterations count:414 (9), effective:67 (1)

iterations count:6462 (153), effective:1110 (26)

iterations count:3526 (83), effective:546 (13)

iterations count:5381 (128), effective:946 (22)

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

iterations count:428 (10), effective:66 (1)

iterations count:1917 (45), effective:289 (6)

iterations count:357 (8), effective:51 (1)

iterations count:302 (7), effective:38 (0)

iterations count:302 (7), effective:38 (0)

iterations count:454 (10), effective:62 (1)

iterations count:302 (7), effective:38 (0)

iterations count:940 (22), effective:142 (3)

iterations count:267 (6), effective:33 (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="TriangularGrid-PT-2011"
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 TriangularGrid-PT-2011, 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 r481-tall-167912692400721"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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