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.r490-tall-167912709200862.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 marciexred
Input is TwoPhaseLocking-PT-nC00200vN, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709200862
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 9.1K Feb 25 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 17:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 17:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 17:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 17:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:23 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
-rw-r--r-- 1 mcc users 4.6K 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 TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679341404274

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00200vN
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:43:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 19:43:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:43:26] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-03-20 19:43:26] [INFO ] Transformed 8 places.
[2023-03-20 19:43:26] [INFO ] Transformed 6 transitions.
[2023-03-20 19:43:26] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 15) seen :9
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :1
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 19:43:26] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-20 19:43:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 19:43:27] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-20 19:43:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 19:43:27] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 971 ms.
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: TwoPhaseLocking_PT_nC00200vN
(NrP: 8 NrTr: 6 NrArc: 18)

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

net check time: 0m 0.000sec

init dd package: 0m 2.753sec


RS generation: 0m48.821sec


-> reachability set: #nodes 556510 (5.6e+05) #states 285,083,711 (8)



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

checking: AG [51<=resB]
normalized: ~ [E [true U ~ [51<=resB]]]

abstracting: (51<=resB)
states: 70,125,731 (7)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.306sec

checking: AG [~ [resA<=34]]
normalized: ~ [E [true U resA<=34]]

abstracting: (resA<=34)
states: 219,381,635 (8)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.998sec

checking: EF [125<=haveAandB]
normalized: E [true U 125<=haveAandB]

abstracting: (125<=haveAandB)
states: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.418sec

checking: EF [22<=haveB]
normalized: E [true U 22<=haveB]

abstracting: (22<=haveB)
states: 184,718,347 (8)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.664sec

checking: AG [haveA<=resA]
normalized: ~ [E [true U ~ [haveA<=resA]]]

abstracting: (haveA<=resA)
states: 144,863,731 (8)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.437sec

checking: EF [[haveA<=haveAandB & 124<=haveAandB]]
normalized: E [true U [haveA<=haveAandB & 124<=haveAandB]]

abstracting: (124<=haveAandB)
states: 0
abstracting: (haveA<=haveAandB)
states: 121,884,151 (8)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.395sec

checking: AG [[[haveA2<=resA | ~ [[resB<=198 | [~ [haveAandB<=haveAandB] & ~ [[~ [[haveA2<=156 | 40<=haveAandB]] & haveA<=179]]]]]] | 104<=haveA]]
normalized: ~ [E [true U ~ [[104<=haveA | [haveA2<=resA | ~ [[resB<=198 | [~ [[haveA<=179 & ~ [[haveA2<=156 | 40<=haveAandB]]]] & ~ [haveAandB<=haveAandB]]]]]]]]]

abstracting: (haveAandB<=haveAandB)
states: 285,083,711 (8)
abstracting: (40<=haveAandB)
states: 24,144,288 (7)
abstracting: (haveA2<=156)
states: 285,083,711 (8)
abstracting: (haveA<=179)
states: 285,083,711 (8)
abstracting: (resB<=198)
states: 285,083,711 (8)
abstracting: (haveA2<=resA)
states: 144,863,731 (8)
abstracting: (104<=haveA)
states: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.585sec

checking: EF [[124<=haveAandB & [~ [[haveB<=haveA2andB | [[[[[haveA2andB<=haveA2 & haveA2<=Clients] & 186<=resB] & [73<=resB | haveA2<=resB]] | Clients<=haveA] | [[157<=haveA & [[49<=haveAandB & 6<=haveA2] & ~ [haveA2andB<=24]]] | ~ [haveA2<=115]]]]] & [haveA2andB<=78 | 90<=haveAandB]]]]
normalized: E [true U [124<=haveAandB & [[haveA2andB<=78 | 90<=haveAandB] & ~ [[haveB<=haveA2andB | [[~ [haveA2<=115] | [157<=haveA & [~ [haveA2andB<=24] & [49<=haveAandB & 6<=haveA2]]]] | [Clients<=haveA | [[73<=resB | haveA2<=resB] & [186<=resB & [haveA2andB<=haveA2 & haveA2<=Clients]]]]]]]]]]

abstracting: (haveA2<=Clients)
states: 272,117,521 (8)
abstracting: (haveA2andB<=haveA2)
states: 168,992,411 (8)
abstracting: (186<=resB)
states: 0
abstracting: (haveA2<=resB)
states: 193,121,291 (8)
abstracting: (73<=resB)
states: 17,307,548 (7)
abstracting: (Clients<=haveA)
states: 13,598,691 (7)
abstracting: (6<=haveA2)
states: 232,630,737 (8)
abstracting: (49<=haveAandB)
states: 11,118,393 (7)
abstracting: (haveA2andB<=24)
states: 214,466,164 (8)
abstracting: (157<=haveA)
states: 0
abstracting: (haveA2<=115)
states: 285,083,711 (8)
abstracting: (haveB<=haveA2andB)
states: 84,789,081 (7)
abstracting: (90<=haveAandB)
states: 8,008 (3)
abstracting: (haveA2andB<=78)
states: 284,899,021 (8)
abstracting: (124<=haveAandB)
states: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.854sec

checking: AG [~ [[[44<=resA | ~ [2<=resB]] & [[haveAandB<=98 & [[[haveA2<=46 & [resB<=40 | haveB<=haveAandB]] | [[[resB<=resA & haveAandB<=45] | ~ [haveA2andB<=haveA2andB]] | [resB<=haveB | [resB<=resB | 81<=haveA2andB]]]] & 42<=haveA]] & [Clients<=19 | Clients<=haveA2andB]]]]]
normalized: ~ [E [true U [[[Clients<=19 | Clients<=haveA2andB] & [haveAandB<=98 & [42<=haveA & [[[resB<=haveB | [resB<=resB | 81<=haveA2andB]] | [~ [haveA2andB<=haveA2andB] | [resB<=resA & haveAandB<=45]]] | [haveA2<=46 & [resB<=40 | haveB<=haveAandB]]]]]] & [44<=resA | ~ [2<=resB]]]]]

abstracting: (2<=resB)
states: 275,887,560 (8)
abstracting: (44<=resA)
states: 38,815,746 (7)
abstracting: (haveB<=haveAandB)
states: 84,789,081 (7)
abstracting: (resB<=40)
states: 179,770,139 (8)
abstracting: (haveA2<=46)
states: 253,166,957 (8)
abstracting: (haveAandB<=45)
states: 270,488,823 (8)
abstracting: (resB<=resA)
states: 96,560,545 (7)
abstracting: (haveA2andB<=haveA2andB)
states: 285,083,711 (8)
abstracting: (81<=haveA2andB)
states: 118,657 (5)
abstracting: (resB<=resB)
states: 285,083,711 (8)
abstracting: (resB<=haveB)
states: 143,691,005 (8)
abstracting: (42<=haveA)
states: 43,958,127 (7)
abstracting: (haveAandB<=98)
states: 285,083,698 (8)
abstracting: (Clients<=haveA2andB)
states: 20,301 (4)
abstracting: (Clients<=19)
states: 945,613 (5)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m18.115sec

checking: EF [[[Clients<=75 & [[[[102<=resB | [~ [144<=haveB] | [[haveB<=resA | 144<=haveB] | [haveA<=haveAandB | haveA<=32]]]] | [[haveA2<=135 | [150<=resB | resB<=26]] | [[[resB<=61 | 69<=haveA] | [26<=haveA & resA<=25]] & 48<=haveA2]]] | haveA2andB<=99] & ~ [[~ [[~ [haveA<=63] | 37<=haveA2andB]] | [149<=haveA2 & [~ [[haveA2<=haveA & haveA2<=haveB]] & [haveB<=Clients | ~ [haveA2<=36]]]]]]]] | ~ [resA<=115]]]
normalized: E [true U [~ [resA<=115] | [Clients<=75 & [~ [[~ [[37<=haveA2andB | ~ [haveA<=63]]] | [149<=haveA2 & [[haveB<=Clients | ~ [haveA2<=36]] & ~ [[haveA2<=haveA & haveA2<=haveB]]]]]] & [haveA2andB<=99 | [[[48<=haveA2 & [[26<=haveA & resA<=25] | [resB<=61 | 69<=haveA]]] | [haveA2<=135 | [150<=resB | resB<=26]]] | [102<=resB | [[[haveA<=haveAandB | haveA<=32] | [haveB<=resA | 144<=haveB]] | ~ [144<=haveB]]]]]]]]]

abstracting: (144<=haveB)
states: 0
abstracting: (144<=haveB)
states: 0
abstracting: (haveB<=resA)
states: 96,560,646 (7)
abstracting: (haveA<=32)
states: 212,016,827 (8)
abstracting: (haveA<=haveAandB)
states: 121,884,151 (8)
abstracting: (102<=resB)
states: 0
abstracting: (resB<=26)
states: 122,376,166 (8)
abstracting: (150<=resB)
states: 0
abstracting: (haveA2<=135)
states: 285,083,711 (8)
abstracting: (69<=haveA)
states: 4,691,424 (6)
abstracting: (resB<=61)
states: 246,008,087 (8)
abstracting: (resA<=25)
states: 181,810,541 (8)
abstracting: (26<=haveA)
states: 103,273,095 (8)
abstracting: (48<=haveA2)
states: 29,823,895 (7)
abstracting: (haveA2andB<=99)
states: 285,083,709 (8)
abstracting: (haveA2<=haveB)
states: 193,121,191 (8)
abstracting: (haveA2<=haveA)
states: 144,863,681 (8)
abstracting: (haveA2<=36)
states: 226,218,111 (8)
abstracting: (haveB<=Clients)
states: 246,817,441 (8)
abstracting: (149<=haveA2)
states: 0
abstracting: (haveA<=63)
states: 277,077,984 (8)
abstracting: (37<=haveA2andB)
states: 30,505,904 (7)
abstracting: (Clients<=75)
states: 87,619,431 (7)
abstracting: (resA<=115)
states: 285,083,711 (8)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m58.941sec

checking: EF [[haveA<=101 & [~ [resB<=resB] & [[~ [[[[141<=haveB & [142<=haveA2andB & 5<=haveAandB]] & haveA2<=60] | ~ [haveA2<=haveA]]] & [[[~ [[52<=haveB & 151<=resA]] & haveB<=115] | [[~ [haveA2<=50] | [Clients<=resA & resA<=Clients]] & [[Clients<=27 & haveAandB<=haveA2andB] | [haveA2<=haveA2andB | 126<=resA]]]] & [~ [[109<=Clients | 74<=haveB]] | [[[179<=haveA2andB & haveA2<=149] & ~ [haveA<=156]] | ~ [haveA2andB<=96]]]]] | [haveA2andB<=64 & haveB<=129]]]]]
normalized: E [true U [haveA<=101 & [[[haveA2andB<=64 & haveB<=129] | [[[[~ [haveA2andB<=96] | [~ [haveA<=156] & [179<=haveA2andB & haveA2<=149]]] | ~ [[109<=Clients | 74<=haveB]]] & [[[[haveA2<=haveA2andB | 126<=resA] | [Clients<=27 & haveAandB<=haveA2andB]] & [[Clients<=resA & resA<=Clients] | ~ [haveA2<=50]]] | [haveB<=115 & ~ [[52<=haveB & 151<=resA]]]]] & ~ [[~ [haveA2<=haveA] | [haveA2<=60 & [141<=haveB & [142<=haveA2andB & 5<=haveAandB]]]]]]] & ~ [resB<=resB]]]]

abstracting: (resB<=resB)
states: 285,083,711 (8)
abstracting: (5<=haveAandB)
states: 222,098,184 (8)
abstracting: (142<=haveA2andB)
states: 0
abstracting: (141<=haveB)
states: 0
abstracting: (haveA2<=60)
states: 274,421,127 (8)
abstracting: (haveA2<=haveA)
states: 144,863,681 (8)
abstracting: (151<=resA)
states: 0
abstracting: (52<=haveB)
states: 66,947,429 (7)
abstracting: (haveB<=115)
states: 285,083,711 (8)
abstracting: (haveA2<=50)
states: 260,954,981 (8)
abstracting: (resA<=Clients)
states: 285,078,661 (8)
abstracting: (Clients<=resA)
states: 20,301 (4)
abstracting: (haveAandB<=haveA2andB)
states: 146,012,831 (8)
abstracting: (Clients<=27)
states: 3,027,731 (6)
abstracting: (126<=resA)
states: 0
abstracting: (haveA2<=haveA2andB)
states: 121,884,151 (8)
abstracting: (74<=haveB)
states: 15,804,667 (7)
abstracting: (109<=Clients)
states: 61,124,064 (7)
abstracting: (haveA2<=149)
states: 285,083,711 (8)
abstracting: (179<=haveA2andB)
states: 0
abstracting: (haveA<=156)
states: 285,083,711 (8)
abstracting: (haveA2andB<=96)
states: 285,083,578 (8)
abstracting: (haveB<=129)
states: 285,083,711 (8)
abstracting: (haveA2andB<=64)
states: 283,191,938 (8)
abstracting: (haveA<=101)
states: 285,083,711 (8)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 0.357sec

checking: EF [~ [[[[[10<=haveA2andB & haveA<=143] & ~ [[resB<=161 | [[[60<=haveB & haveA<=69] & [haveA2<=haveA | 187<=resA]] & haveA2<=2]]]] | ~ [[haveAandB<=179 & [[[28<=haveA2 | [resA<=144 & 100<=haveA]] & ~ [33<=haveA2]] & ~ [[~ [56<=haveA2] & haveA<=51]]]]]] & [[[[haveB<=Clients | resA<=25] & [~ [Clients<=resA] | ~ [[haveA<=22 | haveA2<=195]]]] | haveAandB<=127] & [haveB<=resA | ~ [[~ [[~ [haveA2<=44] | resA<=6]] & ~ [[[114<=haveB & haveA2andB<=haveB] & ~ [58<=haveA]]]]]]]]]]
normalized: E [true U ~ [[[[haveB<=resA | ~ [[~ [[~ [58<=haveA] & [114<=haveB & haveA2andB<=haveB]]] & ~ [[resA<=6 | ~ [haveA2<=44]]]]]] & [haveAandB<=127 | [[~ [[haveA<=22 | haveA2<=195]] | ~ [Clients<=resA]] & [haveB<=Clients | resA<=25]]]] & [~ [[haveAandB<=179 & [~ [[haveA<=51 & ~ [56<=haveA2]]] & [~ [33<=haveA2] & [28<=haveA2 | [resA<=144 & 100<=haveA]]]]]] | [~ [[resB<=161 | [haveA2<=2 & [[haveA2<=haveA | 187<=resA] & [60<=haveB & haveA<=69]]]]] & [10<=haveA2andB & haveA<=143]]]]]]

abstracting: (haveA<=143)
states: 285,083,711 (8)
abstracting: (10<=haveA2andB)
states: 170,772,056 (8)
abstracting: (haveA<=69)
states: 280,909,902 (8)
abstracting: (60<=haveB)
states: 44,056,065 (7)
abstracting: (187<=resA)
states: 0
abstracting: (haveA2<=haveA)
states: 144,863,681 (8)
abstracting: (haveA2<=2)
states: 27,042,949 (7)
abstracting: (resB<=161)
states: 285,083,711 (8)
abstracting: (100<=haveA)
states: 101
abstracting: (resA<=144)
states: 285,083,711 (8)
abstracting: (28<=haveA2)
states: 93,913,697 (7)
abstracting: (33<=haveA2)
states: 73,066,884 (7)
abstracting: (56<=haveA2)
states: 16,422,507 (7)
abstracting: (haveA<=51)
states: 262,667,730 (8)
abstracting: (haveAandB<=179)
states: 285,083,711 (8)
abstracting: (resA<=25)
states: 181,810,541 (8)
abstracting: (haveB<=Clients)
states: 246,817,441 (8)
abstracting: (Clients<=resA)
states: 20,301 (4)
abstracting: (haveA2<=195)
states: 285,083,711 (8)
abstracting: (haveA<=22)
states: 166,625,501 (8)
abstracting: (haveAandB<=127)
states: 285,083,711 (8)
abstracting: (haveA2<=44)
states: 248,673,687 (8)
abstracting: (resA<=6)
states: 60,562,079 (7)
abstracting: (haveA2andB<=haveB)
states: 204,329,206 (8)
abstracting: (114<=haveB)
states: 0
abstracting: (58<=haveA)
states: 13,903,319 (7)
abstracting: (haveB<=resA)
states: 96,560,646 (7)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m37.412sec

checking: AG [[[[[[~ [[74<=haveB & haveAandB<=resB]] | ~ [[28<=haveA | [resB<=haveA & resB<=resB]]]] | [[~ [125<=haveA] & [~ [[haveAandB<=4 & resA<=146]] | [[resA<=haveA2 & resB<=haveA] & [81<=haveA2 | 165<=haveB]]]] & [~ [Clients<=50] | [~ [haveA<=77] & haveA2<=haveA2]]]] | [[[134<=Clients | resA<=haveA] & haveA2andB<=80] & [~ [resB<=Clients] | haveB<=haveA2]]] | ~ [[[~ [39<=haveA2] | [[~ [[haveA2andB<=106 | 82<=resB]] & ~ [69<=resB]] | [140<=resB | ~ [[40<=haveAandB | resA<=haveB]]]]] & [[~ [[Clients<=resB | haveAandB<=14]] | 31<=resB] & [~ [haveB<=haveA2andB] & 42<=haveA2]]]]] | [haveA2andB<=163 | ~ [Clients<=haveA2andB]]]]
normalized: ~ [E [true U ~ [[[haveA2andB<=163 | ~ [Clients<=haveA2andB]] | [~ [[[[42<=haveA2 & ~ [haveB<=haveA2andB]] & [31<=resB | ~ [[Clients<=resB | haveAandB<=14]]]] & [[[140<=resB | ~ [[40<=haveAandB | resA<=haveB]]] | [~ [69<=resB] & ~ [[haveA2andB<=106 | 82<=resB]]]] | ~ [39<=haveA2]]]] | [[[haveB<=haveA2 | ~ [resB<=Clients]] & [haveA2andB<=80 & [134<=Clients | resA<=haveA]]] | [[[[haveA2<=haveA2 & ~ [haveA<=77]] | ~ [Clients<=50]] & [[[[81<=haveA2 | 165<=haveB] & [resA<=haveA2 & resB<=haveA]] | ~ [[haveAandB<=4 & resA<=146]]] & ~ [125<=haveA]]] | [~ [[28<=haveA | [resB<=haveA & resB<=resB]]] | ~ [[74<=haveB & haveAandB<=resB]]]]]]]]]]

abstracting: (haveAandB<=resB)
states: 204,329,206 (8)
abstracting: (74<=haveB)
states: 15,804,667 (7)
abstracting: (resB<=resB)
states: 285,083,711 (8)
abstracting: (resB<=haveA)
states: 96,560,545 (7)
abstracting: (28<=haveA)
states: 93,913,697 (7)
abstracting: (125<=haveA)
states: 0
abstracting: (resA<=146)
states: 285,083,711 (8)
abstracting: (haveAandB<=4)
states: 62,985,527 (7)
abstracting: (resB<=haveA)
states: 96,560,545 (7)
abstracting: (resA<=haveA2)
states: 144,863,631 (8)
abstracting: (165<=haveB)
states: 0
abstracting: (81<=haveA2)
states: 835,892 (5)
abstracting: (Clients<=50)
states: 24,010,171 (7)
abstracting: (haveA<=77)
states: 283,690,394 (8)
abstracting: (haveA2<=haveA2)
states: 285,083,711 (8)
abstracting: (resA<=haveA)
states: 144,863,631 (8)
abstracting: (134<=Clients)
states: 13,019,909 (7)
abstracting: (haveA2andB<=80)
states: 284,965,054 (8)
abstracting: (resB<=Clients)
states: 285,073,510 (8)
abstracting: (haveB<=haveA2)
states: 96,560,646 (7)
abstracting: (39<=haveA2)
states: 52,538,242 (7)
abstracting: (82<=resB)
states: 6,533,912 (6)
abstracting: (haveA2andB<=106)
states: 285,083,711 (8)
abstracting: (69<=resB)
states: 24,110,471 (7)
abstracting: (resA<=haveB)
states: 193,121,191 (8)
abstracting: (40<=haveAandB)
states: 24,144,288 (7)
abstracting: (140<=resB)
states: 0
abstracting: (haveAandB<=14)
states: 155,677,533 (8)
abstracting: (Clients<=resB)
states: 40,601 (4)
abstracting: (31<=resB)
states: 145,569,738 (8)
abstracting: (haveB<=haveA2andB)
states: 84,789,081 (7)
abstracting: (42<=haveA2)
states: 43,958,127 (7)
abstracting: (Clients<=haveA2andB)
states: 20,301 (4)
abstracting: (haveA2andB<=163)
states: 285,083,711 (8)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vN-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1679342560891

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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:2506 (417), effective:800 (133)

initing FirstDep: 0m 0.000sec


iterations count:261 (43), effective:153 (25)

iterations count:138 (23), effective:66 (11)

iterations count:314 (52), effective:110 (18)

iterations count:121 (20), effective:55 (9)

iterations count:221 (36), effective:104 (17)

iterations count:1329 (221), effective:547 (91)

iterations count:1023 (170), effective:364 (60)

iterations count:714 (119), effective:259 (43)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 454 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="TwoPhaseLocking-PT-nC00200vN"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is TwoPhaseLocking-PT-nC00200vN, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r490-tall-167912709200862"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00200vN.tgz
mv TwoPhaseLocking-PT-nC00200vN execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;