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.r522-tall-167987247200342.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 Murphy-PT-D2N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-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 12K Mar 31 16:48 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-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D2N050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680892789060

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=Murphy-PT-D2N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:39:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:39:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:39:50] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 18:39:50] [INFO ] Transformed 18 places.
[2023-04-07 18:39:50] [INFO ] Transformed 21 transitions.
[2023-04-07 18:39:50] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA Murphy-PT-D2N050-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10021 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 15) seen :7
FORMULA Murphy-PT-D2N050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N050-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N050-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D2N050-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:39:51] [INFO ] Computed 4 invariants in 5 ms
[2023-04-07 18:39:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:39:51] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:39:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:51] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:39:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:51] [INFO ] After 36ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:39:51] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 3 ms to minimize.
[2023-04-07 18:39:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 18:39:51] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 18:39:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:39:51] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-07 18:39:51] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 141 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 13 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:51] [INFO ] Invariant cache hit.
[2023-04-07 18:39:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 243538 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243538 steps, saw 156487 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 18:39:55] [INFO ] Invariant cache hit.
[2023-04-07 18:39:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:39:55] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:39:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:39:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:55] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:39:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:55] [INFO ] After 37ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:39:55] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-07 18:39:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 18:39:55] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-07 18:39:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:39:55] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-07 18:39:55] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 63 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:55] [INFO ] Invariant cache hit.
[2023-04-07 18:39:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 18:39:55] [INFO ] Invariant cache hit.
[2023-04-07 18:39:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 18:39:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:39:55] [INFO ] Invariant cache hit.
[2023-04-07 18:39:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 18:39:55] [INFO ] Invariant cache hit.
[2023-04-07 18:39:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:55] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:39:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:39:55] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:39:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:55] [INFO ] After 39ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:39:55] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 18:39:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-07 18:39:55] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2023-04-07 18:39:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 18:39:55] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-07 18:39:56] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:39:56] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-04-07 18:39:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
[2023-04-07 18:39:56] [INFO ] Flatten gal took : 20 ms
Total runtime 5699 ms.
There are residual formulas that ITS could not solve within timeout
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: Murphy_PT_D2N050
(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.767sec


RS generation: 0m 2.463sec


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



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

checking: EF [17<=p14]
normalized: E [true U 17<=p14]

abstracting: (17<=p14)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.057sec

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

abstracting: (p9<=34)
states: 41,538,421,296 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [23<=p10]
normalized: E [true U 23<=p10]

abstracting: (23<=p10)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p12<=46]
normalized: ~ [E [true U ~ [p12<=46]]]

abstracting: (p12<=46)
states: 41,538,421,296 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[[p2<=p13 & 16<=p16] & [29<=p13 & ~ [p5<=7]]]]
normalized: E [true U [[29<=p13 & ~ [p5<=7]] & [p2<=p13 & 16<=p16]]]

abstracting: (16<=p16)
states: 0
abstracting: (p2<=p13)
states: 2,571,946,128 (9)
abstracting: (p5<=7)
states: 9,616,292,784 (9)
abstracting: (29<=p13)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.028sec

checking: AG [[[~ [8<=p11] | [p11<=35 & ~ [32<=p13]]] | [[p5<=p9 & [17<=p14 & [p5<=0 | p11<=p13]]] | [[[[~ [30<=p4] & ~ [p2<=7]] | [~ [p10<=20] & ~ [p16<=24]]] & [p15<=p11 | p17<=p5]] | [~ [28<=p7] & [37<=p10 | [[12<=p2 & p3<=p12] | [~ [13<=p16] & [~ [p3<=15] & ~ [p9<=17]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[37<=p10 | [[[~ [p9<=17] & ~ [p3<=15]] & ~ [13<=p16]] | [12<=p2 & p3<=p12]]] & ~ [28<=p7]] | [[p15<=p11 | p17<=p5] & [[~ [p16<=24] & ~ [p10<=20]] | [~ [p2<=7] & ~ [30<=p4]]]]] | [p5<=p9 & [17<=p14 & [p5<=0 | p11<=p13]]]] | [[p11<=35 & ~ [32<=p13]] | ~ [8<=p11]]]]]]

abstracting: (8<=p11)
states: 0
abstracting: (32<=p13)
states: 0
abstracting: (p11<=35)
states: 41,538,421,296 (10)
abstracting: (p11<=p13)
states: 34,615,351,080 (10)
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (17<=p14)
states: 0
abstracting: (p5<=p9)
states: 1,947,140,532 (9)
abstracting: (30<=p4)
states: 14,271,347,232 (10)
abstracting: (p2<=7)
states: 9,613,897,776 (9)
abstracting: (p10<=20)
states: 41,538,421,296 (10)
abstracting: (p16<=24)
states: 41,538,421,296 (10)
abstracting: (p17<=p5)
states: 39,602,227,284 (10)
abstracting: (p15<=p11)
states: 13,846,140,432 (10)
abstracting: (28<=p7)
states: 15,443,011,584 (10)
abstracting: (p3<=p12)
states: 2,574,294,336 (9)
abstracting: (12<=p2)
states: 27,835,944,192 (10)
abstracting: (13<=p16)
states: 0
abstracting: (p3<=15)
states: 17,363,177,712 (10)
abstracting: (p9<=17)
states: 41,538,421,296 (10)
abstracting: (37<=p10)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.343sec

checking: AG [[[~ [p8<=p11] | [p4<=p1 | ~ [50<=p5]]] | [[p2<=p3 & p3<=p14] | [[p14<=32 & p0<=p6] | [[~ [p8<=33] & ~ [p8<=p3]] & [~ [p1<=23] & [[~ [p9<=28] | [~ [p7<=p11] | [[~ [p8<=27] | p14<=p3] & [[~ [32<=p15] | ~ [p2<=p16]] | [~ [24<=p12] | ~ [p3<=p1]]]]]] & [[~ [22<=p0] | ~ [p17<=45]] | [~ [28<=p9] | [p8<=p5 | 19<=p3]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p8<=p5 | 19<=p3] | ~ [28<=p9]] | [~ [p17<=45] | ~ [22<=p0]]] & [[[[[~ [p3<=p1] | ~ [24<=p12]] | [~ [p2<=p16] | ~ [32<=p15]]] & [p14<=p3 | ~ [p8<=27]]] | ~ [p7<=p11]] | ~ [p9<=28]]] & ~ [p1<=23]] & [~ [p8<=p3] & ~ [p8<=33]]] | [p14<=32 & p0<=p6]] | [p2<=p3 & p3<=p14]] | [[p4<=p1 | ~ [50<=p5]] | ~ [p8<=p11]]]]]]

abstracting: (p8<=p11)
states: 1,944,897,588 (9)
abstracting: (50<=p5)
states: 6,010,065,216 (9)
abstracting: (p4<=p1)
states: 20,770,490,016 (10)
abstracting: (p3<=p14)
states: 2,574,294,336 (9)
abstracting: (p2<=p3)
states: 21,100,781,880 (10)
abstracting: (p0<=p6)
states: 41,538,421,296 (10)
abstracting: (p14<=32)
states: 41,538,421,296 (10)
abstracting: (p8<=33)
states: 29,392,573,680 (10)
abstracting: (p8<=p3)
states: 21,100,781,880 (10)
abstracting: (p1<=23)
states: 23,525,528,112 (10)
abstracting: (p9<=28)
states: 41,538,421,296 (10)
abstracting: (p7<=p11)
states: 1,944,897,588 (9)
abstracting: (p8<=27)
states: 26,095,409,712 (10)
abstracting: (p14<=p3)
states: 40,240,327,608 (10)
abstracting: (32<=p15)
states: 0
abstracting: (p2<=p16)
states: 3,198,994,668 (9)
abstracting: (24<=p12)
states: 0
abstracting: (p3<=p1)
states: 21,103,405,416 (10)
abstracting: (22<=p0)
states: 19,420,150,464 (10)
abstracting: (p17<=45)
states: 41,538,421,296 (10)
abstracting: (28<=p9)
states: 0
abstracting: (19<=p3)
states: 21,704,136,408 (10)
abstracting: (p8<=p5)
states: 20,767,931,280 (10)
-> the formula is TRUE

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

MC time: 0m 1.586sec

checking: AG [[[[p6<=p1 | ~ [p2<=p15]] | [~ [1<=p5] | [~ [p4<=p11] | ~ [p2<=12]]]] | [[~ [50<=p15] | [p12<=8 & [p14<=19 & [p17<=p10 | 17<=p17]]]] | [[~ [p16<=29] & ~ [p14<=2]] | [[p14<=p10 & [p13<=19 | [p1<=p7 | [p7<=20 & 27<=p15]]]] | [[[~ [p0<=p10] & ~ [p14<=p3]] & [~ [p3<=0] & [p11<=p5 & p4<=p0]]] & [[~ [41<=p16] & ~ [29<=p11]] & [[[p5<=p0 | p0<=p6] | [p13<=10 | [p12<=26 | p7<=8]]] & [[[p5<=p16 & [p17<=p15 & [19<=p15 | p9<=50]]] | [~ [p6<=p8] & [~ [p4<=p9] | ~ [p13<=p6]]]] & [[~ [p16<=p10] | [p4<=p7 & p1<=p13]] | [[~ [p10<=14] & ~ [31<=p7]] | [~ [p7<=p13] & ~ [p11<=31]]]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[[[~ [p11<=31] & ~ [p7<=p13]] | [~ [31<=p7] & ~ [p10<=14]]] | [[p4<=p7 & p1<=p13] | ~ [p16<=p10]]] & [[[~ [p13<=p6] | ~ [p4<=p9]] & ~ [p6<=p8]] | [p5<=p16 & [p17<=p15 & [19<=p15 | p9<=50]]]]] & [[p13<=10 | [p12<=26 | p7<=8]] | [p5<=p0 | p0<=p6]]] & [~ [29<=p11] & ~ [41<=p16]]] & [[[p11<=p5 & p4<=p0] & ~ [p3<=0]] & [~ [p14<=p3] & ~ [p0<=p10]]]] | [p14<=p10 & [p13<=19 | [p1<=p7 | [p7<=20 & 27<=p15]]]]] | [~ [p14<=2] & ~ [p16<=29]]] | [[p12<=8 & [p14<=19 & [p17<=p10 | 17<=p17]]] | ~ [50<=p15]]] | [[[~ [p2<=12] | ~ [p4<=p11]] | ~ [1<=p5]] | [p6<=p1 | ~ [p2<=p15]]]]]]]

abstracting: (p2<=p15)
states: 3,198,994,668 (9)
abstracting: (p6<=p1)
states: 21,101,462,280 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (p4<=p11)
states: 1,947,140,532 (9)
abstracting: (p2<=12)
states: 14,642,880,624 (10)
abstracting: (50<=p15)
states: 0
abstracting: (17<=p17)
states: 0
abstracting: (p17<=p10)
states: 13,846,140,432 (10)
abstracting: (p14<=19)
states: 41,538,421,296 (10)
abstracting: (p12<=8)
states: 41,538,421,296 (10)
abstracting: (p16<=29)
states: 41,538,421,296 (10)
abstracting: (p14<=2)
states: 41,538,421,296 (10)
abstracting: (27<=p15)
states: 0
abstracting: (p7<=20)
states: 21,371,341,968 (10)
abstracting: (p1<=p7)
states: 41,538,421,296 (10)
abstracting: (p13<=19)
states: 41,538,421,296 (10)
abstracting: (p14<=p10)
states: 20,769,210,648 (10)
abstracting: (p0<=p10)
states: 1,944,897,588 (9)
abstracting: (p14<=p3)
states: 40,240,327,608 (10)
abstracting: (p3<=0)
states: 1,298,093,688 (9)
abstracting: (p4<=p0)
states: 21,103,405,416 (10)
abstracting: (p11<=p5)
states: 40,889,374,452 (10)
abstracting: (41<=p16)
states: 0
abstracting: (29<=p11)
states: 0
abstracting: (p0<=p6)
states: 41,538,421,296 (10)
abstracting: (p5<=p0)
states: 21,103,405,416 (10)
abstracting: (p7<=8)
states: 10,664,046,576 (10)
abstracting: (p12<=26)
states: 41,538,421,296 (10)
abstracting: (p13<=10)
states: 41,538,421,296 (10)
abstracting: (p9<=50)
states: 41,538,421,296 (10)
abstracting: (19<=p15)
states: 0
abstracting: (p17<=p15)
states: 26,538,435,828 (10)
abstracting: (p5<=p16)
states: 3,201,442,596 (9)
abstracting: (p6<=p8)
states: 21,101,462,280 (10)
abstracting: (p4<=p9)
states: 1,947,140,532 (9)
abstracting: (p13<=p6)
states: 40,241,822,904 (10)
abstracting: (p16<=p10)
states: 13,846,140,432 (10)
abstracting: (p1<=p13)
states: 2,571,946,128 (9)
abstracting: (p4<=p7)
states: 20,770,490,016 (10)
abstracting: (p10<=14)
states: 41,538,421,296 (10)
abstracting: (31<=p7)
states: 13,724,121,600 (10)
abstracting: (p7<=p13)
states: 2,571,946,128 (9)
abstracting: (p11<=31)
states: 41,538,421,296 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.209sec

totally nodes used: 1956800 (2.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 27284840 1335000 28619840
used/not used/entry size/cache size: 1517340 65591524 16 1024MB
basic ops cache: hits/miss/sum: 20479693 6944409 27424102
used/not used/entry size/cache size: 7921122 8856094 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: 2736320 719944 3456264
used/not used/entry size/cache size: 690548 7698060 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 65447747
1 1491082
2 148966
3 12785
4 4494
5 1538
6 305
7 686
8 619
9 68
>= 10 574

Total processing time: 0m14.316sec


BK_STOP 1680892811504

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:7459 (355), effective:1786 (85)

initing FirstDep: 0m 0.000sec

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="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 Murphy-PT-D2N050, 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 r522-tall-167987247200342"
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 [ "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 ;