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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K 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.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:23 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-D4N050-ReachabilityFireability-00
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-01
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-02
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-03
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-04
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-05
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-06
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-07
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-08
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-09
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-10
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-11
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-12
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-13
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-14
FORMULA_NAME Murphy-PT-D4N050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680894067622

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 19:01:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 19:01:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 19:01:09] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-04-07 19:01:09] [INFO ] Transformed 30 places.
[2023-04-07 19:01:09] [INFO ] Transformed 35 transitions.
[2023-04-07 19:01:09] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Murphy-PT-D4N050-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D4N050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10028 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=63 ) properties (out of 10) seen :4
FORMULA Murphy-PT-D4N050-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N050-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N050-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D4N050-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 19:01:09] [INFO ] Computed 6 invariants in 6 ms
[2023-04-07 19:01:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 19:01:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 19:01:09] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 19:01:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 19:01:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 19:01:10] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 19:01:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 19:01:10] [INFO ] After 33ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 19:01:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 10 ms to minimize.
[2023-04-07 19:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-07 19:01:10] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-07 19:01:10] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 29 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 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 19:01:10] [INFO ] Invariant cache hit.
[2023-04-07 19:01:10] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 273813 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273813 steps, saw 187806 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 19:01:13] [INFO ] Invariant cache hit.
[2023-04-07 19:01:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 19:01:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 19:01:13] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 19:01:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 19:01:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 19:01:13] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 19:01:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 19:01:13] [INFO ] After 28ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 19:01:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2023-04-07 19:01:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-07 19:01:13] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-07 19:01:13] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 28 ms.
Support contains 29 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 2 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 2 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 19:01:13] [INFO ] Invariant cache hit.
[2023-04-07 19:01:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 19:01:13] [INFO ] Invariant cache hit.
[2023-04-07 19:01:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 19:01:13] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 19:01:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 19:01:13] [INFO ] Invariant cache hit.
[2023-04-07 19:01:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 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 6 properties.
[2023-04-07 19:01:13] [INFO ] Invariant cache hit.
[2023-04-07 19:01:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 19:01:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 19:01:13] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 19:01:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 19:01:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 19:01:14] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 19:01:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 19:01:14] [INFO ] After 41ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 19:01:14] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 19:01:14] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-04-07 19:01:14] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-04-07 19:01:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 1 ms.
[2023-04-07 19:01:14] [INFO ] Flatten gal took : 20 ms
Total runtime 5079 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Murphy_PT_D4N050
(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.734sec


RS generation: 1m14.686sec


-> reachability set: #nodes 80010 (8.0e+04) #states 7,258,754,799,509,878,656 (18)



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

checking: EF [[2<=p15 & 1<=p20]]
normalized: E [true U [2<=p15 & 1<=p20]]

abstracting: (1<=p20)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p15)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-ReachabilityFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.199sec

checking: EF [[2<=p17 & 1<=p22]]
normalized: E [true U [2<=p17 & 1<=p22]]

abstracting: (1<=p22)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p17)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p17 & 1<=p22]]
normalized: E [true U [2<=p17 & 1<=p22]]

abstracting: (1<=p22)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p17)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[p22<=0 & p27<=2] & [2<=p16 & [1<=p21 & [[p1<=0 | p6<=0] | [[p16<=0 & [3<=p29 & [[p4<=0 | [p9<=0 | p14<=0]] | [p0<=2 | [p10<=0 | p20<=0]]]]] | [1<=p3 & [1<=p8 & [[p0<=0 | p5<=0] | [p10<=0 | [p19<=0 & [[p18<=1 | p23<=0] & [p4<=2 | [p14<=0 | p24<=0]]]]]]]]]]]]]]
normalized: E [true U [[2<=p16 & [1<=p21 & [[[1<=p3 & [1<=p8 & [[p10<=0 | [p19<=0 & [[p4<=2 | [p14<=0 | p24<=0]] & [p18<=1 | p23<=0]]]] | [p0<=0 | p5<=0]]]] | [p16<=0 & [3<=p29 & [[p0<=2 | [p10<=0 | p20<=0]] | [p4<=0 | [p9<=0 | p14<=0]]]]]] | [p1<=0 | p6<=0]]]] & [p22<=0 & p27<=2]]]

abstracting: (p27<=2)
states: 6,048,962,332,924,898,880 (18)
abstracting: (p22<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p6<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p1<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p14<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p9<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p4<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p20<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p10<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p0<=2)
states: 716,629,420,963,697,760 (17)
abstracting: (3<=p29)
states: 1,209,792,466,584,979,776 (18)
abstracting: (p16<=0)
states: 3,629,377,399,754,939,328 (18)
abstracting: (p5<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p0<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p23<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p18<=1)
states: 7,258,754,799,509,878,656 (18)
abstracting: (p24<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p14<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p4<=2)
states: 716,629,420,963,697,760 (17)
abstracting: (p19<=0)
states: 3,629,377,399,754,939,328 (18)
abstracting: (p10<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p21)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p16)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.457sec

checking: EF [[2<=p15 & [1<=p20 & [[1<=p16 | [[1<=p3 & 1<=p8] | [2<=p18 & 1<=p23]]] | [[2<=p19 & 1<=p24] | [[[3<=p0 & [1<=p10 & 1<=p2]] & [1<=p7 & [1<=p12 & [p1<=0 | p6<=0]]]] | [[p20<=0 & p19<=0] & [[p2<=2 | [p12<=0 | p22<=0]] & [[[1<=p3 & 1<=p8] | [2<=p19 & 1<=p24]] & [[p16<=1 | p21<=0] | [3<=p25 | [3<=p3 & [1<=p13 & 1<=p23]]]]]]]]]]]]]
normalized: E [true U [2<=p15 & [1<=p20 & [[[[[[[[3<=p25 | [3<=p3 & [1<=p13 & 1<=p23]]] | [p16<=1 | p21<=0]] & [[2<=p19 & 1<=p24] | [1<=p3 & 1<=p8]]] & [p2<=2 | [p12<=0 | p22<=0]]] & [p20<=0 & p19<=0]] | [[1<=p7 & [1<=p12 & [p1<=0 | p6<=0]]] & [3<=p0 & [1<=p10 & 1<=p2]]]] | [2<=p19 & 1<=p24]] | [1<=p16 | [[2<=p18 & 1<=p23] | [1<=p3 & 1<=p8]]]]]]]

abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p23)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p18)
states: 0
abstracting: (1<=p16)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p19)
states: 0
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p0)
states: 6,542,125,378,546,180,896 (18)
abstracting: (p6<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p1<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (1<=p12)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (p19<=0)
states: 3,629,377,399,754,939,328 (18)
abstracting: (p20<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p22<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p12<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p2<=2)
states: 716,629,420,963,697,760 (17)
abstracting: (1<=p8)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p3)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p24)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p19)
states: 0
abstracting: (p21<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p16<=1)
states: 7,258,754,799,509,878,656 (18)
abstracting: (1<=p23)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p3)
states: 6,542,125,378,546,180,896 (18)
abstracting: (3<=p25)
states: 1,209,792,466,584,979,776 (18)
abstracting: (1<=p20)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p15)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-ReachabilityFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.602sec

checking: AG [[[p15<=1 | [p20<=0 | [1<=p0 & 1<=p5]]] | [[[[3<=p25 | [[2<=p17 & 1<=p22] & [[p19<=1 | p24<=0] & [[2<=p18 & 1<=p23] | [p18<=0 & [p2<=0 | [p7<=0 | p12<=0]]]]]]] | [[[3<=p0 & [1<=p10 & 1<=p20]] & [1<=p2 & [1<=p7 & 1<=p12]]] | [1<=p0 & 1<=p5]]] & [p17<=0 | [p26<=2 | [3<=p1 & [1<=p11 & 1<=p21]]]]] | [[[[1<=p0 & 1<=p5] & [1<=p10 & 1<=p18]] & [[[1<=p21 | p26<=2] & [[p20<=0 | p3<=2] | [p13<=0 | p23<=0]]] & [[[p1<=0 | p6<=0] | [p11<=0 | p29<=2]] & [[p1<=0 | p6<=0] | [p11<=0 | [3<=p3 & [1<=p13 & 1<=p23]]]]]]] | [p25<=2 & [p0<=2 | [p10<=0 | p20<=0]]]]]]]
normalized: ~ [E [true U ~ [[[[[p25<=2 & [p0<=2 | [p10<=0 | p20<=0]]] | [[[[[p11<=0 | [3<=p3 & [1<=p13 & 1<=p23]]] | [p1<=0 | p6<=0]] & [[p11<=0 | p29<=2] | [p1<=0 | p6<=0]]] & [[[p13<=0 | p23<=0] | [p20<=0 | p3<=2]] & [1<=p21 | p26<=2]]] & [[1<=p10 & 1<=p18] & [1<=p0 & 1<=p5]]]] | [[p17<=0 | [p26<=2 | [3<=p1 & [1<=p11 & 1<=p21]]]] & [[[1<=p0 & 1<=p5] | [[1<=p2 & [1<=p7 & 1<=p12]] & [3<=p0 & [1<=p10 & 1<=p20]]]] | [3<=p25 | [[[[p18<=0 & [p2<=0 | [p7<=0 | p12<=0]]] | [2<=p18 & 1<=p23]] & [p19<=1 | p24<=0]] & [2<=p17 & 1<=p22]]]]]] | [p15<=1 | [p20<=0 | [1<=p0 & 1<=p5]]]]]]]

abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (p20<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p15<=1)
states: 7,258,754,799,509,878,656 (18)
abstracting: (1<=p22)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p17)
states: 0
abstracting: (p24<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p19<=1)
states: 7,258,754,799,509,878,656 (18)
abstracting: (1<=p23)
states: 4,839,169,866,339,919,104 (18)
abstracting: (2<=p18)
states: 0
abstracting: (p12<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p7<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p2<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p18<=0)
states: 3,629,377,399,754,939,328 (18)
abstracting: (3<=p25)
states: 1,209,792,466,584,979,776 (18)
abstracting: (1<=p20)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p0)
states: 6,542,125,378,546,180,896 (18)
abstracting: (1<=p12)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p7)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p2)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p21)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p11)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p1)
states: 6,542,125,378,546,180,896 (18)
abstracting: (p26<=2)
states: 6,048,962,332,924,898,880 (18)
abstracting: (p17<=0)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p5)
states: 7,014,990,643,147,641,312 (18)
abstracting: (1<=p0)
states: 7,014,991,108,265,986,464 (18)
abstracting: (1<=p18)
states: 3,629,377,399,754,939,328 (18)
abstracting: (1<=p10)
states: 7,014,991,108,265,986,464 (18)
abstracting: (p26<=2)
states: 6,048,962,332,924,898,880 (18)
abstracting: (1<=p21)
states: 4,839,169,866,339,919,104 (18)
abstracting: (p3<=2)
states: 716,629,420,963,697,760 (17)
abstracting: (p20<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p23<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p13<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p6<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p1<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p29<=2)
states: 6,048,962,332,924,898,880 (18)
abstracting: (p11<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p6<=0)
states: 243,764,156,362,237,344 (17)
abstracting: (p1<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (1<=p23)
states: 4,839,169,866,339,919,104 (18)
abstracting: (1<=p13)
states: 7,014,991,108,265,986,464 (18)
abstracting: (3<=p3)
states: 6,542,125,378,546,180,896 (18)
abstracting: (p11<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p20<=0)
states: 2,419,584,933,169,959,552 (18)
abstracting: (p10<=0)
states: 243,763,691,243,892,192 (17)
abstracting: (p0<=2)
states: 716,629,420,963,697,760 (17)
abstracting: (p25<=2)
states: 6,048,962,332,924,898,880 (18)
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.350sec

totally nodes used: 8129397 (8.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 721658345 48486346 770144691
used/not used/entry size/cache size: 35460073 31648791 16 1024MB
basic ops cache: hits/miss/sum: 28603562 5952932 34556494
used/not used/entry size/cache size: 9074421 7702795 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: 6622088 1242838 7864926
used/not used/entry size/cache size: 1153672 7234936 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 60436062
1 5516260
2 1024410
3 80242
4 13536
5 4026
6 10997
7 9579
8 10223
9 1268
>= 10 2261

Total processing time: 1m27.541sec


BK_STOP 1680894162996

--------------------
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 ReachabilityFireability -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:45332 (1295), effective:8976 (256)

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-D4N050"
export BK_EXAMINATION="ReachabilityFireability"
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-D4N050, examination is ReachabilityFireability"
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-167987247300375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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