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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K 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 16K 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:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 15K 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-D3N050-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680893248629

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-D3N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:47:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:47:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:47:30] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 18:47:30] [INFO ] Transformed 24 places.
[2023-04-07 18:47:30] [INFO ] Transformed 28 transitions.
[2023-04-07 18:47:30] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10039 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=82 ) properties (out of 16) seen :8
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) 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 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 51 ms. (steps per millisecond=196 ) 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 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 18:47:30] [INFO ] Computed 5 invariants in 3 ms
[2023-04-07 18:47:31] [INFO ] After 756ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:47:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:47:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 18:47:31] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:47:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:47:31] [INFO ] After 51ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:47:31] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-04-07 18:47:31] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 120 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:47:32] [INFO ] Invariant cache hit.
[2023-04-07 18:47:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10014 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 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 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
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 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 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 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 316559 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316559 steps, saw 215525 distinct states, run finished after 3002 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 18:47:35] [INFO ] Invariant cache hit.
[2023-04-07 18:47:35] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:47:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:47:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:47:35] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:47:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:47:35] [INFO ] After 57ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:47:35] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 18:47:35] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 56 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:47:35] [INFO ] Invariant cache hit.
[2023-04-07 18:47:35] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 18:47:35] [INFO ] Invariant cache hit.
[2023-04-07 18:47:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:47:35] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 18:47:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:47:35] [INFO ] Invariant cache hit.
[2023-04-07 18:47:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 18:47:35] [INFO ] Invariant cache hit.
[2023-04-07 18:47:36] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:47:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:47:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:47:36] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:47:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:47:36] [INFO ] After 44ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:47:36] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 18:47:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
[2023-04-07 18:47:36] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-07 18:47:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 72 ms
[2023-04-07 18:47:36] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-07 18:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:47:36] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 18:47:36] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:47:36] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-04-07 18:47:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 1 ms.
[2023-04-07 18:47:36] [INFO ] Flatten gal took : 19 ms
Total runtime 6631 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_D3N050
(NrP: 24 NrTr: 28 NrArc: 108)

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

net check time: 0m 0.000sec

init dd package: 0m 2.670sec


RS generation: 0m15.439sec


-> reachability set: #nodes 39729 (4.0e+04) #states 540,710,084,330,928 (14)



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

checking: AG [p21<=49]
normalized: ~ [E [true U ~ [p21<=49]]]

abstracting: (p21<=49)
states: 540,710,084,330,928 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: EF [28<=p12]
normalized: E [true U 28<=p12]

abstracting: (28<=p12)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AG [[~ [37<=p19] | p16<=49]]
normalized: ~ [E [true U ~ [[p16<=49 | ~ [37<=p19]]]]]

abstracting: (37<=p19)
states: 0
abstracting: (p16<=49)
states: 540,710,084,330,928 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: EF [[[~ [p2<=p14] & 34<=p5] & [p16<=p23 & ~ [p21<=47]]]]
normalized: E [true U [[p16<=p23 & ~ [p21<=47]] & [34<=p5 & ~ [p2<=p14]]]]

abstracting: (p2<=p14)
states: 26,529,097,516,344 (13)
abstracting: (34<=p5)
states: 154,925,710,077,456 (14)
abstracting: (p21<=47)
states: 540,710,084,330,928 (14)
abstracting: (p16<=p23)
states: 420,552,287,812,944 (14)
-> the formula is FALSE

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

MC time: 0m 0.121sec

checking: AG [[p5<=49 | [p7<=10 | [[~ [p10<=p8] | p12<=37] & [[~ [p1<=p11] | [~ [32<=p19] | p9<=p7]] | [~ [5<=p8] | [[~ [p15<=21] & ~ [47<=p2]] | [p11<=11 & [p6<=18 & 27<=p19]]]]]]]]]
normalized: ~ [E [true U ~ [[p5<=49 | [p7<=10 | [[[[[p11<=11 & [p6<=18 & 27<=p19]] | [~ [47<=p2] & ~ [p15<=21]]] | ~ [5<=p8]] | [[p9<=p7 | ~ [32<=p19]] | ~ [p1<=p11]]] & [p12<=37 | ~ [p10<=p8]]]]]]]]

abstracting: (p10<=p8)
states: 274,904,556,829,488 (14)
abstracting: (p12<=37)
states: 540,710,084,330,928 (14)
abstracting: (p1<=p11)
states: 274,904,556,829,488 (14)
abstracting: (32<=p19)
states: 0
abstracting: (p9<=p7)
states: 274,904,294,267,664 (14)
abstracting: (5<=p8)
states: 456,234,154,421,760 (14)
abstracting: (p15<=21)
states: 540,710,084,330,928 (14)
abstracting: (47<=p2)
states: 90,007,556,700,672 (13)
abstracting: (27<=p19)
states: 0
abstracting: (p6<=18)
states: 264,086,011,250,064 (14)
abstracting: (p11<=11)
states: 184,058,905,015,728 (14)
abstracting: (p7<=10)
states: 170,920,195,519,248 (14)
abstracting: (p5<=49)
states: 461,877,405,725,664 (14)
-> the formula is TRUE

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

MC time: 0m 5.917sec

checking: EF [[[[~ [34<=p13] & 28<=p8] & [43<=p9 & ~ [20<=p2]]] & [[p18<=p0 & 12<=p22] & [[p7<=47 | [[~ [p7<=p21] & ~ [p17<=41]] & [[~ [43<=p23] | [[~ [12<=p12] | ~ [36<=p13]] & [~ [p1<=4] | ~ [p10<=27]]]] & [[~ [13<=p8] | [~ [28<=p14] | ~ [37<=p7]]] & [p20<=33 | [[~ [37<=p20] & ~ [33<=p12]] | [p20<=p17 & p9<=p20]]]]]]] & [[p18<=12 | [p18<=p1 | p9<=p14]] & [[[27<=p12 & [~ [p20<=p0] & ~ [32<=p1]]] & [8<=p18 & [[p17<=p9 | p18<=p21] & [16<=p11 | p4<=p5]]]] | [p9<=p16 & p21<=7]]]]]]]
normalized: E [true U [[[[[[p9<=p16 & p21<=7] | [[8<=p18 & [[16<=p11 | p4<=p5] & [p17<=p9 | p18<=p21]]] & [27<=p12 & [~ [32<=p1] & ~ [p20<=p0]]]]] & [p18<=12 | [p18<=p1 | p9<=p14]]] & [p7<=47 | [[[[p20<=33 | [[p20<=p17 & p9<=p20] | [~ [33<=p12] & ~ [37<=p20]]]] & [[~ [37<=p7] | ~ [28<=p14]] | ~ [13<=p8]]] & [[[~ [p10<=27] | ~ [p1<=4]] & [~ [36<=p13] | ~ [12<=p12]]] | ~ [43<=p23]]] & [~ [p17<=41] & ~ [p7<=p21]]]]] & [p18<=p0 & 12<=p22]] & [[43<=p9 & ~ [20<=p2]] & [28<=p8 & ~ [34<=p13]]]]]

abstracting: (34<=p13)
states: 0
abstracting: (28<=p8)
states: 196,445,034,998,784 (14)
abstracting: (20<=p2)
states: 266,379,648,897,024 (14)
abstracting: (43<=p9)
states: 106,884,211,737,600 (14)
abstracting: (12<=p22)
states: 0
abstracting: (p18<=p0)
states: 523,024,019,320,032 (14)
abstracting: (p7<=p21)
states: 43,549,551,170,928 (13)
abstracting: (p17<=41)
states: 540,710,084,330,928 (14)
abstracting: (43<=p23)
states: 0
abstracting: (12<=p12)
states: 0
abstracting: (36<=p13)
states: 0
abstracting: (p1<=4)
states: 84,475,929,909,168 (13)
abstracting: (p10<=27)
states: 344,265,049,332,144 (14)
abstracting: (13<=p8)
states: 344,291,980,032,000 (14)
abstracting: (28<=p14)
states: 0
abstracting: (37<=p7)
states: 137,257,162,142,112 (14)
abstracting: (37<=p20)
states: 0
abstracting: (33<=p12)
states: 0
abstracting: (p9<=p20)
states: 43,548,395,836,392 (13)
abstracting: (p20<=p17)
states: 270,355,042,165,464 (14)
abstracting: (p20<=33)
states: 540,710,084,330,928 (14)
abstracting: (p7<=47)
states: 454,616,471,360,016 (14)
abstracting: (p9<=p14)
states: 26,529,097,516,344 (13)
abstracting: (p18<=p1)
states: 523,024,019,320,032 (14)
abstracting: (p18<=12)
states: 540,710,084,330,928 (14)
abstracting: (p20<=p0)
states: 514,347,678,487,296 (14)
abstracting: (32<=p1)
states: 167,836,980,579,840 (14)
abstracting: (27<=p12)
states: 0
abstracting: (p18<=p21)
states: 420,552,287,812,944 (14)
abstracting: (p17<=p9)
states: 523,024,019,320,032 (14)
abstracting: (p4<=p5)
states: 274,904,921,876,400 (14)
abstracting: (16<=p11)
states: 308,697,486,096,384 (14)
abstracting: (8<=p18)
states: 0
abstracting: (p21<=7)
states: 540,710,084,330,928 (14)
abstracting: (p9<=p16)
states: 35,038,746,676,368 (13)
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.087sec

checking: AG [[p2<=p4 | [[[33<=p4 | [[[p0<=p18 | [~ [43<=p10] & ~ [7<=p23]]] & [~ [p1<=p9] | [~ [p5<=29] & ~ [12<=p19]]]] | [[[~ [6<=p18] | [p19<=p20 | p4<=p23]] | [[21<=p18 | 49<=p2] | [[p9<=p20 & 23<=p9] | [p16<=32 & [~ [p14<=17] | ~ [p13<=p12]]]]]] & [[~ [43<=p2] | ~ [35<=p21]] | [~ [p3<=p15] | [[p12<=45 & p18<=p8] & [41<=p16 & [p9<=45 & [~ [15<=p20] | [11<=p9 | p22<=p0]]]]]]]]]] & [[18<=p0 | p22<=10] | [~ [21<=p1] | [~ [p1<=3] | [~ [p5<=p18] & [21<=p12 | [p6<=p9 & [p3<=p19 & [p8<=42 | p4<=p8]]]]]]]]] | [[[p3<=p5 | p7<=p11] & [p13<=p15 | p9<=36]] & [[[~ [37<=p7] | ~ [26<=p12]] | [~ [32<=p3] | [~ [p17<=13] & ~ [p18<=47]]]] & [[p7<=22 & [[[~ [p9<=7] | ~ [p0<=32]] | [p4<=14 | [p20<=p22 | [~ [p9<=p17] & ~ [p17<=3]]]]] & [~ [p21<=p23] | [~ [p6<=27] | ~ [p5<=0]]]]] | [[p2<=p0 & ~ [18<=p0]] & [~ [37<=p12] & [p18<=p23 & 30<=p7]]]]]]]]]
normalized: ~ [E [true U ~ [[p2<=p4 | [[[[[[[p18<=p23 & 30<=p7] & ~ [37<=p12]] & [p2<=p0 & ~ [18<=p0]]] | [p7<=22 & [[[~ [p5<=0] | ~ [p6<=27]] | ~ [p21<=p23]] & [[p4<=14 | [p20<=p22 | [~ [p17<=3] & ~ [p9<=p17]]]] | [~ [p0<=32] | ~ [p9<=7]]]]]] & [[[~ [p18<=47] & ~ [p17<=13]] | ~ [32<=p3]] | [~ [26<=p12] | ~ [37<=p7]]]] & [[p13<=p15 | p9<=36] & [p3<=p5 | p7<=p11]]] | [[[[[[21<=p12 | [p6<=p9 & [p3<=p19 & [p8<=42 | p4<=p8]]]] & ~ [p5<=p18]] | ~ [p1<=3]] | ~ [21<=p1]] | [18<=p0 | p22<=10]] & [33<=p4 | [[[[[[41<=p16 & [p9<=45 & [[11<=p9 | p22<=p0] | ~ [15<=p20]]]] & [p12<=45 & p18<=p8]] | ~ [p3<=p15]] | [~ [35<=p21] | ~ [43<=p2]]] & [[[[p16<=32 & [~ [p13<=p12] | ~ [p14<=17]]] | [p9<=p20 & 23<=p9]] | [21<=p18 | 49<=p2]] | [[p19<=p20 | p4<=p23] | ~ [6<=p18]]]] | [[[~ [12<=p19] & ~ [p5<=29]] | ~ [p1<=p9]] & [p0<=p18 | [~ [7<=p23] & ~ [43<=p10]]]]]]]]]]]]

abstracting: (43<=p10)
states: 106,884,211,737,600 (14)
abstracting: (7<=p23)
states: 0
abstracting: (p0<=p18)
states: 35,038,746,676,368 (13)
abstracting: (p1<=p9)
states: 540,710,084,330,928 (14)
abstracting: (p5<=29)
states: 359,052,019,570,512 (14)
abstracting: (12<=p19)
states: 0
abstracting: (6<=p18)
states: 0
abstracting: (p4<=p23)
states: 43,549,551,170,928 (13)
abstracting: (p19<=p20)
states: 420,552,287,812,944 (14)
abstracting: (49<=p2)
states: 82,463,707,003,392 (13)
abstracting: (21<=p18)
states: 0
abstracting: (23<=p9)
states: 238,145,465,750,400 (14)
abstracting: (p9<=p20)
states: 43,548,395,836,392 (13)
abstracting: (p14<=17)
states: 540,710,084,330,928 (14)
abstracting: (p13<=p12)
states: 405,532,563,248,196 (14)
abstracting: (p16<=32)
states: 540,710,084,330,928 (14)
abstracting: (43<=p2)
states: 106,884,211,737,600 (14)
abstracting: (35<=p21)
states: 0
abstracting: (p3<=p15)
states: 26,529,097,516,344 (13)
abstracting: (p18<=p8)
states: 523,024,019,320,032 (14)
abstracting: (p12<=45)
states: 540,710,084,330,928 (14)
abstracting: (15<=p20)
states: 0
abstracting: (p22<=p0)
states: 514,347,678,487,296 (14)
abstracting: (11<=p9)
states: 369,790,959,605,760 (14)
abstracting: (p9<=45)
states: 446,789,155,599,792 (14)
abstracting: (41<=p16)
states: 0
abstracting: (33<=p4)
states: 161,380,958,284,080 (14)
abstracting: (p22<=10)
states: 540,710,084,330,928 (14)
abstracting: (18<=p0)
states: 286,870,391,119,872 (14)
abstracting: (21<=p1)
states: 256,768,012,081,152 (14)
abstracting: (p1<=3)
states: 68,743,717,687,728 (13)
abstracting: (p5<=p18)
states: 35,039,866,209,984 (13)
abstracting: (p4<=p8)
states: 270,355,641,200,640 (14)
abstracting: (p8<=42)
states: 433,825,872,593,328 (14)
abstracting: (p3<=p19)
states: 35,038,746,676,368 (13)
abstracting: (p6<=p9)
states: 274,905,525,831,840 (14)
abstracting: (21<=p12)
states: 0
abstracting: (p7<=p11)
states: 270,355,641,200,640 (14)
abstracting: (p3<=p5)
states: 274,904,294,267,664 (14)
abstracting: (p9<=36)
states: 403,452,218,276,784 (14)
abstracting: (p13<=p15)
states: 405,532,563,248,196 (14)
abstracting: (37<=p7)
states: 137,257,162,142,112 (14)
abstracting: (26<=p12)
states: 0
abstracting: (32<=p3)
states: 167,836,980,579,840 (14)
abstracting: (p17<=13)
states: 540,710,084,330,928 (14)
abstracting: (p18<=47)
states: 540,710,084,330,928 (14)
abstracting: (p9<=7)
states: 129,857,311,317,168 (14)
abstracting: (p0<=32)
states: 379,328,372,234,928 (14)
abstracting: (p9<=p17)
states: 35,038,746,676,368 (13)
abstracting: (p17<=3)
states: 540,710,084,330,928 (14)
abstracting: (p20<=p22)
states: 345,453,664,989,204 (14)
abstracting: (p4<=14)
states: 220,395,958,501,680 (14)
abstracting: (p21<=p23)
states: 345,453,664,989,204 (14)
abstracting: (p6<=27)
states: 344,265,860,648,880 (14)
abstracting: (p5<=0)
states: 17,686,785,187,728 (13)
abstracting: (p7<=22)
states: 302,565,507,325,488 (14)
abstracting: (18<=p0)
states: 286,870,391,119,872 (14)
abstracting: (p2<=p0)
states: 274,904,556,829,488 (14)
abstracting: (37<=p12)
states: 0
abstracting: (30<=p7)
states: 181,658,064,760,416 (14)
abstracting: (p18<=p23)
states: 420,552,287,812,944 (14)
abstracting: (p2<=p4)
states: 274,904,294,267,664 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.980sec

totally nodes used: 12128066 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 175805106 9825731 185630837
used/not used/entry size/cache size: 9919551 57189313 16 1024MB
basic ops cache: hits/miss/sum: 165852726 36688951 202541677
used/not used/entry size/cache size: 16254442 522774 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: 15539026 4423346 19962372
used/not used/entry size/cache size: 3432254 4956354 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 57726956
1 7636856
2 1517712
3 165932
4 23356
5 6974
6 6382
7 1169
8 730
9 332
>= 10 22465

Total processing time: 1m 8.300sec


BK_STOP 1680893340547

--------------------
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:20755 (741), effective:4264 (152)

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

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