fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r522-tall-167987247200295
Last Updated
May 14, 2023

About the Execution of Marcie+red for Murphy-COL-D2N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5681.176 14633.00 18991.00 302.00 TTFFTTTFTFFFFTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 128K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K 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-COL-D2N050-ReachabilityFireability-00
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-01
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-02
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-03
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-04
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-05
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-06
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-07
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-08
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-09
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-10
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-11
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-12
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-13
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-14
FORMULA_NAME Murphy-COL-D2N050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680887939872

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-COL-D2N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 17:19:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 17:19:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:19:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 17:19:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 17:19:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 518 ms
[2023-04-07 17:19:01] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA Murphy-COL-D2N050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 17:19:01] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2023-04-07 17:19:01] [INFO ] Skeletonized 14 HLPN properties in 0 ms.
All 14 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-07 17:19:01] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 6 ms.
[2023-04-07 17:19:01] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 7 formulas.
FORMULA Murphy-COL-D2N050-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N050-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10020 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :6
FORMULA Murphy-COL-D2N050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N050-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N050-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-COL-D2N050-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 17:19:02] [INFO ] Computed 4 invariants in 3 ms
[2023-04-07 17:19:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-04-07 17:19:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:19:02] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:19:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-04-07 17:19:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 17:19:02] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:19:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:19:02] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:19:02] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 17:19:02] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 18 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:19:02] [INFO ] Invariant cache hit.
[2023-04-07 17:19:02] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 2217669 steps, run timeout after 3001 ms. (steps per millisecond=738 ) properties seen :{}
Probabilistic random walk after 2217669 steps, saw 1397651 distinct states, run finished after 3003 ms. (steps per millisecond=738 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:19:05] [INFO ] Invariant cache hit.
[2023-04-07 17:19:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:19:05] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:19:05] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:19:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:19:05] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:19:05] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:19:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:19:05] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:19:05] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 17:19:05] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 17:19:05] [INFO ] Invariant cache hit.
[2023-04-07 17:19:05] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 17:19:05] [INFO ] Invariant cache hit.
[2023-04-07 17:19:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:19:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-07 17:19:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:19:05] [INFO ] Invariant cache hit.
[2023-04-07 17:19:05] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-04-07 17:19:05] [INFO ] Invariant cache hit.
[2023-04-07 17:19:05] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:19:05] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 17:19:05] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:19:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:19:05] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-04-07 17:19:05] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:19:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 17:19:05] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:19:05] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 17:19:05] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:19:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-04-07 17:19:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
[2023-04-07 17:19:05] [INFO ] Flatten gal took : 18 ms
Total runtime 4697 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_COL_D2N050_unf
(NrP: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.817sec


RS generation: 0m 2.487sec


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



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

checking: AG [[[[[p11<=1 | p14<=0] & [p10<=1 | p13<=0]] & [p9<=1 | p12<=0]] | [[[[[p15<=2 & [p16<=2 & p17<=2]] | [2<=p9 & 1<=p12]] | [[2<=p10 & 1<=p13] | [2<=p11 & 1<=p14]]] | [[[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]] | [3<=p0 & [1<=p6 & 1<=p12]]] | [[3<=p1 & [1<=p7 & 1<=p13]] | [[3<=p2 & [1<=p8 & 1<=p14]] | [[3<=p15 | [3<=p16 | 3<=p17]] & [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]]]] & [[p12<=0 & [p13<=0 & p14<=0]] | [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]] | [p9<=0 & [p10<=0 & p11<=0]]]]]]]
normalized: ~ [E [true U ~ [[[[[[p9<=0 & [p10<=0 & p11<=0]] | [[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]] | [p12<=0 & [p13<=0 & p14<=0]]] & [[[[[[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] & [3<=p15 | [3<=p16 | 3<=p17]]] | [3<=p2 & [1<=p8 & 1<=p14]]] | [3<=p1 & [1<=p7 & 1<=p13]]] | [[3<=p0 & [1<=p6 & 1<=p12]] | [[[p1<=0 | [p4<=0 | p7<=0]] & [p0<=0 | [p3<=0 | p6<=0]]] & [p2<=0 | [p5<=0 | p8<=0]]]]] | [[[2<=p11 & 1<=p14] | [2<=p10 & 1<=p13]] | [[2<=p9 & 1<=p12] | [p15<=2 & [p16<=2 & p17<=2]]]]]] | [[p9<=1 | p12<=0] & [[p10<=1 | p13<=0] & [p11<=1 | p14<=0]]]]]]]

abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p11<=1)
states: 41,538,421,296 (10)
abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (p10<=1)
states: 41,538,421,296 (10)
abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (p9<=1)
states: 41,538,421,296 (10)
abstracting: (p17<=2)
states: 34,615,351,080 (10)
abstracting: (p16<=2)
states: 34,615,351,080 (10)
abstracting: (p15<=2)
states: 34,615,351,080 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (2<=p9)
states: 0
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0
abstracting: (p8<=0)
states: 1,296,166,536 (9)
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (p2<=0)
states: 1,296,166,536 (9)
abstracting: (p6<=0)
states: 1,296,166,536 (9)
abstracting: (p3<=0)
states: 1,298,093,688 (9)
abstracting: (p0<=0)
states: 1,296,166,536 (9)
abstracting: (p7<=0)
states: 1,296,166,536 (9)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (3<=p0)
states: 37,712,378,088 (10)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (3<=p1)
states: 37,712,378,088 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (3<=p2)
states: 37,712,378,088 (10)
abstracting: (3<=p17)
states: 6,923,070,216 (9)
abstracting: (3<=p16)
states: 6,923,070,216 (9)
abstracting: (3<=p15)
states: 6,923,070,216 (9)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (1<=p3)
states: 40,240,327,608 (10)
abstracting: (1<=p0)
states: 40,242,254,760 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (p3<=0)
states: 1,298,093,688 (9)
abstracting: (p0<=0)
states: 1,296,166,536 (9)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (p2<=0)
states: 1,296,166,536 (9)
abstracting: (p11<=0)
states: 20,769,210,648 (10)
abstracting: (p10<=0)
states: 20,769,210,648 (10)
abstracting: (p9<=0)
states: 20,769,210,648 (10)
-> the formula is TRUE

FORMULA Murphy-COL-D2N050-ReachabilityFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.483sec

totally nodes used: 365445 (3.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 27284840 1335000 28619840
used/not used/entry size/cache size: 1517340 65591524 16 1024MB
basic ops cache: hits/miss/sum: 1938935 417016 2355951
used/not used/entry size/cache size: 826513 15950703 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: 550072 101341 651413
used/not used/entry size/cache size: 100843 8287765 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 66787506
1 286495
2 28450
3 3808
4 2473
5 58
6 74
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.639sec


BK_STOP 1680887954505

--------------------
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:7459 (355), effective:1786 (85)

initing FirstDep: 0m 0.000sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-COL-D2N050"
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-COL-D2N050, 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-167987247200295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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