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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 19K 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-D4N025-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680893435019

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-D4N025
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:50:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:50:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:50:36] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-04-07 18:50:36] [INFO ] Transformed 30 places.
[2023-04-07 18:50:36] [INFO ] Transformed 35 transitions.
[2023-04-07 18:50:36] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10022 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 14) seen :6
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N025-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) 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 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:50:37] [INFO ] Computed 6 invariants in 6 ms
[2023-04-07 18:50:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:37] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:50:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:50:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:37] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:37] [INFO ] After 69ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:37] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-04-07 18:50:37] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 88 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 13 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:37] [INFO ] Invariant cache hit.
[2023-04-07 18:50:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 28 ms. (steps per millisecond=357 ) 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
Interrupted probabilistic random walk after 218316 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218316 steps, saw 149704 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 18:50:41] [INFO ] Invariant cache hit.
[2023-04-07 18:50:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:41] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 18:50:41] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:50:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:50:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:41] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:41] [INFO ] After 68ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:41] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 3 ms to minimize.
[2023-04-07 18:50:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-07 18:50:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
[2023-04-07 18:50:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 18:50:41] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 18:50:41] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 104 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:41] [INFO ] Invariant cache hit.
[2023-04-07 18:50:41] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 18:50:41] [INFO ] Invariant cache hit.
[2023-04-07 18:50:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:41] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 18:50:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:50:41] [INFO ] Invariant cache hit.
[2023-04-07 18:50:41] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 18:50:41] [INFO ] Invariant cache hit.
[2023-04-07 18:50:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:41] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:41] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:42] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:42] [INFO ] After 51ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:42] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-07 18:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 18:50:42] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-07 18:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-07 18:50:42] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-07 18:50:42] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:42] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-04-07 18:50:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 0 ms.
[2023-04-07 18:50:42] [INFO ] Flatten gal took : 19 ms
Total runtime 5990 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_D4N025
(NrP: 30 NrTr: 35 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 2.801sec


RS generation: 0m 9.636sec


-> reachability set: #nodes 25113 (2.5e+04) #states 20,012,606,308,670,976 (16)



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

checking: EF [20<=p21]
normalized: E [true U 20<=p21]

abstracting: (20<=p21)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [9<=p18]
normalized: E [true U 9<=p18]

abstracting: (9<=p18)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[~ [p1<=7] | [~ [22<=p25] | ~ [14<=p18]]]]
normalized: ~ [E [true U ~ [[[~ [14<=p18] | ~ [22<=p25]] | ~ [p1<=7]]]]]

abstracting: (p1<=7)
states: 8,458,955,548,932,096 (15)
abstracting: (22<=p25)
states: 0
abstracting: (14<=p18)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.025sec

checking: EF [[4<=p17 & [~ [p8<=p2] & ~ [p17<=p7]]]]
normalized: E [true U [4<=p17 & [~ [p17<=p7] & ~ [p8<=p2]]]]

abstracting: (p8<=p2)
states: 10,340,302,342,076,928 (16)
abstracting: (p17<=p7)
states: 19,346,687,147,563,776 (16)
abstracting: (4<=p17)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.392sec

checking: AG [[[19<=p18 | [p9<=p8 | ~ [24<=p22]]] | [p9<=4 | [[~ [p4<=p13] & [[p12<=11 | [~ [p18<=4] & [[~ [p7<=p2] | [~ [p10<=p0] | [~ [3<=p27] & ~ [p11<=p29]]]] & [~ [p7<=21] | [p27<=10 | p19<=15]]]]] & [[~ [p25<=12] | ~ [2<=p16]] | [17<=p6 | 10<=p21]]]] | [[p19<=11 | 24<=p27] & [p4<=11 | 24<=p1]]]]]]
normalized: ~ [E [true U ~ [[[p9<=4 | [[[p4<=11 | 24<=p1] & [p19<=11 | 24<=p27]] | [[[[17<=p6 | 10<=p21] | [~ [2<=p16] | ~ [p25<=12]]] & [p12<=11 | [[[[p27<=10 | p19<=15] | ~ [p7<=21]] & [[[~ [p11<=p29] & ~ [3<=p27]] | ~ [p10<=p0]] | ~ [p7<=p2]]] & ~ [p18<=4]]]] & ~ [p4<=p13]]]] | [19<=p18 | [p9<=p8 | ~ [24<=p22]]]]]]]

abstracting: (24<=p22)
states: 0
abstracting: (p9<=p8)
states: 10,340,284,138,398,720 (16)
abstracting: (19<=p18)
states: 0
abstracting: (p4<=p13)
states: 10,340,271,134,189,568 (16)
abstracting: (p18<=4)
states: 20,012,606,308,670,976 (16)
abstracting: (p7<=p2)
states: 10,672,240,907,547,648 (16)
abstracting: (p10<=p0)
states: 20,012,606,308,670,976 (16)
abstracting: (3<=p27)
states: 3,335,434,384,778,496 (15)
abstracting: (p11<=p29)
states: 3,082,313,037,652,992 (15)
abstracting: (p7<=21)
states: 15,970,451,557,553,856 (16)
abstracting: (p19<=15)
states: 20,012,606,308,670,976 (16)
abstracting: (p27<=10)
states: 20,012,606,308,670,976 (16)
abstracting: (p12<=11)
states: 11,348,213,794,613,856 (16)
abstracting: (p25<=12)
states: 20,012,606,308,670,976 (16)
abstracting: (2<=p16)
states: 0
abstracting: (10<=p21)
states: 0
abstracting: (17<=p6)
states: 5,950,535,723,543,808 (15)
abstracting: (24<=p27)
states: 0
abstracting: (p19<=11)
states: 20,012,606,308,670,976 (16)
abstracting: (24<=p1)
states: 3,442,624,780,668,480 (15)
abstracting: (p4<=11)
states: 11,348,213,794,613,856 (16)
abstracting: (p9<=4)
states: 5,790,049,604,845,056 (15)
-> the formula is TRUE

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

MC time: 0m 1.426sec

checking: AG [[[~ [9<=p25] | [[1<=p10 & [p9<=p27 | [p0<=13 & [~ [25<=p12] & ~ [12<=p21]]]]] & [[~ [1<=p23] | [~ [20<=p8] & ~ [p1<=23]]] & [~ [16<=p7] | ~ [p5<=23]]]]] | [[~ [p27<=p22] & [~ [4<=p10] & ~ [p29<=p11]]] | [1<=p12 & [[~ [p28<=2] | [p21<=18 & [~ [p16<=p14] & ~ [p9<=19]]]] & [~ [p22<=p10] | [p17<=15 & [24<=p15 & [~ [p1<=20] | ~ [p18<=p26]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[1<=p12 & [[[p17<=15 & [24<=p15 & [~ [p18<=p26] | ~ [p1<=20]]]] | ~ [p22<=p10]] & [[p21<=18 & [~ [p9<=19] & ~ [p16<=p14]]] | ~ [p28<=2]]]] | [[~ [p29<=p11] & ~ [4<=p10]] & ~ [p27<=p22]]] | [[[[~ [p5<=23] | ~ [16<=p7]] & [[~ [p1<=23] & ~ [20<=p8]] | ~ [1<=p23]]] & [1<=p10 & [p9<=p27 | [p0<=13 & [~ [12<=p21] & ~ [25<=p12]]]]]] | ~ [9<=p25]]]]]]

abstracting: (9<=p25)
states: 0
abstracting: (25<=p12)
states: 3,164,214,896,422,272 (15)
abstracting: (12<=p21)
states: 0
abstracting: (p0<=13)
states: 12,535,774,339,356,576 (16)
abstracting: (p9<=p27)
states: 3,082,348,425,192,192 (15)
abstracting: (1<=p10)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (20<=p8)
states: 4,732,794,534,042,432 (15)
abstracting: (p1<=23)
states: 16,569,981,528,002,496 (16)
abstracting: (16<=p7)
states: 6,436,212,726,318,624 (15)
abstracting: (p5<=23)
states: 16,569,999,695,848,896 (16)
abstracting: (p27<=p22)
states: 10,006,303,154,335,488 (16)
abstracting: (4<=p10)
states: 15,269,703,720,860,160 (16)
abstracting: (p29<=p11)
states: 18,114,774,041,624,832 (16)
abstracting: (p28<=2)
states: 16,677,171,923,892,480 (16)
abstracting: (p16<=p14)
states: 19,346,702,759,594,496 (16)
abstracting: (p9<=19)
states: 15,279,811,774,628,544 (16)
abstracting: (p21<=18)
states: 20,012,606,308,670,976 (16)
abstracting: (p22<=p10)
states: 18,730,738,897,288,704 (16)
abstracting: (p1<=20)
states: 15,649,292,432,721,024 (16)
abstracting: (p18<=p26)
states: 18,344,889,116,281,728 (16)
abstracting: (24<=p15)
states: 0
abstracting: (p17<=15)
states: 20,012,606,308,670,976 (16)
abstracting: (1<=p12)
states: 18,680,799,210,518,016 (16)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.901sec

checking: EF [[[[[~ [p15<=19] | ~ [1<=p23]] | [[[~ [p14<=p22] & [~ [4<=p16] & ~ [p3<=15]]] & [~ [p20<=p29] & [12<=p13 & p22<=p4]]] | [p4<=8 & p18<=p6]]] & [~ [p20<=16] | [p19<=p21 & ~ [p18<=16]]]] & [[[p14<=p18 | [p27<=p3 | 15<=p2]] | [~ [p5<=p9] | [~ [p10<=25] | [~ [p26<=p17] & [~ [p22<=p9] & ~ [20<=p12]]]]]] & [~ [p18<=p13] | [~ [14<=p23] & [~ [p28<=4] & ~ [p8<=15]]]]]]]
normalized: E [true U [[[[~ [p5<=p9] | [[[~ [20<=p12] & ~ [p22<=p9]] & ~ [p26<=p17]] | ~ [p10<=25]]] | [p14<=p18 | [p27<=p3 | 15<=p2]]] & [[~ [14<=p23] & [~ [p28<=4] & ~ [p8<=15]]] | ~ [p18<=p13]]] & [[[p19<=p21 & ~ [p18<=16]] | ~ [p20<=16]] & [[[p4<=8 & p18<=p6] | [[[12<=p13 & p22<=p4] & ~ [p20<=p29]] & [[~ [p3<=15] & ~ [4<=p16]] & ~ [p14<=p22]]]] | [~ [1<=p23] | ~ [p15<=19]]]]]]

abstracting: (p15<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (p14<=p22)
states: 2,513,797,122,710,016 (15)
abstracting: (4<=p16)
states: 0
abstracting: (p3<=15)
states: 13,576,369,553,999,136 (16)
abstracting: (p20<=p29)
states: 15,565,360,462,299,648 (16)
abstracting: (p22<=p4)
states: 18,730,738,897,288,704 (16)
abstracting: (12<=p13)
states: 8,664,392,514,057,120 (15)
abstracting: (p18<=p6)
states: 19,346,687,147,563,776 (16)
abstracting: (p4<=8)
states: 9,276,099,091,683,840 (15)
abstracting: (p20<=16)
states: 20,012,606,308,670,976 (16)
abstracting: (p18<=16)
states: 20,012,606,308,670,976 (16)
abstracting: (p19<=p21)
states: 16,677,171,923,892,480 (16)
abstracting: (p18<=p13)
states: 19,346,702,759,594,496 (16)
abstracting: (p8<=15)
states: 13,576,393,582,352,352 (16)
abstracting: (p28<=4)
states: 20,012,606,308,670,976 (16)
abstracting: (14<=p23)
states: 0
abstracting: (15<=p2)
states: 6,921,915,086,116,224 (15)
abstracting: (p27<=p3)
states: 18,114,774,041,624,832 (16)
abstracting: (p14<=p18)
states: 1,922,801,117,073,408 (15)
abstracting: (p10<=25)
states: 17,089,131,942,121,536 (16)
abstracting: (p26<=p17)
states: 6,670,868,769,556,992 (15)
abstracting: (p22<=p9)
states: 18,730,716,094,531,584 (16)
abstracting: (20<=p12)
states: 4,732,815,478,822,848 (15)
abstracting: (p5<=p9)
states: 10,340,284,138,398,720 (16)
-> the formula is FALSE

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

MC time: 0m 1.725sec

checking: EF [[[[[~ [p0<=p5] & p9<=p28] & [~ [p4<=2] & ~ [p27<=21]]] & [[p10<=5 & 14<=p25] & [18<=p4 & 24<=p20]]] & [[[25<=p25 & ~ [9<=p12]] & [[1<=p2 | [p8<=p23 | p16<=p5]] & [~ [p12<=p10] | [p13<=18 & ~ [p22<=p25]]]]] & [[[[~ [9<=p15] & ~ [7<=p17]] | [~ [p13<=p26] & ~ [p20<=24]]] & [~ [p15<=23] | [p18<=p9 | [[~ [12<=p23] & ~ [p22<=19]] & [~ [14<=p16] & [~ [p15<=p0] | ~ [p15<=6]]]]]]] & [[[p25<=p6 & [p12<=p13 & p10<=18]] | [[p2<=13 & ~ [p25<=11]] & [~ [p18<=p24] & [[~ [8<=p29] | ~ [14<=p5]] & [~ [p7<=p1] | ~ [p25<=p15]]]]]] & [[p19<=20 | ~ [p2<=p9]] & [p16<=16 | p0<=3]]]]]]]
normalized: E [true U [[[[[[p16<=16 | p0<=3] & [p19<=20 | ~ [p2<=p9]]] & [[[[[~ [p25<=p15] | ~ [p7<=p1]] & [~ [14<=p5] | ~ [8<=p29]]] & ~ [p18<=p24]] & [p2<=13 & ~ [p25<=11]]] | [p25<=p6 & [p12<=p13 & p10<=18]]]] & [[[p18<=p9 | [[[~ [p15<=6] | ~ [p15<=p0]] & ~ [14<=p16]] & [~ [p22<=19] & ~ [12<=p23]]]] | ~ [p15<=23]] & [[~ [p20<=24] & ~ [p13<=p26]] | [~ [7<=p17] & ~ [9<=p15]]]]] & [[[[p13<=18 & ~ [p22<=p25]] | ~ [p12<=p10]] & [1<=p2 | [p8<=p23 | p16<=p5]]] & [25<=p25 & ~ [9<=p12]]]] & [[[18<=p4 & 24<=p20] & [p10<=5 & 14<=p25]] & [[~ [p27<=21] & ~ [p4<=2]] & [p9<=p28 & ~ [p0<=p5]]]]]]

abstracting: (p0<=p5)
states: 10,672,203,723,337,728 (16)
abstracting: (p9<=p28)
states: 3,082,348,425,192,192 (15)
abstracting: (p4<=2)
states: 3,695,789,133,983,232 (15)
abstracting: (p27<=21)
states: 20,012,606,308,670,976 (16)
abstracting: (14<=p25)
states: 0
abstracting: (p10<=5)
states: 6,715,914,023,909,376 (15)
abstracting: (24<=p20)
states: 0
abstracting: (18<=p4)
states: 5,526,437,752,461,600 (15)
abstracting: (9<=p12)
states: 10,736,507,216,987,136 (16)
abstracting: (25<=p25)
states: 0
abstracting: (p16<=p5)
states: 19,346,687,147,563,776 (16)
abstracting: (p8<=p23)
states: 2,513,831,824,198,656 (15)
abstracting: (1<=p2)
states: 18,680,799,210,518,016 (16)
abstracting: (p12<=p10)
states: 10,340,271,134,189,568 (16)
abstracting: (p22<=p25)
states: 15,565,360,462,299,648 (16)
abstracting: (p13<=18)
states: 14,910,289,226,975,232 (16)
abstracting: (9<=p15)
states: 0
abstracting: (7<=p17)
states: 0
abstracting: (p13<=p26)
states: 3,082,313,037,652,992 (15)
abstracting: (p20<=24)
states: 20,012,606,308,670,976 (16)
abstracting: (p15<=23)
states: 20,012,606,308,670,976 (16)
abstracting: (12<=p23)
states: 0
abstracting: (p22<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (14<=p16)
states: 0
abstracting: (p15<=p0)
states: 19,346,702,759,594,496 (16)
abstracting: (p15<=6)
states: 20,012,606,308,670,976 (16)
abstracting: (p18<=p9)
states: 19,346,687,147,563,776 (16)
abstracting: (p10<=18)
states: 14,910,289,226,975,232 (16)
abstracting: (p12<=p13)
states: 10,340,271,134,189,568 (16)
abstracting: (p25<=p6)
states: 18,114,745,289,501,952 (16)
abstracting: (p25<=11)
states: 20,012,606,308,670,976 (16)
abstracting: (p2<=13)
states: 12,535,774,339,356,576 (16)
abstracting: (p18<=p24)
states: 16,677,171,923,892,480 (16)
abstracting: (8<=p29)
states: 0
abstracting: (14<=p5)
states: 7,476,806,277,410,400 (15)
abstracting: (p7<=p1)
states: 10,340,302,342,076,928 (16)
abstracting: (p25<=p15)
states: 6,670,868,769,556,992 (15)
abstracting: (p2<=p9)
states: 10,340,264,818,211,328 (16)
abstracting: (p19<=20)
states: 20,012,606,308,670,976 (16)
abstracting: (p0<=3)
states: 4,742,902,587,810,816 (15)
abstracting: (p16<=16)
states: 20,012,606,308,670,976 (16)
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.908sec

totally nodes used: 4775198 (4.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 94736176 9246195 103982371
used/not used/entry size/cache size: 9416028 57692836 16 1024MB
basic ops cache: hits/miss/sum: 29623420 11027865 40651285
used/not used/entry size/cache size: 10974633 5802583 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: 5525102 1520665 7045767
used/not used/entry size/cache size: 1390919 6997689 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 62911721
1 3791279
2 373055
3 20307
4 2383
5 1131
6 3031
7 1429
8 2605
9 403
>= 10 1520

Total processing time: 0m25.282sec


BK_STOP 1680893468654

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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.001sec


iterations count:23162 (661), effective:4563 (130)

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-D4N025"
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-D4N025, 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-167987247300366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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