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

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

[2021-05-18 15:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 15:55:31] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2021-05-18 15:55:31] [INFO ] Transformed 462 places.
[2021-05-18 15:55:31] [INFO ] Transformed 409 transitions.
[2021-05-18 15:55:31] [INFO ] Parsed PT model containing 462 places and 409 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5415 resets, run finished after 380 ms. (steps per millisecond=263 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 409 rows 462 cols
[2021-05-18 15:55:32] [INFO ] Computed 53 place invariants in 37 ms
[2021-05-18 15:55:32] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2021-05-18 15:55:32] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 22 ms returned sat
[2021-05-18 15:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 15:55:32] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-18 15:55:32] [INFO ] Computed and/alt/rep : 400/672/400 causal constraints in 29 ms.
[2021-05-18 15:55:32] [INFO ] Added : 6 causal constraints over 2 iterations in 106 ms. Result :sat
[2021-05-18 15:55:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-18 15:55:33] [INFO ] Flatten gal took : 98 ms
FORMULA LeafsetExtension-PT-S08C2-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 15:55:33] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 15:55:33] [INFO ] Applying decomposition
[2021-05-18 15:55:33] [INFO ] Flatten gal took : 25 ms
[2021-05-18 15:55:33] [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/graph16908678021637864713.txt, -o, /tmp/graph16908678021637864713.bin, -w, /tmp/graph16908678021637864713.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/graph16908678021637864713.bin, -l, -1, -v, -w, /tmp/graph16908678021637864713.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 15:55:33] [INFO ] Decomposing Gal with order
[2021-05-18 15:55:33] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 409 rows 462 cols
[2021-05-18 15:55:33] [INFO ] Computed 53 place invariants in 23 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:55:33] [INFO ] Computed 53 place invariants in 25 ms
[2021-05-18 15:55:33] [INFO ] Removed a total of 342 redundant transitions.
[2021-05-18 15:55:33] [INFO ] Flatten gal took : 83 ms
[2021-05-18 15:55:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 17 ms.
[2021-05-18 15:55:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2021-05-18 15:55:33] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], 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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !((((F("((i15.u0.Node0IsActive>=1)&&(i2.i2.u48.Node4DontAnswerToAnyNode>=1))"))U(X("((i15.u0.Node0IsActive>=1)&&(i2.i2.u48.Node4DontAnswerToAnyNode>=1))")))&&(X(X((G("(i7.u54.Node3HasTheLeafSetOfRxToReplaceNode8>=1)"))||(X("((i1.u34.Node2WantsToManageTheBreakDownOfNode3>=1)&&(i1.u111.NoNodeManageTheBreakDownOfNode3>=1))")))))))
Formula 0 simplified : !((F"((i15.u0.Node0IsActive>=1)&&(i2.i2.u48.Node4DontAnswerToAnyNode>=1))" U X"((i15.u0.Node0IsActive>=1)&&(i2.i2.u48.Node4DontAnswerToAnyNode>=1))") & XX(G"(i7.u54.Node3HasTheLeafSetOfRxToReplaceNode8>=1)" | X"((i1.u34.Node2WantsToManageTheBreakDownOfNode3>=1)&&(i1.u111.NoNodeManageTheBreakDownOfNode3>=1))"))
built 98 ordering constraints for composite.
built 18 ordering constraints for composite.
built 19 ordering constraints for composite.
built 42 ordering constraints for composite.
built 19 ordering constraints for composite.
built 18 ordering constraints for composite.
built 14 ordering constraints for composite.
built 19 ordering constraints for composite.
built 25 ordering constraints for composite.
built 30 ordering constraints for composite.
built 20 ordering constraints for composite.
built 21 ordering constraints for composite.
built 20 ordering constraints for composite.
built 31 ordering constraints for composite.
built 16 ordering constraints for composite.
built 18 ordering constraints for composite.
built 8 ordering constraints for composite.
built 40 ordering constraints for composite.
built 26 ordering constraints for composite.
built 27 ordering constraints for composite.
built 27 ordering constraints for composite.
built 18 ordering constraints for composite.
built 26 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 23 ordering constraints for composite.
built 22 ordering constraints for composite.
[2021-05-18 15:55:34] [INFO ] Proved 462 variables to be positive in 537 ms
[2021-05-18 15:55:34] [INFO ] Computing symmetric may disable matrix : 409 transitions.
[2021-05-18 15:55:34] [INFO ] Computation of disable matrix completed :0/409 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 15:55:34] [INFO ] Computation of Complete disable matrix. took 69 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 15:55:34] [INFO ] Computing symmetric may enable matrix : 409 transitions.
[2021-05-18 15:55:34] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 15:55:35] [INFO ] Computing symmetric co enabling matrix : 409 transitions.
[2021-05-18 15:55:37] [INFO ] Computation of co-enabling matrix(6/409) took 1991 ms. Total solver calls (SAT/UNSAT): 1047(1047/0)
[2021-05-18 15:55:40] [INFO ] Computation of co-enabling matrix(20/409) took 5126 ms. Total solver calls (SAT/UNSAT): 3063(3063/0)
[2021-05-18 15:55:43] [INFO ] Computation of co-enabling matrix(38/409) took 8154 ms. Total solver calls (SAT/UNSAT): 5318(5318/0)
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2021-05-18 15:55:45] [INFO ] Computation of Finished co-enabling matrix. took 10109 ms. Total solver calls (SAT/UNSAT): 6087(6087/0)
[2021-05-18 15:55:45] [INFO ] Computing Do-Not-Accords matrix : 409 transitions.
Reverse transition relation is NOT exact ! Due to transitions i2.i2.u48.Node3DetectsTheBreakDownOfTheNodeMaster, i2.i2.u75.Node5DetectsTheBreakDownOfTheNodeMaster, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/372/2/374
Computing Next relation with stutter on 4276 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
3017 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,30.2261,683400,1,0,879693,1023,9038,3.39165e+06,214,5119,5052731
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G((F(((F(G("((i2.i0.u7.NoNodeManageTheBreakDownOfNode4>=1)&&(i5.u69.Node5WantsToManageTheBreakDownOfNode4>=1))")))&&("(i2.i0.u7.NoNodeManageTheBreakDownOfNode4>=1)"))&&("(i5.u69.Node5WantsToManageTheBreakDownOfNode4>=1)")))||((X(X(F("((i4.u38.NoNodeManageTheBreakDownOfNode6>=1)&&(i14.u24.Node8WantsToManageTheBreakDownOfNode6>=1))"))))U("(i4.u38.Node2ManageTheBreakDownOfNode6>=1)"))))))
Formula 1 simplified : !XG(F("(i2.i0.u7.NoNodeManageTheBreakDownOfNode4>=1)" & "(i5.u69.Node5WantsToManageTheBreakDownOfNode4>=1)" & FG"((i2.i0.u7.NoNodeManageTheBreakDownOfNode4>=1)&&(i5.u69.Node5WantsToManageTheBreakDownOfNode4>=1))") | (XXF"((i4.u38.NoNodeManageTheBreakDownOfNode6>=1)&&(i14.u24.Node8WantsToManageTheBreakDownOfNode6>=1))" U "(i4.u38.Node2ManageTheBreakDownOfNode6>=1)"))
Computing Next relation with stutter on 4276 deadlock states
21 unique states visited
21 strongly connected components in search stack
22 transitions explored
21 items max in DFS search stack
1321 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,43.4358,879200,1,0,1.10148e+06,1149,9172,4.42061e+06,215,5864,6061760
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F("((i5.u69.Node5IsActive>=1)&&(i0.i1.u40.Node7DontAnswerToAnyNode>=1))"))&&((X(X((X("((i1.u5.Node3DontAnswerToAnyNode>=1)&&(i10.u56.Node4IsActive>=1))"))||("((i7.u83.Node0WantsToManageTheBreakDownOfNode5>=1)&&(i7.u9.NoNodeManageTheBreakDownOfNode5>=1))"))))||(!(F("(i8.u81.LxHasReceivedTheRequestOfNode5>=1)"))))))
Formula 2 simplified : !(F"((i5.u69.Node5IsActive>=1)&&(i0.i1.u40.Node7DontAnswerToAnyNode>=1))" & (XX("((i7.u83.Node0WantsToManageTheBreakDownOfNode5>=1)&&(i7.u9.NoNodeManageTheBreakDownOfNode5>=1))" | X"((i1.u5.Node3DontAnswerToAnyNode>=1)&&(i10.u56.Node4IsActive>=1))") | !F"(i8.u81.LxHasReceivedTheRequestOfNode5>=1)"))
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
560 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,49.0481,1000080,1,0,1.27752e+06,1152,9311,4.6519e+06,215,5874,6727276
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(X(F(X((X("((i12.u98.Node7HasAskedItsLeafSetToLxToReplaceNode1>=1)&&(i12.u121.LeafSetOfLxIsSentToNode7>=1))"))||("(i5.u78.Node5ManageTheBreakDownOfNode6<1)"))))))))
Formula 3 simplified : !FGXFX("(i5.u78.Node5ManageTheBreakDownOfNode6<1)" | X"((i12.u98.Node7HasAskedItsLeafSetToLxToReplaceNode1>=1)&&(i12.u121.LeafSetOfLxIsSentToNode7>=1))")
Computing Next relation with stutter on 4276 deadlock states
68 unique states visited
0 strongly connected components in search stack
71 transitions explored
22 items max in DFS search stack
180 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,50.8446,1016712,1,0,1.31117e+06,1152,9367,4.69547e+06,216,5876,6902011
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(!(("((((i0.i0.u110.NoNodeManageTheBreakDownOfNode2>=1)&&(i6.i0.u47.Node3WantsToManageTheBreakDownOfNode2>=1))&&(i5.u80.Node5HasAskedItsLeafSetToRxToReplaceNode8>=1))&&(i5.u82.LeafSetOfRxIsSentToNode5>=1))")U(X((G("((i5.u80.Node5HasAskedItsLeafSetToRxToReplaceNode8>=1)&&(i5.u82.LeafSetOfRxIsSentToNode5>=1))"))U("((i14.u112.RequestOfNode8IsSentToRx>=1)&&(i4.u125.RxIsActiveAndNotInTheLeafSet>=1))")))))))
Formula 4 simplified : !X!("((((i0.i0.u110.NoNodeManageTheBreakDownOfNode2>=1)&&(i6.i0.u47.Node3WantsToManageTheBreakDownOfNode2>=1))&&(i5.u80.Node5HasAskedItsLeafSetToRxToReplaceNode8>=1))&&(i5.u82.LeafSetOfRxIsSentToNode5>=1))" U X(G"((i5.u80.Node5HasAskedItsLeafSetToRxToReplaceNode8>=1)&&(i5.u82.LeafSetOfRxIsSentToNode5>=1))" U "((i14.u112.RequestOfNode8IsSentToRx>=1)&&(i4.u125.RxIsActiveAndNotInTheLeafSet>=1))"))
Computing Next relation with stutter on 4276 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 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,50.849,1016976,1,0,1.31117e+06,1152,9421,4.69547e+06,216,5876,6902511
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(G((X("((i16.u16.Node1IsActive<1)||(i13.u27.Node8DontAnswerToAnyNode<1))"))||(F(X(((!(G("((i7.u83.Node5DontAnswerToAnyNode>=1)&&(i11.i1.u84.Node6IsActive>=1))")))||("(i7.u83.Node5DontAnswerToAnyNode<1)"))||("(i11.i1.u84.Node6IsActive<1)")))))))U("((i16.u16.Node1IsActive>=1)&&(i13.u27.Node8DontAnswerToAnyNode>=1))")))
Formula 5 simplified : !(FG(X"((i16.u16.Node1IsActive<1)||(i13.u27.Node8DontAnswerToAnyNode<1))" | FX("(i7.u83.Node5DontAnswerToAnyNode<1)" | "(i11.i1.u84.Node6IsActive<1)" | !G"((i7.u83.Node5DontAnswerToAnyNode>=1)&&(i11.i1.u84.Node6IsActive>=1))")) U "((i16.u16.Node1IsActive>=1)&&(i13.u27.Node8DontAnswerToAnyNode>=1))")
Computing Next relation with stutter on 4276 deadlock states
20 unique states visited
20 strongly connected components in search stack
20 transitions explored
20 items max in DFS search stack
1670 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,67.5458,1173780,1,0,1.55476e+06,1177,9496,5.21971e+06,216,6042,7779373
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(!(X((F("(i0.i1.u106.Node8ManageTheBreakDownOfNode0>=1)"))&&((X(G(F("(i2.i0.u15.LxHasReceivedTheRequestOfNode0>=1)"))))U("((i2.i1.u30.Node1DontAnswerToAnyNode>=1)&&(i12.u97.Node7IsActive>=1))")))))))
Formula 6 simplified : !X!X(F"(i0.i1.u106.Node8ManageTheBreakDownOfNode0>=1)" & (XGF"(i2.i0.u15.LxHasReceivedTheRequestOfNode0>=1)" U "((i2.i1.u30.Node1DontAnswerToAnyNode>=1)&&(i12.u97.Node7IsActive>=1))"))
Computing Next relation with stutter on 4276 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1072 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,78.2705,1335348,1,0,1.81346e+06,1188,9623,5.74982e+06,216,6111,8695453
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!(F("((i4.u125.RxHasReceivedTheRequestOfNode2>=1)&&(i14.u116.Node8ManageTheBreakDownOfNode7<1))")))))
Formula 7 simplified : !G!F"((i4.u125.RxHasReceivedTheRequestOfNode2>=1)&&(i14.u116.Node8ManageTheBreakDownOfNode7<1))"
Computing Next relation with stutter on 4276 deadlock states
[2021-05-18 15:56:55] [INFO ] Computation of Completed DNA matrix. took 70237 ms. Total solver calls (SAT/UNSAT): 2042(0/2042)
[2021-05-18 15:56:56] [INFO ] Built C files in 82671ms 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]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
543 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,83.6962,1416132,1,0,1.93496e+06,1219,9658,6.03468e+06,216,6204,9119830
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(((X("((i4.u38.RequestOfNode2IsSentToRx>=1)&&(i4.u125.RxIsActiveAndNotInTheLeafSet>=1))"))&&("(i10.u63.Node4WantsToManageTheBreakDownOfNode5>=1)"))&&("(i7.u9.NoNodeManageTheBreakDownOfNode5>=1)"))))
Formula 8 simplified : !F("(i7.u9.NoNodeManageTheBreakDownOfNode5>=1)" & "(i10.u63.Node4WantsToManageTheBreakDownOfNode5>=1)" & X"((i4.u38.RequestOfNode2IsSentToRx>=1)&&(i4.u125.RxIsActiveAndNotInTheLeafSet>=1))")
Computing Next relation with stutter on 4276 deadlock states
Compilation finished in 5930 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 50 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(( ( X((LTLAP26==true)) ) && ( (LTLAP27==true) ) ) && ( (LTLAP28==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((LTLAP26==true)) ) && ( (LTLAP27==true) ) ) && ( (LTLAP28==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((LTLAP26==true)) ) && ( (LTLAP27==true) ) ) && ( (LTLAP28==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)
19 unique states visited
19 strongly connected components in search stack
19 transitions explored
19 items max in DFS search stack
508 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,88.7786,1512228,1,0,2.0935e+06,1230,9814,6.2972e+06,217,6259,9635493
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(!(X(!(F(G(X((G("((i0.i0.u3.Node2DontAnswerToAnyNode>=1)&&(i10.u56.Node4IsActive>=1))"))||("((i0.i0.u3.Node2DontAnswerToAnyNode>=1)&&(i10.u56.Node4IsActive>=1))")))))))))))
Formula 9 simplified : !XF!X!FGX("((i0.i0.u3.Node2DontAnswerToAnyNode>=1)&&(i10.u56.Node4IsActive>=1))" | G"((i0.i0.u3.Node2DontAnswerToAnyNode>=1)&&(i10.u56.Node4IsActive>=1))")
Computing Next relation with stutter on 4276 deadlock states
21 unique states visited
20 strongly connected components in search stack
22 transitions explored
21 items max in DFS search stack
332 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,92.1052,1543116,1,0,2.1236e+06,1230,9873,6.37026e+06,217,6262,9836403
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LeafsetExtension-PT-S08C2-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X(F("((i1.u5.Node3DontAnswerToAnyNode<1)||(i5.u69.Node5IsActive<1))")))))
Formula 10 simplified : !FXF"((i1.u5.Node3DontAnswerToAnyNode<1)||(i5.u69.Node5IsActive<1))"
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
28 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,92.379,1550508,1,0,2.14483e+06,1230,9972,6.38653e+06,217,6262,9899476
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((X((X("(i4.u41.Node2ManageTheBreakDownOfNode7>=1)"))||("((i0.i0.u3.Node2DontAnswerToAnyNode>=1)&&(i11.i1.u84.Node6IsActive>=1))")))U(X(X(!(X("(i12.u99.Node7HasTheLeafSetOfLxToReplaceNode2>=1)"))))))))
Formula 11 simplified : !F(X("((i0.i0.u3.Node2DontAnswerToAnyNode>=1)&&(i11.i1.u84.Node6IsActive>=1))" | X"(i4.u41.Node2ManageTheBreakDownOfNode7>=1)") U XX!X"(i12.u99.Node7HasTheLeafSetOfLxToReplaceNode2>=1)")
Computing Next relation with stutter on 4276 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 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,92.381,1550772,1,0,2.14483e+06,1230,9991,6.38653e+06,217,6262,9899591
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X(X((!(F("((i8.u71.Node5HasAskedItsLeafSetToLxToReplaceNode1>=1)&&(i8.u81.LeafSetOfLxIsSentToNode5>=1))")))||(!(X((X("(i7.u51.Node3HasTheLeafSetOfRxToReplaceNode5>=1)"))||("(i2.i0.u1.Node0ManageTheBreakDownOfNode1>=1)")))))))))
Formula 12 simplified : !XXX(!F"((i8.u71.Node5HasAskedItsLeafSetToLxToReplaceNode1>=1)&&(i8.u81.LeafSetOfLxIsSentToNode5>=1))" | !X("(i2.i0.u1.Node0ManageTheBreakDownOfNode1>=1)" | X"(i7.u51.Node3HasTheLeafSetOfRxToReplaceNode5>=1)"))
Computing Next relation with stutter on 4276 deadlock states
21 unique states visited
0 strongly connected components in search stack
21 transitions explored
20 items max in DFS search stack
110 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,93.475,1582452,1,0,2.20105e+06,1230,10095,6.43706e+06,217,6262,10170700
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(!(X(F(X(!(("(i13.u101.Node7ManageTheBreakDownOfNode4>=1)")U(F("(((i11.i1.u84.Node6IsActive<1)||(i13.u27.Node8DontAnswerToAnyNode<1))||(i0.i1.u106.Node8ManageTheBreakDownOfNode0>=1))")))))))))))
Formula 13 simplified : !FG!XFX!("(i13.u101.Node7ManageTheBreakDownOfNode4>=1)" U F"(((i11.i1.u84.Node6IsActive<1)||(i13.u27.Node8DontAnswerToAnyNode<1))||(i0.i1.u106.Node8ManageTheBreakDownOfNode0>=1))")
Computing Next relation with stutter on 4276 deadlock states
39 unique states visited
0 strongly connected components in search stack
40 transitions explored
21 items max in DFS search stack
32 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,93.7932,1589052,1,0,2.21072e+06,1231,10129,6.44762e+06,217,6282,10227327
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1621353440491

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-162124171400238"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;