fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171400237
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for LeafsetExtension-PT-S08C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2697.428 201558.00 329223.00 9374.10 FFTFFFFFFTFTTFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171400237.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is LeafsetExtension-PT-S08C2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171400237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 31K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.4K May 11 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 11 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 647K May 12 08:13 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-S08C2-00
FORMULA_NAME LeafsetExtension-PT-S08C2-01
FORMULA_NAME LeafsetExtension-PT-S08C2-02
FORMULA_NAME LeafsetExtension-PT-S08C2-03
FORMULA_NAME LeafsetExtension-PT-S08C2-04
FORMULA_NAME LeafsetExtension-PT-S08C2-05
FORMULA_NAME LeafsetExtension-PT-S08C2-06
FORMULA_NAME LeafsetExtension-PT-S08C2-07
FORMULA_NAME LeafsetExtension-PT-S08C2-08
FORMULA_NAME LeafsetExtension-PT-S08C2-09
FORMULA_NAME LeafsetExtension-PT-S08C2-10
FORMULA_NAME LeafsetExtension-PT-S08C2-11
FORMULA_NAME LeafsetExtension-PT-S08C2-12
FORMULA_NAME LeafsetExtension-PT-S08C2-13
FORMULA_NAME LeafsetExtension-PT-S08C2-14
FORMULA_NAME LeafsetExtension-PT-S08C2-15

=== Now, execution of the tool begins

BK_START 1621353277995

[2021-05-18 15:54:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 15:54:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 15:54:40] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-18 15:54:40] [INFO ] Transformed 462 places.
[2021-05-18 15:54:40] [INFO ] Transformed 409 transitions.
[2021-05-18 15:54:40] [INFO ] Parsed PT model containing 462 places and 409 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5420 resets, run finished after 416 ms. (steps per millisecond=240 ) properties seen :[1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 409 rows 462 cols
[2021-05-18 15:54:41] [INFO ] Computed 53 place invariants in 30 ms
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned unsat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 16 ms returned unsat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned unsat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 8 ms returned unsat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 13 ms returned unsat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-18 15:54:41] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 3 ms returned unsat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 8 ms returned unsat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 24 ms returned unsat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 11 ms returned unsat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2021-05-18 15:54:42] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 13 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 17 simplifications.
[2021-05-18 15:54:42] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 15:54:42] [INFO ] Flatten gal took : 69 ms
FORMULA LeafsetExtension-PT-S08C2-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 15:54:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 15:54:42] [INFO ] Flatten gal took : 35 ms
[2021-05-18 15:54:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LeafsetExtension-PT-S08C2-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 15:54:42] [INFO ] Applying decomposition
[2021-05-18 15:54:42] [INFO ] Flatten gal took : 28 ms
[2021-05-18 15:54:42] [INFO ] Input system was already deterministic with 409 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12008586537639602621.txt, -o, /tmp/graph12008586537639602621.bin, -w, /tmp/graph12008586537639602621.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12008586537639602621.bin, -l, -1, -v, -w, /tmp/graph12008586537639602621.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 15:54:51] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 409 rows 462 cols
[2021-05-18 15:54:51] [INFO ] Computed 53 place invariants in 11 ms
inv : Node4IsActive + Node4Failure = 1
inv : BreakDownReservoir + Node0DontAnswerToAnyNode + Node1Failure + Node1WantsToManageTheBreakDownOfNode0 + Node1ManageTheBreakDownOfNode0 + Node1HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode1 - Node1HasAskedItsLeafSetToLxToReplaceNode2 - Node1HasAskedItsLeafSetToLxToReplaceNode3 - Node1HasAskedItsLeafSetToLxToReplaceNode4 + RequestOfNode1IsSentToLx + LeafSetOfLxIsSentToNode1 + Node2Failure + Node2WantsToManageTheBreakDownOfNode0 + Node2ManageTheBreakDownOfNode0 + Node2HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode2 - Node2HasAskedItsLeafSetToLxToReplaceNode1 - Node2HasAskedItsLeafSetToLxToReplaceNode3 - Node2HasAskedItsLeafSetToLxToReplaceNode4 + RequestOfNode2IsSentToLx + LeafSetOfLxIsSentToNode2 + Node3Failure + Node3WantsToManageTheBreakDownOfNode0 + Node3ManageTheBreakDownOfNode0 + Node3HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode3 - Node3HasAskedItsLeafSetToLxToReplaceNode1 - Node3HasAskedItsLeafSetToLxToReplaceNode2 - Node3HasAskedItsLeafSetToLxToReplaceNode4 + RequestOfNode3IsSentToLx + LeafSetOfLxIsSentToNode3 + Node4Failure + Node4WantsToManageTheBreakDownOfNode0 + Node4ManageTheBreakDownOfNode0 + Node4HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode4 - Node4HasAskedItsLeafSetToLxToReplaceNode1 - Node4HasAskedItsLeafSetToLxToReplaceNode2 - Node4HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode4IsSentToLx + LeafSetOfLxIsSentToNode4 + Node5Failure + Node5WantsToManageTheBreakDownOfNode0 + Node5ManageTheBreakDownOfNode0 + Node5HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode5 - Node5HasAskedItsLeafSetToLxToReplaceNode1 - Node5HasAskedItsLeafSetToLxToReplaceNode2 - Node5HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode5IsSentToLx + LeafSetOfLxIsSentToNode5 + Node6Failure + Node6WantsToManageTheBreakDownOfNode0 + Node6ManageTheBreakDownOfNode0 + Node6HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode6 - Node6HasAskedItsLeafSetToLxToReplaceNode1 - Node6HasAskedItsLeafSetToLxToReplaceNode2 - Node6HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode6IsSentToLx + LeafSetOfLxIsSentToNode6 + Node7Failure + Node7WantsToManageTheBreakDownOfNode0 + Node7ManageTheBreakDownOfNode0 + Node7HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode7 - Node7HasAskedItsLeafSetToLxToReplaceNode1 - Node7HasAskedItsLeafSetToLxToReplaceNode2 - Node7HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode7IsSentToLx + LeafSetOfLxIsSentToNode7 + Node8Failure + Node8WantsToManageTheBreakDownOfNode0 + Node8ManageTheBreakDownOfNode0 + Node8HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode8 - Node8HasAskedItsLeafSetToLxToReplaceNode1 - Node8HasAskedItsLeafSetToLxToReplaceNode2 - Node8HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode8IsSentToLx + LeafSetOfLxIsSentToNode8 + LxHasReceivedTheRequestOfNode1 + LxHasReceivedTheRequestOfNode2 + LxHasReceivedTheRequestOfNode3 + LxHasReceivedTheRequestOfNode4 + LxHasReceivedTheRequestOfNode5 + LxHasReceivedTheRequestOfNode6 + LxHasReceivedTheRequestOfNode7 + LxHasReceivedTheRequestOfNode8 = 2
inv : Node0ManageTheBreakDownOfNode7 + Node0HasAskedItsLeafSetToRxToReplaceNode7 + Node0HasTheLeafSetOfRxToReplaceNode7 + Node7FailureProcessedByNode0 + Node1ManageTheBreakDownOfNode7 + Node1HasAskedItsLeafSetToRxToReplaceNode7 + Node1HasTheLeafSetOfRxToReplaceNode7 + Node7FailureProcessedByNode1 + Node2ManageTheBreakDownOfNode7 + Node2HasAskedItsLeafSetToRxToReplaceNode7 + Node2HasTheLeafSetOfRxToReplaceNode7 + Node7FailureProcessedByNode2 + Node3ManageTheBreakDownOfNode7 + Node3HasAskedItsLeafSetToRxToReplaceNode7 + Node3HasTheLeafSetOfRxToReplaceNode7 + Node7FailureProcessedByNode3 + Node4ManageTheBreakDownOfNode7 + Node4HasAskedItsLeafSetToRxToReplaceNode7 + Node4HasTheLeafSetOfRxToReplaceNode7 + Node7FailureProcessedByNode4 + Node5ManageTheBreakDownOfNode7 + Node5HasAskedItsLeafSetToRxToReplaceNode7 + Node5HasTheLeafSetOfRxToReplaceNode7 + Node7FailureProcessedByNode5 + Node6ManageTheBreakDownOfNode7 + Node6HasAskedItsLeafSetToRxToReplaceNode7 + Node6HasTheLeafSetOfRxToReplaceNode7 + Node7FailureProcessedByNode6 - Node7Failure + NoNodeManageTheBreakDownOfNode7 + Node8ManageTheBreakDownOfNode7 + Node8HasAskedItsLeafSetToRxToReplaceNode7 + Node8HasTheLeafSetOfRxToReplaceNode7 + Node7FailureProcessedByNode8 = 0
inv : Node6HasAskedItsLeafSetToRxToReplaceNode4 + Node6HasAskedItsLeafSetToRxToReplaceNode5 + Node6HasAskedItsLeafSetToRxToReplaceNode7 + Node6HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode6IsSentToRx - LeafSetOfRxIsSentToNode6 - RxHasReceivedTheRequestOfNode6 = 0
inv : Node0WantsToManageTheBreakDownOfNode8 + Node1WantsToManageTheBreakDownOfNode8 + Node2WantsToManageTheBreakDownOfNode8 + Node3WantsToManageTheBreakDownOfNode8 + Node4WantsToManageTheBreakDownOfNode8 + Node5WantsToManageTheBreakDownOfNode8 + Node6WantsToManageTheBreakDownOfNode8 + Node7WantsToManageTheBreakDownOfNode8 + Node8DontAnswerToAnyNode - NoNodeManageTheBreakDownOfNode8 = 0
inv : Node1IsActive + Node1Failure = 1
inv : Node7IsActive + Node7Failure = 1
inv : Node5FailureProcessedByNode0 + Node6FailureProcessedByNode0 + Node7FailureProcessedByNode0 + Node8FailureProcessedByNode0 + Node5FailureProcessedByNode1 + Node6FailureProcessedByNode1 + Node7FailureProcessedByNode1 + Node8FailureProcessedByNode1 + Node5FailureProcessedByNode2 + Node6FailureProcessedByNode2 + Node7FailureProcessedByNode2 + Node8FailureProcessedByNode2 + Node5FailureProcessedByNode3 + Node6FailureProcessedByNode3 + Node7FailureProcessedByNode3 + Node8FailureProcessedByNode3 + Node5FailureProcessedByNode4 + Node6FailureProcessedByNode4 + Node7FailureProcessedByNode4 + Node8FailureProcessedByNode4 + Node4FailureProcessedByNode5 + Node6FailureProcessedByNode5 + Node7FailureProcessedByNode5 + Node8FailureProcessedByNode5 + Node4FailureProcessedByNode6 + Node5FailureProcessedByNode6 + Node7FailureProcessedByNode6 + Node8FailureProcessedByNode6 + Node4FailureProcessedByNode7 + Node5FailureProcessedByNode7 + Node6FailureProcessedByNode7 + Node8FailureProcessedByNode7 + Node4FailureProcessedByNode8 + Node5FailureProcessedByNode8 + Node6FailureProcessedByNode8 + Node7FailureProcessedByNode8 - RxIsActiveInTheLeafSet - ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet = 0
inv : Node1FailureProcessedByNode0 + Node2FailureProcessedByNode0 + Node3FailureProcessedByNode0 + Node4FailureProcessedByNode0 + Node0FailureProcessedByNode1 + Node2FailureProcessedByNode1 + Node3FailureProcessedByNode1 + Node4FailureProcessedByNode1 + Node0FailureProcessedByNode2 + Node1FailureProcessedByNode2 + Node3FailureProcessedByNode2 + Node4FailureProcessedByNode2 + Node0FailureProcessedByNode3 + Node1FailureProcessedByNode3 + Node2FailureProcessedByNode3 + Node4FailureProcessedByNode3 + Node0FailureProcessedByNode4 + Node1FailureProcessedByNode4 + Node2FailureProcessedByNode4 + Node3FailureProcessedByNode4 + Node0FailureProcessedByNode5 + Node1FailureProcessedByNode5 + Node2FailureProcessedByNode5 + Node3FailureProcessedByNode5 + Node0FailureProcessedByNode6 + Node1FailureProcessedByNode6 + Node2FailureProcessedByNode6 + Node3FailureProcessedByNode6 + Node0FailureProcessedByNode7 + Node1FailureProcessedByNode7 + Node2FailureProcessedByNode7 + Node3FailureProcessedByNode7 + Node0FailureProcessedByNode8 + Node1FailureProcessedByNode8 + Node2FailureProcessedByNode8 + Node3FailureProcessedByNode8 - LxIsActiveInTheLeafSet - ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet = 0
inv : Node1HasAskedItsLeafSetToRxToReplaceNode5 + Node1HasAskedItsLeafSetToRxToReplaceNode6 + Node1HasAskedItsLeafSetToRxToReplaceNode7 + Node1HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode1IsSentToRx - LeafSetOfRxIsSentToNode1 - RxHasReceivedTheRequestOfNode1 = 0
inv : Node2HasAskedItsLeafSetToLxToReplaceNode0 + Node2HasAskedItsLeafSetToLxToReplaceNode1 + Node2HasAskedItsLeafSetToLxToReplaceNode3 + Node2HasAskedItsLeafSetToLxToReplaceNode4 - RequestOfNode2IsSentToLx - LeafSetOfLxIsSentToNode2 - LxHasReceivedTheRequestOfNode2 = 0
inv : Node8HasAskedItsLeafSetToRxToReplaceNode4 + Node8HasAskedItsLeafSetToRxToReplaceNode5 + Node8HasAskedItsLeafSetToRxToReplaceNode6 + Node8HasAskedItsLeafSetToRxToReplaceNode7 - RequestOfNode8IsSentToRx - LeafSetOfRxIsSentToNode8 - RxHasReceivedTheRequestOfNode8 = 0
inv : Node6HasAskedItsLeafSetToLxToReplaceNode0 + Node6HasAskedItsLeafSetToLxToReplaceNode1 + Node6HasAskedItsLeafSetToLxToReplaceNode2 + Node6HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode6IsSentToLx - LeafSetOfLxIsSentToNode6 - LxHasReceivedTheRequestOfNode6 = 0
inv : Node3IsActive + Node3Failure = 1
inv : Node0WantsToManageTheBreakDownOfNode5 + Node1WantsToManageTheBreakDownOfNode5 + Node2WantsToManageTheBreakDownOfNode5 + Node3WantsToManageTheBreakDownOfNode5 + Node4WantsToManageTheBreakDownOfNode5 + Node5DontAnswerToAnyNode - NoNodeManageTheBreakDownOfNode5 + Node6WantsToManageTheBreakDownOfNode5 + Node7WantsToManageTheBreakDownOfNode5 + Node8WantsToManageTheBreakDownOfNode5 = 0
inv : Node0WantsToManageTheBreakDownOfNode7 + Node1WantsToManageTheBreakDownOfNode7 + Node2WantsToManageTheBreakDownOfNode7 + Node3WantsToManageTheBreakDownOfNode7 + Node4WantsToManageTheBreakDownOfNode7 + Node5WantsToManageTheBreakDownOfNode7 + Node6WantsToManageTheBreakDownOfNode7 + Node7DontAnswerToAnyNode - NoNodeManageTheBreakDownOfNode7 + Node8WantsToManageTheBreakDownOfNode7 = 0
inv : RxIsActiveAndNotInTheLeafSet + RxIsActiveInTheLeafSet = 1
inv : Node0WantsToManageTheBreakDownOfNode2 + Node0ManageTheBreakDownOfNode2 + Node0HasAskedItsLeafSetToLxToReplaceNode2 + Node0HasTheLeafSetOfLxToReplaceNode2 + Node2FailureProcessedByNode0 + Node1WantsToManageTheBreakDownOfNode2 + Node1ManageTheBreakDownOfNode2 + Node1HasAskedItsLeafSetToLxToReplaceNode2 + Node1HasTheLeafSetOfLxToReplaceNode2 + Node2FailureProcessedByNode1 - Node2Failure + Node2DontAnswerToAnyNode + Node3WantsToManageTheBreakDownOfNode2 + Node3ManageTheBreakDownOfNode2 + Node3HasAskedItsLeafSetToLxToReplaceNode2 + Node3HasTheLeafSetOfLxToReplaceNode2 + Node2FailureProcessedByNode3 + Node4WantsToManageTheBreakDownOfNode2 + Node4ManageTheBreakDownOfNode2 + Node4HasAskedItsLeafSetToLxToReplaceNode2 + Node4HasTheLeafSetOfLxToReplaceNode2 + Node2FailureProcessedByNode4 + Node5WantsToManageTheBreakDownOfNode2 + Node5ManageTheBreakDownOfNode2 + Node5HasAskedItsLeafSetToLxToReplaceNode2 + Node5HasTheLeafSetOfLxToReplaceNode2 + Node2FailureProcessedByNode5 + Node6WantsToManageTheBreakDownOfNode2 + Node6ManageTheBreakDownOfNode2 + Node6HasAskedItsLeafSetToLxToReplaceNode2 + Node6HasTheLeafSetOfLxToReplaceNode2 + Node2FailureProcessedByNode6 + Node7WantsToManageTheBreakDownOfNode2 + Node7ManageTheBreakDownOfNode2 + Node7HasAskedItsLeafSetToLxToReplaceNode2 + Node7HasTheLeafSetOfLxToReplaceNode2 + Node2FailureProcessedByNode7 + Node8WantsToManageTheBreakDownOfNode2 + Node8ManageTheBreakDownOfNode2 + Node8HasAskedItsLeafSetToLxToReplaceNode2 + Node8HasTheLeafSetOfLxToReplaceNode2 + Node2FailureProcessedByNode8 = 0
inv : Node2HasAskedItsLeafSetToRxToReplaceNode5 + Node2HasAskedItsLeafSetToRxToReplaceNode6 + Node2HasAskedItsLeafSetToRxToReplaceNode7 + Node2HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode2IsSentToRx - LeafSetOfRxIsSentToNode2 - RxHasReceivedTheRequestOfNode2 = 0
inv : Node0ManageTheBreakDownOfNode5 + Node0HasTheLeafSetOfRxToReplaceNode5 + Node0ManageTheBreakDownOfNode6 + Node0HasTheLeafSetOfRxToReplaceNode6 + Node0ManageTheBreakDownOfNode7 + Node0HasTheLeafSetOfRxToReplaceNode7 + Node0ManageTheBreakDownOfNode8 + Node0HasTheLeafSetOfRxToReplaceNode8 + RequestOfNode0IsSentToRx + LeafSetOfRxIsSentToNode0 + Node1ManageTheBreakDownOfNode5 + Node1HasTheLeafSetOfRxToReplaceNode5 + Node1ManageTheBreakDownOfNode6 + Node1HasTheLeafSetOfRxToReplaceNode6 + Node1ManageTheBreakDownOfNode7 + Node1HasTheLeafSetOfRxToReplaceNode7 + Node1ManageTheBreakDownOfNode8 + Node1HasTheLeafSetOfRxToReplaceNode8 + RequestOfNode1IsSentToRx + LeafSetOfRxIsSentToNode1 + Node2ManageTheBreakDownOfNode5 + Node2HasTheLeafSetOfRxToReplaceNode5 + Node2ManageTheBreakDownOfNode6 + Node2HasTheLeafSetOfRxToReplaceNode6 + Node2ManageTheBreakDownOfNode7 + Node2HasTheLeafSetOfRxToReplaceNode7 + Node2ManageTheBreakDownOfNode8 + Node2HasTheLeafSetOfRxToReplaceNode8 + RequestOfNode2IsSentToRx + LeafSetOfRxIsSentToNode2 + Node3ManageTheBreakDownOfNode5 + Node3HasTheLeafSetOfRxToReplaceNode5 + Node3ManageTheBreakDownOfNode6 + Node3HasTheLeafSetOfRxToReplaceNode6 + Node3ManageTheBreakDownOfNode7 + Node3HasTheLeafSetOfRxToReplaceNode7 + Node3ManageTheBreakDownOfNode8 + Node3HasTheLeafSetOfRxToReplaceNode8 + RequestOfNode3IsSentToRx + LeafSetOfRxIsSentToNode3 + Node4ManageTheBreakDownOfNode5 + Node4HasTheLeafSetOfRxToReplaceNode5 + Node4ManageTheBreakDownOfNode6 + Node4HasTheLeafSetOfRxToReplaceNode6 + Node4ManageTheBreakDownOfNode7 + Node4HasTheLeafSetOfRxToReplaceNode7 + Node4ManageTheBreakDownOfNode8 + Node4HasTheLeafSetOfRxToReplaceNode8 + RequestOfNode4IsSentToRx + LeafSetOfRxIsSentToNode4 - Node5Failure - Node4FailureProcessedByNode5 + Node5ManageTheBreakDownOfNode6 + Node5HasAskedItsLeafSetToRxToReplaceNode6 + Node5HasTheLeafSetOfRxToReplaceNode6 + Node5ManageTheBreakDownOfNode7 + Node5HasAskedItsLeafSetToRxToReplaceNode7 + Node5HasTheLeafSetOfRxToReplaceNode7 + Node5ManageTheBreakDownOfNode8 + Node5HasAskedItsLeafSetToRxToReplaceNode8 + Node5HasTheLeafSetOfRxToReplaceNode8 + NoNodeManageTheBreakDownOfNode5 - Node6Failure - Node4FailureProcessedByNode6 + Node6ManageTheBreakDownOfNode5 + Node6HasAskedItsLeafSetToRxToReplaceNode5 + Node6HasTheLeafSetOfRxToReplaceNode5 + Node6ManageTheBreakDownOfNode7 + Node6HasAskedItsLeafSetToRxToReplaceNode7 + Node6HasTheLeafSetOfRxToReplaceNode7 + Node6ManageTheBreakDownOfNode8 + Node6HasAskedItsLeafSetToRxToReplaceNode8 + Node6HasTheLeafSetOfRxToReplaceNode8 + NoNodeManageTheBreakDownOfNode6 - Node7Failure - Node4FailureProcessedByNode7 + Node7ManageTheBreakDownOfNode5 + Node7HasAskedItsLeafSetToRxToReplaceNode5 + Node7HasTheLeafSetOfRxToReplaceNode5 + Node7ManageTheBreakDownOfNode6 + Node7HasAskedItsLeafSetToRxToReplaceNode6 + Node7HasTheLeafSetOfRxToReplaceNode6 + Node7ManageTheBreakDownOfNode8 + Node7HasAskedItsLeafSetToRxToReplaceNode8 + Node7HasTheLeafSetOfRxToReplaceNode8 + NoNodeManageTheBreakDownOfNode7 - Node8Failure - Node4FailureProcessedByNode8 + Node8ManageTheBreakDownOfNode5 + Node8HasAskedItsLeafSetToRxToReplaceNode5 + Node8HasTheLeafSetOfRxToReplaceNode5 + Node8ManageTheBreakDownOfNode6 + Node8HasAskedItsLeafSetToRxToReplaceNode6 + Node8HasTheLeafSetOfRxToReplaceNode6 + Node8ManageTheBreakDownOfNode7 + Node8HasAskedItsLeafSetToRxToReplaceNode7 + Node8HasTheLeafSetOfRxToReplaceNode7 + NoNodeManageTheBreakDownOfNode8 + RxIsActiveInTheLeafSet + RxHasReceivedTheRequestOfNode0 + RxHasReceivedTheRequestOfNode1 + RxHasReceivedTheRequestOfNode2 + RxHasReceivedTheRequestOfNode3 + RxHasReceivedTheRequestOfNode4 + ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet = 0
inv : Node0WantsToManageTheBreakDownOfNode3 + Node1WantsToManageTheBreakDownOfNode3 + Node2WantsToManageTheBreakDownOfNode3 + Node3DontAnswerToAnyNode - NoNodeManageTheBreakDownOfNode3 + Node4WantsToManageTheBreakDownOfNode3 + Node5WantsToManageTheBreakDownOfNode3 + Node6WantsToManageTheBreakDownOfNode3 + Node7WantsToManageTheBreakDownOfNode3 + Node8WantsToManageTheBreakDownOfNode3 = 0
inv : Node0ManageTheBreakDownOfNode6 + Node0HasAskedItsLeafSetToRxToReplaceNode6 + Node0HasTheLeafSetOfRxToReplaceNode6 + Node6FailureProcessedByNode0 + Node1ManageTheBreakDownOfNode6 + Node1HasAskedItsLeafSetToRxToReplaceNode6 + Node1HasTheLeafSetOfRxToReplaceNode6 + Node6FailureProcessedByNode1 + Node2ManageTheBreakDownOfNode6 + Node2HasAskedItsLeafSetToRxToReplaceNode6 + Node2HasTheLeafSetOfRxToReplaceNode6 + Node6FailureProcessedByNode2 + Node3ManageTheBreakDownOfNode6 + Node3HasAskedItsLeafSetToRxToReplaceNode6 + Node3HasTheLeafSetOfRxToReplaceNode6 + Node6FailureProcessedByNode3 + Node4ManageTheBreakDownOfNode6 + Node4HasAskedItsLeafSetToRxToReplaceNode6 + Node4HasTheLeafSetOfRxToReplaceNode6 + Node6FailureProcessedByNode4 + Node5ManageTheBreakDownOfNode6 + Node5HasAskedItsLeafSetToRxToReplaceNode6 + Node5HasTheLeafSetOfRxToReplaceNode6 + Node6FailureProcessedByNode5 - Node6Failure + NoNodeManageTheBreakDownOfNode6 + Node7ManageTheBreakDownOfNode6 + Node7HasAskedItsLeafSetToRxToReplaceNode6 + Node7HasTheLeafSetOfRxToReplaceNode6 + Node6FailureProcessedByNode7 + Node8ManageTheBreakDownOfNode6 + Node8HasAskedItsLeafSetToRxToReplaceNode6 + Node8HasTheLeafSetOfRxToReplaceNode6 + Node6FailureProcessedByNode8 = 0
inv : Node5HasAskedItsLeafSetToRxToReplaceNode4 + Node5HasAskedItsLeafSetToRxToReplaceNode6 + Node5HasAskedItsLeafSetToRxToReplaceNode7 + Node5HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode5IsSentToRx - LeafSetOfRxIsSentToNode5 - RxHasReceivedTheRequestOfNode5 = 0
inv : -Node0DontAnswerToAnyNode + NoNodeManageTheBreakDownOfNode0 - Node1WantsToManageTheBreakDownOfNode0 - Node2WantsToManageTheBreakDownOfNode0 - Node3WantsToManageTheBreakDownOfNode0 - Node4WantsToManageTheBreakDownOfNode0 - Node5WantsToManageTheBreakDownOfNode0 - Node6WantsToManageTheBreakDownOfNode0 - Node7WantsToManageTheBreakDownOfNode0 - Node8WantsToManageTheBreakDownOfNode0 = 0
inv : Node0ManageTheBreakDownOfNode3 + Node0HasAskedItsLeafSetToLxToReplaceNode3 + Node0HasTheLeafSetOfLxToReplaceNode3 + Node3FailureProcessedByNode0 + Node1ManageTheBreakDownOfNode3 + Node1HasAskedItsLeafSetToLxToReplaceNode3 + Node1HasTheLeafSetOfLxToReplaceNode3 + Node3FailureProcessedByNode1 + Node2ManageTheBreakDownOfNode3 + Node2HasAskedItsLeafSetToLxToReplaceNode3 + Node2HasTheLeafSetOfLxToReplaceNode3 + Node3FailureProcessedByNode2 - Node3Failure + NoNodeManageTheBreakDownOfNode3 + Node4ManageTheBreakDownOfNode3 + Node4HasAskedItsLeafSetToLxToReplaceNode3 + Node4HasTheLeafSetOfLxToReplaceNode3 + Node3FailureProcessedByNode4 + Node5ManageTheBreakDownOfNode3 + Node5HasAskedItsLeafSetToLxToReplaceNode3 + Node5HasTheLeafSetOfLxToReplaceNode3 + Node3FailureProcessedByNode5 + Node6ManageTheBreakDownOfNode3 + Node6HasAskedItsLeafSetToLxToReplaceNode3 + Node6HasTheLeafSetOfLxToReplaceNode3 + Node3FailureProcessedByNode6 + Node7ManageTheBreakDownOfNode3 + Node7HasAskedItsLeafSetToLxToReplaceNode3 + Node7HasTheLeafSetOfLxToReplaceNode3 + Node3FailureProcessedByNode7 + Node8ManageTheBreakDownOfNode3 + Node8HasAskedItsLeafSetToLxToReplaceNode3 + Node8HasTheLeafSetOfLxToReplaceNode3 + Node3FailureProcessedByNode8 = 0
inv : Node0ManageTheBreakDownOfNode4 + Node0HasAskedItsLeafSetToLxToReplaceNode4 + Node0HasTheLeafSetOfLxToReplaceNode4 + Node4FailureProcessedByNode0 + Node1ManageTheBreakDownOfNode4 + Node1HasAskedItsLeafSetToLxToReplaceNode4 + Node1HasTheLeafSetOfLxToReplaceNode4 + Node4FailureProcessedByNode1 + Node2ManageTheBreakDownOfNode4 + Node2HasAskedItsLeafSetToLxToReplaceNode4 + Node2HasTheLeafSetOfLxToReplaceNode4 + Node4FailureProcessedByNode2 + Node3ManageTheBreakDownOfNode4 + Node3HasAskedItsLeafSetToLxToReplaceNode4 + Node3HasTheLeafSetOfLxToReplaceNode4 + Node4FailureProcessedByNode3 - Node4Failure + NoNodeManageTheBreakDownOfNode4 + Node5ManageTheBreakDownOfNode4 + Node5HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode5 - Node5HasAskedItsLeafSetToRxToReplaceNode6 - Node5HasAskedItsLeafSetToRxToReplaceNode7 - Node5HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode5IsSentToRx + LeafSetOfRxIsSentToNode5 + Node6ManageTheBreakDownOfNode4 + Node6HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode6 - Node6HasAskedItsLeafSetToRxToReplaceNode5 - Node6HasAskedItsLeafSetToRxToReplaceNode7 - Node6HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode6IsSentToRx + LeafSetOfRxIsSentToNode6 + Node7ManageTheBreakDownOfNode4 + Node7HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode7 - Node7HasAskedItsLeafSetToRxToReplaceNode5 - Node7HasAskedItsLeafSetToRxToReplaceNode6 - Node7HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode7IsSentToRx + LeafSetOfRxIsSentToNode7 + Node8ManageTheBreakDownOfNode4 + Node8HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode8 - Node8HasAskedItsLeafSetToRxToReplaceNode5 - Node8HasAskedItsLeafSetToRxToReplaceNode6 - Node8HasAskedItsLeafSetToRxToReplaceNode7 + RequestOfNode8IsSentToRx + LeafSetOfRxIsSentToNode8 + RxHasReceivedTheRequestOfNode5 + RxHasReceivedTheRequestOfNode6 + RxHasReceivedTheRequestOfNode7 + RxHasReceivedTheRequestOfNode8 = 0
inv : Node0ManageTheBreakDownOfNode5 + Node0HasAskedItsLeafSetToRxToReplaceNode5 + Node0HasTheLeafSetOfRxToReplaceNode5 - Node6FailureProcessedByNode0 - Node7FailureProcessedByNode0 - Node8FailureProcessedByNode0 + Node1ManageTheBreakDownOfNode5 + Node1HasTheLeafSetOfRxToReplaceNode5 - Node1HasAskedItsLeafSetToRxToReplaceNode6 - Node6FailureProcessedByNode1 - Node1HasAskedItsLeafSetToRxToReplaceNode7 - Node7FailureProcessedByNode1 - Node1HasAskedItsLeafSetToRxToReplaceNode8 - Node8FailureProcessedByNode1 + RequestOfNode1IsSentToRx + LeafSetOfRxIsSentToNode1 + Node2ManageTheBreakDownOfNode5 + Node2HasTheLeafSetOfRxToReplaceNode5 - Node2HasAskedItsLeafSetToRxToReplaceNode6 - Node6FailureProcessedByNode2 - Node2HasAskedItsLeafSetToRxToReplaceNode7 - Node7FailureProcessedByNode2 - Node2HasAskedItsLeafSetToRxToReplaceNode8 - Node8FailureProcessedByNode2 + RequestOfNode2IsSentToRx + LeafSetOfRxIsSentToNode2 + Node3ManageTheBreakDownOfNode5 + Node3HasTheLeafSetOfRxToReplaceNode5 - Node3HasAskedItsLeafSetToRxToReplaceNode6 - Node6FailureProcessedByNode3 - Node3HasAskedItsLeafSetToRxToReplaceNode7 - Node7FailureProcessedByNode3 - Node3HasAskedItsLeafSetToRxToReplaceNode8 - Node8FailureProcessedByNode3 + RequestOfNode3IsSentToRx + LeafSetOfRxIsSentToNode3 + Node4ManageTheBreakDownOfNode5 + Node4HasTheLeafSetOfRxToReplaceNode5 - Node4HasAskedItsLeafSetToRxToReplaceNode6 - Node6FailureProcessedByNode4 - Node4HasAskedItsLeafSetToRxToReplaceNode7 - Node7FailureProcessedByNode4 - Node4HasAskedItsLeafSetToRxToReplaceNode8 - Node8FailureProcessedByNode4 + RequestOfNode4IsSentToRx + LeafSetOfRxIsSentToNode4 - Node5Failure - Node4FailureProcessedByNode5 - Node6FailureProcessedByNode5 - Node7FailureProcessedByNode5 - Node8FailureProcessedByNode5 + NoNodeManageTheBreakDownOfNode5 - Node4FailureProcessedByNode6 + Node6ManageTheBreakDownOfNode5 + Node6HasAskedItsLeafSetToRxToReplaceNode5 + Node6HasTheLeafSetOfRxToReplaceNode5 - Node7FailureProcessedByNode6 - Node8FailureProcessedByNode6 - Node4FailureProcessedByNode7 + Node7ManageTheBreakDownOfNode5 + Node7HasAskedItsLeafSetToRxToReplaceNode5 + Node7HasTheLeafSetOfRxToReplaceNode5 - Node6FailureProcessedByNode7 - Node8FailureProcessedByNode7 - Node4FailureProcessedByNode8 + Node8ManageTheBreakDownOfNode5 + Node8HasAskedItsLeafSetToRxToReplaceNode5 + Node8HasTheLeafSetOfRxToReplaceNode5 - Node6FailureProcessedByNode8 - Node7FailureProcessedByNode8 + RxIsActiveInTheLeafSet + RxHasReceivedTheRequestOfNode1 + RxHasReceivedTheRequestOfNode2 + RxHasReceivedTheRequestOfNode3 + RxHasReceivedTheRequestOfNode4 + ANodeFromTheLeafSetOfRxIsACtiveInTheLeafSet = 0
inv : Node4HasAskedItsLeafSetToRxToReplaceNode5 + Node4HasAskedItsLeafSetToRxToReplaceNode6 + Node4HasAskedItsLeafSetToRxToReplaceNode7 + Node4HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode4IsSentToRx - LeafSetOfRxIsSentToNode4 - RxHasReceivedTheRequestOfNode4 = 0
inv : Node6IsActive + Node6Failure = 1
inv : Node0ManageTheBreakDownOfNode1 + Node0HasAskedItsLeafSetToLxToReplaceNode1 + Node0HasTheLeafSetOfLxToReplaceNode1 - Node2FailureProcessedByNode0 - Node3FailureProcessedByNode0 - Node4FailureProcessedByNode0 - Node1Failure - Node0FailureProcessedByNode1 - Node2FailureProcessedByNode1 - Node3FailureProcessedByNode1 - Node4FailureProcessedByNode1 + NoNodeManageTheBreakDownOfNode1 - Node0FailureProcessedByNode2 + Node2ManageTheBreakDownOfNode1 + Node2HasAskedItsLeafSetToLxToReplaceNode1 + Node2HasTheLeafSetOfLxToReplaceNode1 - Node3FailureProcessedByNode2 - Node4FailureProcessedByNode2 - Node0FailureProcessedByNode3 + Node3ManageTheBreakDownOfNode1 + Node3HasAskedItsLeafSetToLxToReplaceNode1 + Node3HasTheLeafSetOfLxToReplaceNode1 - Node2FailureProcessedByNode3 - Node4FailureProcessedByNode3 - Node0FailureProcessedByNode4 + Node4ManageTheBreakDownOfNode1 + Node4HasAskedItsLeafSetToLxToReplaceNode1 + Node4HasTheLeafSetOfLxToReplaceNode1 - Node2FailureProcessedByNode4 - Node3FailureProcessedByNode4 - Node0FailureProcessedByNode5 + Node5ManageTheBreakDownOfNode1 + Node5HasAskedItsLeafSetToLxToReplaceNode1 + Node5HasTheLeafSetOfLxToReplaceNode1 - Node2FailureProcessedByNode5 - Node3FailureProcessedByNode5 - Node0FailureProcessedByNode6 + Node6ManageTheBreakDownOfNode1 + Node6HasAskedItsLeafSetToLxToReplaceNode1 + Node6HasTheLeafSetOfLxToReplaceNode1 - Node2FailureProcessedByNode6 - Node3FailureProcessedByNode6 - Node0FailureProcessedByNode7 + Node7ManageTheBreakDownOfNode1 + Node7HasAskedItsLeafSetToLxToReplaceNode1 + Node7HasTheLeafSetOfLxToReplaceNode1 - Node2FailureProcessedByNode7 - Node3FailureProcessedByNode7 - Node0FailureProcessedByNode8 + Node8ManageTheBreakDownOfNode1 + Node8HasAskedItsLeafSetToLxToReplaceNode1 + Node8HasTheLeafSetOfLxToReplaceNode1 - Node2FailureProcessedByNode8 - Node3FailureProcessedByNode8 + LxIsActiveInTheLeafSet + ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet = 0
inv : Node0ManageTheBreakDownOfNode8 + Node0HasAskedItsLeafSetToRxToReplaceNode8 + Node0HasTheLeafSetOfRxToReplaceNode8 + Node8FailureProcessedByNode0 + Node1ManageTheBreakDownOfNode8 + Node1HasAskedItsLeafSetToRxToReplaceNode8 + Node1HasTheLeafSetOfRxToReplaceNode8 + Node8FailureProcessedByNode1 + Node2ManageTheBreakDownOfNode8 + Node2HasAskedItsLeafSetToRxToReplaceNode8 + Node2HasTheLeafSetOfRxToReplaceNode8 + Node8FailureProcessedByNode2 + Node3ManageTheBreakDownOfNode8 + Node3HasAskedItsLeafSetToRxToReplaceNode8 + Node3HasTheLeafSetOfRxToReplaceNode8 + Node8FailureProcessedByNode3 + Node4ManageTheBreakDownOfNode8 + Node4HasAskedItsLeafSetToRxToReplaceNode8 + Node4HasTheLeafSetOfRxToReplaceNode8 + Node8FailureProcessedByNode4 + Node5ManageTheBreakDownOfNode8 + Node5HasAskedItsLeafSetToRxToReplaceNode8 + Node5HasTheLeafSetOfRxToReplaceNode8 + Node8FailureProcessedByNode5 + Node6ManageTheBreakDownOfNode8 + Node6HasAskedItsLeafSetToRxToReplaceNode8 + Node6HasTheLeafSetOfRxToReplaceNode8 + Node8FailureProcessedByNode6 + Node7ManageTheBreakDownOfNode8 + Node7HasAskedItsLeafSetToRxToReplaceNode8 + Node7HasTheLeafSetOfRxToReplaceNode8 + Node8FailureProcessedByNode7 - Node8Failure + NoNodeManageTheBreakDownOfNode8 = 0
inv : LxIsActiveAndNotInTheLeafSet + LxIsActiveInTheLeafSet = 1
inv : Node7HasAskedItsLeafSetToRxToReplaceNode4 + Node7HasAskedItsLeafSetToRxToReplaceNode5 + Node7HasAskedItsLeafSetToRxToReplaceNode6 + Node7HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode7IsSentToRx - LeafSetOfRxIsSentToNode7 - RxHasReceivedTheRequestOfNode7 = 0
inv : -Node0WantsToManageTheBreakDownOfNode2 - Node1WantsToManageTheBreakDownOfNode2 - Node2DontAnswerToAnyNode + NoNodeManageTheBreakDownOfNode2 - Node3WantsToManageTheBreakDownOfNode2 - Node4WantsToManageTheBreakDownOfNode2 - Node5WantsToManageTheBreakDownOfNode2 - Node6WantsToManageTheBreakDownOfNode2 - Node7WantsToManageTheBreakDownOfNode2 - Node8WantsToManageTheBreakDownOfNode2 = 0
inv : Node3HasAskedItsLeafSetToRxToReplaceNode5 + Node3HasAskedItsLeafSetToRxToReplaceNode6 + Node3HasAskedItsLeafSetToRxToReplaceNode7 + Node3HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode3IsSentToRx - LeafSetOfRxIsSentToNode3 - RxHasReceivedTheRequestOfNode3 = 0
inv : Node4HasAskedItsLeafSetToLxToReplaceNode0 + Node4HasAskedItsLeafSetToLxToReplaceNode1 + Node4HasAskedItsLeafSetToLxToReplaceNode2 + Node4HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode4IsSentToLx - LeafSetOfLxIsSentToNode4 - LxHasReceivedTheRequestOfNode4 = 0
inv : Node0WantsToManageTheBreakDownOfNode6 + Node1WantsToManageTheBreakDownOfNode6 + Node2WantsToManageTheBreakDownOfNode6 + Node3WantsToManageTheBreakDownOfNode6 + Node4WantsToManageTheBreakDownOfNode6 + Node5WantsToManageTheBreakDownOfNode6 + Node6DontAnswerToAnyNode - NoNodeManageTheBreakDownOfNode6 + Node7WantsToManageTheBreakDownOfNode6 + Node8WantsToManageTheBreakDownOfNode6 = 0
inv : Node8HasAskedItsLeafSetToLxToReplaceNode0 + Node8HasAskedItsLeafSetToLxToReplaceNode1 + Node8HasAskedItsLeafSetToLxToReplaceNode2 + Node8HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode8IsSentToLx - LeafSetOfLxIsSentToNode8 - LxHasReceivedTheRequestOfNode8 = 0
inv : Node7HasAskedItsLeafSetToLxToReplaceNode0 + Node7HasAskedItsLeafSetToLxToReplaceNode1 + Node7HasAskedItsLeafSetToLxToReplaceNode2 + Node7HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode7IsSentToLx - LeafSetOfLxIsSentToNode7 - LxHasReceivedTheRequestOfNode7 = 0
inv : Node0WantsToManageTheBreakDownOfNode1 + Node1DontAnswerToAnyNode - NoNodeManageTheBreakDownOfNode1 + Node2WantsToManageTheBreakDownOfNode1 + Node3WantsToManageTheBreakDownOfNode1 + Node4WantsToManageTheBreakDownOfNode1 + Node5WantsToManageTheBreakDownOfNode1 + Node6WantsToManageTheBreakDownOfNode1 + Node7WantsToManageTheBreakDownOfNode1 + Node8WantsToManageTheBreakDownOfNode1 = 0
inv : Node1HasAskedItsLeafSetToLxToReplaceNode0 + Node1HasAskedItsLeafSetToLxToReplaceNode2 + Node1HasAskedItsLeafSetToLxToReplaceNode3 + Node1HasAskedItsLeafSetToLxToReplaceNode4 - RequestOfNode1IsSentToLx - LeafSetOfLxIsSentToNode1 - LxHasReceivedTheRequestOfNode1 = 0
inv : Node5isTheNodeMaster - Node5ManageTheBreakDownOfNode4 - Node5HasTheLeafSetOfRxToReplaceNode4 - Node4FailureProcessedByNode5 + Node5HasAskedItsLeafSetToRxToReplaceNode6 + Node5HasAskedItsLeafSetToRxToReplaceNode7 + Node5HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode5IsSentToRx - LeafSetOfRxIsSentToNode5 - Node6WantsToManageTheBreakDownOfNode4 - Node6ManageTheBreakDownOfNode4 - Node6HasTheLeafSetOfRxToReplaceNode4 - Node4FailureProcessedByNode6 + Node6HasAskedItsLeafSetToRxToReplaceNode5 + Node6HasAskedItsLeafSetToRxToReplaceNode7 + Node6HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode6IsSentToRx - LeafSetOfRxIsSentToNode6 - Node7WantsToManageTheBreakDownOfNode4 - Node7ManageTheBreakDownOfNode4 - Node7HasTheLeafSetOfRxToReplaceNode4 - Node4FailureProcessedByNode7 + Node7HasAskedItsLeafSetToRxToReplaceNode5 + Node7HasAskedItsLeafSetToRxToReplaceNode6 + Node7HasAskedItsLeafSetToRxToReplaceNode8 - RequestOfNode7IsSentToRx - LeafSetOfRxIsSentToNode7 - Node8WantsToManageTheBreakDownOfNode4 - Node8ManageTheBreakDownOfNode4 - Node8HasTheLeafSetOfRxToReplaceNode4 - Node4FailureProcessedByNode8 + Node8HasAskedItsLeafSetToRxToReplaceNode5 + Node8HasAskedItsLeafSetToRxToReplaceNode6 + Node8HasAskedItsLeafSetToRxToReplaceNode7 - RequestOfNode8IsSentToRx - LeafSetOfRxIsSentToNode8 + RightNodeHasDetectedBreakDownOfMaster - RxHasReceivedTheRequestOfNode5 - RxHasReceivedTheRequestOfNode6 - RxHasReceivedTheRequestOfNode7 - RxHasReceivedTheRequestOfNode8 = 0
inv : Node0WantsToManageTheBreakDownOfNode4 + Node1WantsToManageTheBreakDownOfNode4 + Node2WantsToManageTheBreakDownOfNode4 + Node3WantsToManageTheBreakDownOfNode4 + Node4DontAnswerToAnyNode - NoNodeManageTheBreakDownOfNode4 + Node5WantsToManageTheBreakDownOfNode4 + Node6WantsToManageTheBreakDownOfNode4 + Node7WantsToManageTheBreakDownOfNode4 + Node8WantsToManageTheBreakDownOfNode4 = 0
inv : Node5HasAskedItsLeafSetToLxToReplaceNode0 + Node5HasAskedItsLeafSetToLxToReplaceNode1 + Node5HasAskedItsLeafSetToLxToReplaceNode2 + Node5HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode5IsSentToLx - LeafSetOfLxIsSentToNode5 - LxHasReceivedTheRequestOfNode5 = 0
inv : Node5IsActive + Node5Failure = 1
inv : Node0IsActive + Node0DontAnswerToAnyNode + Node1WantsToManageTheBreakDownOfNode0 + Node1ManageTheBreakDownOfNode0 + Node1HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode1 - Node1HasAskedItsLeafSetToLxToReplaceNode2 - Node1HasAskedItsLeafSetToLxToReplaceNode3 - Node1HasAskedItsLeafSetToLxToReplaceNode4 + RequestOfNode1IsSentToLx + LeafSetOfLxIsSentToNode1 + Node2WantsToManageTheBreakDownOfNode0 + Node2ManageTheBreakDownOfNode0 + Node2HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode2 - Node2HasAskedItsLeafSetToLxToReplaceNode1 - Node2HasAskedItsLeafSetToLxToReplaceNode3 - Node2HasAskedItsLeafSetToLxToReplaceNode4 + RequestOfNode2IsSentToLx + LeafSetOfLxIsSentToNode2 + Node3WantsToManageTheBreakDownOfNode0 + Node3ManageTheBreakDownOfNode0 + Node3HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode3 - Node3HasAskedItsLeafSetToLxToReplaceNode1 - Node3HasAskedItsLeafSetToLxToReplaceNode2 - Node3HasAskedItsLeafSetToLxToReplaceNode4 + RequestOfNode3IsSentToLx + LeafSetOfLxIsSentToNode3 + Node4WantsToManageTheBreakDownOfNode0 + Node4ManageTheBreakDownOfNode0 + Node4HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode4 - Node4HasAskedItsLeafSetToLxToReplaceNode1 - Node4HasAskedItsLeafSetToLxToReplaceNode2 - Node4HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode4IsSentToLx + LeafSetOfLxIsSentToNode4 + Node5WantsToManageTheBreakDownOfNode0 + Node5ManageTheBreakDownOfNode0 + Node5HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode5 - Node5HasAskedItsLeafSetToLxToReplaceNode1 - Node5HasAskedItsLeafSetToLxToReplaceNode2 - Node5HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode5IsSentToLx + LeafSetOfLxIsSentToNode5 + Node6WantsToManageTheBreakDownOfNode0 + Node6ManageTheBreakDownOfNode0 + Node6HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode6 - Node6HasAskedItsLeafSetToLxToReplaceNode1 - Node6HasAskedItsLeafSetToLxToReplaceNode2 - Node6HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode6IsSentToLx + LeafSetOfLxIsSentToNode6 + Node7WantsToManageTheBreakDownOfNode0 + Node7ManageTheBreakDownOfNode0 + Node7HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode7 - Node7HasAskedItsLeafSetToLxToReplaceNode1 - Node7HasAskedItsLeafSetToLxToReplaceNode2 - Node7HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode7IsSentToLx + LeafSetOfLxIsSentToNode7 + Node8WantsToManageTheBreakDownOfNode0 + Node8ManageTheBreakDownOfNode0 + Node8HasTheLeafSetOfLxToReplaceNode0 + Node0FailureProcessedByNode8 - Node8HasAskedItsLeafSetToLxToReplaceNode1 - Node8HasAskedItsLeafSetToLxToReplaceNode2 - Node8HasAskedItsLeafSetToLxToReplaceNode3 + RequestOfNode8IsSentToLx + LeafSetOfLxIsSentToNode8 + LxHasReceivedTheRequestOfNode1 + LxHasReceivedTheRequestOfNode2 + LxHasReceivedTheRequestOfNode3 + LxHasReceivedTheRequestOfNode4 + LxHasReceivedTheRequestOfNode5 + LxHasReceivedTheRequestOfNode6 + LxHasReceivedTheRequestOfNode7 + LxHasReceivedTheRequestOfNode8 = 1
inv : Node3WantsToManageTheBreakDownOfNode4 + Node3isTheNodeMaster - Node4Failure + Node4DontAnswerToAnyNode + Node5WantsToManageTheBreakDownOfNode4 + Node5ManageTheBreakDownOfNode4 + Node5HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode5 - Node5HasAskedItsLeafSetToRxToReplaceNode6 - Node5HasAskedItsLeafSetToRxToReplaceNode7 - Node5HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode5IsSentToRx + LeafSetOfRxIsSentToNode5 + Node6WantsToManageTheBreakDownOfNode4 + Node6ManageTheBreakDownOfNode4 + Node6HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode6 - Node6HasAskedItsLeafSetToRxToReplaceNode5 - Node6HasAskedItsLeafSetToRxToReplaceNode7 - Node6HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode6IsSentToRx + LeafSetOfRxIsSentToNode6 + Node7WantsToManageTheBreakDownOfNode4 + Node7ManageTheBreakDownOfNode4 + Node7HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode7 - Node7HasAskedItsLeafSetToRxToReplaceNode5 - Node7HasAskedItsLeafSetToRxToReplaceNode6 - Node7HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode7IsSentToRx + LeafSetOfRxIsSentToNode7 + Node8WantsToManageTheBreakDownOfNode4 + Node8ManageTheBreakDownOfNode4 + Node8HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode8 - Node8HasAskedItsLeafSetToRxToReplaceNode5 - Node8HasAskedItsLeafSetToRxToReplaceNode6 - Node8HasAskedItsLeafSetToRxToReplaceNode7 + RequestOfNode8IsSentToRx + LeafSetOfRxIsSentToNode8 + LeftNodeHasDetectedBreakDownOfMaster + RxHasReceivedTheRequestOfNode5 + RxHasReceivedTheRequestOfNode6 + RxHasReceivedTheRequestOfNode7 + RxHasReceivedTheRequestOfNode8 = 0
inv : Node0ManageTheBreakDownOfNode1 + Node0HasTheLeafSetOfLxToReplaceNode1 + Node0WantsToManageTheBreakDownOfNode2 + Node0ManageTheBreakDownOfNode2 + Node0HasTheLeafSetOfLxToReplaceNode2 + Node0ManageTheBreakDownOfNode3 + Node0HasTheLeafSetOfLxToReplaceNode3 + Node0ManageTheBreakDownOfNode4 + Node0HasTheLeafSetOfLxToReplaceNode4 + RequestOfNode0IsSentToLx + LeafSetOfLxIsSentToNode0 - Node1Failure - Node0FailureProcessedByNode1 + Node1WantsToManageTheBreakDownOfNode2 + Node1ManageTheBreakDownOfNode2 + Node1HasAskedItsLeafSetToLxToReplaceNode2 + Node1HasTheLeafSetOfLxToReplaceNode2 + Node1ManageTheBreakDownOfNode3 + Node1HasAskedItsLeafSetToLxToReplaceNode3 + Node1HasTheLeafSetOfLxToReplaceNode3 + Node1ManageTheBreakDownOfNode4 + Node1HasAskedItsLeafSetToLxToReplaceNode4 + Node1HasTheLeafSetOfLxToReplaceNode4 + NoNodeManageTheBreakDownOfNode1 - Node2Failure - Node0FailureProcessedByNode2 + Node2ManageTheBreakDownOfNode1 + Node2HasAskedItsLeafSetToLxToReplaceNode1 + Node2HasTheLeafSetOfLxToReplaceNode1 + Node2ManageTheBreakDownOfNode3 + Node2HasAskedItsLeafSetToLxToReplaceNode3 + Node2HasTheLeafSetOfLxToReplaceNode3 + Node2ManageTheBreakDownOfNode4 + Node2HasAskedItsLeafSetToLxToReplaceNode4 + Node2HasTheLeafSetOfLxToReplaceNode4 + Node2DontAnswerToAnyNode - Node3Failure - Node0FailureProcessedByNode3 + Node3ManageTheBreakDownOfNode1 + Node3HasAskedItsLeafSetToLxToReplaceNode1 + Node3HasTheLeafSetOfLxToReplaceNode1 + Node3WantsToManageTheBreakDownOfNode2 + Node3ManageTheBreakDownOfNode2 + Node3HasAskedItsLeafSetToLxToReplaceNode2 + Node3HasTheLeafSetOfLxToReplaceNode2 + Node3ManageTheBreakDownOfNode4 + Node3HasAskedItsLeafSetToLxToReplaceNode4 + Node3HasTheLeafSetOfLxToReplaceNode4 + NoNodeManageTheBreakDownOfNode3 - Node4Failure - Node0FailureProcessedByNode4 + Node4ManageTheBreakDownOfNode1 + Node4HasAskedItsLeafSetToLxToReplaceNode1 + Node4HasTheLeafSetOfLxToReplaceNode1 + Node4WantsToManageTheBreakDownOfNode2 + Node4ManageTheBreakDownOfNode2 + Node4HasAskedItsLeafSetToLxToReplaceNode2 + Node4HasTheLeafSetOfLxToReplaceNode2 + Node4ManageTheBreakDownOfNode3 + Node4HasAskedItsLeafSetToLxToReplaceNode3 + Node4HasTheLeafSetOfLxToReplaceNode3 + NoNodeManageTheBreakDownOfNode4 - Node0FailureProcessedByNode5 + Node5ManageTheBreakDownOfNode1 + Node5HasAskedItsLeafSetToLxToReplaceNode1 + Node5HasTheLeafSetOfLxToReplaceNode1 + Node5WantsToManageTheBreakDownOfNode2 + Node5ManageTheBreakDownOfNode2 + Node5HasAskedItsLeafSetToLxToReplaceNode2 + Node5HasTheLeafSetOfLxToReplaceNode2 + Node5ManageTheBreakDownOfNode3 + Node5HasAskedItsLeafSetToLxToReplaceNode3 + Node5HasTheLeafSetOfLxToReplaceNode3 + Node5ManageTheBreakDownOfNode4 + Node5HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode5 - Node5HasAskedItsLeafSetToRxToReplaceNode6 - Node5HasAskedItsLeafSetToRxToReplaceNode7 - Node5HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode5IsSentToRx + LeafSetOfRxIsSentToNode5 - Node0FailureProcessedByNode6 + Node6ManageTheBreakDownOfNode1 + Node6HasAskedItsLeafSetToLxToReplaceNode1 + Node6HasTheLeafSetOfLxToReplaceNode1 + Node6WantsToManageTheBreakDownOfNode2 + Node6ManageTheBreakDownOfNode2 + Node6HasAskedItsLeafSetToLxToReplaceNode2 + Node6HasTheLeafSetOfLxToReplaceNode2 + Node6ManageTheBreakDownOfNode3 + Node6HasAskedItsLeafSetToLxToReplaceNode3 + Node6HasTheLeafSetOfLxToReplaceNode3 + Node6ManageTheBreakDownOfNode4 + Node6HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode6 - Node6HasAskedItsLeafSetToRxToReplaceNode5 - Node6HasAskedItsLeafSetToRxToReplaceNode7 - Node6HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode6IsSentToRx + LeafSetOfRxIsSentToNode6 - Node0FailureProcessedByNode7 + Node7ManageTheBreakDownOfNode1 + Node7HasAskedItsLeafSetToLxToReplaceNode1 + Node7HasTheLeafSetOfLxToReplaceNode1 + Node7WantsToManageTheBreakDownOfNode2 + Node7ManageTheBreakDownOfNode2 + Node7HasAskedItsLeafSetToLxToReplaceNode2 + Node7HasTheLeafSetOfLxToReplaceNode2 + Node7ManageTheBreakDownOfNode3 + Node7HasAskedItsLeafSetToLxToReplaceNode3 + Node7HasTheLeafSetOfLxToReplaceNode3 + Node7ManageTheBreakDownOfNode4 + Node7HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode7 - Node7HasAskedItsLeafSetToRxToReplaceNode5 - Node7HasAskedItsLeafSetToRxToReplaceNode6 - Node7HasAskedItsLeafSetToRxToReplaceNode8 + RequestOfNode7IsSentToRx + LeafSetOfRxIsSentToNode7 - Node0FailureProcessedByNode8 + Node8ManageTheBreakDownOfNode1 + Node8HasAskedItsLeafSetToLxToReplaceNode1 + Node8HasTheLeafSetOfLxToReplaceNode1 + Node8WantsToManageTheBreakDownOfNode2 + Node8ManageTheBreakDownOfNode2 + Node8HasAskedItsLeafSetToLxToReplaceNode2 + Node8HasTheLeafSetOfLxToReplaceNode2 + Node8ManageTheBreakDownOfNode3 + Node8HasAskedItsLeafSetToLxToReplaceNode3 + Node8HasTheLeafSetOfLxToReplaceNode3 + Node8ManageTheBreakDownOfNode4 + Node8HasTheLeafSetOfRxToReplaceNode4 + Node4FailureProcessedByNode8 - Node8HasAskedItsLeafSetToRxToReplaceNode5 - Node8HasAskedItsLeafSetToRxToReplaceNode6 - Node8HasAskedItsLeafSetToRxToReplaceNode7 + RequestOfNode8IsSentToRx + LeafSetOfRxIsSentToNode8 + LxIsActiveInTheLeafSet + LxHasReceivedTheRequestOfNode0 + RxHasReceivedTheRequestOfNode5 + RxHasReceivedTheRequestOfNode6 + RxHasReceivedTheRequestOfNode7 + RxHasReceivedTheRequestOfNode8 + ANodeFromTheLeafSetOfLxIsACtiveInTheLeafSet = 0
inv : Node4isTheNodeMaster + Node4Failure = 1
inv : Node3HasAskedItsLeafSetToLxToReplaceNode0 + Node3HasAskedItsLeafSetToLxToReplaceNode1 + Node3HasAskedItsLeafSetToLxToReplaceNode2 + Node3HasAskedItsLeafSetToLxToReplaceNode4 - RequestOfNode3IsSentToLx - LeafSetOfLxIsSentToNode3 - LxHasReceivedTheRequestOfNode3 = 0
inv : Node2IsActive + Node2Failure = 1
inv : Node0Failure - Node0DontAnswerToAnyNode - Node1WantsToManageTheBreakDownOfNode0 - Node1ManageTheBreakDownOfNode0 - Node1HasTheLeafSetOfLxToReplaceNode0 - Node0FailureProcessedByNode1 + Node1HasAskedItsLeafSetToLxToReplaceNode2 + Node1HasAskedItsLeafSetToLxToReplaceNode3 + Node1HasAskedItsLeafSetToLxToReplaceNode4 - RequestOfNode1IsSentToLx - LeafSetOfLxIsSentToNode1 - Node2WantsToManageTheBreakDownOfNode0 - Node2ManageTheBreakDownOfNode0 - Node2HasTheLeafSetOfLxToReplaceNode0 - Node0FailureProcessedByNode2 + Node2HasAskedItsLeafSetToLxToReplaceNode1 + Node2HasAskedItsLeafSetToLxToReplaceNode3 + Node2HasAskedItsLeafSetToLxToReplaceNode4 - RequestOfNode2IsSentToLx - LeafSetOfLxIsSentToNode2 - Node3WantsToManageTheBreakDownOfNode0 - Node3ManageTheBreakDownOfNode0 - Node3HasTheLeafSetOfLxToReplaceNode0 - Node0FailureProcessedByNode3 + Node3HasAskedItsLeafSetToLxToReplaceNode1 + Node3HasAskedItsLeafSetToLxToReplaceNode2 + Node3HasAskedItsLeafSetToLxToReplaceNode4 - RequestOfNode3IsSentToLx - LeafSetOfLxIsSentToNode3 - Node4WantsToManageTheBreakDownOfNode0 - Node4ManageTheBreakDownOfNode0 - Node4HasTheLeafSetOfLxToReplaceNode0 - Node0FailureProcessedByNode4 + Node4HasAskedItsLeafSetToLxToReplaceNode1 + Node4HasAskedItsLeafSetToLxToReplaceNode2 + Node4HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode4IsSentToLx - LeafSetOfLxIsSentToNode4 - Node5WantsToManageTheBreakDownOfNode0 - Node5ManageTheBreakDownOfNode0 - Node5HasTheLeafSetOfLxToReplaceNode0 - Node0FailureProcessedByNode5 + Node5HasAskedItsLeafSetToLxToReplaceNode1 + Node5HasAskedItsLeafSetToLxToReplaceNode2 + Node5HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode5IsSentToLx - LeafSetOfLxIsSentToNode5 - Node6WantsToManageTheBreakDownOfNode0 - Node6ManageTheBreakDownOfNode0 - Node6HasTheLeafSetOfLxToReplaceNode0 - Node0FailureProcessedByNode6 + Node6HasAskedItsLeafSetToLxToReplaceNode1 + Node6HasAskedItsLeafSetToLxToReplaceNode2 + Node6HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode6IsSentToLx - LeafSetOfLxIsSentToNode6 - Node7WantsToManageTheBreakDownOfNode0 - Node7ManageTheBreakDownOfNode0 - Node7HasTheLeafSetOfLxToReplaceNode0 - Node0FailureProcessedByNode7 + Node7HasAskedItsLeafSetToLxToReplaceNode1 + Node7HasAskedItsLeafSetToLxToReplaceNode2 + Node7HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode7IsSentToLx - LeafSetOfLxIsSentToNode7 - Node8WantsToManageTheBreakDownOfNode0 - Node8ManageTheBreakDownOfNode0 - Node8HasTheLeafSetOfLxToReplaceNode0 - Node0FailureProcessedByNode8 + Node8HasAskedItsLeafSetToLxToReplaceNode1 + Node8HasAskedItsLeafSetToLxToReplaceNode2 + Node8HasAskedItsLeafSetToLxToReplaceNode3 - RequestOfNode8IsSentToLx - LeafSetOfLxIsSentToNode8 - LxHasReceivedTheRequestOfNode1 - LxHasReceivedTheRequestOfNode2 - LxHasReceivedTheRequestOfNode3 - LxHasReceivedTheRequestOfNode4 - LxHasReceivedTheRequestOfNode5 - LxHasReceivedTheRequestOfNode6 - LxHasReceivedTheRequestOfNode7 - LxHasReceivedTheRequestOfNode8 = 0
inv : Node8IsActive + Node8Failure = 1
Total of 53 invariants.
[2021-05-18 15:54:51] [INFO ] Computed 53 place invariants in 13 ms
[2021-05-18 15:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 15:54:51] [INFO ] Removed a total of 342 redundant transitions.
[2021-05-18 15:54:51] [INFO ] Flatten gal took : 80 ms
[2021-05-18 15:54:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 21 ms.
[2021-05-18 15:54:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
[2021-05-18 15:54:51] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !((G(!(X((("((gu92.Node4WantsToManageTheBreakDownOfNode1>gu92.Node5IsActive)||(gi1.gi1.gi2.gi14.gu88.Node4WantsToManageTheBreakDownOfNode7<0))")U("(gu92.Node4WantsToManageTheBreakDownOfNode1<=gu92.Node5IsActive)"))||(!(F("(gi12.gu85.Node4HasTheLeafSetOfRxToReplaceNode5>=1)"))))))))
Formula 0 simplified : !G!X(("((gu92.Node4WantsToManageTheBreakDownOfNode1>gu92.Node5IsActive)||(gi1.gi1.gi2.gi14.gu88.Node4WantsToManageTheBreakDownOfNode7<0))" U "(gu92.Node4WantsToManageTheBreakDownOfNode1<=gu92.Node5IsActive)") | !F"(gi12.gu85.Node4HasTheLeafSetOfRxToReplaceNode5>=1)")
[2021-05-18 15:54:52] [INFO ] Proved 462 variables to be positive in 1077 ms
[2021-05-18 15:54:52] [INFO ] Computing symmetric may disable matrix : 409 transitions.
[2021-05-18 15:54:52] [INFO ] Computation of disable matrix completed :0/409 took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 15:54:52] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 15:54:52] [INFO ] Computing symmetric may enable matrix : 409 transitions.
[2021-05-18 15:54:52] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 15:54:52] [INFO ] Computing symmetric co enabling matrix : 409 transitions.
[2021-05-18 15:54:55] [INFO ] Computation of co-enabling matrix(8/409) took 2540 ms. Total solver calls (SAT/UNSAT): 1352(1352/0)
[2021-05-18 15:54:58] [INFO ] Computation of co-enabling matrix(22/409) took 5577 ms. Total solver calls (SAT/UNSAT): 3306(3306/0)
[2021-05-18 15:55:01] [INFO ] Computation of co-enabling matrix(40/409) took 8651 ms. Total solver calls (SAT/UNSAT): 5565(5565/0)
[2021-05-18 15:55:04] [INFO ] Computation of co-enabling matrix(50/409) took 11663 ms. Total solver calls (SAT/UNSAT): 6708(6708/0)
[2021-05-18 15:55:07] [INFO ] Computation of co-enabling matrix(65/409) took 14846 ms. Total solver calls (SAT/UNSAT): 8486(8486/0)
[2021-05-18 15:55:11] [INFO ] Computation of co-enabling matrix(89/409) took 18076 ms. Total solver calls (SAT/UNSAT): 10635(10635/0)
[2021-05-18 15:55:14] [INFO ] Computation of co-enabling matrix(102/409) took 21132 ms. Total solver calls (SAT/UNSAT): 12207(12207/0)
[2021-05-18 15:55:17] [INFO ] Computation of co-enabling matrix(128/409) took 24201 ms. Total solver calls (SAT/UNSAT): 14244(14244/0)
[2021-05-18 15:55:20] [INFO ] Computation of co-enabling matrix(138/409) took 27224 ms. Total solver calls (SAT/UNSAT): 15327(15327/0)
[2021-05-18 15:55:23] [INFO ] Computation of co-enabling matrix(163/409) took 30345 ms. Total solver calls (SAT/UNSAT): 17255(17255/0)
[2021-05-18 15:55:26] [INFO ] Computation of co-enabling matrix(178/409) took 33415 ms. Total solver calls (SAT/UNSAT): 18453(18453/0)
[2021-05-18 15:55:29] [INFO ] Computation of co-enabling matrix(202/409) took 36495 ms. Total solver calls (SAT/UNSAT): 20041(20041/0)
[2021-05-18 15:55:32] [INFO ] Computation of co-enabling matrix(226/409) took 39790 ms. Total solver calls (SAT/UNSAT): 21712(21712/0)
[2021-05-18 15:55:35] [INFO ] Computation of co-enabling matrix(255/409) took 42893 ms. Total solver calls (SAT/UNSAT): 23329(23329/0)
[2021-05-18 15:55:38] [INFO ] Computation of co-enabling matrix(280/409) took 45939 ms. Total solver calls (SAT/UNSAT): 24736(24736/0)
[2021-05-18 15:55:41] [INFO ] Computation of co-enabling matrix(313/409) took 48960 ms. Total solver calls (SAT/UNSAT): 26095(26095/0)
[2021-05-18 15:55:44] [INFO ] Computation of co-enabling matrix(360/409) took 51998 ms. Total solver calls (SAT/UNSAT): 27267(27267/0)
[2021-05-18 15:55:46] [INFO ] Computation of Finished co-enabling matrix. took 53673 ms. Total solver calls (SAT/UNSAT): 27678(27678/0)
[2021-05-18 15:55:46] [INFO ] Computing Do-Not-Accords matrix : 409 transitions.
Reverse transition relation is NOT exact ! Due to transitions gi1.gi1.gi5.gu101.Node5DetectsTheBreakDownOfTheNodeMaster, gi1.gi1.gi5.gu160.Node3DetectsTheBreakDownOfTheNodeMaster, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/377/2/379
Computing Next relation with stutter on 4276 deadlock states
23 unique states visited
23 strongly connected components in search stack
24 transitions explored
23 items max in DFS search stack
11024 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,110.321,2220204,1,0,695,5.4254e+06,24,417,6342,5.15624e+06,37
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("(gi2.gu53.Node3WantsToManageTheBreakDownOfNode4>gi2.gu53.NoNodeManageTheBreakDownOfNode2)"))||(G("(gi12.gu85.Node7WantsToManageTheBreakDownOfNode8<=gi12.gu85.Node4HasTheLeafSetOfRxToReplaceNode5)"))))
Formula 1 simplified : !(F"(gi2.gu53.Node3WantsToManageTheBreakDownOfNode4>gi2.gu53.NoNodeManageTheBreakDownOfNode2)" | G"(gi12.gu85.Node7WantsToManageTheBreakDownOfNode8<=gi12.gu85.Node4HasTheLeafSetOfRxToReplaceNode5)")
Computing Next relation with stutter on 4276 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1499 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,125.32,2220204,1,0,695,5.4254e+06,44,417,8151,5.15624e+06,314
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(!(X((F("(gi10.gu124.Node6HasAskedItsLeafSetToRxToReplaceNode8<=gi10.gu124.LxHasReceivedTheRequestOfNode5)"))&&(X("(gu166.RxIsActiveAndNotInTheLeafSet<=gu166.Node3ManageTheBreakDownOfNode5)"))))))))
Formula 2 simplified : !XF!X(F"(gi10.gu124.Node6HasAskedItsLeafSetToRxToReplaceNode8<=gi10.gu124.LxHasReceivedTheRequestOfNode5)" & X"(gu166.RxIsActiveAndNotInTheLeafSet<=gu166.Node3ManageTheBreakDownOfNode5)")
Computing Next relation with stutter on 4276 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
49 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,125.803,2220460,1,0,695,5.4254e+06,63,417,8163,5.15624e+06,520
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(!(F((F((("(gi3.gu33.Node6FailureProcessedByNode1<=gi3.gu33.Node3HasAskedItsLeafSetToLxToReplaceNode2)")U("(gi1.gi1.gi2.gi22.gu129.Node7Failure>=1)"))U("(gu65.Node3HasAskedItsLeafSetToRxToReplaceNode6<=gu65.Node4HasTheLeafSetOfRxToReplaceNode8)")))&&(F((F("(gi13.gu159.RequestOfNode8IsSentToLx<=gi13.gu159.Node4FailureProcessedByNode5)"))||("(gu65.Node3HasAskedItsLeafSetToRxToReplaceNode6<=gu65.Node4HasTheLeafSetOfRxToReplaceNode8)"))))))))
Formula 3 simplified : !X!F(F(("(gi3.gu33.Node6FailureProcessedByNode1<=gi3.gu33.Node3HasAskedItsLeafSetToLxToReplaceNode2)" U "(gi1.gi1.gi2.gi22.gu129.Node7Failure>=1)") U "(gu65.Node3HasAskedItsLeafSetToRxToReplaceNode6<=gu65.Node4HasTheLeafSetOfRxToReplaceNode8)") & F("(gu65.Node3HasAskedItsLeafSetToRxToReplaceNode6<=gu65.Node4HasTheLeafSetOfRxToReplaceNode8)" | F"(gi13.gu159.RequestOfNode8IsSentToLx<=gi13.gu159.Node4FailureProcessedByNode5)"))
Computing Next relation with stutter on 4276 deadlock states
[2021-05-18 15:57:00] [INFO ] Computation of Completed DNA matrix. took 73535 ms. Total solver calls (SAT/UNSAT): 2042(0/2042)
[2021-05-18 15:57:00] [INFO ] Built C files in 137432ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
848 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,134.29,2221384,1,0,695,5.4254e+06,69,417,8167,5.15624e+06,566
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(X(("(gu65.Node4HasTheLeafSetOfRxToReplaceNode8<=gu65.Node6HasAskedItsLeafSetToLxToReplaceNode2)")U(G((G(F("(gi7.gu91.Node4HasTheLeafSetOfLxToReplaceNode2<=gi7.gu91.LeafSetOfLxIsSentToNode4)")))||("(gi7.gu91.Node4HasTheLeafSetOfLxToReplaceNode2<=gi7.gu91.LeafSetOfLxIsSentToNode4)")))))))
Formula 4 simplified : X("(gu65.Node4HasTheLeafSetOfRxToReplaceNode8<=gu65.Node6HasAskedItsLeafSetToLxToReplaceNode2)" U G("(gi7.gu91.Node4HasTheLeafSetOfLxToReplaceNode2<=gi7.gu91.LeafSetOfLxIsSentToNode4)" | GF"(gi7.gu91.Node4HasTheLeafSetOfLxToReplaceNode2<=gi7.gu91.LeafSetOfLxIsSentToNode4)"))
Compilation finished in 6323 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Computing Next relation with stutter on 4276 deadlock states
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(((LTLAP11==true))U([](( [](<>((LTLAP12==true)))) || ( (LTLAP12==true)) )))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(((LTLAP11==true))U([](( [](<>((LTLAP12==true)))) || ( (LTLAP12==true)) )))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(((LTLAP11==true))U([](( [](<>((LTLAP12==true)))) || ( (LTLAP12==true)) )))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1424 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,148.887,2227700,1,0,695,6.24344e+06,82,417,8174,5.9379e+06,917
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F("(gu7.Node0HasTheLeafSetOfLxToReplaceNode3<=gu7.Node2HasTheLeafSetOfLxToReplaceNode3)"))))
Formula 5 simplified : !XF"(gu7.Node0HasTheLeafSetOfLxToReplaceNode3<=gu7.Node2HasTheLeafSetOfLxToReplaceNode3)"
Computing Next relation with stutter on 4276 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,148.89,2227700,1,0,695,6.24344e+06,91,417,8178,5.93791e+06,921
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(!((X("(gi8.gu8.Node0ManageTheBreakDownOfNode4<=gi8.gu8.LeafSetOfRxIsSentToNode0)"))&&("(gu120.Node5FailureProcessedByNode6<=gu120.Node6HasTheLeafSetOfLxToReplaceNode0)")))))
Formula 6 simplified : !F!("(gu120.Node5FailureProcessedByNode6<=gu120.Node6HasTheLeafSetOfLxToReplaceNode0)" & X"(gi8.gu8.Node0ManageTheBreakDownOfNode4<=gi8.gu8.LeafSetOfRxIsSentToNode0)")
Computing Next relation with stutter on 4276 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1835 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,167.234,2241284,1,0,695,7.38105e+06,105,438,8191,7.3297e+06,1111
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F((F(G(X("(gi6.gu81.Node4HasAskedItsLeafSetToLxToReplaceNode2<=gi6.gu81.Node0HasTheLeafSetOfRxToReplaceNode7)"))))||(X("(gi6.gu81.Node4HasAskedItsLeafSetToLxToReplaceNode2<=gi6.gu81.Node0HasTheLeafSetOfRxToReplaceNode7)"))))))
Formula 7 simplified : F(X"(gi6.gu81.Node4HasAskedItsLeafSetToLxToReplaceNode2<=gi6.gu81.Node0HasTheLeafSetOfRxToReplaceNode7)" | FGX"(gi6.gu81.Node4HasAskedItsLeafSetToLxToReplaceNode2<=gi6.gu81.Node0HasTheLeafSetOfRxToReplaceNode7)")
Computing Next relation with stutter on 4276 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,167.238,2241284,1,0,695,7.38105e+06,111,438,8195,7.3297e+06,1116
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1621353479553

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-S08C2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is LeafsetExtension-PT-S08C2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171400237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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