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

About the Execution of Marcie+red for LeafsetExtension-PT-S08C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10629.292 1479898.00 1497030.00 3904.00 TTFTTFFFFFFFTFTT 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.r234-tall-167856420300463.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 LeafsetExtension-PT-S08C3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420300463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 254K 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 LeafsetExtension-PT-S08C3-ReachabilityFireability-00
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-01
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-02
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-03
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-04
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-05
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-06
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-07
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-08
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-09
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-10
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-11
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-12
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-13
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-14
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679505706042

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=LeafsetExtension-PT-S08C3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:21:47] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-22 17:21:47] [INFO ] Transformed 462 places.
[2023-03-22 17:21:47] [INFO ] Transformed 409 transitions.
[2023-03-22 17:21:47] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 377 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 16) seen :9
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :1
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :1
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 409 rows 462 cols
[2023-03-22 17:21:48] [INFO ] Computed 53 place invariants in 31 ms
[2023-03-22 17:21:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 17:21:48] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-22 17:21:48] [INFO ] After 199ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-22 17:21:49] [INFO ] After 276ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-22 17:21:49] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-22 17:21:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:21:49] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-22 17:21:49] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-22 17:21:49] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-22 17:21:49] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 61 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 228 are kept as prefixes of interest. Removing 234 places using SCC suffix rule.2 ms
Discarding 234 places :
Also discarding 117 output transitions
Drop transitions removed 117 transitions
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 228 transition count 255
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 17 rules applied. Total rules applied 55 place count 215 transition count 251
Reduce places removed 4 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 31 rules applied. Total rules applied 86 place count 211 transition count 224
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 113 place count 184 transition count 224
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 113 place count 184 transition count 212
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 137 place count 172 transition count 212
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 153 place count 156 transition count 196
Iterating global reduction 4 with 16 rules applied. Total rules applied 169 place count 156 transition count 196
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 156 transition count 192
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 177 place count 152 transition count 192
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 152 transition count 192
Applied a total of 179 rules in 57 ms. Remains 152 /462 variables (removed 310) and now considering 192/409 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 152/462 places, 192/409 transitions.
Incomplete random walk after 10000 steps, including 734 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1474047 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :{1=1}
Probabilistic random walk after 1474047 steps, saw 336246 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :1
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-22 17:21:52] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
// Phase 1: matrix 186 rows 152 cols
[2023-03-22 17:21:52] [INFO ] Computed 16 place invariants in 7 ms
[2023-03-22 17:21:53] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-22 17:21:53] [INFO ] After 110ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 17:21:53] [INFO ] After 153ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-22 17:21:53] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 44 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 192/192 transitions.
Graph (complete) has 366 edges and 152 vertex of which 129 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 129 transition count 172
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 127 transition count 170
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 127 transition count 170
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 127 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 125 transition count 168
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 125 transition count 168
Applied a total of 19 rules in 23 ms. Remains 125 /152 variables (removed 27) and now considering 168/192 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 125/152 places, 168/192 transitions.
Incomplete random walk after 10000 steps, including 793 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1342129 steps, run visited all 1 properties in 2383 ms. (steps per millisecond=563 )
Probabilistic random walk after 1342129 steps, saw 303273 distinct states, run finished after 2384 ms. (steps per millisecond=562 ) properties seen :1
FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 8286 ms.
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: LeafsetExtension_PT_S08C3
(NrP: 462 NrTr: 409 NrArc: 1324)

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

net check time: 0m 0.000sec

init dd package: 0m 2.798sec


RS generation: 8m52.269sec


-> reachability set: #nodes 3360441 (3.4e+06) #states 26,263,874 (7)



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

checking: EF [IS_FIREABLE [LxSendsItsLeafSetToNode5]]
normalized: E [true U IS_FIREABLE [LxSendsItsLeafSetToNode5]]

-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m56.764sec

checking: EF [IS_FIREABLE [Node6SelectsANodeOfTheLeafSetOfRxToReplaceNode4]]
normalized: E [true U IS_FIREABLE [Node6SelectsANodeOfTheLeafSetOfRxToReplaceNode4]]

-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m49.779sec

checking: AG [~ [IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfLxToReplaceNode2]]]
normalized: ~ [E [true U IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfLxToReplaceNode2]]]

-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m54.783sec

checking: AG [~ [IS_FIREABLE [Node1ReceiveTheLeafSetOfRxToReplaceNode5]]]
normalized: ~ [E [true U IS_FIREABLE [Node1ReceiveTheLeafSetOfRxToReplaceNode5]]]

-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.973sec

checking: AG [~ [IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfLxToReplaceNode0]]]
normalized: ~ [E [true U IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfLxToReplaceNode0]]]

-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.798sec

checking: EF [IS_FIREABLE [LxReceiveARequestToSendItsLeafSetToNode7]]
normalized: E [true U IS_FIREABLE [LxReceiveARequestToSendItsLeafSetToNode7]]

-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m24.374sec

checking: EF [IS_FIREABLE [Node2ReceiveTheLeafSetOfRxToReplaceNode5]]
normalized: E [true U IS_FIREABLE [Node2ReceiveTheLeafSetOfRxToReplaceNode5]]

-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.678sec

checking: AG [~ [[[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode6] & IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfLxToReplaceNode0]] & [IS_FIREABLE [Node4DetectsBreakDownOfNode8] | IS_FIREABLE [Node5BreaksDown]]]]]
normalized: ~ [E [true U [[IS_FIREABLE [Node4DetectsBreakDownOfNode8] | IS_FIREABLE [Node5BreaksDown]] & [IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode6] & IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfLxToReplaceNode0]]]]]

-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.781sec

checking: AG [[[IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode8] | ~ [[~ [[[~ [IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode7]] | IS_FIREABLE [Node6ReceiveTheLeafSetOfRxToReplaceNode5]] & [~ [IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode5]] | [IS_FIREABLE [Node1DetectsBreakDownOfNode4] | IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode4]]]]] & ~ [[~ [IS_FIREABLE [Node8ReceiveTheLeafSetOfLxToReplaceNode1]] & IS_FIREABLE [Node0SelectsANodeOfTheLeafSetOfRxToReplaceNode8]]]]]] | ~ [IS_FIREABLE [Node1AsksItsLeafSetToLxToReplaceNode2]]]]
normalized: ~ [E [true U ~ [[~ [IS_FIREABLE [Node1AsksItsLeafSetToLxToReplaceNode2]] | [IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode8] | ~ [[~ [[IS_FIREABLE [Node0SelectsANodeOfTheLeafSetOfRxToReplaceNode8] & ~ [IS_FIREABLE [Node8ReceiveTheLeafSetOfLxToReplaceNode1]]]] & ~ [[[[IS_FIREABLE [Node1DetectsBreakDownOfNode4] | IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode4]] | ~ [IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode5]]] & [IS_FIREABLE [Node6ReceiveTheLeafSetOfRxToReplaceNode5] | ~ [IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode7]]]]]]]]]]]]

-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.499sec

checking: AG [[~ [[[IS_FIREABLE [Node6ReceiveTheLeafSetOfRxToReplaceNode8] | IS_FIREABLE [Node6ReceiveTheLeafSetOfLxToReplaceNode3]] & ~ [[[IS_FIREABLE [Node7AsksItsLeafSetToRxToReplaceNode8] | [IS_FIREABLE [Node6ReceiveTheLeafSetOfRxToReplaceNode8] & [~ [IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode4]] | [IS_FIREABLE [Node2SelectsANodeOfTheLeafSetOfLxToReplaceNode0] & IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode8]]]]] | IS_FIREABLE [Node3ReceiveTheLeafSetOfRxToReplaceNode5]]]]] & ~ [[[[IS_FIREABLE [Node5DetectsBreakDownOfNode6] | IS_FIREABLE [Node3DetectsBreakDownOfNode5]] | [[IS_FIREABLE [Node7DetectsBreakDownOfNode3] | ~ [[IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode3] & ~ [IS_FIREABLE [Node3AsksItsLeafSetToRxToReplaceNode8]]]]] | ~ [IS_FIREABLE [Node2DetectsBreakDownOfNode1]]]] & IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfLxToReplaceNode2]]]]]
normalized: ~ [E [true U ~ [[~ [[IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfLxToReplaceNode2] & [[[IS_FIREABLE [Node7DetectsBreakDownOfNode3] | ~ [[IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode3] & ~ [IS_FIREABLE [Node3AsksItsLeafSetToRxToReplaceNode8]]]]] | ~ [IS_FIREABLE [Node2DetectsBreakDownOfNode1]]] | [IS_FIREABLE [Node5DetectsBreakDownOfNode6] | IS_FIREABLE [Node3DetectsBreakDownOfNode5]]]]] & ~ [[~ [[IS_FIREABLE [Node3ReceiveTheLeafSetOfRxToReplaceNode5] | [IS_FIREABLE [Node7AsksItsLeafSetToRxToReplaceNode8] | [IS_FIREABLE [Node6ReceiveTheLeafSetOfRxToReplaceNode8] & [[IS_FIREABLE [Node2SelectsANodeOfTheLeafSetOfLxToReplaceNode0] & IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode8]] | ~ [IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode4]]]]]]] & [IS_FIREABLE [Node6ReceiveTheLeafSetOfRxToReplaceNode8] | IS_FIREABLE [Node6ReceiveTheLeafSetOfLxToReplaceNode3]]]]]]]]

-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m40.842sec

checking: AG [[[[[[[[[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode6] & IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode0]] & ~ [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode7] | IS_FIREABLE [Node1SelectsANodeOfTheLeafSetOfLxToReplaceNode2]]]] & ~ [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode4]]] | [[IS_FIREABLE [Node4DetectsBreakDownOfNode7] | [[IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode0] & IS_FIREABLE [Node2ReceiveTheLeafSetOfLxToReplaceNode4]] | [IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode5] | IS_FIREABLE [Node0AsksItsLeafSetToLxToReplaceNode1]]]] | IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode5]]] & [~ [[IS_FIREABLE [Node3GetTheRightToManageTheBreakDownOfNode7] & [[IS_FIREABLE [Node4DetectsBreakDownOfNode7] & IS_FIREABLE [Node1DetectsBreakDownOfNode4]] & IS_FIREABLE [Node4ReceiveTheLeafSetOfLxToReplaceNode2]]]] & ~ [IS_FIREABLE [Node2DetectsBreakDownOfNode4]]]] | ~ [IS_FIREABLE [Node7GetTheRightToManageTheBreakDownOfNode2]]] | IS_FIREABLE [Node7ReceiveTheLeafSetOfLxToReplaceNode2]] | ~ [IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode7]]]]
normalized: ~ [E [true U ~ [[~ [IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode7]] | [IS_FIREABLE [Node7ReceiveTheLeafSetOfLxToReplaceNode2] | [~ [IS_FIREABLE [Node7GetTheRightToManageTheBreakDownOfNode2]] | [[~ [IS_FIREABLE [Node2DetectsBreakDownOfNode4]] & ~ [[IS_FIREABLE [Node3GetTheRightToManageTheBreakDownOfNode7] & [IS_FIREABLE [Node4ReceiveTheLeafSetOfLxToReplaceNode2] & [IS_FIREABLE [Node4DetectsBreakDownOfNode7] & IS_FIREABLE [Node1DetectsBreakDownOfNode4]]]]]] & [[IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode5] | [IS_FIREABLE [Node4DetectsBreakDownOfNode7] | [[IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode5] | IS_FIREABLE [Node0AsksItsLeafSetToLxToReplaceNode1]] | [IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode0] & IS_FIREABLE [Node2ReceiveTheLeafSetOfLxToReplaceNode4]]]]] | [~ [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode4]] & [~ [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode7] | IS_FIREABLE [Node1SelectsANodeOfTheLeafSetOfLxToReplaceNode2]]] & [IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode6] & IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode0]]]]]]]]]]]]

-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.362sec

checking: EF [[~ [[~ [[[[~ [[IS_FIREABLE [Node1AsksItsLeafSetToRxToReplaceNode7] & IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode2]]] | IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfLxToReplaceNode0]] & [~ [IS_FIREABLE [Node6GetTheRightToManageTheBreakDownOfNode2]] | [~ [IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode1]] & ~ [IS_FIREABLE [Node7DetectsBreakDownOfNode0]]]]] | ~ [[[IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode6] & IS_FIREABLE [Node2DetectsBreakDownOfNode6]] | [IS_FIREABLE [Node0AsksItsLeafSetToLxToReplaceNode3] & IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode1]]]]]] | [[[~ [IS_FIREABLE [Node2GetTheRightToManageTheBreakDownOfNode7]] | [[[IS_FIREABLE [Node8SelectsANodeOfTheLeafSetOfLxToReplaceNode2] & IS_FIREABLE [Node8ReceiveTheLeafSetOfLxToReplaceNode3]] | ~ [IS_FIREABLE [Node2DetectsBreakDownOfNode5]]] | IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfLxToReplaceNode4]]] & ~ [IS_FIREABLE [Node4AsksItsLeafSetToLxToReplaceNode3]]] | IS_FIREABLE [Node1ReceiveTheLeafSetOfRxToReplaceNode8]]]] & ~ [[[[IS_FIREABLE [Node1DetectsBreakDownOfNode2] & ~ [[IS_FIREABLE [Node7GetTheRightToManageTheBreakDownOfNode5] | IS_FIREABLE [Node0SelectsANodeOfTheLeafSetOfRxToReplaceNode5]]]] | ~ [IS_FIREABLE [Node5DetectsBreakDownOfNode1]]] | [[~ [[IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode0] | IS_FIREABLE [Node5ReceiveTheLeafSetOfLxToReplaceNode0]]] | [[~ [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode6] | IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode7]]] | IS_FIREABLE [Node4AsksItsLeafSetToLxToReplaceNode2]] & [~ [IS_FIREABLE [Node2GetTheRightToManageTheBreakDownOfNode5]] | [IS_FIREABLE [Node6SelectsANodeOfTheLeafSetOfRxToReplaceNode8] & ~ [IS_FIREABLE [Node7ReceiveTheLeafSetOfRxToReplaceNode8]]]]]] & ~ [IS_FIREABLE [Node1SelectsANodeOfTheLeafSetOfLxToReplaceNode4]]]]]]]
normalized: E [true U [~ [[[~ [IS_FIREABLE [Node1SelectsANodeOfTheLeafSetOfLxToReplaceNode4]] & [[[[IS_FIREABLE [Node6SelectsANodeOfTheLeafSetOfRxToReplaceNode8] & ~ [IS_FIREABLE [Node7ReceiveTheLeafSetOfRxToReplaceNode8]]] | ~ [IS_FIREABLE [Node2GetTheRightToManageTheBreakDownOfNode5]]] & [IS_FIREABLE [Node4AsksItsLeafSetToLxToReplaceNode2] | ~ [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode6] | IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode7]]]]] | ~ [[IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode0] | IS_FIREABLE [Node5ReceiveTheLeafSetOfLxToReplaceNode0]]]]] | [~ [IS_FIREABLE [Node5DetectsBreakDownOfNode1]] | [IS_FIREABLE [Node1DetectsBreakDownOfNode2] & ~ [[IS_FIREABLE [Node7GetTheRightToManageTheBreakDownOfNode5] | IS_FIREABLE [Node0SelectsANodeOfTheLeafSetOfRxToReplaceNode5]]]]]]] & ~ [[[IS_FIREABLE [Node1ReceiveTheLeafSetOfRxToReplaceNode8] | [~ [IS_FIREABLE [Node4AsksItsLeafSetToLxToReplaceNode3]] & [[IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfLxToReplaceNode4] | [~ [IS_FIREABLE [Node2DetectsBreakDownOfNode5]] | [IS_FIREABLE [Node8SelectsANodeOfTheLeafSetOfLxToReplaceNode2] & IS_FIREABLE [Node8ReceiveTheLeafSetOfLxToReplaceNode3]]]] | ~ [IS_FIREABLE [Node2GetTheRightToManageTheBreakDownOfNode7]]]]] | ~ [[~ [[[IS_FIREABLE [Node0AsksItsLeafSetToLxToReplaceNode3] & IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode1]] | [IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode6] & IS_FIREABLE [Node2DetectsBreakDownOfNode6]]]] | [[[~ [IS_FIREABLE [Node7DetectsBreakDownOfNode0]] & ~ [IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode1]]] | ~ [IS_FIREABLE [Node6GetTheRightToManageTheBreakDownOfNode2]]] & [IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfLxToReplaceNode0] | ~ [[IS_FIREABLE [Node1AsksItsLeafSetToRxToReplaceNode7] & IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode2]]]]]]]]]]]

-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.327sec

checking: EF [[IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfRxToReplaceNode6] & [[~ [[~ [[[[IS_FIREABLE [Node3GetTheRightToManageTheBreakDownOfNode7] | IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode8]] & IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode5]] & [IS_FIREABLE [Node7ReceiveTheLeafSetOfLxToReplaceNode3] | ~ [IS_FIREABLE [Node0AsksItsLeafSetToRxToReplaceNode6]]]]] | IS_FIREABLE [Node5DetectsBreakDownOfNode1]]] & IS_FIREABLE [Node1DetectsBreakDownOfNode0]] & [~ [IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode1]] | [[[[[IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfLxToReplaceNode0] | [IS_FIREABLE [Node8SelectsANodeOfTheLeafSetOfLxToReplaceNode1] & IS_FIREABLE [Node6DetectsBreakDownOfNode2]]] & ~ [[IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode6] & IS_FIREABLE [Node0DetectsBreakDownOfNode1]]]] | [[~ [IS_FIREABLE [Node2AsksItsLeafSetToRxToReplaceNode8]] | ~ [IS_FIREABLE [Node0AsksItsLeafSetToRxToReplaceNode7]]] & ~ [[IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode2] | IS_FIREABLE [Node2ReceiveTheLeafSetOfRxToReplaceNode5]]]]] & [[IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode1] | [[IS_FIREABLE [Node7AsksItsLeafSetToLxToReplaceNode3] | IS_FIREABLE [Node8BreaksDown]] | [IS_FIREABLE [Node6AsksItsLeafSetToRxToReplaceNode5] & IS_FIREABLE [Node5BreaksDown]]]] | IS_FIREABLE [Node7DetectsBreakDownOfNode5]]] & ~ [[[[[IS_FIREABLE [RxSendsItsLeafSetToNode6] | IS_FIREABLE [Node6DetectsBreakDownOfNode4]] | [IS_FIREABLE [Node1AsksItsLeafSetToLxToReplaceNode3] & IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfLxToReplaceNode3]]] & ~ [[IS_FIREABLE [Node6GetTheRightToManageTheBreakDownOfNode8] & IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfRxToReplaceNode4]]]] & [IS_FIREABLE [LxSendsItsLeafSetToNode1] | IS_FIREABLE [Node5ReceiveTheLeafSetOfLxToReplaceNode3]]]]]]]]]
normalized: E [true U [IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfRxToReplaceNode6] & [[[~ [[[IS_FIREABLE [LxSendsItsLeafSetToNode1] | IS_FIREABLE [Node5ReceiveTheLeafSetOfLxToReplaceNode3]] & [~ [[IS_FIREABLE [Node6GetTheRightToManageTheBreakDownOfNode8] & IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfRxToReplaceNode4]]] & [[IS_FIREABLE [Node1AsksItsLeafSetToLxToReplaceNode3] & IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfLxToReplaceNode3]] | [IS_FIREABLE [RxSendsItsLeafSetToNode6] | IS_FIREABLE [Node6DetectsBreakDownOfNode4]]]]]] & [[IS_FIREABLE [Node7DetectsBreakDownOfNode5] | [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode1] | [[IS_FIREABLE [Node6AsksItsLeafSetToRxToReplaceNode5] & IS_FIREABLE [Node5BreaksDown]] | [IS_FIREABLE [Node7AsksItsLeafSetToLxToReplaceNode3] | IS_FIREABLE [Node8BreaksDown]]]]] & [[~ [[IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode2] | IS_FIREABLE [Node2ReceiveTheLeafSetOfRxToReplaceNode5]]] & [~ [IS_FIREABLE [Node0AsksItsLeafSetToRxToReplaceNode7]] | ~ [IS_FIREABLE [Node2AsksItsLeafSetToRxToReplaceNode8]]]] | [~ [[IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode6] & IS_FIREABLE [Node0DetectsBreakDownOfNode1]]] & [IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfLxToReplaceNode0] | [IS_FIREABLE [Node8SelectsANodeOfTheLeafSetOfLxToReplaceNode1] & IS_FIREABLE [Node6DetectsBreakDownOfNode2]]]]]]] | ~ [IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode1]]] & [IS_FIREABLE [Node1DetectsBreakDownOfNode0] & ~ [[IS_FIREABLE [Node5DetectsBreakDownOfNode1] | ~ [[[IS_FIREABLE [Node7ReceiveTheLeafSetOfLxToReplaceNode3] | ~ [IS_FIREABLE [Node0AsksItsLeafSetToRxToReplaceNode6]]] & [IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode5] & [IS_FIREABLE [Node3GetTheRightToManageTheBreakDownOfNode7] | IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode8]]]]]]]]]]]

-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.312sec

checking: EF [[~ [[[[~ [[[IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode8] | IS_FIREABLE [LxReceiveARequestToSendItsLeafSetToNode4]] | IS_FIREABLE [Node1SelectsANodeOfTheLeafSetOfLxToReplaceNode0]]] | [~ [IS_FIREABLE [Node0SelectsANodeOfTheLeafSetOfRxToReplaceNode7]] | [[IS_FIREABLE [LxSendsItsLeafSetToNode4] & IS_FIREABLE [Node1DetectsBreakDownOfNode7]] & [IS_FIREABLE [Node1DetectsBreakDownOfNode4] & IS_FIREABLE [Node3AsksItsLeafSetToRxToReplaceNode5]]]]] | [IS_FIREABLE [Node4AsksItsLeafSetToRxToReplaceNode6] | [[~ [IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode6]] & IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode6]] | [[IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfLxToReplaceNode1] | IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode3]] | ~ [IS_FIREABLE [Node2DetectsBreakDownOfNode3]]]]]] & [[IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfRxToReplaceNode5] | [[~ [IS_FIREABLE [Node8AsksItsLeafSetToLxToReplaceNode0]] & [IS_FIREABLE [Node7ReceiveTheLeafSetOfLxToReplaceNode1] & IS_FIREABLE [Node2AsksItsLeafSetToLxToReplaceNode4]]] | [[IS_FIREABLE [Node0BreaksDown] & IS_FIREABLE [Node7GetTheRightToManageTheBreakDownOfNode0]] | [IS_FIREABLE [Node3ReceiveTheLeafSetOfRxToReplaceNode8] | IS_FIREABLE [Node5BreaksDown]]]]] | [[~ [[IS_FIREABLE [Node7ReceiveTheLeafSetOfRxToReplaceNode6] | IS_FIREABLE [Node6AsksItsLeafSetToRxToReplaceNode7]]] | ~ [IS_FIREABLE [Node0AsksItsLeafSetToLxToReplaceNode3]]] & ~ [[[IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode0] & IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfLxToReplaceNode2]] | [IS_FIREABLE [Node2SelectsANodeOfTheLeafSetOfLxToReplaceNode0] & IS_FIREABLE [Node0DetectsBreakDownOfNode1]]]]]]]] & [IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfLxToReplaceNode1] | ~ [[IS_FIREABLE [Node7AsksItsLeafSetToRxToReplaceNode5] & ~ [[[[~ [IS_FIREABLE [Node1ReceiveTheLeafSetOfRxToReplaceNode5]] & IS_FIREABLE [Node4AsksItsLeafSetToRxToReplaceNode5]] | [IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode2] & IS_FIREABLE [Node6DetectsBreakDownOfNode3]]] | [~ [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode8] & IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode4]]] | [[IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfLxToReplaceNode4] | IS_FIREABLE [Node7AsksItsLeafSetToLxToReplaceNode1]] | [IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode8] & IS_FIREABLE [LxEntersTheLeafSet]]]]]]]]]]]
normalized: E [true U [[IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfLxToReplaceNode1] | ~ [[IS_FIREABLE [Node7AsksItsLeafSetToRxToReplaceNode5] & ~ [[[[[IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode8] & IS_FIREABLE [LxEntersTheLeafSet]] | [IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfLxToReplaceNode4] | IS_FIREABLE [Node7AsksItsLeafSetToLxToReplaceNode1]]] | ~ [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode8] & IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode4]]]] | [[IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode2] & IS_FIREABLE [Node6DetectsBreakDownOfNode3]] | [IS_FIREABLE [Node4AsksItsLeafSetToRxToReplaceNode5] & ~ [IS_FIREABLE [Node1ReceiveTheLeafSetOfRxToReplaceNode5]]]]]]]]] & ~ [[[[~ [[[IS_FIREABLE [Node2SelectsANodeOfTheLeafSetOfLxToReplaceNode0] & IS_FIREABLE [Node0DetectsBreakDownOfNode1]] | [IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode0] & IS_FIREABLE [Node7SelectsANodeOfTheLeafSetOfLxToReplaceNode2]]]] & [~ [IS_FIREABLE [Node0AsksItsLeafSetToLxToReplaceNode3]] | ~ [[IS_FIREABLE [Node7ReceiveTheLeafSetOfRxToReplaceNode6] | IS_FIREABLE [Node6AsksItsLeafSetToRxToReplaceNode7]]]]] | [IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfRxToReplaceNode5] | [[[IS_FIREABLE [Node3ReceiveTheLeafSetOfRxToReplaceNode8] | IS_FIREABLE [Node5BreaksDown]] | [IS_FIREABLE [Node0BreaksDown] & IS_FIREABLE [Node7GetTheRightToManageTheBreakDownOfNode0]]] | [[IS_FIREABLE [Node7ReceiveTheLeafSetOfLxToReplaceNode1] & IS_FIREABLE [Node2AsksItsLeafSetToLxToReplaceNode4]] & ~ [IS_FIREABLE [Node8AsksItsLeafSetToLxToReplaceNode0]]]]]] & [[IS_FIREABLE [Node4AsksItsLeafSetToRxToReplaceNode6] | [[~ [IS_FIREABLE [Node2DetectsBreakDownOfNode3]] | [IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfLxToReplaceNode1] | IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode3]]] | [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode6] & ~ [IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode6]]]]] | [[[[IS_FIREABLE [Node1DetectsBreakDownOfNode4] & IS_FIREABLE [Node3AsksItsLeafSetToRxToReplaceNode5]] & [IS_FIREABLE [LxSendsItsLeafSetToNode4] & IS_FIREABLE [Node1DetectsBreakDownOfNode7]]] | ~ [IS_FIREABLE [Node0SelectsANodeOfTheLeafSetOfRxToReplaceNode7]]] | ~ [[IS_FIREABLE [Node1SelectsANodeOfTheLeafSetOfLxToReplaceNode0] | [IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode8] | IS_FIREABLE [LxReceiveARequestToSendItsLeafSetToNode4]]]]]]]]]]

-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.613sec

checking: EF [[[IS_FIREABLE [Node8AsksItsLeafSetToLxToReplaceNode0] & [[IS_FIREABLE [Node0DetectsBreakDownOfNode4] & ~ [[~ [IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfRxToReplaceNode6]] & [[[IS_FIREABLE [Node5GetTheRightToManageTheBreakDownOfNode6] | IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode5]] | [IS_FIREABLE [Node8AsksItsLeafSetToLxToReplaceNode2] | IS_FIREABLE [Node0SelectsANodeOfTheLeafSetOfRxToReplaceNode8]]] & ~ [IS_FIREABLE [Node1DetectsBreakDownOfNode3]]]]]] | [[IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode5] | [IS_FIREABLE [RxSendsItsLeafSetToNode0] | [IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode5] & [[IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode4] | IS_FIREABLE [Node4ReceiveTheLeafSetOfLxToReplaceNode2]] | [IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode7] & IS_FIREABLE [Node6DetectsBreakDownOfNode3]]]]]] & [[IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode3] | [[~ [IS_FIREABLE [Node8ReceiveTheLeafSetOfRxToReplaceNode7]] | [IS_FIREABLE [Node1SelectsANodeOfTheLeafSetOfLxToReplaceNode4] | IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode7]]] & [~ [IS_FIREABLE [Node1DetectsBreakDownOfNode2]] | IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode7]]]] | IS_FIREABLE [Node5GetTheRightToManageTheBreakDownOfNode8]]]]] & [~ [[~ [IS_FIREABLE [Node3ReceiveTheLeafSetOfRxToReplaceNode6]] & [IS_FIREABLE [Node0ReceiveTheLeafSetOfRxToReplaceNode6] | [~ [IS_FIREABLE [Node3AsksItsLeafSetToRxToReplaceNode5]] | [[IS_FIREABLE [Node7DetectsBreakDownOfNode0] & IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode3]] | [IS_FIREABLE [Node2ReceiveTheLeafSetOfRxToReplaceNode6] | IS_FIREABLE [Node5DetectsBreakDownOfNode4]]]]]]] & [[[[~ [[~ [IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode0]] & IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode1]]] & [~ [[IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode1] & IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode5]]] & IS_FIREABLE [Node2ReceiveTheLeafSetOfRxToReplaceNode7]]] & [[[[IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode8] & IS_FIREABLE [Node3DetectsBreakDownOfNode0]] | [IS_FIREABLE [Node3GetTheRightToManageTheBreakDownOfNode5] | IS_FIREABLE [Node0AsksItsLeafSetToLxToReplaceNode1]]] & ~ [[IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfRxToReplaceNode4] & IS_FIREABLE [Node5AsksItsLeafSetToLxToReplaceNode0]]]] | [[[IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode4] | IS_FIREABLE [Node1AsksItsLeafSetToRxToReplaceNode7]] & [IS_FIREABLE [Node2GetTheRightToManageTheBreakDownOfNode1] | IS_FIREABLE [Node6GetTheRightToManageTheBreakDownOfNode5]]] | ~ [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode3] | IS_FIREABLE [Node2AsksItsLeafSetToRxToReplaceNode8]]]]]] | [IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode2] | ~ [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode0]]]] & IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode7]]]]]
normalized: E [true U [[[IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode7] & [[IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode2] | ~ [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode0]]] | [[[~ [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode3] | IS_FIREABLE [Node2AsksItsLeafSetToRxToReplaceNode8]]] | [[IS_FIREABLE [Node2GetTheRightToManageTheBreakDownOfNode1] | IS_FIREABLE [Node6GetTheRightToManageTheBreakDownOfNode5]] & [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode4] | IS_FIREABLE [Node1AsksItsLeafSetToRxToReplaceNode7]]]] | [~ [[IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfRxToReplaceNode4] & IS_FIREABLE [Node5AsksItsLeafSetToLxToReplaceNode0]]] & [[IS_FIREABLE [Node3GetTheRightToManageTheBreakDownOfNode5] | IS_FIREABLE [Node0AsksItsLeafSetToLxToReplaceNode1]] | [IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode8] & IS_FIREABLE [Node3DetectsBreakDownOfNode0]]]]] & [[IS_FIREABLE [Node2ReceiveTheLeafSetOfRxToReplaceNode7] & ~ [[IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode1] & IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode5]]]] & ~ [[IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode1] & ~ [IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode0]]]]]]]] & ~ [[[IS_FIREABLE [Node0ReceiveTheLeafSetOfRxToReplaceNode6] | [[[IS_FIREABLE [Node2ReceiveTheLeafSetOfRxToReplaceNode6] | IS_FIREABLE [Node5DetectsBreakDownOfNode4]] | [IS_FIREABLE [Node7DetectsBreakDownOfNode0] & IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode3]]] | ~ [IS_FIREABLE [Node3AsksItsLeafSetToRxToReplaceNode5]]]] & ~ [IS_FIREABLE [Node3ReceiveTheLeafSetOfRxToReplaceNode6]]]]] & [IS_FIREABLE [Node8AsksItsLeafSetToLxToReplaceNode0] & [[[IS_FIREABLE [Node5GetTheRightToManageTheBreakDownOfNode8] | [IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode3] | [[IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode7] | ~ [IS_FIREABLE [Node1DetectsBreakDownOfNode2]]] & [[IS_FIREABLE [Node1SelectsANodeOfTheLeafSetOfLxToReplaceNode4] | IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfRxToReplaceNode7]] | ~ [IS_FIREABLE [Node8ReceiveTheLeafSetOfRxToReplaceNode7]]]]]] & [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode5] | [IS_FIREABLE [RxSendsItsLeafSetToNode0] | [IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode5] & [[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode7] & IS_FIREABLE [Node6DetectsBreakDownOfNode3]] | [IS_FIREABLE [Node1ReceiveTheLeafSetOfLxToReplaceNode4] | IS_FIREABLE [Node4ReceiveTheLeafSetOfLxToReplaceNode2]]]]]]] | [IS_FIREABLE [Node0DetectsBreakDownOfNode4] & ~ [[[~ [IS_FIREABLE [Node1DetectsBreakDownOfNode3]] & [[IS_FIREABLE [Node8AsksItsLeafSetToLxToReplaceNode2] | IS_FIREABLE [Node0SelectsANodeOfTheLeafSetOfRxToReplaceNode8]] | [IS_FIREABLE [Node5GetTheRightToManageTheBreakDownOfNode6] | IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode5]]]] & ~ [IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfRxToReplaceNode6]]]]]]]]]


before gc: list nodes free: 1867712

after gc: idd nodes used:4500073, unused:59499927; list nodes free:305951634
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 4.492sec

checking: AG [[[[~ [IS_FIREABLE [Node3DetectsBreakDownOfNode0]] | [[[~ [[IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode8] & IS_FIREABLE [Node7AsksItsLeafSetToRxToReplaceNode5]]] | IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfLxToReplaceNode2]] | IS_FIREABLE [Node0AsksItsLeafSetToRxToReplaceNode6]] | [[[[[IS_FIREABLE [Node7DetectsBreakDownOfNode2] & IS_FIREABLE [Node7GetTheRightToManageTheBreakDownOfNode2]] & ~ [IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode7]]] & [IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode1] | [IS_FIREABLE [Node6DetectsBreakDownOfNode4] & IS_FIREABLE [LxSendsItsLeafSetToNode1]]]] | [~ [[IS_FIREABLE [Node1AsksItsLeafSetToLxToReplaceNode4] & IS_FIREABLE [Node4BreaksDown]]] | [[IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode1] & IS_FIREABLE [Node8SelectsANodeOfTheLeafSetOfLxToReplaceNode1]] & IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode0]]]] & [IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfRxToReplaceNode6] & IS_FIREABLE [Node0ReceiveTheLeafSetOfLxToReplaceNode2]]]]] | [[[[~ [[~ [IS_FIREABLE [Node3DetectsBreakDownOfNode7]] | [IS_FIREABLE [Node8DetectsBreakDownOfNode4] | IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode6]]]] & ~ [[[IS_FIREABLE [Node5GetTheRightToManageTheBreakDownOfNode6] & IS_FIREABLE [LxSendsItsLeafSetToNode1]] & [IS_FIREABLE [Node3AsksItsLeafSetToLxToReplaceNode1] & IS_FIREABLE [LxReceiveARequestToSendItsLeafSetToNode8]]]]] & [[[~ [IS_FIREABLE [Node8DetectsBreakDownOfNode6]] & IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode2]] | ~ [IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfRxToReplaceNode8]]] & IS_FIREABLE [Node0AsksItsLeafSetToRxToReplaceNode6]]] & [IS_FIREABLE [Node0BreaksDown] | IS_FIREABLE [RxSendsItsLeafSetToNode4]]] & IS_FIREABLE [Node3AsksItsLeafSetToRxToReplaceNode5]]] | ~ [[[[~ [IS_FIREABLE [Node8BreaksDown]] | ~ [[IS_FIREABLE [LxReceiveARequestToSendItsLeafSetToNode8] | IS_FIREABLE [LxSendsItsLeafSetToNode0]]]] & ~ [[[[IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode8] & [IS_FIREABLE [Node5GetTheRightToManageTheBreakDownOfNode1] | IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode5]]] | ~ [IS_FIREABLE [Node2AsksItsLeafSetToRxToReplaceNode8]]] | [IS_FIREABLE [LxSendsItsLeafSetToNode7] | [[IS_FIREABLE [Node1DetectsBreakDownOfNode2] & IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode6]] & ~ [IS_FIREABLE [Node6DetectsBreakDownOfNode0]]]]]]] & [IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode0] | [~ [[[IS_FIREABLE [Node6ReceiveTheLeafSetOfLxToReplaceNode1] & IS_FIREABLE [Node2DetectsBreakDownOfNode3]] | [IS_FIREABLE [LxSendsItsLeafSetToNode7] & IS_FIREABLE [Node2AsksItsLeafSetToRxToReplaceNode8]]]] | [~ [IS_FIREABLE [Node8ReceiveTheLeafSetOfLxToReplaceNode3]] & [~ [IS_FIREABLE [Node2AsksItsLeafSetToLxToReplaceNode3]] & [~ [IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode5]] & IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfRxToReplaceNode7]]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode0] | [[[[IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfRxToReplaceNode7] & ~ [IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode5]]] & ~ [IS_FIREABLE [Node2AsksItsLeafSetToLxToReplaceNode3]]] & ~ [IS_FIREABLE [Node8ReceiveTheLeafSetOfLxToReplaceNode3]]] | ~ [[[IS_FIREABLE [LxSendsItsLeafSetToNode7] & IS_FIREABLE [Node2AsksItsLeafSetToRxToReplaceNode8]] | [IS_FIREABLE [Node6ReceiveTheLeafSetOfLxToReplaceNode1] & IS_FIREABLE [Node2DetectsBreakDownOfNode3]]]]]] & [~ [[[IS_FIREABLE [LxSendsItsLeafSetToNode7] | [~ [IS_FIREABLE [Node6DetectsBreakDownOfNode0]] & [IS_FIREABLE [Node1DetectsBreakDownOfNode2] & IS_FIREABLE [Node8AsksItsLeafSetToRxToReplaceNode6]]]] | [~ [IS_FIREABLE [Node2AsksItsLeafSetToRxToReplaceNode8]] | [IS_FIREABLE [Node4ReceiveTheLeafSetOfRxToReplaceNode8] & [IS_FIREABLE [Node5GetTheRightToManageTheBreakDownOfNode1] | IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode5]]]]]] & [~ [[IS_FIREABLE [LxReceiveARequestToSendItsLeafSetToNode8] | IS_FIREABLE [LxSendsItsLeafSetToNode0]]] | ~ [IS_FIREABLE [Node8BreaksDown]]]]]] | [[IS_FIREABLE [Node3AsksItsLeafSetToRxToReplaceNode5] & [[IS_FIREABLE [Node0BreaksDown] | IS_FIREABLE [RxSendsItsLeafSetToNode4]] & [[IS_FIREABLE [Node0AsksItsLeafSetToRxToReplaceNode6] & [~ [IS_FIREABLE [Node3SelectsANodeOfTheLeafSetOfRxToReplaceNode8]] | [IS_FIREABLE [Node0GetTheRightToManageTheBreakDownOfNode2] & ~ [IS_FIREABLE [Node8DetectsBreakDownOfNode6]]]]] & [~ [[[IS_FIREABLE [Node3AsksItsLeafSetToLxToReplaceNode1] & IS_FIREABLE [LxReceiveARequestToSendItsLeafSetToNode8]] & [IS_FIREABLE [Node5GetTheRightToManageTheBreakDownOfNode6] & IS_FIREABLE [LxSendsItsLeafSetToNode1]]]] & ~ [[[IS_FIREABLE [Node8DetectsBreakDownOfNode4] | IS_FIREABLE [Node1GetTheRightToManageTheBreakDownOfNode6]] | ~ [IS_FIREABLE [Node3DetectsBreakDownOfNode7]]]]]]]] | [[[[IS_FIREABLE [Node5SelectsANodeOfTheLeafSetOfRxToReplaceNode6] & IS_FIREABLE [Node0ReceiveTheLeafSetOfLxToReplaceNode2]] & [[[IS_FIREABLE [Node6AsksItsLeafSetToLxToReplaceNode0] & [IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode1] & IS_FIREABLE [Node8SelectsANodeOfTheLeafSetOfLxToReplaceNode1]]] | ~ [[IS_FIREABLE [Node1AsksItsLeafSetToLxToReplaceNode4] & IS_FIREABLE [Node4BreaksDown]]]] | [[IS_FIREABLE [Node4GetTheRightToManageTheBreakDownOfNode1] | [IS_FIREABLE [Node6DetectsBreakDownOfNode4] & IS_FIREABLE [LxSendsItsLeafSetToNode1]]] & [~ [IS_FIREABLE [Node8GetTheRightToManageTheBreakDownOfNode7]] & [IS_FIREABLE [Node7DetectsBreakDownOfNode2] & IS_FIREABLE [Node7GetTheRightToManageTheBreakDownOfNode2]]]]]] | [IS_FIREABLE [Node0AsksItsLeafSetToRxToReplaceNode6] | [IS_FIREABLE [Node4SelectsANodeOfTheLeafSetOfLxToReplaceNode2] | ~ [[IS_FIREABLE [RxReceiveARequestToSendItsLeafSetToNode8] & IS_FIREABLE [Node7AsksItsLeafSetToRxToReplaceNode5]]]]]] | ~ [IS_FIREABLE [Node3DetectsBreakDownOfNode0]]]]]]]]

-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.526sec

totally nodes used: 79033766 (7.9e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 384731680 2879797355 3264529035
used/not used/entry size/cache size: 0 67108864 16 1024MB
basic ops cache: hits/miss/sum: 83321084 555992005 639313089
used/not used/entry size/cache size: 16776887 329 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: 520508 3369088 3889596
used/not used/entry size/cache size: 0 8388608 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 52218855
1 11272373
2 2785528
3 669319
4 135837
5 23152
6 3298
7 462
8 37
9 3
>= 10 0

Total processing time: 24m29.102sec


BK_STOP 1679507185940

--------------------
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

290972 480537
iterations count:245882 (601), effective:5513 (13)

initing FirstDep: 0m 0.001sec


iterations count:1421 (3), effective:16 (0)

iterations count:1703 (4), effective:11 (0)

iterations count:1469 (3), effective:19 (0)

iterations count:1011 (2), effective:19 (0)

iterations count:1188 (2), effective:14 (0)

iterations count:1755 (4), effective:15 (0)

iterations count:1188 (2), effective:19 (0)

iterations count:1047 (2), effective:9 (0)

iterations count:2878 (7), effective:25 (0)

iterations count:7791 (19), effective:74 (0)

iterations count:825 (2), effective:7 (0)

iterations count:1060 (2), effective:11 (0)

iterations count:6054 (14), effective:67 (0)

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="LeafsetExtension-PT-S08C3"
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 LeafsetExtension-PT-S08C3, 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 r234-tall-167856420300463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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