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.r065-smll-167814393100233.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 ClientsAndServers-PT-N0005P1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393100233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678286807372

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=ClientsAndServers-PT-N0005P1
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: ClientsAndServers_PT_N0005P1
(NrP: 25 NrTr: 18 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 3.632sec


RS generation: 1m27.791sec


-> reachability set: #nodes 545079 (5.5e+05) #states 211,714,654,767 (11)



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

checking: EF [AG [StR<=SwA]]
normalized: E [true U ~ [E [true U ~ [StR<=SwA]]]]

abstracting: (StR<=SwA)
states: 189,151,192,331 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.277sec

checking: EX [EG [EX [Si<=MtF]]]
normalized: EX [EG [EX [Si<=MtF]]]

abstracting: (Si<=MtF)
states: 132,542,877,498 (11)
..................................................................................
EG iterations: 81
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.006sec

checking: ~ [AF [[EF [12<=SwA] & CwG<=Si]]]
normalized: EG [~ [[CwG<=Si & E [true U 12<=SwA]]]]

abstracting: (12<=SwA)
states: 0
abstracting: (CwG<=Si)
states: 1,222,177,020 (9)

EG iterations: 0
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.573sec

checking: EF [[~ [EF [~ [[~ [38<=SA] | CG<=29]]]] & EX [[35<=SF | EF [Si<=13]]]]]
normalized: E [true U [EX [[35<=SF | E [true U Si<=13]]] & ~ [E [true U ~ [[CG<=29 | ~ [38<=SA]]]]]]]

abstracting: (38<=SA)
states: 0
abstracting: (CG<=29)
states: 211,714,654,767 (11)
abstracting: (Si<=13)
states: 211,714,654,767 (11)
abstracting: (35<=SF)
states: 0
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.662sec

checking: E [39<=SF U AX [[AF [~ [[SwA<=SG & StR<=8]]] & ~ [21<=SwA]]]]
normalized: E [39<=SF U ~ [EX [~ [[~ [21<=SwA] & ~ [EG [[SwA<=SG & StR<=8]]]]]]]]

abstracting: (StR<=8)
states: 211,710,425,349 (11)
abstracting: (SwA<=SG)
states: 44,679,750,629 (10)
....................................................................................................................
EG iterations: 116
abstracting: (21<=SwA)
states: 0
.abstracting: (39<=SF)
states: 0
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m55.090sec

checking: ~ [AG [~ [AG [~ [[[CF<=6 & SF<=SwG] | CwA<=SpA]]]]]]
normalized: E [true U ~ [E [true U [CwA<=SpA | [CF<=6 & SF<=SwG]]]]]

abstracting: (SF<=SwG)
states: 190,593,651,587 (11)
abstracting: (CF<=6)
states: 151,358,641,049 (11)
abstracting: (CwA<=SpA)
states: 103,312,551 (8)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m55.880sec

checking: [AG [[[Uf<=4 & CwG<=23] & [E [EF [SG<=2] U AX [SpG<=37]] & ~ [AG [EG [MpA<=5]]]]]] | ~ [[AG [AX [Cb<=24]] & ~ [AX [5<=MtF]]]]]
normalized: [~ [[EX [~ [5<=MtF]] & ~ [E [true U EX [~ [Cb<=24]]]]]] | ~ [E [true U ~ [[[E [true U ~ [EG [MpA<=5]]] & E [E [true U SG<=2] U ~ [EX [~ [SpG<=37]]]]] & [Uf<=4 & CwG<=23]]]]]]

abstracting: (CwG<=23)
states: 190,640,654,431 (11)
abstracting: (Uf<=4)
states: 48,850,653,621 (10)
abstracting: (SpG<=37)
states: 211,714,654,767 (11)
.abstracting: (SG<=2)
states: 196,656,669,393 (11)
abstracting: (MpA<=5)
states: 211,113,023,442 (11)
.
EG iterations: 1
abstracting: (Cb<=24)
states: 211,696,552,639 (11)
.abstracting: (5<=MtF)
states: 1,724,167,464 (9)
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 7.935sec

checking: A [EF [CG<=Mi] U [~ [EF [[AF [Si<=SpG] & AG [MtF<=Si]]]] & CwA<=1]]
normalized: [~ [EG [~ [[CwA<=1 & ~ [E [true U [~ [E [true U ~ [MtF<=Si]]] & ~ [EG [~ [Si<=SpG]]]]]]]]]] & ~ [E [~ [[CwA<=1 & ~ [E [true U [~ [E [true U ~ [MtF<=Si]]] & ~ [EG [~ [Si<=SpG]]]]]]]] U [~ [E [true U CG<=Mi]] & ~ [[CwA<=1 & ~ [E [true U [~ [E [true U ~ [MtF<=Si]]] & ~ [EG [~ [Si<=SpG]]]]]]]]]]]]

abstracting: (Si<=SpG)
states: 132,542,877,498 (11)
....................................................................................................
EG iterations: 100
abstracting: (MtF<=Si)
states: 151,678,289,727 (11)
abstracting: (CwA<=1)
states: 276,410,706 (8)
abstracting: (CG<=Mi)
states: 178,204,222,449 (11)
abstracting: (Si<=SpG)
states: 132,542,877,498 (11)
....................................................................................................
EG iterations: 100
abstracting: (MtF<=Si)
states: 151,678,289,727 (11)
abstracting: (CwA<=1)
states: 276,410,706 (8)
abstracting: (Si<=SpG)
states: 132,542,877,498 (11)
....................................................................................................
EG iterations: 100
abstracting: (MtF<=Si)
states: 151,678,289,727 (11)
abstracting: (CwA<=1)
states: 276,410,706 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m15.837sec

checking: AX [[[EG [AG [EF [StF<=MtF]]] | [~ [Si<=18] | Si<=MpA]] | [[~ [EX [MwU<=24]] | 27<=MwU] | 28<=Si]]]
normalized: ~ [EX [~ [[[28<=Si | [27<=MwU | ~ [EX [MwU<=24]]]] | [[Si<=MpA | ~ [Si<=18]] | EG [~ [E [true U ~ [E [true U StF<=MtF]]]]]]]]]]

abstracting: (StF<=MtF)
states: 146,051,819,637 (11)

EG iterations: 0
abstracting: (Si<=18)
states: 211,714,654,767 (11)
abstracting: (Si<=MpA)
states: 133,824,368,088 (11)
abstracting: (MwU<=24)
states: 211,714,654,767 (11)
.abstracting: (27<=MwU)
states: 0
abstracting: (28<=Si)
states: 0
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.165sec

checking: AG [E [AX [E [[20<=CwG | CA<=MpA] U AG [27<=SpA]]] U E [EF [[SpA<=SR & 13<=CG]] U AG [AG [MwU<=30]]]]]
normalized: ~ [E [true U ~ [E [~ [EX [~ [E [[20<=CwG | CA<=MpA] U ~ [E [true U ~ [27<=SpA]]]]]]] U E [E [true U [SpA<=SR & 13<=CG]] U ~ [E [true U E [true U ~ [MwU<=30]]]]]]]]]

abstracting: (MwU<=30)
states: 211,714,654,767 (11)
abstracting: (13<=CG)
states: 14,080,956,648 (10)
abstracting: (SpA<=SR)
states: 144,462,474,323 (11)
abstracting: (27<=SpA)
states: 0
abstracting: (CA<=MpA)
states: 42,435,006,742 (10)
abstracting: (20<=CwG)
states: 48,962,581,404 (10)
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m11.662sec

checking: AG [[SG<=23 & EG [[E [[CG<=SA & SwG<=SpA] U SG<=CwG] | ~ [SR<=MtF]]]]]
normalized: ~ [E [true U ~ [[SG<=23 & EG [[~ [SR<=MtF] | E [[CG<=SA & SwG<=SpA] U SG<=CwG]]]]]]]

abstracting: (SG<=CwG)
states: 211,714,654,767 (11)
abstracting: (SwG<=SpA)
states: 46,324,324,781 (10)
abstracting: (CG<=SA)
states: 50,788,067,869 (10)
abstracting: (SR<=MtF)
states: 143,373,924,899 (11)

EG iterations: 0
abstracting: (SG<=23)
states: 211,714,654,767 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.039sec

checking: ~ [EF [A [A [[A [Cb<=24 U 36<=Uf] & AF [24<=Cb]] U EX [MwU<=SwG]] U [~ [CF<=12] & [~ [[SwA<=19 | MwU<=MpG]] | EF [CF<=SpG]]]]]]
normalized: ~ [E [true U [~ [EG [~ [[[E [true U CF<=SpG] | ~ [[SwA<=19 | MwU<=MpG]]] & ~ [CF<=12]]]]] & ~ [E [~ [[[E [true U CF<=SpG] | ~ [[SwA<=19 | MwU<=MpG]]] & ~ [CF<=12]]] U [~ [[~ [EG [~ [EX [MwU<=SwG]]]] & ~ [E [~ [EX [MwU<=SwG]] U [~ [[~ [EG [~ [24<=Cb]]] & [~ [EG [~ [36<=Uf]]] & ~ [E [~ [36<=Uf] U [~ [Cb<=24] & ~ [36<=Uf]]]]]]] & ~ [EX [MwU<=SwG]]]]]]] & ~ [[[E [true U CF<=SpG] | ~ [[SwA<=19 | MwU<=MpG]]] & ~ [CF<=12]]]]]]]]]

abstracting: (CF<=12)
states: 197,633,698,119 (11)
abstracting: (MwU<=MpG)
states: 143,373,924,899 (11)
abstracting: (SwA<=19)
states: 211,714,654,767 (11)
abstracting: (CF<=SpG)
states: 50,142,617,899 (10)
abstracting: (MwU<=SwG)
states: 211,714,654,767 (11)
.abstracting: (36<=Uf)
states: 0
abstracting: (Cb<=24)
states: 211,696,552,639 (11)
abstracting: (36<=Uf)
states: 0
abstracting: (36<=Uf)
states: 0

EG iterations: 0
abstracting: (24<=Cb)
states: 51,738,357 (7)
.
EG iterations: 1
abstracting: (MwU<=SwG)
states: 211,714,654,767 (11)
.abstracting: (MwU<=SwG)
states: 211,714,654,767 (11)
..
EG iterations: 1
abstracting: (CF<=12)
states: 197,633,698,119 (11)
abstracting: (MwU<=MpG)
states: 143,373,924,899 (11)
abstracting: (SwA<=19)
states: 211,714,654,767 (11)
abstracting: (CF<=SpG)
states: 50,142,617,899 (10)
abstracting: (CF<=12)
states: 197,633,698,119 (11)
abstracting: (MwU<=MpG)
states: 143,373,924,899 (11)
abstracting: (SwA<=19)
states: 211,714,654,767 (11)
abstracting: (CF<=SpG)
states: 50,142,617,899 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m14.708sec

checking: E [Cb<=5 U E [[[[~ [EF [4<=CwA]] & [19<=MwU | EX [23<=StR]]] & [AG [CA<=CwA] | E [36<=CwG U MwU<=SwA]]] & EF [EX [SpA<=CF]]] U EX [AX [37<=CwG]]]]
normalized: E [Cb<=5 U E [[E [true U EX [SpA<=CF]] & [[E [36<=CwG U MwU<=SwA] | ~ [E [true U ~ [CA<=CwA]]]] & [[19<=MwU | EX [23<=StR]] & ~ [E [true U 4<=CwA]]]]] U EX [~ [EX [~ [37<=CwG]]]]]]

abstracting: (37<=CwG)
states: 27,306,301 (7)
..abstracting: (4<=CwA)
states: 209,103,483,347 (11)
abstracting: (23<=StR)
states: 0
.abstracting: (19<=MwU)
states: 0
abstracting: (CA<=CwA)
states: 211,714,654,767 (11)
abstracting: (MwU<=SwA)
states: 189,151,192,331 (11)
abstracting: (36<=CwG)
states: 74,503,451 (7)
abstracting: (SpA<=CF)

before gc: list nodes free: 1909921

after gc: idd nodes used:8485201, unused:55514799; list nodes free:462510786
states: 189,459,863,461 (11)
.abstracting: (Cb<=5)
states: 137,850,161,922 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m25.282sec

checking: AG [E [[~ [EG [~ [CG<=SwA]]] | 21<=CwG] U [AG [SpG<=1] | [[[AF [SwG<=26] & EF [36<=Cb]] | Ci<=SF] & [[[SwA<=21 | CwA<=33] | 29<=CF] | [AG [19<=SF] & Ci<=CwA]]]]]]
normalized: ~ [E [true U ~ [E [[21<=CwG | ~ [EG [~ [CG<=SwA]]]] U [[[[Ci<=CwA & ~ [E [true U ~ [19<=SF]]]] | [29<=CF | [SwA<=21 | CwA<=33]]] & [Ci<=SF | [E [true U 36<=Cb] & ~ [EG [~ [SwG<=26]]]]]] | ~ [E [true U ~ [SpG<=1]]]]]]]]

abstracting: (SpG<=1)
states: 172,839,260,832 (11)
abstracting: (SwG<=26)
states: 211,714,654,767 (11)
.
EG iterations: 1
abstracting: (36<=Cb)
states: 0
abstracting: (Ci<=SF)
states: 41,019,602,338 (10)
abstracting: (CwA<=33)
states: 211,354,228,515 (11)
abstracting: (SwA<=21)
states: 211,714,654,767 (11)
abstracting: (29<=CF)
states: 0
abstracting: (19<=SF)
states: 0
abstracting: (Ci<=CwA)
states: 181,801,940,843 (11)
abstracting: (CG<=SwA)
states: 99,600,781,885 (10)
............................................................................................
EG iterations: 92
abstracting: (21<=CwG)
states: 40,613,275,450 (10)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 9m58.132sec

checking: [[~ [[[E [EG [MwU<=Mi] U Mi<=11] | EX [AF [SwG<=28]]] | AG [[~ [SG<=28] & [SpA<=MtF | SF<=SG]]]]] | AF [~ [MtF<=CF]]] & AX [AF [~ [[Si<=22 & [CA<=SF & ~ [Uf<=37]]]]]]]
normalized: [~ [EX [EG [[Si<=22 & [CA<=SF & ~ [Uf<=37]]]]]] & [~ [EG [MtF<=CF]] | ~ [[~ [E [true U ~ [[[SpA<=MtF | SF<=SG] & ~ [SG<=28]]]]] | [EX [~ [EG [~ [SwG<=28]]]] | E [EG [MwU<=Mi] U Mi<=11]]]]]]

abstracting: (Mi<=11)
states: 196,622,041,997 (11)
abstracting: (MwU<=Mi)
states: 211,010,399,625 (11)
......................................................................................
EG iterations: 86
abstracting: (SwG<=28)
states: 211,714,654,767 (11)
.
EG iterations: 1
.abstracting: (SG<=28)
states: 211,714,654,767 (11)
abstracting: (SF<=SG)
states: 146,051,819,637 (11)
abstracting: (SpA<=MtF)
states: 143,374,068,449 (11)
abstracting: (MtF<=CF)
states: 190,134,730,951 (11)
........................................................................
EG iterations: 72
abstracting: (Uf<=37)
states: 211,714,654,767 (11)
abstracting: (CA<=SF)
states: 41,019,602,338 (10)
abstracting: (Si<=22)
states: 211,714,654,767 (11)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m51.753sec

checking: AG [[[[EF [CwA<=Mi] & [EF [8<=CF] | 27<=MwU]] | EX [35<=SwA]] & [[CwG<=SA | [[[16<=SA | [StF<=21 | CwG<=15]] & [AF [1<=SF] & EF [32<=CwA]]] | ~ [[EX [CwA<=StF] & Mi<=27]]]] & [[[EG [StF<=19] | 27<=CG] | [EG [36<=StR] & AX [27<=MtF]]] | AX [~ [Ci<=2]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EX [Ci<=2]] | [[~ [EX [~ [27<=MtF]]] & EG [36<=StR]] | [27<=CG | EG [StF<=19]]]] & [CwG<=SA | [~ [[Mi<=27 & EX [CwA<=StF]]] | [[E [true U 32<=CwA] & ~ [EG [~ [1<=SF]]]] & [16<=SA | [StF<=21 | CwG<=15]]]]]] & [EX [35<=SwA] | [[27<=MwU | E [true U 8<=CF]] & E [true U CwA<=Mi]]]]]]]

abstracting: (CwA<=Mi)
states: 47,338,648,413 (10)

before gc: list nodes free: 3638

after gc: idd nodes used:13135747, unused:50864253; list nodes free:481908782
abstracting: (8<=CF)
states: 48,848,754,339 (10)
abstracting: (27<=MwU)
states: 0
abstracting: (35<=SwA)
states: 0
.abstracting: (CwG<=15)
states: 120,807,036,802 (11)
abstracting: (StF<=21)
states: 211,714,654,767 (11)
abstracting: (16<=SA)
states: 0
abstracting: (1<=SF)
states: 93,508,716,980 (10)
....................................................................................................................................................................
before gc: list nodes free: 45199225

after gc: idd nodes used:16020863, unused:47979137; list nodes free:457158054
..............................................................................................................................................................................................................................
EG iterations: 386
abstracting: (32<=CwA)
states: 1,189,814,568 (9)

before gc: list nodes free: 57258751

after gc: idd nodes used:14207034, unused:49792966; list nodes free:472234041
abstracting: (CwA<=StF)
states: 98,528,430 (7)
.abstracting: (Mi<=27)
states: 211,714,654,767 (11)
abstracting: (CwG<=SA)
states: 1,005,539,828 (9)
abstracting: (StF<=19)
states: 211,714,654,767 (11)

EG iterations: 0
abstracting: (27<=CG)
states: 1,000,956 (6)
abstracting: (36<=StR)
states: 0
.
EG iterations: 1
abstracting: (27<=MtF)
states: 0
.abstracting: (Ci<=2)
states: 69,645,307,380 (10)
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 21m12.684sec

totally nodes used: 224372378 (2.2e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 2854124301 1001538928 3855663229
used/not used/entry size/cache size: 27578272 39530592 16 1024MB
basic ops cache: hits/miss/sum: 776092271 310497422 1086589693
used/not used/entry size/cache size: 10257194 6520022 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: 66317138 20066157 86383295
used/not used/entry size/cache size: 1147694 7240914 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 50352851
1 13983515
2 2311416
3 338288
4 79824
5 20147
6 8261
7 4325
8 2623
9 2581
>= 10 5033

Total processing time: 50m23.990sec


BK_STOP 1678289831509

--------------------
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:4822 (267), effective:1040 (57)

initing FirstDep: 0m 0.000sec


iterations count:405 (22), effective:78 (4)

iterations count:1967 (109), effective:417 (23)

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

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

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

iterations count:1418 (78), effective:295 (16)

iterations count:1958 (108), effective:421 (23)

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

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

iterations count:542 (30), effective:119 (6)

iterations count:985 (54), effective:195 (10)

iterations count:2913 (161), effective:646 (35)

iterations count:319 (17), effective:73 (4)

iterations count:1937 (107), effective:407 (22)

iterations count:44 (2), effective:26 (1)

iterations count:319 (17), effective:73 (4)

iterations count:1937 (107), effective:407 (22)

iterations count:319 (17), effective:73 (4)

iterations count:1937 (107), effective:407 (22)

iterations count:78 (4), effective:10 (0)

iterations count:1635 (90), effective:357 (19)

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

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

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

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

iterations count:1490 (82), effective:318 (17)

iterations count:2914 (161), effective:647 (35)

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

iterations count:1490 (82), effective:318 (17)

iterations count:2101 (116), effective:487 (27)

iterations count:1490 (82), effective:318 (17)

iterations count:845 (46), effective:200 (11)

iterations count:190 (10), effective:40 (2)

iterations count:559 (31), effective:126 (7)

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

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

iterations count:2306 (128), effective:529 (29)

iterations count:230 (12), effective:46 (2)

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

iterations count:338 (18), effective:40 (2)

iterations count:1421 (78), effective:321 (17)

iterations count:74 (4), effective:11 (0)

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

iterations count:1284 (71), effective:286 (15)

iterations count:560 (31), effective:129 (7)

iterations count:1732 (96), effective:402 (22)

iterations count:2037 (113), effective:473 (26)

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="ClientsAndServers-PT-N0005P1"
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 ClientsAndServers-PT-N0005P1, 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 r065-smll-167814393100233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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