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-167856420300462.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420300462
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C3-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679505636126

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:20:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:20:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:20:37] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-22 17:20:37] [INFO ] Transformed 462 places.
[2023-03-22 17:20:37] [INFO ] Transformed 409 transitions.
[2023-03-22 17:20:37] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 379 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 16) seen :3
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 409 rows 462 cols
[2023-03-22 17:20:39] [INFO ] Computed 53 place invariants in 35 ms
[2023-03-22 17:20:39] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 17:20:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:20:39] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-22 17:20:40] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :4
[2023-03-22 17:20:40] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :4
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-22 17:20:40] [INFO ] After 1016ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :4
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 4 different solutions.
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 13 ms.
Support contains 75 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 284 are kept as prefixes of interest. Removing 178 places using SCC suffix rule.1 ms
Discarding 178 places :
Also discarding 62 output transitions
Drop transitions removed 62 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 284 transition count 289
Reduce places removed 20 places and 0 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 1 with 31 rules applied. Total rules applied 90 place count 264 transition count 278
Reduce places removed 11 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 38 rules applied. Total rules applied 128 place count 253 transition count 251
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 155 place count 226 transition count 251
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 155 place count 226 transition count 237
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 183 place count 212 transition count 237
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 192 place count 203 transition count 228
Iterating global reduction 4 with 9 rules applied. Total rules applied 201 place count 203 transition count 228
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 210 place count 203 transition count 219
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 219 place count 194 transition count 219
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 229 place count 194 transition count 219
Applied a total of 229 rules in 72 ms. Remains 194 /462 variables (removed 268) and now considering 219/409 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 194/462 places, 219/409 transitions.
Incomplete random walk after 10000 steps, including 728 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 196 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=196 )
FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 3141 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=ReachabilityCardinality.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.758sec


RS generation: 8m51.878sec


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



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

checking: AG [Node0WantsToManageTheBreakDownOfNode1<=1]
normalized: ~ [E [true U ~ [Node0WantsToManageTheBreakDownOfNode1<=1]]]

abstracting: (Node0WantsToManageTheBreakDownOfNode1<=1)
states: 26,263,874 (7)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.235sec

checking: AG [LeafSetOfRxIsSentToNode5<=3]
normalized: ~ [E [true U ~ [LeafSetOfRxIsSentToNode5<=3]]]

abstracting: (LeafSetOfRxIsSentToNode5<=3)
states: 26,263,874 (7)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [~ [Node8HasAskedItsLeafSetToRxToReplaceNode5<=Node7ManageTheBreakDownOfNode2]]
normalized: E [true U ~ [Node8HasAskedItsLeafSetToRxToReplaceNode5<=Node7ManageTheBreakDownOfNode2]]

abstracting: (Node8HasAskedItsLeafSetToRxToReplaceNode5<=Node7ManageTheBreakDownOfNode2)
states: 25,875,069 (7)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.771sec

checking: AG [[2<=Node6HasTheLeafSetOfRxToReplaceNode8 | Node5WantsToManageTheBreakDownOfNode0<=3]]
normalized: ~ [E [true U ~ [[2<=Node6HasTheLeafSetOfRxToReplaceNode8 | Node5WantsToManageTheBreakDownOfNode0<=3]]]]

abstracting: (Node5WantsToManageTheBreakDownOfNode0<=3)
states: 26,263,874 (7)
abstracting: (2<=Node6HasTheLeafSetOfRxToReplaceNode8)
states: 0
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.323sec

checking: AG [[Node1FailureProcessedByNode5<=2 | LeafSetOfLxIsSentToNode2<=Node2FailureProcessedByNode7]]
normalized: ~ [E [true U ~ [[Node1FailureProcessedByNode5<=2 | LeafSetOfLxIsSentToNode2<=Node2FailureProcessedByNode7]]]]

abstracting: (LeafSetOfLxIsSentToNode2<=Node2FailureProcessedByNode7)
states: 25,662,224 (7)
abstracting: (Node1FailureProcessedByNode5<=2)
states: 26,263,874 (7)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.709sec

checking: AG [~ [[[Node1WantsToManageTheBreakDownOfNode2<=Node4HasAskedItsLeafSetToLxToReplaceNode0 & 3<=RequestOfNode8IsSentToRx] & ~ [[Node4WantsToManageTheBreakDownOfNode6<=Node4FailureProcessedByNode0 & [1<=Node4FailureProcessedByNode8 | ~ [[~ [2<=Node7FailureProcessedByNode5] | [Node3FailureProcessedByNode2<=Node6FailureProcessedByNode1 & Node5HasAskedItsLeafSetToRxToReplaceNode6<=3]]]]]]]]]
normalized: ~ [E [true U [~ [[Node4WantsToManageTheBreakDownOfNode6<=Node4FailureProcessedByNode0 & [1<=Node4FailureProcessedByNode8 | ~ [[~ [2<=Node7FailureProcessedByNode5] | [Node3FailureProcessedByNode2<=Node6FailureProcessedByNode1 & Node5HasAskedItsLeafSetToRxToReplaceNode6<=3]]]]]] & [Node1WantsToManageTheBreakDownOfNode2<=Node4HasAskedItsLeafSetToLxToReplaceNode0 & 3<=RequestOfNode8IsSentToRx]]]]

abstracting: (3<=RequestOfNode8IsSentToRx)
states: 7
abstracting: (Node1WantsToManageTheBreakDownOfNode2<=Node4HasAskedItsLeafSetToLxToReplaceNode0)
states: 26,133,383 (7)
abstracting: (Node5HasAskedItsLeafSetToRxToReplaceNode6<=3)
states: 26,263,874 (7)
abstracting: (Node3FailureProcessedByNode2<=Node6FailureProcessedByNode1)
states: 26,028,346 (7)
abstracting: (2<=Node7FailureProcessedByNode5)
states: 0
abstracting: (1<=Node4FailureProcessedByNode8)
states: 394,580 (5)
abstracting: (Node4WantsToManageTheBreakDownOfNode6<=Node4FailureProcessedByNode0)
states: 26,137,037 (7)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.130sec

checking: EF [~ [[[3<=Node8WantsToManageTheBreakDownOfNode2 & 1<=Node4HasAskedItsLeafSetToLxToReplaceNode1] | [~ [3<=Node5isTheNodeMaster] | ~ [[~ [[Node2HasTheLeafSetOfRxToReplaceNode8<=0 | [Node3WantsToManageTheBreakDownOfNode1<=Node7DontAnswerToAnyNode | Node5Failure<=0]]] & ~ [[[Node8ManageTheBreakDownOfNode2<=1 & 1<=Node3HasAskedItsLeafSetToLxToReplaceNode2] | [Node2ManageTheBreakDownOfNode1<=2 & Node1ManageTheBreakDownOfNode5<=0]]]]]]]]]
normalized: E [true U ~ [[[~ [[~ [[[Node8ManageTheBreakDownOfNode2<=1 & 1<=Node3HasAskedItsLeafSetToLxToReplaceNode2] | [Node2ManageTheBreakDownOfNode1<=2 & Node1ManageTheBreakDownOfNode5<=0]]] & ~ [[Node2HasTheLeafSetOfRxToReplaceNode8<=0 | [Node3WantsToManageTheBreakDownOfNode1<=Node7DontAnswerToAnyNode | Node5Failure<=0]]]]] | ~ [3<=Node5isTheNodeMaster]] | [3<=Node8WantsToManageTheBreakDownOfNode2 & 1<=Node4HasAskedItsLeafSetToLxToReplaceNode1]]]]

abstracting: (1<=Node4HasAskedItsLeafSetToLxToReplaceNode1)
states: 381,189 (5)
abstracting: (3<=Node8WantsToManageTheBreakDownOfNode2)
states: 0
abstracting: (3<=Node5isTheNodeMaster)
states: 0
abstracting: (Node5Failure<=0)
states: 17,938,166 (7)
abstracting: (Node3WantsToManageTheBreakDownOfNode1<=Node7DontAnswerToAnyNode)
states: 26,132,445 (7)
abstracting: (Node2HasTheLeafSetOfRxToReplaceNode8<=0)
states: 26,131,938 (7)
abstracting: (Node1ManageTheBreakDownOfNode5<=0)
states: 26,131,933 (7)
abstracting: (Node2ManageTheBreakDownOfNode1<=2)
states: 26,263,874 (7)
abstracting: (1<=Node3HasAskedItsLeafSetToLxToReplaceNode2)
states: 391,557 (5)
abstracting: (Node8ManageTheBreakDownOfNode2<=1)
states: 26,263,874 (7)
-> the formula is FALSE

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

MC time: 0m14.082sec

checking: AG [[[[Node3FailureProcessedByNode0<=Node6DontAnswerToAnyNode & [[[[Node1FailureProcessedByNode3<=2 | Node4FailureProcessedByNode8<=2] | [[[RequestOfNode5IsSentToLx<=0 & Node2HasTheLeafSetOfLxToReplaceNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode2] & ~ [Node2HasAskedItsLeafSetToRxToReplaceNode7<=Node1ManageTheBreakDownOfNode5]] | Node1WantsToManageTheBreakDownOfNode5<=1]] & [RequestOfNode0IsSentToRx<=2 | [[Node4HasTheLeafSetOfRxToReplaceNode5<=1 | [Node8FailureProcessedByNode2<=LxHasReceivedTheRequestOfNode4 | 1<=Node4WantsToManageTheBreakDownOfNode1]] & LeafSetOfRxIsSentToNode7<=3]]] & Node3FailureProcessedByNode6<=0]] & Node6ManageTheBreakDownOfNode3<=0] | RequestOfNode4IsSentToRx<=1]]
normalized: ~ [E [true U ~ [[RequestOfNode4IsSentToRx<=1 | [Node6ManageTheBreakDownOfNode3<=0 & [Node3FailureProcessedByNode0<=Node6DontAnswerToAnyNode & [Node3FailureProcessedByNode6<=0 & [[RequestOfNode0IsSentToRx<=2 | [LeafSetOfRxIsSentToNode7<=3 & [Node4HasTheLeafSetOfRxToReplaceNode5<=1 | [Node8FailureProcessedByNode2<=LxHasReceivedTheRequestOfNode4 | 1<=Node4WantsToManageTheBreakDownOfNode1]]]] & [[Node1WantsToManageTheBreakDownOfNode5<=1 | [~ [Node2HasAskedItsLeafSetToRxToReplaceNode7<=Node1ManageTheBreakDownOfNode5] & [RequestOfNode5IsSentToLx<=0 & Node2HasTheLeafSetOfLxToReplaceNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode2]]] | [Node1FailureProcessedByNode3<=2 | Node4FailureProcessedByNode8<=2]]]]]]]]]]

abstracting: (Node4FailureProcessedByNode8<=2)
states: 26,263,874 (7)
abstracting: (Node1FailureProcessedByNode3<=2)
states: 26,263,874 (7)
abstracting: (Node2HasTheLeafSetOfLxToReplaceNode1<=Node5HasAskedItsLeafSetToLxToReplaceNode2)
states: 26,133,407 (7)
abstracting: (RequestOfNode5IsSentToLx<=0)
states: 25,744,849 (7)
abstracting: (Node2HasAskedItsLeafSetToRxToReplaceNode7<=Node1ManageTheBreakDownOfNode5)
states: 25,873,886 (7)
abstracting: (Node1WantsToManageTheBreakDownOfNode5<=1)
states: 26,263,874 (7)
abstracting: (1<=Node4WantsToManageTheBreakDownOfNode1)
states: 128,477 (5)
abstracting: (Node8FailureProcessedByNode2<=LxHasReceivedTheRequestOfNode4)
states: 26,031,002 (7)
abstracting: (Node4HasTheLeafSetOfRxToReplaceNode5<=1)
states: 26,263,874 (7)
abstracting: (LeafSetOfRxIsSentToNode7<=3)
states: 26,263,874 (7)
abstracting: (RequestOfNode0IsSentToRx<=2)
states: 26,263,870 (7)
abstracting: (Node3FailureProcessedByNode6<=0)
states: 26,027,422 (7)
abstracting: (Node3FailureProcessedByNode0<=Node6DontAnswerToAnyNode)
states: 26,027,566 (7)
abstracting: (Node6ManageTheBreakDownOfNode3<=0)
states: 26,131,933 (7)
abstracting: (RequestOfNode4IsSentToRx<=1)
states: 26,261,042 (7)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.779sec

checking: AG [[[[~ [[[1<=RequestOfNode6IsSentToLx & [2<=Node6WantsToManageTheBreakDownOfNode7 | [Node7HasAskedItsLeafSetToLxToReplaceNode3<=2 | Node5ManageTheBreakDownOfNode4<=2]]] & [[Node0FailureProcessedByNode6<=2 & [[3<=Node3FailureProcessedByNode1 & Node6HasTheLeafSetOfRxToReplaceNode4<=LxHasReceivedTheRequestOfNode7] & ~ [Node4ManageTheBreakDownOfNode7<=2]]] | ~ [1<=Node1FailureProcessedByNode3]]]] | [~ [[~ [Node7WantsToManageTheBreakDownOfNode5<=0] | 1<=Node0ManageTheBreakDownOfNode5]] | [~ [Node5WantsToManageTheBreakDownOfNode8<=Node2WantsToManageTheBreakDownOfNode7] & [~ [Node8FailureProcessedByNode1<=3] & RequestOfNode4IsSentToLx<=1]]]] | Node3HasTheLeafSetOfRxToReplaceNode5<=Node6IsActive] & [[2<=Node1HasTheLeafSetOfRxToReplaceNode7 & Node5HasAskedItsLeafSetToLxToReplaceNode1<=Node6ManageTheBreakDownOfNode7] | ~ [1<=Node6HasAskedItsLeafSetToLxToReplaceNode2]]]]
normalized: ~ [E [true U ~ [[[~ [1<=Node6HasAskedItsLeafSetToLxToReplaceNode2] | [2<=Node1HasTheLeafSetOfRxToReplaceNode7 & Node5HasAskedItsLeafSetToLxToReplaceNode1<=Node6ManageTheBreakDownOfNode7]] & [Node3HasTheLeafSetOfRxToReplaceNode5<=Node6IsActive | [[[[RequestOfNode4IsSentToLx<=1 & ~ [Node8FailureProcessedByNode1<=3]] & ~ [Node5WantsToManageTheBreakDownOfNode8<=Node2WantsToManageTheBreakDownOfNode7]] | ~ [[1<=Node0ManageTheBreakDownOfNode5 | ~ [Node7WantsToManageTheBreakDownOfNode5<=0]]]] | ~ [[[~ [1<=Node1FailureProcessedByNode3] | [Node0FailureProcessedByNode6<=2 & [~ [Node4ManageTheBreakDownOfNode7<=2] & [3<=Node3FailureProcessedByNode1 & Node6HasTheLeafSetOfRxToReplaceNode4<=LxHasReceivedTheRequestOfNode7]]]] & [1<=RequestOfNode6IsSentToLx & [2<=Node6WantsToManageTheBreakDownOfNode7 | [Node7HasAskedItsLeafSetToLxToReplaceNode3<=2 | Node5ManageTheBreakDownOfNode4<=2]]]]]]]]]]]

abstracting: (Node5ManageTheBreakDownOfNode4<=2)
states: 26,263,874 (7)
abstracting: (Node7HasAskedItsLeafSetToLxToReplaceNode3<=2)
states: 26,263,874 (7)
abstracting: (2<=Node6WantsToManageTheBreakDownOfNode7)
states: 0
abstracting: (1<=RequestOfNode6IsSentToLx)
states: 519,025 (5)
abstracting: (Node6HasTheLeafSetOfRxToReplaceNode4<=LxHasReceivedTheRequestOfNode7)
states: 26,044,894 (7)
abstracting: (3<=Node3FailureProcessedByNode1)
states: 0
abstracting: (Node4ManageTheBreakDownOfNode7<=2)
states: 26,263,874 (7)
abstracting: (Node0FailureProcessedByNode6<=2)
states: 26,263,874 (7)
abstracting: (1<=Node1FailureProcessedByNode3)
states: 237,240 (5)
abstracting: (Node7WantsToManageTheBreakDownOfNode5<=0)
states: 26,131,949 (7)
abstracting: (1<=Node0ManageTheBreakDownOfNode5)
states: 131,941 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode8<=Node2WantsToManageTheBreakDownOfNode7)
states: 26,132,437 (7)
abstracting: (Node8FailureProcessedByNode1<=3)
states: 26,263,874 (7)
abstracting: (RequestOfNode4IsSentToLx<=1)
states: 26,261,042 (7)
abstracting: (Node3HasTheLeafSetOfRxToReplaceNode5<=Node6IsActive)
states: 26,232,627 (7)
abstracting: (Node5HasAskedItsLeafSetToLxToReplaceNode1<=Node6ManageTheBreakDownOfNode7)
states: 25,873,883 (7)
abstracting: (2<=Node1HasTheLeafSetOfRxToReplaceNode7)
states: 0
abstracting: (1<=Node6HasAskedItsLeafSetToLxToReplaceNode2)
states: 391,446 (5)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.617sec

checking: AG [~ [[2<=Node6WantsToManageTheBreakDownOfNode2 & [3<=Node8HasAskedItsLeafSetToLxToReplaceNode1 | [~ [1<=Node7HasAskedItsLeafSetToRxToReplaceNode4] & [[[[[3<=Node5WantsToManageTheBreakDownOfNode2 | 3<=Node6WantsToManageTheBreakDownOfNode8] & [2<=Node7ManageTheBreakDownOfNode0 | Node6FailureProcessedByNode5<=1]] & [[2<=Node3ManageTheBreakDownOfNode6 | Node8HasAskedItsLeafSetToRxToReplaceNode7<=1] & Node0HasTheLeafSetOfLxToReplaceNode2<=Node8Failure]] & [Node6Failure<=3 | [[Node4HasTheLeafSetOfLxToReplaceNode0<=2 & 2<=Node5ManageTheBreakDownOfNode8] | [Node1ManageTheBreakDownOfNode8<=Node4ManageTheBreakDownOfNode5 & 2<=Node2HasAskedItsLeafSetToRxToReplaceNode8]]]] & [~ [[Node0WantsToManageTheBreakDownOfNode1<=Node8ManageTheBreakDownOfNode5 & 1<=Node6HasTheLeafSetOfLxToReplaceNode1]] & [1<=RxHasReceivedTheRequestOfNode6 & ~ [[RxHasReceivedTheRequestOfNode7<=Node8DontAnswerToAnyNode | 1<=Node4HasTheLeafSetOfRxToReplaceNode5]]]]]]]]]]
normalized: ~ [E [true U [2<=Node6WantsToManageTheBreakDownOfNode2 & [3<=Node8HasAskedItsLeafSetToLxToReplaceNode1 | [[[[1<=RxHasReceivedTheRequestOfNode6 & ~ [[RxHasReceivedTheRequestOfNode7<=Node8DontAnswerToAnyNode | 1<=Node4HasTheLeafSetOfRxToReplaceNode5]]] & ~ [[Node0WantsToManageTheBreakDownOfNode1<=Node8ManageTheBreakDownOfNode5 & 1<=Node6HasTheLeafSetOfLxToReplaceNode1]]] & [[Node6Failure<=3 | [[Node1ManageTheBreakDownOfNode8<=Node4ManageTheBreakDownOfNode5 & 2<=Node2HasAskedItsLeafSetToRxToReplaceNode8] | [Node4HasTheLeafSetOfLxToReplaceNode0<=2 & 2<=Node5ManageTheBreakDownOfNode8]]] & [[Node0HasTheLeafSetOfLxToReplaceNode2<=Node8Failure & [2<=Node3ManageTheBreakDownOfNode6 | Node8HasAskedItsLeafSetToRxToReplaceNode7<=1]] & [[2<=Node7ManageTheBreakDownOfNode0 | Node6FailureProcessedByNode5<=1] & [3<=Node5WantsToManageTheBreakDownOfNode2 | 3<=Node6WantsToManageTheBreakDownOfNode8]]]]] & ~ [1<=Node7HasAskedItsLeafSetToRxToReplaceNode4]]]]]]

abstracting: (1<=Node7HasAskedItsLeafSetToRxToReplaceNode4)
states: 659,532 (5)
abstracting: (3<=Node6WantsToManageTheBreakDownOfNode8)
states: 0
abstracting: (3<=Node5WantsToManageTheBreakDownOfNode2)
states: 0
abstracting: (Node6FailureProcessedByNode5<=1)
states: 26,263,874 (7)
abstracting: (2<=Node7ManageTheBreakDownOfNode0)
states: 0
abstracting: (Node8HasAskedItsLeafSetToRxToReplaceNode7<=1)
states: 26,263,874 (7)
abstracting: (2<=Node3ManageTheBreakDownOfNode6)
states: 0
abstracting: (Node0HasTheLeafSetOfLxToReplaceNode2<=Node8Failure)
states: 26,163,049 (7)
abstracting: (2<=Node5ManageTheBreakDownOfNode8)
states: 0
abstracting: (Node4HasTheLeafSetOfLxToReplaceNode0<=2)
states: 26,263,874 (7)
abstracting: (2<=Node2HasAskedItsLeafSetToRxToReplaceNode8)
states: 0
abstracting: (Node1ManageTheBreakDownOfNode8<=Node4ManageTheBreakDownOfNode5)
states: 26,132,426 (7)
abstracting: (Node6Failure<=3)
states: 26,263,874 (7)
abstracting: (1<=Node6HasTheLeafSetOfLxToReplaceNode1)
states: 131,936 (5)
abstracting: (Node0WantsToManageTheBreakDownOfNode1<=Node8ManageTheBreakDownOfNode5)
states: 26,132,437 (7)
abstracting: (1<=Node4HasTheLeafSetOfRxToReplaceNode5)
states: 131,947 (5)
abstracting: (RxHasReceivedTheRequestOfNode7<=Node8DontAnswerToAnyNode)
states: 25,659,710 (7)
abstracting: (1<=RxHasReceivedTheRequestOfNode6)
states: 606,032 (5)
abstracting: (3<=Node8HasAskedItsLeafSetToLxToReplaceNode1)
states: 0
abstracting: (2<=Node6WantsToManageTheBreakDownOfNode2)
states: 0
-> the formula is TRUE

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

MC time: 0m18.828sec

checking: AG [[Node7HasTheLeafSetOfLxToReplaceNode2<=Node3HasTheLeafSetOfLxToReplaceNode1 | [[Node7HasTheLeafSetOfRxToReplaceNode5<=Node2WantsToManageTheBreakDownOfNode6 & ~ [1<=Node8WantsToManageTheBreakDownOfNode0]] | [[[Node4HasTheLeafSetOfRxToReplaceNode8<=Node4WantsToManageTheBreakDownOfNode5 | [[[[Node7HasTheLeafSetOfRxToReplaceNode4<=Node4HasAskedItsLeafSetToLxToReplaceNode1 | Node7HasTheLeafSetOfRxToReplaceNode5<=Node4WantsToManageTheBreakDownOfNode7] & 1<=Node3FailureProcessedByNode5] & [~ [2<=LeafSetOfRxIsSentToNode1] | ~ [1<=Node7HasTheLeafSetOfLxToReplaceNode1]]] & Node3HasAskedItsLeafSetToLxToReplaceNode0<=Node8FailureProcessedByNode0]] & ~ [Node2WantsToManageTheBreakDownOfNode5<=3]] | [1<=Node2ManageTheBreakDownOfNode8 & ~ [[[[[Node7FailureProcessedByNode6<=Node3FailureProcessedByNode4 | Node7FailureProcessedByNode4<=Node5HasAskedItsLeafSetToLxToReplaceNode2] | [3<=RightNodeHasDetectedBreakDownOfMaster | 3<=Node1FailureProcessedByNode3]] & [[1<=Node5WantsToManageTheBreakDownOfNode6 | 2<=Node2WantsToManageTheBreakDownOfNode1] & [2<=Node5HasAskedItsLeafSetToLxToReplaceNode0 & Node6ManageTheBreakDownOfNode3<=RequestOfNode7IsSentToLx]]] | 1<=Node6FailureProcessedByNode0]]]]]]]
normalized: ~ [E [true U ~ [[Node7HasTheLeafSetOfLxToReplaceNode2<=Node3HasTheLeafSetOfLxToReplaceNode1 | [[[~ [Node2WantsToManageTheBreakDownOfNode5<=3] & [Node4HasTheLeafSetOfRxToReplaceNode8<=Node4WantsToManageTheBreakDownOfNode5 | [Node3HasAskedItsLeafSetToLxToReplaceNode0<=Node8FailureProcessedByNode0 & [[~ [1<=Node7HasTheLeafSetOfLxToReplaceNode1] | ~ [2<=LeafSetOfRxIsSentToNode1]] & [1<=Node3FailureProcessedByNode5 & [Node7HasTheLeafSetOfRxToReplaceNode4<=Node4HasAskedItsLeafSetToLxToReplaceNode1 | Node7HasTheLeafSetOfRxToReplaceNode5<=Node4WantsToManageTheBreakDownOfNode7]]]]]] | [1<=Node2ManageTheBreakDownOfNode8 & ~ [[1<=Node6FailureProcessedByNode0 | [[[3<=RightNodeHasDetectedBreakDownOfMaster | 3<=Node1FailureProcessedByNode3] | [Node7FailureProcessedByNode6<=Node3FailureProcessedByNode4 | Node7FailureProcessedByNode4<=Node5HasAskedItsLeafSetToLxToReplaceNode2]] & [[2<=Node5HasAskedItsLeafSetToLxToReplaceNode0 & Node6ManageTheBreakDownOfNode3<=RequestOfNode7IsSentToLx] & [1<=Node5WantsToManageTheBreakDownOfNode6 | 2<=Node2WantsToManageTheBreakDownOfNode1]]]]]]] | [Node7HasTheLeafSetOfRxToReplaceNode5<=Node2WantsToManageTheBreakDownOfNode6 & ~ [1<=Node8WantsToManageTheBreakDownOfNode0]]]]]]]

abstracting: (1<=Node8WantsToManageTheBreakDownOfNode0)
states: 131,936 (5)
abstracting: (Node7HasTheLeafSetOfRxToReplaceNode5<=Node2WantsToManageTheBreakDownOfNode6)
states: 26,132,437 (7)
abstracting: (2<=Node2WantsToManageTheBreakDownOfNode1)
states: 0
abstracting: (1<=Node5WantsToManageTheBreakDownOfNode6)
states: 131,925 (5)
abstracting: (Node6ManageTheBreakDownOfNode3<=RequestOfNode7IsSentToLx)
states: 26,133,388 (7)
abstracting: (2<=Node5HasAskedItsLeafSetToLxToReplaceNode0)
states: 0
abstracting: (Node7FailureProcessedByNode4<=Node5HasAskedItsLeafSetToLxToReplaceNode2)
states: 26,035,196 (7)
abstracting: (Node7FailureProcessedByNode6<=Node3FailureProcessedByNode4)
states: 26,028,346 (7)
abstracting: (3<=Node1FailureProcessedByNode3)
states: 0
abstracting: (3<=RightNodeHasDetectedBreakDownOfMaster)
states: 0
abstracting: (1<=Node6FailureProcessedByNode0)
states: 236,432 (5)
abstracting: (1<=Node2ManageTheBreakDownOfNode8)
states: 131,936 (5)
abstracting: (Node7HasTheLeafSetOfRxToReplaceNode5<=Node4WantsToManageTheBreakDownOfNode7)
states: 26,132,429 (7)
abstracting: (Node7HasTheLeafSetOfRxToReplaceNode4<=Node4HasAskedItsLeafSetToLxToReplaceNode1)
states: 26,044,032 (7)
abstracting: (1<=Node3FailureProcessedByNode5)
states: 236,452 (5)
abstracting: (2<=LeafSetOfRxIsSentToNode1)
states: 2,904 (3)
abstracting: (1<=Node7HasTheLeafSetOfLxToReplaceNode1)
states: 131,936 (5)
abstracting: (Node3HasAskedItsLeafSetToLxToReplaceNode0<=Node8FailureProcessedByNode0)
states: 25,875,041 (7)
abstracting: (Node4HasTheLeafSetOfRxToReplaceNode8<=Node4WantsToManageTheBreakDownOfNode5)
states: 26,135,877 (7)
abstracting: (Node2WantsToManageTheBreakDownOfNode5<=3)
states: 26,263,874 (7)
abstracting: (Node7HasTheLeafSetOfLxToReplaceNode2<=Node3HasTheLeafSetOfLxToReplaceNode1)
states: 26,132,426 (7)
-> the formula is FALSE

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

MC time: 0m28.797sec

checking: AG [[[[[~ [[Node5ManageTheBreakDownOfNode3<=Node0ManageTheBreakDownOfNode8 & [[RxHasReceivedTheRequestOfNode4<=0 | Node0FailureProcessedByNode8<=2] & 2<=Node2FailureProcessedByNode8]]] & ~ [LeafSetOfRxIsSentToNode2<=LxHasReceivedTheRequestOfNode3]] | [1<=Node5ManageTheBreakDownOfNode8 | 2<=Node0ManageTheBreakDownOfNode3]] | [[[~ [[[Node3HasTheLeafSetOfLxToReplaceNode1<=3 | RequestOfNode2IsSentToRx<=3] & [Node6HasTheLeafSetOfLxToReplaceNode1<=2 & 3<=Node7WantsToManageTheBreakDownOfNode2]]] & [~ [[ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet<=Node2DontAnswerToAnyNode & [Node5Failure<=LxHasReceivedTheRequestOfNode1 | 1<=Node0HasAskedItsLeafSetToRxToReplaceNode6]]] | [[Node3Failure<=3 & [Node1ManageTheBreakDownOfNode0<=3 & Node1ManageTheBreakDownOfNode8<=BreakDownReservoir]] | ~ [[1<=Node0ManageTheBreakDownOfNode3 & 3<=NoNodeManageTheBreakDownOfNode3]]]]] | Node6HasAskedItsLeafSetToLxToReplaceNode0<=Node2HasAskedItsLeafSetToRxToReplaceNode6] | [~ [Node6FailureProcessedByNode4<=1] | Node8HasAskedItsLeafSetToRxToReplaceNode4<=Node2ManageTheBreakDownOfNode3]]] & Node5FailureProcessedByNode7<=Node5DontAnswerToAnyNode]]
normalized: ~ [E [true U ~ [[Node5FailureProcessedByNode7<=Node5DontAnswerToAnyNode & [[[Node8HasAskedItsLeafSetToRxToReplaceNode4<=Node2ManageTheBreakDownOfNode3 | ~ [Node6FailureProcessedByNode4<=1]] | [Node6HasAskedItsLeafSetToLxToReplaceNode0<=Node2HasAskedItsLeafSetToRxToReplaceNode6 | [[[~ [[1<=Node0ManageTheBreakDownOfNode3 & 3<=NoNodeManageTheBreakDownOfNode3]] | [Node3Failure<=3 & [Node1ManageTheBreakDownOfNode0<=3 & Node1ManageTheBreakDownOfNode8<=BreakDownReservoir]]] | ~ [[ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet<=Node2DontAnswerToAnyNode & [Node5Failure<=LxHasReceivedTheRequestOfNode1 | 1<=Node0HasAskedItsLeafSetToRxToReplaceNode6]]]] & ~ [[[Node6HasTheLeafSetOfLxToReplaceNode1<=2 & 3<=Node7WantsToManageTheBreakDownOfNode2] & [Node3HasTheLeafSetOfLxToReplaceNode1<=3 | RequestOfNode2IsSentToRx<=3]]]]]] | [[1<=Node5ManageTheBreakDownOfNode8 | 2<=Node0ManageTheBreakDownOfNode3] | [~ [LeafSetOfRxIsSentToNode2<=LxHasReceivedTheRequestOfNode3] & ~ [[Node5ManageTheBreakDownOfNode3<=Node0ManageTheBreakDownOfNode8 & [2<=Node2FailureProcessedByNode8 & [RxHasReceivedTheRequestOfNode4<=0 | Node0FailureProcessedByNode8<=2]]]]]]]]]]]

abstracting: (Node0FailureProcessedByNode8<=2)
states: 26,263,874 (7)
abstracting: (RxHasReceivedTheRequestOfNode4<=0)
states: 25,755,004 (7)
abstracting: (2<=Node2FailureProcessedByNode8)
states: 0
abstracting: (Node5ManageTheBreakDownOfNode3<=Node0ManageTheBreakDownOfNode8)
states: 26,132,421 (7)
abstracting: (LeafSetOfRxIsSentToNode2<=LxHasReceivedTheRequestOfNode3)
states: 25,752,297 (7)
abstracting: (2<=Node0ManageTheBreakDownOfNode3)
states: 0
abstracting: (1<=Node5ManageTheBreakDownOfNode8)
states: 131,925 (5)
abstracting: (RequestOfNode2IsSentToRx<=3)
states: 26,263,874 (7)
abstracting: (Node3HasTheLeafSetOfLxToReplaceNode1<=3)
states: 26,263,874 (7)
abstracting: (3<=Node7WantsToManageTheBreakDownOfNode2)
states: 0
abstracting: (Node6HasTheLeafSetOfLxToReplaceNode1<=2)
states: 26,263,874 (7)
abstracting: (1<=Node0HasAskedItsLeafSetToRxToReplaceNode6)
states: 391,446 (5)
abstracting: (Node5Failure<=LxHasReceivedTheRequestOfNode1)
states: 18,086,222 (7)
abstracting: (ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet<=Node2DontAnswerToAnyNode)
states: 21,811,168 (7)
abstracting: (Node1ManageTheBreakDownOfNode8<=BreakDownReservoir)
states: 26,132,499 (7)
abstracting: (Node1ManageTheBreakDownOfNode0<=3)
states: 26,263,874 (7)
abstracting: (Node3Failure<=3)
states: 26,263,874 (7)
abstracting: (3<=NoNodeManageTheBreakDownOfNode3)
states: 0
abstracting: (1<=Node0ManageTheBreakDownOfNode3)
states: 131,925 (5)
abstracting: (Node6HasAskedItsLeafSetToLxToReplaceNode0<=Node2HasAskedItsLeafSetToRxToReplaceNode6)
states: 25,876,775 (7)
abstracting: (Node6FailureProcessedByNode4<=1)
states: 26,263,874 (7)
abstracting: (Node8HasAskedItsLeafSetToRxToReplaceNode4<=Node2ManageTheBreakDownOfNode3)
states: 25,606,964 (7)
abstracting: (Node5FailureProcessedByNode7<=Node5DontAnswerToAnyNode)
states: 26,026,634 (7)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m21.164sec

checking: AG [[Node8ManageTheBreakDownOfNode0<=3 | [1<=Node1WantsToManageTheBreakDownOfNode5 | [[[[~ [[Node4IsActive<=1 & 2<=Node6WantsToManageTheBreakDownOfNode2]] & [Node0HasTheLeafSetOfLxToReplaceNode3<=2 | [[Node5WantsToManageTheBreakDownOfNode2<=RequestOfNode7IsSentToRx & Node1HasAskedItsLeafSetToLxToReplaceNode3<=2] | [Node7ManageTheBreakDownOfNode3<=1 & Node0HasTheLeafSetOfRxToReplaceNode7<=3]]]] & ~ [[[[3<=RequestOfNode1IsSentToRx & LeafSetOfRxIsSentToNode5<=Node1Failure] | [Node3WantsToManageTheBreakDownOfNode0<=Node0WantsToManageTheBreakDownOfNode2 | 3<=Node4HasAskedItsLeafSetToLxToReplaceNode0]] & [2<=Node5HasAskedItsLeafSetToLxToReplaceNode2 | [3<=Node8WantsToManageTheBreakDownOfNode3 & Node8IsActive<=Node4WantsToManageTheBreakDownOfNode5]]]]] | [[[[~ [LeafSetOfRxIsSentToNode7<=Node0ManageTheBreakDownOfNode5] | ~ [Node5WantsToManageTheBreakDownOfNode7<=Node0WantsToManageTheBreakDownOfNode4]] & [[LxHasReceivedTheRequestOfNode0<=Node2ManageTheBreakDownOfNode3 & Node0WantsToManageTheBreakDownOfNode4<=2] | Node8ManageTheBreakDownOfNode5<=3]] & ~ [[Node4WantsToManageTheBreakDownOfNode3<=0 & 1<=Node2ManageTheBreakDownOfNode1]]] | 1<=Node8DontAnswerToAnyNode]] & Node5WantsToManageTheBreakDownOfNode7<=Node0IsActive]]]]
normalized: ~ [E [true U ~ [[Node8ManageTheBreakDownOfNode0<=3 | [1<=Node1WantsToManageTheBreakDownOfNode5 | [Node5WantsToManageTheBreakDownOfNode7<=Node0IsActive & [[1<=Node8DontAnswerToAnyNode | [[[Node8ManageTheBreakDownOfNode5<=3 | [LxHasReceivedTheRequestOfNode0<=Node2ManageTheBreakDownOfNode3 & Node0WantsToManageTheBreakDownOfNode4<=2]] & [~ [Node5WantsToManageTheBreakDownOfNode7<=Node0WantsToManageTheBreakDownOfNode4] | ~ [LeafSetOfRxIsSentToNode7<=Node0ManageTheBreakDownOfNode5]]] & ~ [[Node4WantsToManageTheBreakDownOfNode3<=0 & 1<=Node2ManageTheBreakDownOfNode1]]]] | [~ [[[[Node3WantsToManageTheBreakDownOfNode0<=Node0WantsToManageTheBreakDownOfNode2 | 3<=Node4HasAskedItsLeafSetToLxToReplaceNode0] | [3<=RequestOfNode1IsSentToRx & LeafSetOfRxIsSentToNode5<=Node1Failure]] & [2<=Node5HasAskedItsLeafSetToLxToReplaceNode2 | [3<=Node8WantsToManageTheBreakDownOfNode3 & Node8IsActive<=Node4WantsToManageTheBreakDownOfNode5]]]] & [~ [[Node4IsActive<=1 & 2<=Node6WantsToManageTheBreakDownOfNode2]] & [Node0HasTheLeafSetOfLxToReplaceNode3<=2 | [[Node7ManageTheBreakDownOfNode3<=1 & Node0HasTheLeafSetOfRxToReplaceNode7<=3] | [Node5WantsToManageTheBreakDownOfNode2<=RequestOfNode7IsSentToRx & Node1HasAskedItsLeafSetToLxToReplaceNode3<=2]]]]]]]]]]]]

abstracting: (Node1HasAskedItsLeafSetToLxToReplaceNode3<=2)
states: 26,263,874 (7)
abstracting: (Node5WantsToManageTheBreakDownOfNode2<=RequestOfNode7IsSentToRx)
states: 26,134,255 (7)
abstracting: (Node0HasTheLeafSetOfRxToReplaceNode7<=3)
states: 26,263,874 (7)
abstracting: (Node7ManageTheBreakDownOfNode3<=1)
states: 26,263,874 (7)
abstracting: (Node0HasTheLeafSetOfLxToReplaceNode3<=2)
states: 26,263,874 (7)
abstracting: (2<=Node6WantsToManageTheBreakDownOfNode2)
states: 0
abstracting: (Node4IsActive<=1)
states: 26,263,874 (7)
abstracting: (Node8IsActive<=Node4WantsToManageTheBreakDownOfNode5)
states: 8,400,996 (6)
abstracting: (3<=Node8WantsToManageTheBreakDownOfNode3)
states: 0
abstracting: (2<=Node5HasAskedItsLeafSetToLxToReplaceNode2)
states: 0
abstracting: (LeafSetOfRxIsSentToNode5<=Node1Failure)
states: 25,885,066 (7)
abstracting: (3<=RequestOfNode1IsSentToRx)
states: 4
abstracting: (3<=Node4HasAskedItsLeafSetToLxToReplaceNode0)
states: 0
abstracting: (Node3WantsToManageTheBreakDownOfNode0<=Node0WantsToManageTheBreakDownOfNode2)
states: 26,132,437 (7)
abstracting: (1<=Node2ManageTheBreakDownOfNode1)
states: 131,925 (5)
abstracting: (Node4WantsToManageTheBreakDownOfNode3<=0)
states: 26,131,927 (7)
abstracting: (LeafSetOfRxIsSentToNode7<=Node0ManageTheBreakDownOfNode5)
states: 25,659,678 (7)
abstracting: (Node5WantsToManageTheBreakDownOfNode7<=Node0WantsToManageTheBreakDownOfNode4)
states: 26,132,829 (7)
abstracting: (Node0WantsToManageTheBreakDownOfNode4<=2)
states: 26,263,874 (7)
abstracting: (LxHasReceivedTheRequestOfNode0<=Node2ManageTheBreakDownOfNode3)
states: 25,659,678 (7)
abstracting: (Node8ManageTheBreakDownOfNode5<=3)
states: 26,263,874 (7)
abstracting: (1<=Node8DontAnswerToAnyNode)
states: 136,403 (5)
abstracting: (Node5WantsToManageTheBreakDownOfNode7<=Node0IsActive)
states: 26,232,774 (7)
abstracting: (1<=Node1WantsToManageTheBreakDownOfNode5)
states: 131,941 (5)
abstracting: (Node8ManageTheBreakDownOfNode0<=3)
states: 26,263,874 (7)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.252sec

checking: EF [~ [[Node4HasTheLeafSetOfRxToReplaceNode8<=Node6HasTheLeafSetOfRxToReplaceNode4 | [[RequestOfNode1IsSentToRx<=2 | [[~ [[[Node7IsActive<=3 | Node4FailureProcessedByNode5<=Node7ManageTheBreakDownOfNode3] | ~ [Node8HasAskedItsLeafSetToLxToReplaceNode0<=Node6ManageTheBreakDownOfNode1]]] & ~ [2<=Node0ManageTheBreakDownOfNode8]] | [[1<=Node6FailureProcessedByNode1 & Node2FailureProcessedByNode6<=Node8FailureProcessedByNode0] & ~ [1<=Node0WantsToManageTheBreakDownOfNode6]]]] & [[Node6WantsToManageTheBreakDownOfNode5<=2 & [Node8WantsToManageTheBreakDownOfNode6<=Node5ManageTheBreakDownOfNode6 | [LeafSetOfLxIsSentToNode8<=Node7WantsToManageTheBreakDownOfNode2 | [[Node7HasTheLeafSetOfLxToReplaceNode3<=Node4FailureProcessedByNode5 | 3<=NoNodeManageTheBreakDownOfNode3] & ~ [RequestOfNode3IsSentToRx<=0]]]]] | [Node0HasAskedItsLeafSetToLxToReplaceNode1<=Node8FailureProcessedByNode7 | [[~ [1<=Node2FailureProcessedByNode8] | ~ [[1<=Node2HasAskedItsLeafSetToRxToReplaceNode6 | Node0Failure<=Node4ManageTheBreakDownOfNode2]]] & ~ [[[Node2HasTheLeafSetOfRxToReplaceNode7<=LxHasReceivedTheRequestOfNode5 & 1<=Node2HasAskedItsLeafSetToLxToReplaceNode3] | [Node3isTheNodeMaster<=Node1FailureProcessedByNode6 | Node1FailureProcessedByNode3<=3]]]]]]]]]]
normalized: E [true U ~ [[Node4HasTheLeafSetOfRxToReplaceNode8<=Node6HasTheLeafSetOfRxToReplaceNode4 | [[[Node0HasAskedItsLeafSetToLxToReplaceNode1<=Node8FailureProcessedByNode7 | [~ [[[Node2HasTheLeafSetOfRxToReplaceNode7<=LxHasReceivedTheRequestOfNode5 & 1<=Node2HasAskedItsLeafSetToLxToReplaceNode3] | [Node3isTheNodeMaster<=Node1FailureProcessedByNode6 | Node1FailureProcessedByNode3<=3]]] & [~ [[1<=Node2HasAskedItsLeafSetToRxToReplaceNode6 | Node0Failure<=Node4ManageTheBreakDownOfNode2]] | ~ [1<=Node2FailureProcessedByNode8]]]] | [Node6WantsToManageTheBreakDownOfNode5<=2 & [Node8WantsToManageTheBreakDownOfNode6<=Node5ManageTheBreakDownOfNode6 | [LeafSetOfLxIsSentToNode8<=Node7WantsToManageTheBreakDownOfNode2 | [~ [RequestOfNode3IsSentToRx<=0] & [Node7HasTheLeafSetOfLxToReplaceNode3<=Node4FailureProcessedByNode5 | 3<=NoNodeManageTheBreakDownOfNode3]]]]]] & [RequestOfNode1IsSentToRx<=2 | [[~ [1<=Node0WantsToManageTheBreakDownOfNode6] & [1<=Node6FailureProcessedByNode1 & Node2FailureProcessedByNode6<=Node8FailureProcessedByNode0]] | [~ [2<=Node0ManageTheBreakDownOfNode8] & ~ [[~ [Node8HasAskedItsLeafSetToLxToReplaceNode0<=Node6ManageTheBreakDownOfNode1] | [Node7IsActive<=3 | Node4FailureProcessedByNode5<=Node7ManageTheBreakDownOfNode3]]]]]]]]]]

abstracting: (Node4FailureProcessedByNode5<=Node7ManageTheBreakDownOfNode3)
states: 26,067,404 (7)
abstracting: (Node7IsActive<=3)
states: 26,263,874 (7)
abstracting: (Node8HasAskedItsLeafSetToLxToReplaceNode0<=Node6ManageTheBreakDownOfNode1)
states: 25,873,886 (7)
abstracting: (2<=Node0ManageTheBreakDownOfNode8)
states: 0
abstracting: (Node2FailureProcessedByNode6<=Node8FailureProcessedByNode0)
states: 26,029,154 (7)
abstracting: (1<=Node6FailureProcessedByNode1)
states: 236,432 (5)
abstracting: (1<=Node0WantsToManageTheBreakDownOfNode6)
states: 131,936 (5)
abstracting: (RequestOfNode1IsSentToRx<=2)
states: 26,263,870 (7)
abstracting: (3<=NoNodeManageTheBreakDownOfNode3)
states: 0
abstracting: (Node7HasTheLeafSetOfLxToReplaceNode3<=Node4FailureProcessedByNode5)
states: 26,132,753 (7)
abstracting: (RequestOfNode3IsSentToRx<=0)
states: 25,744,849 (7)
abstracting: (LeafSetOfLxIsSentToNode8<=Node7WantsToManageTheBreakDownOfNode2)
states: 25,746,301 (7)
abstracting: (Node8WantsToManageTheBreakDownOfNode6<=Node5ManageTheBreakDownOfNode6)
states: 26,131,949 (7)
abstracting: (Node6WantsToManageTheBreakDownOfNode5<=2)
states: 26,263,874 (7)
abstracting: (1<=Node2FailureProcessedByNode8)
states: 236,432 (5)
abstracting: (Node0Failure<=Node4ManageTheBreakDownOfNode2)
states: 17,994,324 (7)
abstracting: (1<=Node2HasAskedItsLeafSetToRxToReplaceNode6)
states: 391,446 (5)
abstracting: (Node1FailureProcessedByNode3<=3)
states: 26,263,874 (7)
abstracting: (Node3isTheNodeMaster<=Node1FailureProcessedByNode6)
states: 22,954,548 (7)
abstracting: (1<=Node2HasAskedItsLeafSetToLxToReplaceNode3)
states: 390,257 (5)
abstracting: (Node2HasTheLeafSetOfRxToReplaceNode7<=LxHasReceivedTheRequestOfNode5)
states: 26,133,872 (7)
abstracting: (Node0HasAskedItsLeafSetToLxToReplaceNode1<=Node8FailureProcessedByNode7)
states: 25,876,341 (7)
abstracting: (Node4HasTheLeafSetOfRxToReplaceNode8<=Node6HasTheLeafSetOfRxToReplaceNode4)
states: 26,136,277 (7)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.633sec

checking: AG [[[[[[[[[[Node0WantsToManageTheBreakDownOfNode2<=NoNodeManageTheBreakDownOfNode5 & Node1HasTheLeafSetOfLxToReplaceNode2<=RequestOfNode8IsSentToLx] | [1<=Node1ManageTheBreakDownOfNode2 | Node2WantsToManageTheBreakDownOfNode6<=1]] & [Node3HasTheLeafSetOfRxToReplaceNode6<=1 & Node0ManageTheBreakDownOfNode4<=3]] & Node7WantsToManageTheBreakDownOfNode0<=2] | [RequestOfNode3IsSentToRx<=2 | [[~ [Node2HasTheLeafSetOfLxToReplaceNode4<=Node4IsActive] | ~ [Node7ManageTheBreakDownOfNode6<=2]] | ~ [Node3WantsToManageTheBreakDownOfNode0<=1]]]] | [[~ [[~ [Node7WantsToManageTheBreakDownOfNode5<=LeafSetOfLxIsSentToNode4] | ~ [Node5HasTheLeafSetOfRxToReplaceNode8<=2]]] & Node8HasTheLeafSetOfLxToReplaceNode0<=Node8ManageTheBreakDownOfNode0] & Node2HasTheLeafSetOfLxToReplaceNode1<=Node4ManageTheBreakDownOfNode7]] & Node4ManageTheBreakDownOfNode8<=Node1FailureProcessedByNode3] & Node7WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode4] | [~ [[[[Node3ManageTheBreakDownOfNode2<=0 | [3<=Node4WantsToManageTheBreakDownOfNode2 & [~ [RequestOfNode8IsSentToLx<=3] & ~ [Node0Failure<=Node1WantsToManageTheBreakDownOfNode8]]]] & ~ [[1<=NoNodeManageTheBreakDownOfNode1 & Node3WantsToManageTheBreakDownOfNode1<=Node7IsActive]]] | [[[[[3<=Node8DontAnswerToAnyNode & 1<=Node6ManageTheBreakDownOfNode2] | 2<=Node5WantsToManageTheBreakDownOfNode7] & [~ [Node8WantsToManageTheBreakDownOfNode1<=2] | [Node3WantsToManageTheBreakDownOfNode4<=Node6HasAskedItsLeafSetToLxToReplaceNode3 | Node2HasAskedItsLeafSetToRxToReplaceNode7<=Node1ManageTheBreakDownOfNode3]]] & ~ [Node1FailureProcessedByNode7<=Node0WantsToManageTheBreakDownOfNode3]] | 2<=Node4WantsToManageTheBreakDownOfNode6]]] | [[Node8HasTheLeafSetOfRxToReplaceNode4<=NoNodeManageTheBreakDownOfNode4 | ~ [[~ [[1<=Node0FailureProcessedByNode8 | RxHasReceivedTheRequestOfNode4<=2]] & 2<=Node7WantsToManageTheBreakDownOfNode0]]] & [Node3WantsToManageTheBreakDownOfNode1<=Node7HasTheLeafSetOfLxToReplaceNode2 | 2<=Node6WantsToManageTheBreakDownOfNode5]]]]]
normalized: ~ [E [true U ~ [[[[[Node8HasTheLeafSetOfRxToReplaceNode4<=NoNodeManageTheBreakDownOfNode4 | ~ [[2<=Node7WantsToManageTheBreakDownOfNode0 & ~ [[1<=Node0FailureProcessedByNode8 | RxHasReceivedTheRequestOfNode4<=2]]]]] & [Node3WantsToManageTheBreakDownOfNode1<=Node7HasTheLeafSetOfLxToReplaceNode2 | 2<=Node6WantsToManageTheBreakDownOfNode5]] | ~ [[[2<=Node4WantsToManageTheBreakDownOfNode6 | [[[[Node3WantsToManageTheBreakDownOfNode4<=Node6HasAskedItsLeafSetToLxToReplaceNode3 | Node2HasAskedItsLeafSetToRxToReplaceNode7<=Node1ManageTheBreakDownOfNode3] | ~ [Node8WantsToManageTheBreakDownOfNode1<=2]] & [2<=Node5WantsToManageTheBreakDownOfNode7 | [3<=Node8DontAnswerToAnyNode & 1<=Node6ManageTheBreakDownOfNode2]]] & ~ [Node1FailureProcessedByNode7<=Node0WantsToManageTheBreakDownOfNode3]]] | [~ [[1<=NoNodeManageTheBreakDownOfNode1 & Node3WantsToManageTheBreakDownOfNode1<=Node7IsActive]] & [Node3ManageTheBreakDownOfNode2<=0 | [3<=Node4WantsToManageTheBreakDownOfNode2 & [~ [Node0Failure<=Node1WantsToManageTheBreakDownOfNode8] & ~ [RequestOfNode8IsSentToLx<=3]]]]]]]] | [Node7WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode4 & [Node4ManageTheBreakDownOfNode8<=Node1FailureProcessedByNode3 & [[Node2HasTheLeafSetOfLxToReplaceNode1<=Node4ManageTheBreakDownOfNode7 & [Node8HasTheLeafSetOfLxToReplaceNode0<=Node8ManageTheBreakDownOfNode0 & ~ [[~ [Node5HasTheLeafSetOfRxToReplaceNode8<=2] | ~ [Node7WantsToManageTheBreakDownOfNode5<=LeafSetOfLxIsSentToNode4]]]]] | [[Node7WantsToManageTheBreakDownOfNode0<=2 & [[Node3HasTheLeafSetOfRxToReplaceNode6<=1 & Node0ManageTheBreakDownOfNode4<=3] & [[1<=Node1ManageTheBreakDownOfNode2 | Node2WantsToManageTheBreakDownOfNode6<=1] | [Node0WantsToManageTheBreakDownOfNode2<=NoNodeManageTheBreakDownOfNode5 & Node1HasTheLeafSetOfLxToReplaceNode2<=RequestOfNode8IsSentToLx]]]] | [RequestOfNode3IsSentToRx<=2 | [~ [Node3WantsToManageTheBreakDownOfNode0<=1] | [~ [Node7ManageTheBreakDownOfNode6<=2] | ~ [Node2HasTheLeafSetOfLxToReplaceNode4<=Node4IsActive]]]]]]]]]]]]

abstracting: (Node2HasTheLeafSetOfLxToReplaceNode4<=Node4IsActive)
states: 26,041,410 (7)
abstracting: (Node7ManageTheBreakDownOfNode6<=2)
states: 26,263,874 (7)
abstracting: (Node3WantsToManageTheBreakDownOfNode0<=1)
states: 26,263,874 (7)
abstracting: (RequestOfNode3IsSentToRx<=2)
states: 26,263,870 (7)
abstracting: (Node1HasTheLeafSetOfLxToReplaceNode2<=RequestOfNode8IsSentToLx)
states: 26,133,404 (7)
abstracting: (Node0WantsToManageTheBreakDownOfNode2<=NoNodeManageTheBreakDownOfNode5)
states: 26,136,349 (7)
abstracting: (Node2WantsToManageTheBreakDownOfNode6<=1)
states: 26,263,874 (7)
abstracting: (1<=Node1ManageTheBreakDownOfNode2)
states: 131,925 (5)
abstracting: (Node0ManageTheBreakDownOfNode4<=3)
states: 26,263,874 (7)
abstracting: (Node3HasTheLeafSetOfRxToReplaceNode6<=1)
states: 26,263,874 (7)
abstracting: (Node7WantsToManageTheBreakDownOfNode0<=2)
states: 26,263,874 (7)
abstracting: (Node7WantsToManageTheBreakDownOfNode5<=LeafSetOfLxIsSentToNode4)
states: 26,133,859 (7)
abstracting: (Node5HasTheLeafSetOfRxToReplaceNode8<=2)
states: 26,263,874 (7)
abstracting: (Node8HasTheLeafSetOfLxToReplaceNode0<=Node8ManageTheBreakDownOfNode0)
states: 26,131,938 (7)
abstracting: (Node2HasTheLeafSetOfLxToReplaceNode1<=Node4ManageTheBreakDownOfNode7)
states: 26,132,429 (7)
abstracting: (Node4ManageTheBreakDownOfNode8<=Node1FailureProcessedByNode3)
states: 26,136,297 (7)
abstracting: (Node7WantsToManageTheBreakDownOfNode6<=Node1WantsToManageTheBreakDownOfNode4)
states: 26,132,829 (7)
abstracting: (RequestOfNode8IsSentToLx<=3)
states: 26,263,874 (7)
abstracting: (Node0Failure<=Node1WantsToManageTheBreakDownOfNode8)
states: 17,994,740 (7)
abstracting: (3<=Node4WantsToManageTheBreakDownOfNode2)
states: 0
abstracting: (Node3ManageTheBreakDownOfNode2<=0)
states: 26,131,949 (7)
abstracting: (Node3WantsToManageTheBreakDownOfNode1<=Node7IsActive)
states: 26,232,774 (7)
abstracting: (1<=NoNodeManageTheBreakDownOfNode1)
states: 1,188,399 (6)
abstracting: (Node1FailureProcessedByNode7<=Node0WantsToManageTheBreakDownOfNode3)
states: 26,028,374 (7)
abstracting: (1<=Node6ManageTheBreakDownOfNode2)
states: 131,936 (5)
abstracting: (3<=Node8DontAnswerToAnyNode)
states: 0
abstracting: (2<=Node5WantsToManageTheBreakDownOfNode7)
states: 0
abstracting: (Node8WantsToManageTheBreakDownOfNode1<=2)
states: 26,263,874 (7)
abstracting: (Node2HasAskedItsLeafSetToRxToReplaceNode7<=Node1ManageTheBreakDownOfNode3)
states: 25,873,883 (7)
abstracting: (Node3WantsToManageTheBreakDownOfNode4<=Node6HasAskedItsLeafSetToLxToReplaceNode3)
states: 26,153,953 (7)
abstracting: (2<=Node4WantsToManageTheBreakDownOfNode6)
states: 0
abstracting: (2<=Node6WantsToManageTheBreakDownOfNode5)
states: 0
abstracting: (Node3WantsToManageTheBreakDownOfNode1<=Node7HasTheLeafSetOfLxToReplaceNode2)
states: 26,132,437 (7)
abstracting: (RxHasReceivedTheRequestOfNode4<=2)
states: 26,263,870 (7)
abstracting: (1<=Node0FailureProcessedByNode8)
states: 236,432 (5)
abstracting: (2<=Node7WantsToManageTheBreakDownOfNode0)
states: 0
abstracting: (Node8HasTheLeafSetOfRxToReplaceNode4<=NoNodeManageTheBreakDownOfNode4)
states: 26,041,410 (7)
-> the formula is FALSE

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

MC time: 0m55.500sec

checking: AG [[[~ [[[[~ [[[BreakDownReservoir<=0 & Node8HasTheLeafSetOfRxToReplaceNode5<=Node1HasAskedItsLeafSetToRxToReplaceNode8] & ~ [1<=Node2WantsToManageTheBreakDownOfNode4]]] | [~ [Node2FailureProcessedByNode3<=Node7HasAskedItsLeafSetToRxToReplaceNode8] & ~ [[3<=Node3FailureProcessedByNode8 & Node3HasTheLeafSetOfLxToReplaceNode2<=Node2FailureProcessedByNode6]]]] | [[[[Node6FailureProcessedByNode4<=Node7WantsToManageTheBreakDownOfNode0 & 2<=LeafSetOfRxIsSentToNode4] | 2<=Node0ManageTheBreakDownOfNode8] & Node0HasTheLeafSetOfRxToReplaceNode7<=3] | [~ [Node4WantsToManageTheBreakDownOfNode2<=1] & [~ [Node6ManageTheBreakDownOfNode2<=0] & [2<=Node4HasTheLeafSetOfLxToReplaceNode2 | Node5FailureProcessedByNode6<=0]]]]] & [Node2WantsToManageTheBreakDownOfNode8<=3 & ~ [[~ [2<=RxHasReceivedTheRequestOfNode8] & [[LeafSetOfLxIsSentToNode7<=0 | Node4Failure<=Node7FailureProcessedByNode3] & Node2FailureProcessedByNode3<=1]]]]]] | [Node2ManageTheBreakDownOfNode8<=Node2WantsToManageTheBreakDownOfNode6 | [Node8WantsToManageTheBreakDownOfNode4<=3 | [[[[NoNodeManageTheBreakDownOfNode8<=Node5HasAskedItsLeafSetToLxToReplaceNode3 | LeafSetOfRxIsSentToNode7<=Node6ManageTheBreakDownOfNode3] | Node2ManageTheBreakDownOfNode8<=Node2FailureProcessedByNode6] & ~ [LeafSetOfLxIsSentToNode5<=RxHasReceivedTheRequestOfNode5]] | [[[[3<=Node4HasAskedItsLeafSetToRxToReplaceNode6 & Node0WantsToManageTheBreakDownOfNode5<=RequestOfNode5IsSentToRx] | [2<=Node0WantsToManageTheBreakDownOfNode5 & Node3HasAskedItsLeafSetToLxToReplaceNode2<=3]] | Node8HasTheLeafSetOfLxToReplaceNode0<=3] & [[~ [Node4HasAskedItsLeafSetToRxToReplaceNode6<=Node5ManageTheBreakDownOfNode8] | [3<=RequestOfNode5IsSentToLx | Node3HasTheLeafSetOfLxToReplaceNode4<=Node3FailureProcessedByNode7]] & [[Node3DontAnswerToAnyNode<=Node3FailureProcessedByNode2 & 1<=Node4WantsToManageTheBreakDownOfNode8] & [Node5HasAskedItsLeafSetToLxToReplaceNode0<=Node0WantsToManageTheBreakDownOfNode1 & 3<=Node2FailureProcessedByNode4]]]]]]]] | [[[2<=Node3FailureProcessedByNode5 & [2<=Node6WantsToManageTheBreakDownOfNode4 & [~ [[[Node0HasAskedItsLeafSetToRxToReplaceNode6<=2 | Node3FailureProcessedByNode2<=Node4HasAskedItsLeafSetToRxToReplaceNode7] | ~ [Node0HasTheLeafSetOfRxToReplaceNode8<=LeafSetOfRxIsSentToNode2]]] | [[Node8HasTheLeafSetOfRxToReplaceNode6<=2 & [1<=Node5isTheNodeMaster | Node1HasAskedItsLeafSetToRxToReplaceNode8<=Node6WantsToManageTheBreakDownOfNode3]] & 1<=Node6HasAskedItsLeafSetToLxToReplaceNode1]]]] & ~ [[[2<=Node4DontAnswerToAnyNode & [1<=LxHasReceivedTheRequestOfNode2 & Node5WantsToManageTheBreakDownOfNode0<=Node6HasTheLeafSetOfRxToReplaceNode4]] | [[[1<=Node6WantsToManageTheBreakDownOfNode3 & Node6FailureProcessedByNode4<=LeafSetOfRxIsSentToNode8] | [3<=Node1HasAskedItsLeafSetToRxToReplaceNode8 & Node0WantsToManageTheBreakDownOfNode6<=Node0HasAskedItsLeafSetToLxToReplaceNode2]] & ~ [2<=Node0ManageTheBreakDownOfNode8]]]]] & [[[Node0Failure<=3 & [[~ [Node8WantsToManageTheBreakDownOfNode1<=1] & ~ [[1<=NoNodeManageTheBreakDownOfNode8 & Node5ManageTheBreakDownOfNode3<=2]]] | [Node3WantsToManageTheBreakDownOfNode8<=0 & [3<=Node3DontAnswerToAnyNode | [3<=Node3WantsToManageTheBreakDownOfNode8 | Node8HasTheLeafSetOfLxToReplaceNode2<=1]]]]] & Node7HasTheLeafSetOfRxToReplaceNode4<=Node6HasAskedItsLeafSetToLxToReplaceNode3] | ~ [[[~ [[2<=Node3HasAskedItsLeafSetToRxToReplaceNode6 | Node0ManageTheBreakDownOfNode5<=LeafSetOfRxIsSentToNode5]] | ~ [[2<=Node8WantsToManageTheBreakDownOfNode3 | 1<=Node3WantsToManageTheBreakDownOfNode5]]] | ~ [[~ [Node3ManageTheBreakDownOfNode4<=Node1Failure] | Node7HasTheLeafSetOfLxToReplaceNode3<=Node3WantsToManageTheBreakDownOfNode0]]]]]]]]
normalized: ~ [E [true U ~ [[[[[2<=Node3FailureProcessedByNode5 & [2<=Node6WantsToManageTheBreakDownOfNode4 & [~ [[~ [Node0HasTheLeafSetOfRxToReplaceNode8<=LeafSetOfRxIsSentToNode2] | [Node0HasAskedItsLeafSetToRxToReplaceNode6<=2 | Node3FailureProcessedByNode2<=Node4HasAskedItsLeafSetToRxToReplaceNode7]]] | [1<=Node6HasAskedItsLeafSetToLxToReplaceNode1 & [Node8HasTheLeafSetOfRxToReplaceNode6<=2 & [1<=Node5isTheNodeMaster | Node1HasAskedItsLeafSetToRxToReplaceNode8<=Node6WantsToManageTheBreakDownOfNode3]]]]]] & ~ [[[2<=Node4DontAnswerToAnyNode & [1<=LxHasReceivedTheRequestOfNode2 & Node5WantsToManageTheBreakDownOfNode0<=Node6HasTheLeafSetOfRxToReplaceNode4]] | [~ [2<=Node0ManageTheBreakDownOfNode8] & [[3<=Node1HasAskedItsLeafSetToRxToReplaceNode8 & Node0WantsToManageTheBreakDownOfNode6<=Node0HasAskedItsLeafSetToLxToReplaceNode2] | [1<=Node6WantsToManageTheBreakDownOfNode3 & Node6FailureProcessedByNode4<=LeafSetOfRxIsSentToNode8]]]]]] & [~ [[~ [[Node7HasTheLeafSetOfLxToReplaceNode3<=Node3WantsToManageTheBreakDownOfNode0 | ~ [Node3ManageTheBreakDownOfNode4<=Node1Failure]]] | [~ [[2<=Node8WantsToManageTheBreakDownOfNode3 | 1<=Node3WantsToManageTheBreakDownOfNode5]] | ~ [[2<=Node3HasAskedItsLeafSetToRxToReplaceNode6 | Node0ManageTheBreakDownOfNode5<=LeafSetOfRxIsSentToNode5]]]]] | [Node7HasTheLeafSetOfRxToReplaceNode4<=Node6HasAskedItsLeafSetToLxToReplaceNode3 & [Node0Failure<=3 & [[~ [[1<=NoNodeManageTheBreakDownOfNode8 & Node5ManageTheBreakDownOfNode3<=2]] & ~ [Node8WantsToManageTheBreakDownOfNode1<=1]] | [Node3WantsToManageTheBreakDownOfNode8<=0 & [3<=Node3DontAnswerToAnyNode | [3<=Node3WantsToManageTheBreakDownOfNode8 | Node8HasTheLeafSetOfLxToReplaceNode2<=1]]]]]]]] | [~ [[[[[~ [Node4WantsToManageTheBreakDownOfNode2<=1] & [[2<=Node4HasTheLeafSetOfLxToReplaceNode2 | Node5FailureProcessedByNode6<=0] & ~ [Node6ManageTheBreakDownOfNode2<=0]]] | [Node0HasTheLeafSetOfRxToReplaceNode7<=3 & [2<=Node0ManageTheBreakDownOfNode8 | [Node6FailureProcessedByNode4<=Node7WantsToManageTheBreakDownOfNode0 & 2<=LeafSetOfRxIsSentToNode4]]]] | [[~ [[3<=Node3FailureProcessedByNode8 & Node3HasTheLeafSetOfLxToReplaceNode2<=Node2FailureProcessedByNode6]] & ~ [Node2FailureProcessedByNode3<=Node7HasAskedItsLeafSetToRxToReplaceNode8]] | ~ [[~ [1<=Node2WantsToManageTheBreakDownOfNode4] & [BreakDownReservoir<=0 & Node8HasTheLeafSetOfRxToReplaceNode5<=Node1HasAskedItsLeafSetToRxToReplaceNode8]]]]] & [Node2WantsToManageTheBreakDownOfNode8<=3 & ~ [[[Node2FailureProcessedByNode3<=1 & [LeafSetOfLxIsSentToNode7<=0 | Node4Failure<=Node7FailureProcessedByNode3]] & ~ [2<=RxHasReceivedTheRequestOfNode8]]]]]] | [Node2ManageTheBreakDownOfNode8<=Node2WantsToManageTheBreakDownOfNode6 | [Node8WantsToManageTheBreakDownOfNode4<=3 | [[[[[Node5HasAskedItsLeafSetToLxToReplaceNode0<=Node0WantsToManageTheBreakDownOfNode1 & 3<=Node2FailureProcessedByNode4] & [Node3DontAnswerToAnyNode<=Node3FailureProcessedByNode2 & 1<=Node4WantsToManageTheBreakDownOfNode8]] & [[3<=RequestOfNode5IsSentToLx | Node3HasTheLeafSetOfLxToReplaceNode4<=Node3FailureProcessedByNode7] | ~ [Node4HasAskedItsLeafSetToRxToReplaceNode6<=Node5ManageTheBreakDownOfNode8]]] & [Node8HasTheLeafSetOfLxToReplaceNode0<=3 | [[2<=Node0WantsToManageTheBreakDownOfNode5 & Node3HasAskedItsLeafSetToLxToReplaceNode2<=3] | [3<=Node4HasAskedItsLeafSetToRxToReplaceNode6 & Node0WantsToManageTheBreakDownOfNode5<=RequestOfNode5IsSentToRx]]]] | [~ [LeafSetOfLxIsSentToNode5<=RxHasReceivedTheRequestOfNode5] & [Node2ManageTheBreakDownOfNode8<=Node2FailureProcessedByNode6 | [NoNodeManageTheBreakDownOfNode8<=Node5HasAskedItsLeafSetToLxToReplaceNode3 | LeafSetOfRxIsSentToNode7<=Node6ManageTheBreakDownOfNode3]]]]]]]]]]]

abstracting: (LeafSetOfRxIsSentToNode7<=Node6ManageTheBreakDownOfNode3)
states: 25,660,150 (7)
abstracting: (NoNodeManageTheBreakDownOfNode8<=Node5HasAskedItsLeafSetToLxToReplaceNode3)
states: 25,088,570 (7)
abstracting: (Node2ManageTheBreakDownOfNode8<=Node2FailureProcessedByNode6)
states: 26,132,852 (7)
abstracting: (LeafSetOfLxIsSentToNode5<=RxHasReceivedTheRequestOfNode5)
states: 25,752,297 (7)
abstracting: (Node0WantsToManageTheBreakDownOfNode5<=RequestOfNode5IsSentToRx)
states: 26,133,819 (7)
abstracting: (3<=Node4HasAskedItsLeafSetToRxToReplaceNode6)
states: 0
abstracting: (Node3HasAskedItsLeafSetToLxToReplaceNode2<=3)
states: 26,263,874 (7)
abstracting: (2<=Node0WantsToManageTheBreakDownOfNode5)
states: 0
abstracting: (Node8HasTheLeafSetOfLxToReplaceNode0<=3)
states: 26,263,874 (7)
abstracting: (Node4HasAskedItsLeafSetToRxToReplaceNode6<=Node5ManageTheBreakDownOfNode8)
states: 25,884,119 (7)
abstracting: (Node3HasTheLeafSetOfLxToReplaceNode4<=Node3FailureProcessedByNode7)
states: 26,153,474 (7)
abstracting: (3<=RequestOfNode5IsSentToLx)
states: 4
abstracting: (1<=Node4WantsToManageTheBreakDownOfNode8)
states: 128,477 (5)
abstracting: (Node3DontAnswerToAnyNode<=Node3FailureProcessedByNode2)
states: 26,127,530 (7)
abstracting: (3<=Node2FailureProcessedByNode4)
states: 0
abstracting: (Node5HasAskedItsLeafSetToLxToReplaceNode0<=Node0WantsToManageTheBreakDownOfNode1)
states: 25,873,886 (7)
abstracting: (Node8WantsToManageTheBreakDownOfNode4<=3)
states: 26,263,874 (7)
abstracting: (Node2ManageTheBreakDownOfNode8<=Node2WantsToManageTheBreakDownOfNode6)
states: 26,132,426 (7)
abstracting: (2<=RxHasReceivedTheRequestOfNode8)
states: 4,062 (3)
abstracting: (Node4Failure<=Node7FailureProcessedByNode3)
states: 14,185,297 (7)
abstracting: (LeafSetOfLxIsSentToNode7<=0)
states: 25,744,849 (7)
abstracting: (Node2FailureProcessedByNode3<=1)
states: 26,263,874 (7)
abstracting: (Node2WantsToManageTheBreakDownOfNode8<=3)
states: 26,263,874 (7)
abstracting: (Node8HasTheLeafSetOfRxToReplaceNode5<=Node1HasAskedItsLeafSetToRxToReplaceNode8)
states: 26,133,407 (7)
abstracting: (BreakDownReservoir<=0)
states: 26,091,626 (7)
abstracting: (1<=Node2WantsToManageTheBreakDownOfNode4)
states: 222,464 (5)
abstracting: (Node2FailureProcessedByNode3<=Node7HasAskedItsLeafSetToRxToReplaceNode8)
states: 26,029,358 (7)
abstracting: (Node3HasTheLeafSetOfLxToReplaceNode2<=Node2FailureProcessedByNode6)
states: 26,131,949 (7)
abstracting: (3<=Node3FailureProcessedByNode8)
states: 0
abstracting: (2<=LeafSetOfRxIsSentToNode4)
states: 2,832 (3)
abstracting: (Node6FailureProcessedByNode4<=Node7WantsToManageTheBreakDownOfNode0)
states: 26,033,406 (7)
abstracting: (2<=Node0ManageTheBreakDownOfNode8)
states: 0
abstracting: (Node0HasTheLeafSetOfRxToReplaceNode7<=3)
states: 26,263,874 (7)
abstracting: (Node6ManageTheBreakDownOfNode2<=0)
states: 26,131,938 (7)
abstracting: (Node5FailureProcessedByNode6<=0)
states: 26,026,634 (7)
abstracting: (2<=Node4HasTheLeafSetOfLxToReplaceNode2)
states: 0
abstracting: (Node4WantsToManageTheBreakDownOfNode2<=1)
states: 26,263,874 (7)
abstracting: (Node8HasTheLeafSetOfLxToReplaceNode2<=1)
states: 26,263,874 (7)
abstracting: (3<=Node3WantsToManageTheBreakDownOfNode8)
states: 0
abstracting: (3<=Node3DontAnswerToAnyNode)
states: 0
abstracting: (Node3WantsToManageTheBreakDownOfNode8<=0)
states: 26,131,938 (7)
abstracting: (Node8WantsToManageTheBreakDownOfNode1<=1)
states: 26,263,874 (7)
abstracting: (Node5ManageTheBreakDownOfNode3<=2)
states: 26,263,874 (7)
abstracting: (1<=NoNodeManageTheBreakDownOfNode8)
states: 1,188,399 (6)
abstracting: (Node0Failure<=3)
states: 26,263,874 (7)
abstracting: (Node7HasTheLeafSetOfRxToReplaceNode4<=Node6HasAskedItsLeafSetToLxToReplaceNode3)
states: 26,044,032 (7)
abstracting: (Node0ManageTheBreakDownOfNode5<=LeafSetOfRxIsSentToNode5)
states: 26,133,819 (7)
abstracting: (2<=Node3HasAskedItsLeafSetToRxToReplaceNode6)
states: 0
abstracting: (1<=Node3WantsToManageTheBreakDownOfNode5)
states: 131,941 (5)
abstracting: (2<=Node8WantsToManageTheBreakDownOfNode3)
states: 0
abstracting: (Node3ManageTheBreakDownOfNode4<=Node1Failure)
states: 26,180,830 (7)
abstracting: (Node7HasTheLeafSetOfLxToReplaceNode3<=Node3WantsToManageTheBreakDownOfNode0)
states: 26,132,421 (7)
abstracting: (Node6FailureProcessedByNode4<=LeafSetOfRxIsSentToNode8)
states: 26,035,984 (7)
abstracting: (1<=Node6WantsToManageTheBreakDownOfNode3)
states: 131,941 (5)
abstracting: (Node0WantsToManageTheBreakDownOfNode6<=Node0HasAskedItsLeafSetToLxToReplaceNode2)
states: 26,133,390 (7)
abstracting: (3<=Node1HasAskedItsLeafSetToRxToReplaceNode8)
states: 0
abstracting: (2<=Node0ManageTheBreakDownOfNode8)
states: 0
abstracting: (Node5WantsToManageTheBreakDownOfNode0<=Node6HasTheLeafSetOfRxToReplaceNode4)
states: 26,132,818 (7)
abstracting: (1<=LxHasReceivedTheRequestOfNode2)
states: 606,032 (5)
abstracting: (2<=Node4DontAnswerToAnyNode)
states: 0
abstracting: (Node1HasAskedItsLeafSetToRxToReplaceNode8<=Node6WantsToManageTheBreakDownOfNode3)
states: 25,873,883 (7)
abstracting: (1<=Node5isTheNodeMaster)
states: 3,331,776 (6)
abstracting: (Node8HasTheLeafSetOfRxToReplaceNode6<=2)
states: 26,263,874 (7)
abstracting: (1<=Node6HasAskedItsLeafSetToLxToReplaceNode1)
states: 391,446 (5)
abstracting: (Node3FailureProcessedByNode2<=Node4HasAskedItsLeafSetToRxToReplaceNode7)
states: 26,029,316 (7)
abstracting: (Node0HasAskedItsLeafSetToRxToReplaceNode6<=2)
states: 26,263,874 (7)
abstracting: (Node0HasTheLeafSetOfRxToReplaceNode8<=LeafSetOfRxIsSentToNode2)
states: 26,133,393 (7)
abstracting: (2<=Node6WantsToManageTheBreakDownOfNode4)
states: 0
abstracting: (2<=Node3FailureProcessedByNode5)
states: 0
-> the formula is TRUE

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

MC time: 1m27.875sec

totally nodes used: 59831925 (6.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 244543214 1736332424 1980875638
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 93969755 586087378 680057133
used/not used/entry size/cache size: 16777216 0 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: 18354080 41897248 60251328
used/not used/entry size/cache size: 8306636 81972 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 28136232
1 23822290
2 10731267
3 3377606
4 834498
5 171647
6 29948
7 4710
8 601
9 61
>= 10 4

Total processing time: 17m29.378sec


BK_STOP 1679506691104

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

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

initing FirstDep: 0m 0.000sec


iterations count:888 (2), effective:5 (0)

iterations count:2301 (5), effective:15 (0)

iterations count:2558 (6), effective:29 (0)

iterations count:734 (1), effective:4 (0)

iterations count:3870 (9), effective:38 (0)

iterations count:2176 (5), effective:16 (0)

iterations count:1238 (3), effective:8 (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="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is LeafsetExtension-PT-S08C3, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420300462"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;