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

About the Execution of Marcie+red for DES-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8394.067 138576.00 149138.00 339.50 FTFTTFTFFFTTFTTF 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.r106-tall-167814482700399.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 DES-PT-05a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K Mar 5 18:22 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 DES-PT-05a-ReachabilityFireability-00
FORMULA_NAME DES-PT-05a-ReachabilityFireability-01
FORMULA_NAME DES-PT-05a-ReachabilityFireability-02
FORMULA_NAME DES-PT-05a-ReachabilityFireability-03
FORMULA_NAME DES-PT-05a-ReachabilityFireability-04
FORMULA_NAME DES-PT-05a-ReachabilityFireability-05
FORMULA_NAME DES-PT-05a-ReachabilityFireability-06
FORMULA_NAME DES-PT-05a-ReachabilityFireability-07
FORMULA_NAME DES-PT-05a-ReachabilityFireability-08
FORMULA_NAME DES-PT-05a-ReachabilityFireability-09
FORMULA_NAME DES-PT-05a-ReachabilityFireability-10
FORMULA_NAME DES-PT-05a-ReachabilityFireability-11
FORMULA_NAME DES-PT-05a-ReachabilityFireability-12
FORMULA_NAME DES-PT-05a-ReachabilityFireability-13
FORMULA_NAME DES-PT-05a-ReachabilityFireability-14
FORMULA_NAME DES-PT-05a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678384314901

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=DES-PT-05a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 17:51:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 17:51:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 17:51:56] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-09 17:51:56] [INFO ] Transformed 135 places.
[2023-03-09 17:51:56] [INFO ] Transformed 92 transitions.
[2023-03-09 17:51:56] [INFO ] Found NUPN structural information;
[2023-03-09 17:51:56] [INFO ] Parsed PT model containing 135 places and 92 transitions and 457 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 16) seen :8
FORMULA DES-PT-05a-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :1
FORMULA DES-PT-05a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 78 rows 135 cols
[2023-03-09 17:51:57] [INFO ] Computed 59 place invariants in 15 ms
[2023-03-09 17:51:57] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2023-03-09 17:51:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 17:51:57] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 17:51:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 17:51:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 17:51:58] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-09 17:51:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 17:51:58] [INFO ] After 112ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-09 17:51:58] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-09 17:51:58] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA DES-PT-05a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-05a-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-05a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 34 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 134 transition count 77
Applied a total of 4 rules in 28 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 134/135 places, 77/78 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 870188 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 870188 steps, saw 133431 distinct states, run finished after 3002 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 77 rows 134 cols
[2023-03-09 17:52:02] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-09 17:52:02] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 17:52:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 17:52:02] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 17:52:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-09 17:52:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2023-03-09 17:52:02] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 17:52:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 17:52:02] [INFO ] After 52ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 17:52:02] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-09 17:52:02] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-05a-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-05a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 26 ms.
Support contains 32 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 134/134 places, 77/77 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 77/77 transitions.
Applied a total of 0 rules in 7 ms. Remains 134 /134 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2023-03-09 17:52:02] [INFO ] Invariant cache hit.
[2023-03-09 17:52:02] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 17:52:02] [INFO ] Invariant cache hit.
[2023-03-09 17:52:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 17:52:02] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-09 17:52:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 17:52:02] [INFO ] Invariant cache hit.
[2023-03-09 17:52:02] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 134/134 places, 77/77 transitions.
Applied a total of 0 rules in 5 ms. Remains 134 /134 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-09 17:52:02] [INFO ] Invariant cache hit.
[2023-03-09 17:52:02] [INFO ] [Real]Absence check using 34 positive place invariants in 3 ms returned sat
[2023-03-09 17:52:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-09 17:52:02] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 17:52:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 17:52:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 17:52:02] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 17:52:03] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-09 17:52:03] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-09 17:52:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-09 17:52:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 134 places, 77 transitions and 393 arcs took 1 ms.
[2023-03-09 17:52:03] [INFO ] Flatten gal took : 33 ms
Total runtime 6878 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: DES_PT_05a
(NrP: 134 NrTr: 77 NrArc: 393)

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

net check time: 0m 0.000sec

init dd package: 0m 2.762sec


RS generation: 0m24.439sec


-> reachability set: #nodes 721583 (7.2e+05) #states 188,492,687,951 (11)



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

checking: EF [[[p3<=1 & 1<=p3] & [[p53<=1 & 1<=p53] & [p55<=1 & 1<=p55]]]]
normalized: E [true U [[[p55<=1 & 1<=p55] & [p53<=1 & 1<=p53]] & [p3<=1 & 1<=p3]]]

abstracting: (1<=p3)
states: 63,776,709,249 (10)
abstracting: (p3<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p53)
states: 60,672,290,552 (10)
abstracting: (p53<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p55)
states: 126,821,318,856 (11)
abstracting: (p55<=1)
states: 188,492,687,951 (11)
-> the formula is TRUE

FORMULA DES-PT-05a-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.584sec

checking: AG [[[[[p10<=0 & 0<=p10] | [[p129<=0 & 0<=p129] | [p116<=0 & 0<=p116]]] | [[[p130<=0 & 0<=p130] | [p37<=1 & 1<=p37]] | [[[p72<=1 & 1<=p72] & [p89<=1 & 1<=p89]] | [[[p20<=0 & 0<=p20] | [p25<=0 & 0<=p25]] & [[[[p43<=1 & 1<=p43] & [p45<=1 & 1<=p45]] | [[p5<=1 & 1<=p5] & [[p53<=1 & 1<=p53] & [p55<=1 & 1<=p55]]]] | [[[p15<=1 & 1<=p15] & [p50<=1 & 1<=p50]] | [[p42<=1 & 1<=p42] & [[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]]]]]]]]] & [[[p3<=0 & 0<=p3] | [p53<=0 & 0<=p53]] | [[p55<=0 & 0<=p55] | [[[[p123<=1 & 1<=p123] & [p128<=1 & 1<=p128]] & [[p21<=1 & 1<=p21] & [[p23<=1 & 1<=p23] & [p27<=1 & 1<=p27]]]] & [[[p28<=1 & 1<=p28] & [[p30<=1 & 1<=p30] & [p32<=1 & 1<=p32]]] & [[[p26<=0 & 0<=p26] | [p48<=0 & 0<=p48]] & [[[p42<=0 & 0<=p42] | [[p47<=0 & 0<=p47] | [p49<=0 & 0<=p49]]] & [[p74<=0 & 0<=p74] | [p91<=0 & 0<=p91]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p89<=1 & 1<=p89] & [p72<=1 & 1<=p72]] | [[[[[[p55<=1 & 1<=p55] & [p53<=1 & 1<=p53]] & [p5<=1 & 1<=p5]] | [[p45<=1 & 1<=p45] & [p43<=1 & 1<=p43]]] | [[[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p42<=1 & 1<=p42]] | [[p50<=1 & 1<=p50] & [p15<=1 & 1<=p15]]]] & [[p25<=0 & 0<=p25] | [p20<=0 & 0<=p20]]]] | [[p37<=1 & 1<=p37] | [p130<=0 & 0<=p130]]] | [[[p116<=0 & 0<=p116] | [p129<=0 & 0<=p129]] | [p10<=0 & 0<=p10]]] & [[[[[[[[p91<=0 & 0<=p91] | [p74<=0 & 0<=p74]] & [[[p49<=0 & 0<=p49] | [p47<=0 & 0<=p47]] | [p42<=0 & 0<=p42]]] & [[p48<=0 & 0<=p48] | [p26<=0 & 0<=p26]]] & [[[p32<=1 & 1<=p32] & [p30<=1 & 1<=p30]] & [p28<=1 & 1<=p28]]] & [[[[p27<=1 & 1<=p27] & [p23<=1 & 1<=p23]] & [p21<=1 & 1<=p21]] & [[p128<=1 & 1<=p128] & [p123<=1 & 1<=p123]]]] | [p55<=0 & 0<=p55]] | [[p53<=0 & 0<=p53] | [p3<=0 & 0<=p3]]]]]]]

abstracting: (0<=p3)
states: 188,492,687,951 (11)
abstracting: (p3<=0)
states: 124,715,978,702 (11)
abstracting: (0<=p53)
states: 188,492,687,951 (11)
abstracting: (p53<=0)
states: 127,820,397,399 (11)
abstracting: (0<=p55)
states: 188,492,687,951 (11)
abstracting: (p55<=0)
states: 61,671,369,095 (10)
abstracting: (1<=p123)
states: 45,160,718,347 (10)
abstracting: (p123<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p128)
states: 26,215,298,217 (10)
abstracting: (p128<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p21)
states: 107,026,619,046 (11)
abstracting: (p21<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p23)
states: 94,852,771,040 (10)
abstracting: (p23<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p27)
states: 64,462,189,562 (10)
abstracting: (p27<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p28)
states: 56,554,238,060 (10)
abstracting: (p28<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p30)
states: 109,597,658,609 (11)
abstracting: (p30<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p32)
states: 188,492,687,950 (11)
abstracting: (p32<=1)
states: 188,492,687,951 (11)
abstracting: (0<=p26)
states: 188,492,687,951 (11)
abstracting: (p26<=0)
states: 126,477,438,759 (11)
abstracting: (0<=p48)
states: 188,492,687,951 (11)
abstracting: (p48<=0)
states: 91,043,906,055 (10)
abstracting: (0<=p42)
states: 188,492,687,951 (11)
abstracting: (p42<=0)
states: 129,076,752,378 (11)
abstracting: (0<=p47)
states: 188,492,687,951 (11)
abstracting: (p47<=0)
states: 104,931,719,859 (11)
abstracting: (0<=p49)
states: 188,492,687,951 (11)
abstracting: (p49<=0)
states: 97,448,781,897 (10)
abstracting: (0<=p74)
states: 188,492,687,951 (11)
abstracting: (p74<=0)
states: 68,142,752,207 (10)
abstracting: (0<=p91)
states: 188,492,687,951 (11)
abstracting: (p91<=0)
states: 120,349,935,745 (11)
abstracting: (0<=p10)
states: 188,492,687,951 (11)
abstracting: (p10<=0)
states: 187,313,416,691 (11)
abstracting: (0<=p129)
states: 188,492,687,951 (11)
abstracting: (p129<=0)
states: 152,848,088,755 (11)
abstracting: (0<=p116)
states: 188,492,687,951 (11)
abstracting: (p116<=0)
states: 149,956,230,538 (11)
abstracting: (0<=p130)
states: 188,492,687,951 (11)
abstracting: (p130<=0)
states: 162,272,176,607 (11)
abstracting: (1<=p37)
states: 44,729,325,260 (10)
abstracting: (p37<=1)
states: 188,492,687,951 (11)
abstracting: (0<=p20)
states: 188,492,687,951 (11)
abstracting: (p20<=0)
states: 155,210,626,213 (11)
abstracting: (0<=p25)
states: 188,492,687,951 (11)
abstracting: (p25<=0)
states: 126,477,438,755 (11)
abstracting: (1<=p15)
states: 14,545,433,717 (10)
abstracting: (p15<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p50)
states: 105,805,956,296 (11)
abstracting: (p50<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p42)
states: 59,415,935,573 (10)
abstracting: (p42<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p47)
states: 83,560,968,092 (10)
abstracting: (p47<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p49)
states: 91,043,906,054 (10)
abstracting: (p49<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p43)
states: 37,041,662,336 (10)
abstracting: (p43<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p45)
states: 47,678,220,156 (10)
abstracting: (p45<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p5)
states: 34,004,061,041 (10)
abstracting: (p5<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p53)
states: 60,672,290,552 (10)
abstracting: (p53<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p55)
states: 126,821,318,856 (11)
abstracting: (p55<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p72)
states: 120,349,935,744 (11)
abstracting: (p72<=1)
states: 188,492,687,951 (11)
abstracting: (1<=p89)
states: 68,142,752,206 (10)
abstracting: (p89<=1)
states: 188,492,687,951 (11)
-> the formula is FALSE

FORMULA DES-PT-05a-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.413sec

totally nodes used: 39857057 (4.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 28370518 185160314 213530832
used/not used/entry size/cache size: 64286633 2822231 16 1024MB
basic ops cache: hits/miss/sum: 13495277 90783988 104279265
used/not used/entry size/cache size: 16737769 39447 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: 802542 5057908 5860450
used/not used/entry size/cache size: 3815026 4573582 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 38076911
1 20540239
2 6571305
3 1568833
4 297930
5 46728
6 6154
7 692
8 67
9 5
>= 10 0

Total processing time: 2m 9.134sec


BK_STOP 1678384453477

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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:26856 (348), effective:3355 (43)

initing FirstDep: 0m 0.000sec


iterations count:15074 (195), effective:1641 (21)

iterations count:15233 (197), effective:1665 (21)

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="DES-PT-05a"
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 DES-PT-05a, 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 r106-tall-167814482700399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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