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.r513-tall-167987240900337.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 Murphy-PT-D2N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987240900337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 14K Mar 26 22:42 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 Murphy-PT-D2N050-CTLCardinality-00
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-01
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-02
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-03
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-04
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-05
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-06
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-07
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-08
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-09
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-10
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-11
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-12
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-13
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-14
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679894056706

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=Murphy-PT-D2N050
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: Murphy_COL_D2_N50
(NrP: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.766sec


RS generation: 0m 2.583sec


-> reachability set: #nodes 15348 (1.5e+04) #states 41,538,421,296 (10)



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

checking: EG [[EF [p2_1<=12] | ~ [p3_2<=40]]]
normalized: EG [[~ [p3_2<=40] | E [true U p2_1<=12]]]

abstracting: (p2_1<=12)
states: 14,642,880,624 (10)
abstracting: (p3_2<=40)
states: 41,538,421,296 (10)

EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.787sec

checking: AG [AX [~ [[~ [EF [11<=p4_1]] & p2_1<=p3_1]]]]
normalized: ~ [E [true U EX [[p2_1<=p3_1 & ~ [E [true U 11<=p4_1]]]]]]

abstracting: (11<=p4_1)
states: 0
abstracting: (p2_1<=p3_1)
states: 1,944,897,588 (9)
.-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.692sec

checking: E [[AX [~ [EX [~ [p2_3<=p4_3]]]] | 39<=p1_1] U ~ [p0_3<=45]]
normalized: E [[39<=p1_1 | ~ [EX [EX [~ [p2_3<=p4_3]]]]] U ~ [p0_3<=45]]

abstracting: (p0_3<=45)
states: 34,303,102,128 (10)
abstracting: (p2_3<=p4_3)
states: 2,571,946,128 (9)
..abstracting: (39<=p1_1)
states: 9,857,295,432 (9)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.192sec

checking: E [AG [~ [p2_3<=p4_2]] U AG [~ [AF [[p1_3<=p1_2 & 30<=p0_2]]]]]
normalized: E [~ [E [true U p2_3<=p4_2]] U ~ [E [true U ~ [EG [~ [[p1_3<=p1_2 & 30<=p0_2]]]]]]]

abstracting: (30<=p0_2)
states: 14,273,086,464 (10)
abstracting: (p1_3<=p1_2)
states: 21,102,118,056 (10)
.
EG iterations: 1
abstracting: (p2_3<=p4_2)
states: 2,571,946,128 (9)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.981sec

checking: [AG [p0_1<=21] & EX [~ [AG [~ [[A [p1_3<=p4_2 U 48<=p0_3] | EX [30<=p5_1]]]]]]]
normalized: [EX [E [true U [[~ [EG [~ [48<=p0_3]]] & ~ [E [~ [48<=p0_3] U [~ [p1_3<=p4_2] & ~ [48<=p0_3]]]]] | EX [30<=p5_1]]]] & ~ [E [true U ~ [p0_1<=21]]]]

abstracting: (p0_1<=21)
states: 22,118,270,832 (10)
abstracting: (30<=p5_1)
states: 0
.abstracting: (48<=p0_3)
states: 6,600,642,048 (9)
abstracting: (p1_3<=p4_2)
states: 2,574,294,336 (9)
abstracting: (48<=p0_3)
states: 6,600,642,048 (9)
abstracting: (48<=p0_3)
states: 6,600,642,048 (9)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.781sec

checking: AG [[p0_3<=9 & [44<=p5_2 | AG [[~ [p2_1<=17] | ~ [[48<=p4_3 | 26<=p4_3]]]]]]]
normalized: ~ [E [true U ~ [[p0_3<=9 & [44<=p5_2 | ~ [E [true U ~ [[~ [[48<=p4_3 | 26<=p4_3]] | ~ [p2_1<=17]]]]]]]]]]

abstracting: (p2_1<=17)
states: 19,040,018,544 (10)
abstracting: (26<=p4_3)
states: 0
abstracting: (48<=p4_3)
states: 0
abstracting: (44<=p5_2)
states: 0
abstracting: (p0_3<=9)
states: 11,714,195,376 (10)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.453sec

checking: ~ [EG [E [A [[EG [p0_3<=3] & [p0_3<=37 & p2_3<=p1_1]] U EG [23<=p5_3]] U E [~ [EX [p1_1<=31]] U AG [p4_2<=10]]]]]
normalized: ~ [EG [E [[~ [EG [~ [EG [23<=p5_3]]]] & ~ [E [~ [EG [23<=p5_3]] U [~ [[[p0_3<=37 & p2_3<=p1_1] & EG [p0_3<=3]]] & ~ [EG [23<=p5_3]]]]]] U E [~ [EX [p1_1<=31]] U ~ [E [true U ~ [p4_2<=10]]]]]]]

abstracting: (p4_2<=10)
states: 41,538,421,296 (10)
abstracting: (p1_1<=31)
states: 28,364,949,360 (10)
.abstracting: (23<=p5_3)
states: 0
.
EG iterations: 1
abstracting: (p0_3<=3)
states: 5,058,457,776 (9)
.
EG iterations: 1
abstracting: (p2_3<=p1_1)
states: 21,100,781,880 (10)
abstracting: (p0_3<=37)
states: 31,258,295,280 (10)
abstracting: (23<=p5_3)
states: 0
.
EG iterations: 1
abstracting: (23<=p5_3)
states: 0
.
EG iterations: 1

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.271sec

checking: A [~ [[~ [AX [A [p0_3<=p1_1 U p1_3<=21]]] & p3_3<=24]] U ~ [AG [E [EX [p0_1<=p3_3] U [p4_2<=43 | p3_3<=p4_1]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [EX [p0_1<=p3_3] U [p4_2<=43 | p3_3<=p4_1]]]]]]] & ~ [E [~ [E [true U ~ [E [EX [p0_1<=p3_3] U [p4_2<=43 | p3_3<=p4_1]]]]] U [[p3_3<=24 & EX [~ [[~ [EG [~ [p1_3<=21]]] & ~ [E [~ [p1_3<=21] U [~ [p0_3<=p1_1] & ~ [p1_3<=21]]]]]]]] & ~ [E [true U ~ [E [EX [p0_1<=p3_3] U [p4_2<=43 | p3_3<=p4_1]]]]]]]]]

abstracting: (p3_3<=p4_1)
states: 34,615,351,080 (10)
abstracting: (p4_2<=43)
states: 41,538,421,296 (10)
abstracting: (p0_1<=p3_3)
states: 1,944,897,588 (9)
.abstracting: (p1_3<=21)
states: 22,120,236,432 (10)
abstracting: (p0_3<=p1_1)
states: 21,100,781,880 (10)
abstracting: (p1_3<=21)
states: 22,120,236,432 (10)
abstracting: (p1_3<=21)
states: 22,120,236,432 (10)
.
EG iterations: 1
.abstracting: (p3_3<=24)
states: 41,538,421,296 (10)
abstracting: (p3_3<=p4_1)
states: 34,615,351,080 (10)
abstracting: (p4_2<=43)
states: 41,538,421,296 (10)
abstracting: (p0_1<=p3_3)
states: 1,944,897,588 (9)
.abstracting: (p3_3<=p4_1)
states: 34,615,351,080 (10)
abstracting: (p4_2<=43)
states: 41,538,421,296 (10)
abstracting: (p0_1<=p3_3)
states: 1,944,897,588 (9)
.
EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.176sec

checking: EF [[~ [[~ [EF [[49<=p0_3 & p3_1<=20]]] & ~ [E [[p0_1<=p0_1 & p3_3<=13] U ~ [p5_1<=p5_2]]]]] & [~ [AF [[~ [p2_3<=p3_2] | EX [p5_2<=13]]]] & ~ [AF [1<=p1_1]]]]]
normalized: E [true U [[EG [~ [[EX [p5_2<=13] | ~ [p2_3<=p3_2]]]] & EG [~ [1<=p1_1]]] & ~ [[~ [E [[p0_1<=p0_1 & p3_3<=13] U ~ [p5_1<=p5_2]]] & ~ [E [true U [49<=p0_3 & p3_1<=20]]]]]]]

abstracting: (p3_1<=20)
states: 41,538,421,296 (10)
abstracting: (49<=p0_3)
states: 6,305,970,528 (9)
abstracting: (p5_1<=p5_2)
states: 26,538,435,828 (10)
abstracting: (p3_3<=13)
states: 41,538,421,296 (10)
abstracting: (p0_1<=p0_1)
states: 41,538,421,296 (10)
abstracting: (1<=p1_1)
states: 40,240,327,608 (10)
.
EG iterations: 1
abstracting: (p2_3<=p3_2)
states: 1,944,897,588 (9)
abstracting: (p5_2<=13)
states: 41,538,421,296 (10)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.478sec

checking: A [EF [p2_1<=p2_3] U [[~ [p2_2<=p4_2] | AG [[~ [EF [p0_2<=38]] | ~ [[p1_1<=47 & p4_2<=p3_1]]]]] & ~ [[p1_2<=34 | EG [EF [p1_3<=p5_2]]]]]]
normalized: [~ [EG [~ [[~ [[p1_2<=34 | EG [E [true U p1_3<=p5_2]]]] & [~ [E [true U ~ [[~ [[p1_1<=47 & p4_2<=p3_1]] | ~ [E [true U p0_2<=38]]]]]] | ~ [p2_2<=p4_2]]]]]] & ~ [E [~ [[~ [[p1_2<=34 | EG [E [true U p1_3<=p5_2]]]] & [~ [E [true U ~ [[~ [[p1_1<=47 & p4_2<=p3_1]] | ~ [E [true U p0_2<=38]]]]]] | ~ [p2_2<=p4_2]]]] U [~ [E [true U p2_1<=p2_3]] & ~ [[~ [[p1_2<=34 | EG [E [true U p1_3<=p5_2]]]] & [~ [E [true U ~ [[~ [[p1_1<=47 & p4_2<=p3_1]] | ~ [E [true U p0_2<=38]]]]]] | ~ [p2_2<=p4_2]]]]]]]]

abstracting: (p2_2<=p4_2)
states: 2,571,946,128 (9)
abstracting: (p0_2<=38)
states: 31,679,611,920 (10)
abstracting: (p4_2<=p3_1)
states: 20,769,210,648 (10)
abstracting: (p1_1<=47)
states: 34,939,059,696 (10)
abstracting: (p1_3<=p5_2)
states: 3,201,442,596 (9)

EG iterations: 0
abstracting: (p1_2<=34)
states: 29,876,169,816 (10)
abstracting: (p2_1<=p2_3)
states: 21,101,462,280 (10)
abstracting: (p2_2<=p4_2)
states: 2,571,946,128 (9)
abstracting: (p0_2<=38)
states: 31,679,611,920 (10)
abstracting: (p4_2<=p3_1)
states: 20,769,210,648 (10)
abstracting: (p1_1<=47)
states: 34,939,059,696 (10)
abstracting: (p1_3<=p5_2)
states: 3,201,442,596 (9)

EG iterations: 0
abstracting: (p1_2<=34)
states: 29,876,169,816 (10)
abstracting: (p2_2<=p4_2)
states: 2,571,946,128 (9)
abstracting: (p0_2<=38)
states: 31,679,611,920 (10)
abstracting: (p4_2<=p3_1)
states: 20,769,210,648 (10)
abstracting: (p1_1<=47)
states: 34,939,059,696 (10)
abstracting: (p1_3<=p5_2)
states: 3,201,442,596 (9)

EG iterations: 0
abstracting: (p1_2<=34)
states: 29,876,169,816 (10)

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.875sec

checking: [AG [EF [~ [EX [~ [p3_1<=p3_1]]]]] & E [p3_1<=p2_2 U [~ [[E [~ [p3_2<=p4_3] U 11<=p4_1] & AG [EG [35<=p3_1]]]] | [AG [[~ [42<=p5_1] & EX [p1_3<=39]]] | AX [~ [[p4_3<=p1_1 & p2_1<=43]]]]]]]
normalized: [E [p3_1<=p2_2 U [[~ [EX [[p4_3<=p1_1 & p2_1<=43]]] | ~ [E [true U ~ [[EX [p1_3<=39] & ~ [42<=p5_1]]]]]] | ~ [[~ [E [true U ~ [EG [35<=p3_1]]]] & E [~ [p3_2<=p4_3] U 11<=p4_1]]]]] & ~ [E [true U ~ [E [true U ~ [EX [~ [p3_1<=p3_1]]]]]]]]

abstracting: (p3_1<=p3_1)
states: 41,538,421,296 (10)
.abstracting: (11<=p4_1)
states: 0
abstracting: (p3_2<=p4_3)
states: 34,615,351,080 (10)
abstracting: (35<=p3_1)
states: 0
.
EG iterations: 1
abstracting: (42<=p5_1)
states: 0
abstracting: (p1_3<=39)
states: 32,102,404,272 (10)
.abstracting: (p2_1<=43)
states: 33,620,524,848 (10)
abstracting: (p4_3<=p1_1)
states: 40,240,327,608 (10)
.abstracting: (p3_1<=p2_2)
states: 40,890,338,028 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.925sec

checking: [[EX [AG [~ [[[19<=p0_2 & p5_1<=p4_1] | [p0_2<=32 & p1_1<=42]]]]] | AG [AF [[p3_3<=p3_2 & ~ [A [p3_2<=34 U 3<=p4_3]]]]]] | A [~ [EF [[p2_2<=p1_1 | p4_1<=p1_1]]] U [E [A [~ [p1_3<=p5_2] U AG [p0_3<=24]] U p5_2<=1] & 34<=p1_2]]]
normalized: [[~ [EG [~ [[34<=p1_2 & E [[~ [EG [E [true U ~ [p0_3<=24]]]] & ~ [E [E [true U ~ [p0_3<=24]] U [p1_3<=p5_2 & E [true U ~ [p0_3<=24]]]]]] U p5_2<=1]]]]] & ~ [E [~ [[34<=p1_2 & E [[~ [EG [E [true U ~ [p0_3<=24]]]] & ~ [E [E [true U ~ [p0_3<=24]] U [p1_3<=p5_2 & E [true U ~ [p0_3<=24]]]]]] U p5_2<=1]]] U [E [true U [p2_2<=p1_1 | p4_1<=p1_1]] & ~ [[34<=p1_2 & E [[~ [EG [E [true U ~ [p0_3<=24]]]] & ~ [E [E [true U ~ [p0_3<=24]] U [p1_3<=p5_2 & E [true U ~ [p0_3<=24]]]]]] U p5_2<=1]]]]]]] | [~ [E [true U EG [~ [[p3_3<=p3_2 & ~ [[~ [EG [~ [3<=p4_3]]] & ~ [E [~ [3<=p4_3] U [~ [p3_2<=34] & ~ [3<=p4_3]]]]]]]]]]] | EX [~ [E [true U [[p0_2<=32 & p1_1<=42] | [19<=p0_2 & p5_1<=p4_1]]]]]]]

abstracting: (p5_1<=p4_1)
states: 20,769,210,648 (10)
abstracting: (19<=p0_2)
states: 21,706,205,472 (10)
abstracting: (p1_1<=42)
states: 33,255,368,856 (10)
abstracting: (p0_2<=32)
states: 28,877,919,120 (10)
.abstracting: (3<=p4_3)
states: 0
abstracting: (p3_2<=34)
states: 41,538,421,296 (10)
abstracting: (3<=p4_3)
states: 0
abstracting: (3<=p4_3)
states: 0

EG iterations: 0
abstracting: (p3_3<=p3_2)
states: 31,153,815,972 (10)
.
EG iterations: 1
abstracting: (p5_2<=1)
states: 20,769,210,648 (10)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)
abstracting: (p1_3<=p5_2)
states: 3,201,442,596 (9)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)

EG iterations: 0
abstracting: (34<=p1_2)
states: 12,144,216,384 (10)
abstracting: (p4_1<=p1_1)
states: 40,240,327,608 (10)
abstracting: (p2_2<=p1_1)
states: 21,100,781,880 (10)
abstracting: (p5_2<=1)
states: 20,769,210,648 (10)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)
abstracting: (p1_3<=p5_2)
states: 3,201,442,596 (9)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)

EG iterations: 0
abstracting: (34<=p1_2)
states: 12,144,216,384 (10)
abstracting: (p5_2<=1)
states: 20,769,210,648 (10)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)
abstracting: (p1_3<=p5_2)
states: 3,201,442,596 (9)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)
abstracting: (p0_3<=24)
states: 24,187,766,832 (10)

EG iterations: 0
abstracting: (34<=p1_2)
states: 12,144,216,384 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.490sec

checking: ~ [AG [[[[[AG [p2_2<=p4_1] & [p1_1<=p5_1 | p0_3<=p4_2]] | [p3_2<=28 & [p0_2<=p1_3 & p4_1<=7]]] | [EG [p3_1<=p4_2] | p1_2<=24]] & EF [[[47<=p5_1 & p0_2<=17] & E [p2_3<=16 U p2_3<=p0_3]]]]]]
normalized: E [true U ~ [[E [true U [E [p2_3<=16 U p2_3<=p0_3] & [47<=p5_1 & p0_2<=17]]] & [[p1_2<=24 | EG [p3_1<=p4_2]] | [[p3_2<=28 & [p0_2<=p1_3 & p4_1<=7]] | [[p1_1<=p5_1 | p0_3<=p4_2] & ~ [E [true U ~ [p2_2<=p4_1]]]]]]]]]

abstracting: (p2_2<=p4_1)
states: 2,571,946,128 (9)
abstracting: (p0_3<=p4_2)
states: 2,571,946,128 (9)
abstracting: (p1_1<=p5_1)
states: 3,201,442,596 (9)
abstracting: (p4_1<=7)
states: 41,538,421,296 (10)
abstracting: (p0_2<=p1_3)
states: 21,100,781,880 (10)
abstracting: (p3_2<=28)
states: 41,538,421,296 (10)
abstracting: (p3_1<=p4_2)
states: 34,615,351,080 (10)
.
EG iterations: 1
abstracting: (p1_2<=24)
states: 24,189,660,288 (10)
abstracting: (p0_2<=17)
states: 19,040,018,544 (10)
abstracting: (47<=p5_1)
states: 0
abstracting: (p2_3<=p0_3)
states: 41,538,421,296 (10)
abstracting: (p2_3<=16)
states: 18,200,525,904 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.160sec

checking: AG [[[AG [~ [[[p3_2<=31 & 35<=p0_1] & ~ [p2_3<=38]]]] & [~ [46<=p3_1] | p4_3<=p0_3]] | ~ [[[[22<=p2_1 & AX [p1_3<=p5_2]] | [~ [42<=p1_1] & [[5<=p5_3 | p3_2<=1] & ~ [p1_2<=31]]]] & E [EF [p2_2<=p0_3] U ~ [[p0_3<=p4_2 | p0_1<=p5_1]]]]]]]
normalized: ~ [E [true U ~ [[~ [[E [E [true U p2_2<=p0_3] U ~ [[p0_3<=p4_2 | p0_1<=p5_1]]] & [[[~ [p1_2<=31] & [5<=p5_3 | p3_2<=1]] & ~ [42<=p1_1]] | [22<=p2_1 & ~ [EX [~ [p1_3<=p5_2]]]]]]] | [[p4_3<=p0_3 | ~ [46<=p3_1]] & ~ [E [true U [~ [p2_3<=38] & [p3_2<=31 & 35<=p0_1]]]]]]]]]

abstracting: (35<=p0_1)
states: 11,663,869,536 (10)
abstracting: (p3_2<=31)
states: 41,538,421,296 (10)
abstracting: (p2_3<=38)
states: 31,679,611,920 (10)
abstracting: (46<=p3_1)
states: 0
abstracting: (p4_3<=p0_3)
states: 40,241,822,904 (10)
abstracting: (p1_3<=p5_2)
states: 3,201,442,596 (9)
.abstracting: (22<=p2_1)
states: 19,420,150,464 (10)
abstracting: (42<=p1_1)
states: 8,649,609,408 (9)
abstracting: (p3_2<=1)
states: 41,538,421,296 (10)
abstracting: (5<=p5_3)
states: 0
abstracting: (p1_2<=31)
states: 28,364,949,360 (10)
abstracting: (p0_1<=p5_1)
states: 3,198,994,668 (9)
abstracting: (p0_3<=p4_2)
states: 2,571,946,128 (9)
abstracting: (p2_2<=p0_3)
states: 21,101,462,280 (10)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.824sec

checking: [AF [[AF [AG [p2_3<=p0_3]] | E [46<=p4_2 U A [~ [12<=p4_2] U ~ [p4_2<=24]]]]] & EX [[[[[[~ [p0_2<=p2_2] | ~ [p0_1<=p4_3]] & [29<=p4_2 & [p0_1<=8 & 46<=p2_2]]] & p3_2<=32] & p4_2<=p1_2] | [EF [E [p1_3<=p4_1 U 49<=p4_2]] | ~ [AF [AF [14<=p5_1]]]]]]]
normalized: [EX [[[EG [EG [~ [14<=p5_1]]] | E [true U E [p1_3<=p4_1 U 49<=p4_2]]] | [p4_2<=p1_2 & [p3_2<=32 & [[29<=p4_2 & [p0_1<=8 & 46<=p2_2]] & [~ [p0_1<=p4_3] | ~ [p0_2<=p2_2]]]]]]] & ~ [EG [~ [[E [46<=p4_2 U [~ [EG [p4_2<=24]] & ~ [E [p4_2<=24 U [12<=p4_2 & p4_2<=24]]]]] | ~ [EG [E [true U ~ [p2_3<=p0_3]]]]]]]]]

abstracting: (p2_3<=p0_3)
states: 41,538,421,296 (10)
.
EG iterations: 1
abstracting: (p4_2<=24)
states: 41,538,421,296 (10)
abstracting: (12<=p4_2)
states: 0
abstracting: (p4_2<=24)
states: 41,538,421,296 (10)
abstracting: (p4_2<=24)
states: 41,538,421,296 (10)

EG iterations: 0
abstracting: (46<=p4_2)
states: 0
.
EG iterations: 1
abstracting: (p0_2<=p2_2)
states: 41,538,421,296 (10)
abstracting: (p0_1<=p4_3)
states: 2,571,946,128 (9)
abstracting: (46<=p2_2)
states: 7,235,319,168 (9)
abstracting: (p0_1<=8)
states: 10,664,046,576 (10)
abstracting: (29<=p4_2)
states: 0
abstracting: (p3_2<=32)
states: 41,538,421,296 (10)
abstracting: (p4_2<=p1_2)
states: 40,240,327,608 (10)
abstracting: (49<=p4_2)
states: 0
abstracting: (p1_3<=p4_1)
states: 2,574,294,336 (9)
abstracting: (14<=p5_1)
states: 0

EG iterations: 0

EG iterations: 0
.-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.204sec

checking: AG [A [EG [~ [p0_1<=38]] U [[EX [p5_3<=24] | [~ [p2_3<=17] | EX [p4_1<=p2_2]]] | [[[[p4_1<=p2_2 | p1_2<=p3_3] | [p0_2<=23 & p1_2<=p1_2]] | [E [34<=p2_2 U p0_3<=p3_1] & 49<=p0_1]] & [p3_2<=24 | [p1_1<=p5_1 & 21<=p4_2]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[p3_2<=24 | [p1_1<=p5_1 & 21<=p4_2]] & [[49<=p0_1 & E [34<=p2_2 U p0_3<=p3_1]] | [[p0_2<=23 & p1_2<=p1_2] | [p4_1<=p2_2 | p1_2<=p3_3]]]] | [[EX [p4_1<=p2_2] | ~ [p2_3<=17]] | EX [p5_3<=24]]]]]] & ~ [E [~ [[[[p3_2<=24 | [p1_1<=p5_1 & 21<=p4_2]] & [[49<=p0_1 & E [34<=p2_2 U p0_3<=p3_1]] | [[p0_2<=23 & p1_2<=p1_2] | [p4_1<=p2_2 | p1_2<=p3_3]]]] | [[EX [p4_1<=p2_2] | ~ [p2_3<=17]] | EX [p5_3<=24]]]] U [~ [EG [~ [p0_1<=38]]] & ~ [[[[p3_2<=24 | [p1_1<=p5_1 & 21<=p4_2]] & [[49<=p0_1 & E [34<=p2_2 U p0_3<=p3_1]] | [[p0_2<=23 & p1_2<=p1_2] | [p4_1<=p2_2 | p1_2<=p3_3]]]] | [[EX [p4_1<=p2_2] | ~ [p2_3<=17]] | EX [p5_3<=24]]]]]]]]]]]

abstracting: (p5_3<=24)
states: 41,538,421,296 (10)
.abstracting: (p2_3<=17)
states: 19,040,018,544 (10)
abstracting: (p4_1<=p2_2)
states: 40,241,822,904 (10)
.abstracting: (p1_2<=p3_3)
states: 1,947,140,532 (9)
abstracting: (p4_1<=p2_2)
states: 40,241,822,904 (10)
abstracting: (p1_2<=p1_2)
states: 41,538,421,296 (10)
abstracting: (p0_2<=23)
states: 23,525,528,112 (10)
abstracting: (p0_3<=p3_1)
states: 1,944,897,588 (9)
abstracting: (34<=p2_2)
states: 12,145,847,616 (10)
abstracting: (49<=p0_1)
states: 6,305,970,528 (9)
abstracting: (21<=p4_2)
states: 0
abstracting: (p1_1<=p5_1)
states: 3,201,442,596 (9)
abstracting: (p3_2<=24)
states: 41,538,421,296 (10)
abstracting: (p0_1<=38)
states: 31,679,611,920 (10)
.
EG iterations: 1
abstracting: (p5_3<=24)
states: 41,538,421,296 (10)
.abstracting: (p2_3<=17)
states: 19,040,018,544 (10)
abstracting: (p4_1<=p2_2)
states: 40,241,822,904 (10)
.abstracting: (p1_2<=p3_3)
states: 1,947,140,532 (9)
abstracting: (p4_1<=p2_2)
states: 40,241,822,904 (10)
abstracting: (p1_2<=p1_2)
states: 41,538,421,296 (10)
abstracting: (p0_2<=23)
states: 23,525,528,112 (10)
abstracting: (p0_3<=p3_1)
states: 1,944,897,588 (9)
abstracting: (34<=p2_2)
states: 12,145,847,616 (10)
abstracting: (49<=p0_1)
states: 6,305,970,528 (9)
abstracting: (21<=p4_2)
states: 0
abstracting: (p1_1<=p5_1)
states: 3,201,442,596 (9)
abstracting: (p3_2<=24)
states: 41,538,421,296 (10)
abstracting: (p5_3<=24)
states: 41,538,421,296 (10)
.abstracting: (p2_3<=17)
states: 19,040,018,544 (10)
abstracting: (p4_1<=p2_2)
states: 40,241,822,904 (10)
.abstracting: (p1_2<=p3_3)
states: 1,947,140,532 (9)
abstracting: (p4_1<=p2_2)
states: 40,241,822,904 (10)
abstracting: (p1_2<=p1_2)
states: 41,538,421,296 (10)
abstracting: (p0_2<=23)
states: 23,525,528,112 (10)
abstracting: (p0_3<=p3_1)
states: 1,944,897,588 (9)
abstracting: (34<=p2_2)
states: 12,145,847,616 (10)
abstracting: (49<=p0_1)
states: 6,305,970,528 (9)
abstracting: (21<=p4_2)
states: 0
abstracting: (p1_1<=p5_1)
states: 3,201,442,596 (9)
abstracting: (p3_2<=24)
states: 41,538,421,296 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.066sec

totally nodes used: 12400378 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 459473555 27697186 487170741
used/not used/entry size/cache size: 28654061 38454803 16 1024MB
basic ops cache: hits/miss/sum: 173098697 17259493 190358190
used/not used/entry size/cache size: 12775230 4001986 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: 2731564 606692 3338256
used/not used/entry size/cache size: 584502 7804106 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 57338863
1 8219184
2 1269740
3 175140
4 49647
5 15690
6 9418
7 5392
8 3050
9 1634
>= 10 21106

Total processing time: 1m34.719sec


BK_STOP 1679894151500

--------------------
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:7459 (355), effective:1786 (85)

initing FirstDep: 0m 0.000sec


iterations count:306 (14), effective:141 (6)

iterations count:334 (15), effective:153 (7)

iterations count:4940 (235), effective:2077 (98)

iterations count:2864 (136), effective:654 (31)

iterations count:1385 (65), effective:154 (7)

iterations count:660 (31), effective:143 (6)

iterations count:207 (9), effective:42 (2)

iterations count:1568 (74), effective:375 (17)

iterations count:314 (14), effective:71 (3)

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

iterations count:212 (10), effective:159 (7)

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

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

iterations count:209 (9), effective:141 (6)

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

iterations count:1594 (75), effective:325 (15)

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

iterations count:1570 (74), effective:376 (17)

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

iterations count:480 (22), effective:115 (5)

iterations count:178 (8), effective:114 (5)

iterations count:727 (34), effective:157 (7)

iterations count:985 (46), effective:462 (22)

iterations count:480 (22), effective:115 (5)

iterations count:178 (8), effective:114 (5)

iterations count:727 (34), effective:157 (7)

iterations count:480 (22), effective:115 (5)

iterations count:178 (8), effective:114 (5)

iterations count:727 (34), effective:157 (7)

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

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

iterations count:2996 (142), effective:612 (29)

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

iterations count:179 (8), effective:118 (5)

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

iterations count:778 (37), effective:184 (8)

iterations count:778 (37), effective:184 (8)

iterations count:727 (34), effective:157 (7)

iterations count:778 (37), effective:184 (8)

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

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

iterations count:778 (37), effective:184 (8)

iterations count:778 (37), effective:184 (8)

iterations count:727 (34), effective:157 (7)

iterations count:778 (37), effective:184 (8)

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

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

iterations count:778 (37), effective:184 (8)

iterations count:778 (37), effective:184 (8)

iterations count:727 (34), effective:157 (7)

iterations count:778 (37), effective:184 (8)

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

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

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

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

iterations count:2219 (105), effective:517 (24)

iterations count:1434 (68), effective:372 (17)

iterations count:115 (5), effective:25 (1)

iterations count:3544 (168), effective:856 (40)

iterations count:1083 (51), effective:121 (5)

iterations count:1083 (51), effective:121 (5)

iterations count:1083 (51), effective:121 (5)

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="Murphy-PT-D2N050"
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 Murphy-PT-D2N050, 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 r513-tall-167987240900337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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