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

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10589.783 3600000.00 10950476.00 28024.70 TFTFFTFTFFT?TFFF 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.r292-tall-162124156700614.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 itstools
Input is MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 52K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K 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 4.4K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 6.4K May 11 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 11 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 11 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 11 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 12M 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 gen-ReachabilityCardinality-00
FORMULA_NAME gen-ReachabilityCardinality-01
FORMULA_NAME gen-ReachabilityCardinality-02
FORMULA_NAME gen-ReachabilityCardinality-03
FORMULA_NAME gen-ReachabilityCardinality-04
FORMULA_NAME gen-ReachabilityCardinality-05
FORMULA_NAME gen-ReachabilityCardinality-06
FORMULA_NAME gen-ReachabilityCardinality-07
FORMULA_NAME gen-ReachabilityCardinality-08
FORMULA_NAME gen-ReachabilityCardinality-09
FORMULA_NAME gen-ReachabilityCardinality-10
FORMULA_NAME gen-ReachabilityCardinality-11
FORMULA_NAME gen-ReachabilityCardinality-12
FORMULA_NAME gen-ReachabilityCardinality-13
FORMULA_NAME gen-ReachabilityCardinality-14
FORMULA_NAME gen-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621333437360

Running Version 0
[2021-05-18 10:23:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 10:23:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:23:59] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2021-05-18 10:23:59] [INFO ] Transformed 6222 places.
[2021-05-18 10:23:59] [INFO ] Transformed 8685 transitions.
[2021-05-18 10:23:59] [INFO ] Parsed PT model containing 6222 places and 8685 transitions in 510 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 138 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 16) seen :3
FORMULA gen-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :1
FORMULA gen-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :1
FORMULA gen-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :1
FORMULA gen-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2021-05-18 10:24:00] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2021-05-18 10:24:01] [INFO ] Computed 611 place invariants in 883 ms
[2021-05-18 10:24:03] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:10
[2021-05-18 10:24:04] [INFO ] [Nat]Absence check using 52 positive place invariants in 26 ms returned sat
[2021-05-18 10:24:04] [INFO ] [Nat]Absence check using 52 positive and 559 generalized place invariants in 249 ms returned sat
[2021-05-18 10:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:24:11] [INFO ] [Nat]Absence check using state equation in 6100 ms returned unsat :7 sat :3
[2021-05-18 10:24:11] [INFO ] State equation strengthened by 2467 read => feed constraints.
[2021-05-18 10:24:11] [INFO ] [Nat]Added 2467 Read/Feed constraints in 137 ms returned sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-18 10:24:28] [INFO ] SMT Verify possible in nat domain returned unsat :7 sat :1
FORMULA gen-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 5 out of 6222 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.27 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 1902 transitions
Trivial Post-agglo rules discarded 1902 transitions
Performed 1902 trivial Post agglomeration. Transition count delta: 1902
Iterating post reduction 0 with 1902 rules applied. Total rules applied 1903 place count 6188 transition count 6783
Reduce places removed 1902 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1903 rules applied. Total rules applied 3806 place count 4286 transition count 6782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3807 place count 4285 transition count 6782
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 3807 place count 4285 transition count 6545
Deduced a syphon composed of 237 places in 5 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 4281 place count 4048 transition count 6545
Discarding 1664 places :
Symmetric choice reduction at 3 with 1664 rule applications. Total rules 5945 place count 2384 transition count 4881
Iterating global reduction 3 with 1664 rules applied. Total rules applied 7609 place count 2384 transition count 4881
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 7609 place count 2384 transition count 4868
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 7635 place count 2371 transition count 4868
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 7871 place count 2135 transition count 3216
Iterating global reduction 3 with 236 rules applied. Total rules applied 8107 place count 2135 transition count 3216
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 8141 place count 2118 transition count 3199
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 3 with 162 rules applied. Total rules applied 8303 place count 2118 transition count 4453
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 8465 place count 1956 transition count 4453
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 8482 place count 1956 transition count 4453
Applied a total of 8482 rules in 2242 ms. Remains 1956 /6222 variables (removed 4266) and now considering 4453/8685 (removed 4232) transitions.
Finished structural reductions, in 1 iterations. Remains : 1956/6222 places, 4453/8685 transitions.
[2021-05-18 10:24:31] [INFO ] Flatten gal took : 474 ms
[2021-05-18 10:24:31] [INFO ] Flatten gal took : 255 ms
[2021-05-18 10:24:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2197781759747563061.gal : 74 ms
[2021-05-18 10:24:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5981518343248662050.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2197781759747563061.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5981518343248662050.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2197781759747563061.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5981518343248662050.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5981518343248662050.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :16 after 31
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :31 after 41
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :41 after 162
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :162 after 170
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :170 after 186
Detected timeout of ITS tools.
[2021-05-18 10:24:46] [INFO ] Flatten gal took : 230 ms
[2021-05-18 10:24:46] [INFO ] Applying decomposition
[2021-05-18 10:24:46] [INFO ] Flatten gal took : 247 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1745448044854980293.txt, -o, /tmp/graph1745448044854980293.bin, -w, /tmp/graph1745448044854980293.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1745448044854980293.bin, -l, -1, -v, -w, /tmp/graph1745448044854980293.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:24:47] [INFO ] Decomposing Gal with order
[2021-05-18 10:24:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:24:48] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-18 10:24:48] [INFO ] Flatten gal took : 354 ms
[2021-05-18 10:24:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 9 ms.
[2021-05-18 10:24:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16597365189473650659.gal : 30 ms
[2021-05-18 10:24:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8710506969603719597.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16597365189473650659.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8710506969603719597.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16597365189473650659.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8710506969603719597.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8710506969603719597.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :10 after 11
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 18
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :18 after 21
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :21 after 34
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :34 after 85
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :85 after 122
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :122 after 177
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7551021712184105749
[2021-05-18 10:25:03] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7551021712184105749
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7551021712184105749]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7551021712184105749] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7551021712184105749] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 22911 resets, run finished after 21431 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
FORMULA gen-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4298 resets, run finished after 4539 ms. (steps per millisecond=220 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4298 resets, run finished after 4707 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-18 10:25:35] [INFO ] Flow matrix only has 4055 transitions (discarded 398 similar events)
// Phase 1: matrix 4055 rows 1956 cols
[2021-05-18 10:25:35] [INFO ] Computed 577 place invariants in 69 ms
[2021-05-18 10:25:36] [INFO ] [Real]Absence check using 31 positive place invariants in 29 ms returned sat
[2021-05-18 10:25:36] [INFO ] [Real]Absence check using 31 positive and 546 generalized place invariants in 92 ms returned sat
[2021-05-18 10:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:25:37] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2021-05-18 10:25:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:25:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2021-05-18 10:25:38] [INFO ] [Nat]Absence check using 31 positive and 546 generalized place invariants in 100 ms returned sat
[2021-05-18 10:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:25:39] [INFO ] [Nat]Absence check using state equation in 1246 ms returned sat
[2021-05-18 10:25:39] [INFO ] State equation strengthened by 2467 read => feed constraints.
[2021-05-18 10:25:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:25:45] [INFO ] [Nat]Added 2467 Read/Feed constraints in 6223 ms returned unknown
[2021-05-18 10:25:46] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2021-05-18 10:25:46] [INFO ] [Real]Absence check using 31 positive and 546 generalized place invariants in 92 ms returned sat
[2021-05-18 10:25:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:25:47] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2021-05-18 10:25:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:25:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2021-05-18 10:25:47] [INFO ] [Nat]Absence check using 31 positive and 546 generalized place invariants in 93 ms returned sat
[2021-05-18 10:25:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:25:48] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2021-05-18 10:25:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:25:55] [INFO ] [Nat]Added 2467 Read/Feed constraints in 6166 ms returned sat
[2021-05-18 10:25:56] [INFO ] Deduced a trap composed of 192 places in 1673 ms of which 5 ms to minimize.
[2021-05-18 10:25:58] [INFO ] Deduced a trap composed of 568 places in 1485 ms of which 2 ms to minimize.
[2021-05-18 10:25:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3590 ms
[2021-05-18 10:25:59] [INFO ] Computed and/alt/rep : 1646/4162/1646 causal constraints (skipped 2392 transitions) in 408 ms.
[2021-05-18 10:26:11] [INFO ] Added : 286 causal constraints over 60 iterations in 12306 ms. Result :sat
Incomplete Parikh walk after 92600 steps, including 2943 resets, run finished after 2966 ms. (steps per millisecond=31 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 4 out of 1956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1956/1956 places, 4453/4453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1956 transition count 4453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 1955 transition count 4452
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1955 transition count 4452
Applied a total of 3 rules in 349 ms. Remains 1955 /1956 variables (removed 1) and now considering 4452/4453 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1955/1956 places, 4452/4453 transitions.
[2021-05-18 10:26:14] [INFO ] Flatten gal took : 214 ms
[2021-05-18 10:26:14] [INFO ] Flatten gal took : 215 ms
[2021-05-18 10:26:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15595730990926372703.gal : 22 ms
[2021-05-18 10:26:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1092759044190050263.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15595730990926372703.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1092759044190050263.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15595730990926372703.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1092759044190050263.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1092759044190050263.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 41
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :41 after 174
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :174 after 186
Detected timeout of ITS tools.
[2021-05-18 10:26:30] [INFO ] Flatten gal took : 198 ms
[2021-05-18 10:26:30] [INFO ] Applying decomposition
[2021-05-18 10:26:30] [INFO ] Flatten gal took : 201 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10878404123705557901.txt, -o, /tmp/graph10878404123705557901.bin, -w, /tmp/graph10878404123705557901.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10878404123705557901.bin, -l, -1, -v, -w, /tmp/graph10878404123705557901.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:26:30] [INFO ] Decomposing Gal with order
[2021-05-18 10:26:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:26:31] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-18 10:26:31] [INFO ] Flatten gal took : 269 ms
[2021-05-18 10:26:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2021-05-18 10:26:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7128447550869256087.gal : 3246 ms
[2021-05-18 10:26:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10900464041890942810.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7128447550869256087.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10900464041890942810.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7128447550869256087.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10900464041890942810.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10900464041890942810.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 21
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :21 after 33
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 84
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :84 after 122
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :122 after 177
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :177 after 310
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8791321700069530689
[2021-05-18 10:26:49] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8791321700069530689
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8791321700069530689]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8791321700069530689] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8791321700069530689] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 22916 resets, run finished after 21330 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4297 resets, run finished after 4525 ms. (steps per millisecond=220 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4298 resets, run finished after 4641 ms. (steps per millisecond=215 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 481670 steps, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 481670 steps, saw 210146 distinct states, run finished after 38045 ms. (steps per millisecond=12 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-18 10:27:59] [INFO ] Flow matrix only has 4054 transitions (discarded 398 similar events)
// Phase 1: matrix 4054 rows 1955 cols
[2021-05-18 10:27:59] [INFO ] Computed 577 place invariants in 81 ms
[2021-05-18 10:27:59] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2021-05-18 10:27:59] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 88 ms returned sat
[2021-05-18 10:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:28:01] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2021-05-18 10:28:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:28:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2021-05-18 10:28:01] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 91 ms returned sat
[2021-05-18 10:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:28:02] [INFO ] [Nat]Absence check using state equation in 1349 ms returned sat
[2021-05-18 10:28:02] [INFO ] State equation strengthened by 2467 read => feed constraints.
[2021-05-18 10:28:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:28:09] [INFO ] [Nat]Added 2467 Read/Feed constraints in 6238 ms returned unknown
[2021-05-18 10:28:09] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2021-05-18 10:28:09] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 94 ms returned sat
[2021-05-18 10:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:28:10] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2021-05-18 10:28:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:28:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2021-05-18 10:28:11] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 98 ms returned sat
[2021-05-18 10:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:28:12] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2021-05-18 10:28:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:28:18] [INFO ] [Nat]Added 2467 Read/Feed constraints in 6220 ms returned unknown
Fused 2 Parikh solutions to 1 different solutions.
Support contains 4 out of 1955 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1955/1955 places, 4452/4452 transitions.
Applied a total of 0 rules in 177 ms. Remains 1955 /1955 variables (removed 0) and now considering 4452/4452 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1955/1955 places, 4452/4452 transitions.
Starting structural reductions, iteration 0 : 1955/1955 places, 4452/4452 transitions.
Applied a total of 0 rules in 155 ms. Remains 1955 /1955 variables (removed 0) and now considering 4452/4452 (removed 0) transitions.
[2021-05-18 10:28:19] [INFO ] Flow matrix only has 4054 transitions (discarded 398 similar events)
// Phase 1: matrix 4054 rows 1955 cols
[2021-05-18 10:28:19] [INFO ] Computed 577 place invariants in 68 ms
[2021-05-18 10:28:23] [INFO ] Implicit Places using invariants in 4761 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 148, 165, 171, 173, 174, 175, 176, 177, 178, 179, 180, 182, 186, 192, 200, 210, 222, 235, 247, 248, 249, 250, 251, 252, 253, 254, 264, 272, 278, 282, 284, 286, 303, 309, 311, 312, 313, 314, 315, 316, 317, 318, 320, 322, 326, 332, 340, 350, 361, 371, 372, 373, 374, 375, 376, 377, 378, 386, 392, 396, 398, 400, 402, 419, 425, 427, 428, 429, 430, 431, 432, 433, 434, 436, 438, 440, 444, 450, 458, 467, 475, 476, 477, 478, 479, 480, 481, 482, 488, 492, 494, 496, 498, 500, 517, 523, 525, 526, 527, 528, 529, 530, 531, 532, 534, 536, 538, 540, 544, 550, 557, 563, 564, 565, 566, 567, 568, 569, 570, 574, 576, 578, 580, 582, 584, 601, 607, 609, 610, 611, 612, 613, 614, 615, 616, 618, 620, 622, 624, 626, 630, 635, 639, 640, 641, 642, 643, 644, 645, 646, 648, 650, 652, 654, 656, 658, 675, 681, 683, 684, 685, 686, 687, 688, 689, 690, 692, 694, 696, 698, 700, 702, 705, 707, 708, 709, 710, 711, 712, 713, 714, 716, 718, 720, 722, 724, 726, 743, 749, 751, 752, 753, 754, 755, 756, 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, 775, 776, 777, 778, 779, 780, 781, 783, 785, 787, 789, 791, 793, 810, 812, 815, 817, 818, 819, 820, 822, 823, 824, 826, 828, 832, 834, 836, 838, 840, 842, 843, 844, 845, 846, 847, 848, 849, 851, 853, 855, 857, 859, 861, 878, 884, 886, 887, 888, 889, 890, 891, 892, 893, 895, 897, 899, 901, 903, 905, 907, 909, 910, 911, 912, 913, 914, 915, 916, 918, 920, 922, 924, 926, 928, 945, 951, 953, 954, 955, 956, 957, 958, 959, 960, 962, 964, 966, 968, 970, 972, 974, 977, 978, 979, 980, 981, 982, 983, 984, 986, 988, 990, 992, 994, 996, 1013, 1019, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1030, 1032, 1034, 1036, 1038, 1040, 1044, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1060, 1062, 1064, 1066, 1068, 1070, 1087, 1093, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1104, 1106, 1108, 1110, 1112, 1116, 1122, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1142, 1146, 1148, 1150, 1152, 1154, 1171, 1177, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1188, 1190, 1192, 1194, 1198, 1204, 1212, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1236, 1242, 1246, 1248, 1250, 1252, 1269, 1275, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1286, 1288, 1290, 1294, 1300, 1308, 1318, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1346, 1354, 1360, 1364, 1366, 1368, 1385, 1391, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1402, 1404, 1408, 1414, 1422, 1432, 1444, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1476, 1486, 1494, 1500, 1504, 1506, 1523, 1525, 1528, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1539, 1543, 1549, 1557, 1567, 1579, 1593, 1608, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1629, 1641, 1651, 1659, 1665, 1669, 1687]
Discarding 529 places :
Implicit Place search using SMT only with invariants took 4786 ms to find 529 implicit places.
[2021-05-18 10:28:24] [INFO ] Redundant transitions in 332 ms returned []
[2021-05-18 10:28:24] [INFO ] Flow matrix only has 4054 transitions (discarded 398 similar events)
// Phase 1: matrix 4054 rows 1426 cols
[2021-05-18 10:28:24] [INFO ] Computed 48 place invariants in 33 ms
[2021-05-18 10:28:26] [INFO ] Dead Transitions using invariants and state equation in 1957 ms returned []
Starting structural reductions, iteration 1 : 1426/1955 places, 4452/4452 transitions.
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 223 place count 1203 transition count 4229
Iterating global reduction 0 with 223 rules applied. Total rules applied 446 place count 1203 transition count 4229
Discarding 222 places :
Symmetric choice reduction at 0 with 222 rule applications. Total rules 668 place count 981 transition count 4007
Iterating global reduction 0 with 222 rules applied. Total rules applied 890 place count 981 transition count 4007
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 893 place count 981 transition count 4004
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 896 place count 978 transition count 4004
Applied a total of 896 rules in 488 ms. Remains 978 /1426 variables (removed 448) and now considering 4004/4452 (removed 448) transitions.
[2021-05-18 10:28:26] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 978 cols
[2021-05-18 10:28:26] [INFO ] Computed 48 place invariants in 39 ms
[2021-05-18 10:28:27] [INFO ] Implicit Places using invariants in 1121 ms returned []
[2021-05-18 10:28:27] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 978 cols
[2021-05-18 10:28:27] [INFO ] Computed 48 place invariants in 38 ms
[2021-05-18 10:28:28] [INFO ] State equation strengthened by 2467 read => feed constraints.
[2021-05-18 10:28:28] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 2261 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 978/1955 places, 4004/4452 transitions.
[2021-05-18 10:28:29] [INFO ] Flatten gal took : 156 ms
[2021-05-18 10:28:29] [INFO ] Flatten gal took : 161 ms
[2021-05-18 10:28:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17499260139415466754.gal : 16 ms
[2021-05-18 10:28:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11311444580088838072.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17499260139415466754.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11311444580088838072.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17499260139415466754.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11311444580088838072.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11311444580088838072.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 65
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 92
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
Detected timeout of ITS tools.
[2021-05-18 10:28:44] [INFO ] Flatten gal took : 141 ms
[2021-05-18 10:28:44] [INFO ] Applying decomposition
[2021-05-18 10:28:44] [INFO ] Flatten gal took : 145 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12507813125674989564.txt, -o, /tmp/graph12507813125674989564.bin, -w, /tmp/graph12507813125674989564.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12507813125674989564.bin, -l, -1, -v, -w, /tmp/graph12507813125674989564.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:28:44] [INFO ] Decomposing Gal with order
[2021-05-18 10:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:28:45] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-18 10:28:45] [INFO ] Flatten gal took : 203 ms
[2021-05-18 10:28:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2021-05-18 10:28:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13126717256793170999.gal : 16 ms
[2021-05-18 10:28:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9005600002057026148.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13126717256793170999.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9005600002057026148.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13126717256793170999.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9005600002057026148.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9005600002057026148.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 73
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :73 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 77
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :77 after 154
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :154 after 157
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :157 after 177
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :177 after 302
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :302 after 444
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :444 after 1086
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14665622441398950579
[2021-05-18 10:29:00] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14665622441398950579
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14665622441398950579]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14665622441398950579] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14665622441398950579] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 24137 resets, run finished after 20908 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3263 resets, run finished after 3381 ms. (steps per millisecond=295 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3274 resets, run finished after 3379 ms. (steps per millisecond=295 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 598771 steps, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 598771 steps, saw 247899 distinct states, run finished after 30001 ms. (steps per millisecond=19 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-18 10:29:59] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 978 cols
[2021-05-18 10:29:59] [INFO ] Computed 48 place invariants in 24 ms
[2021-05-18 10:29:59] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 10:29:59] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2021-05-18 10:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:29:59] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2021-05-18 10:30:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:30:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2021-05-18 10:30:00] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2021-05-18 10:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:30:01] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2021-05-18 10:30:01] [INFO ] State equation strengthened by 2467 read => feed constraints.
[2021-05-18 10:30:02] [INFO ] [Nat]Added 2467 Read/Feed constraints in 1687 ms returned sat
[2021-05-18 10:30:03] [INFO ] Deduced a trap composed of 94 places in 680 ms of which 13 ms to minimize.
[2021-05-18 10:30:04] [INFO ] Deduced a trap composed of 366 places in 530 ms of which 1 ms to minimize.
[2021-05-18 10:30:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1475 ms
[2021-05-18 10:30:04] [INFO ] Computed and/alt/rep : 1343/1958/1343 causal constraints (skipped 2201 transitions) in 300 ms.
[2021-05-18 10:30:12] [INFO ] Added : 310 causal constraints over 62 iterations in 8290 ms. Result :sat
[2021-05-18 10:30:12] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 10:30:12] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2021-05-18 10:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:30:13] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2021-05-18 10:30:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:30:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 10:30:13] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2021-05-18 10:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:30:14] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2021-05-18 10:30:16] [INFO ] [Nat]Added 2467 Read/Feed constraints in 1957 ms returned sat
[2021-05-18 10:30:17] [INFO ] Deduced a trap composed of 80 places in 692 ms of which 1 ms to minimize.
[2021-05-18 10:30:17] [INFO ] Deduced a trap composed of 345 places in 536 ms of which 9 ms to minimize.
[2021-05-18 10:30:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1497 ms
[2021-05-18 10:30:18] [INFO ] Computed and/alt/rep : 1343/1958/1343 causal constraints (skipped 2201 transitions) in 269 ms.
[2021-05-18 10:30:27] [INFO ] Added : 341 causal constraints over 69 iterations in 9188 ms. Result :sat
Incomplete Parikh walk after 98600 steps, including 3092 resets, run finished after 2123 ms. (steps per millisecond=46 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 89000 steps, including 2895 resets, run finished after 1923 ms. (steps per millisecond=46 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 4 out of 978 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 978/978 places, 4004/4004 transitions.
Applied a total of 0 rules in 106 ms. Remains 978 /978 variables (removed 0) and now considering 4004/4004 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 978/978 places, 4004/4004 transitions.
Starting structural reductions, iteration 0 : 978/978 places, 4004/4004 transitions.
Applied a total of 0 rules in 115 ms. Remains 978 /978 variables (removed 0) and now considering 4004/4004 (removed 0) transitions.
[2021-05-18 10:30:31] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 978 cols
[2021-05-18 10:30:31] [INFO ] Computed 48 place invariants in 23 ms
[2021-05-18 10:30:32] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2021-05-18 10:30:32] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 978 cols
[2021-05-18 10:30:32] [INFO ] Computed 48 place invariants in 25 ms
[2021-05-18 10:30:33] [INFO ] State equation strengthened by 2467 read => feed constraints.
[2021-05-18 10:30:33] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 2280 ms to find 0 implicit places.
[2021-05-18 10:30:34] [INFO ] Redundant transitions in 244 ms returned []
[2021-05-18 10:30:34] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 978 cols
[2021-05-18 10:30:34] [INFO ] Computed 48 place invariants in 38 ms
[2021-05-18 10:30:36] [INFO ] Dead Transitions using invariants and state equation in 1834 ms returned []
Finished structural reductions, in 1 iterations. Remains : 978/978 places, 4004/4004 transitions.
Incomplete random walk after 100000 steps, including 2413 resets, run finished after 2139 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-18 10:30:38] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 978 cols
[2021-05-18 10:30:38] [INFO ] Computed 48 place invariants in 22 ms
[2021-05-18 10:30:38] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 10:30:38] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2021-05-18 10:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:30:39] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2021-05-18 10:30:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:30:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 10:30:39] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2021-05-18 10:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:30:40] [INFO ] [Nat]Absence check using state equation in 932 ms returned sat
[2021-05-18 10:30:40] [INFO ] State equation strengthened by 2467 read => feed constraints.
[2021-05-18 10:30:42] [INFO ] [Nat]Added 2467 Read/Feed constraints in 1711 ms returned sat
[2021-05-18 10:30:42] [INFO ] Deduced a trap composed of 94 places in 613 ms of which 1 ms to minimize.
[2021-05-18 10:30:43] [INFO ] Deduced a trap composed of 366 places in 509 ms of which 1 ms to minimize.
[2021-05-18 10:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1387 ms
[2021-05-18 10:30:43] [INFO ] Computed and/alt/rep : 1343/1958/1343 causal constraints (skipped 2201 transitions) in 318 ms.
[2021-05-18 10:30:51] [INFO ] Added : 310 causal constraints over 62 iterations in 8294 ms. Result :sat
[2021-05-18 10:30:51] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 10:30:51] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2021-05-18 10:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:30:52] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2021-05-18 10:30:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:30:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2021-05-18 10:30:52] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2021-05-18 10:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:30:53] [INFO ] [Nat]Absence check using state equation in 959 ms returned sat
[2021-05-18 10:30:55] [INFO ] [Nat]Added 2467 Read/Feed constraints in 1920 ms returned sat
[2021-05-18 10:30:56] [INFO ] Deduced a trap composed of 80 places in 633 ms of which 1 ms to minimize.
[2021-05-18 10:30:56] [INFO ] Deduced a trap composed of 345 places in 535 ms of which 1 ms to minimize.
[2021-05-18 10:30:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1465 ms
[2021-05-18 10:30:57] [INFO ] Computed and/alt/rep : 1343/1958/1343 causal constraints (skipped 2201 transitions) in 260 ms.
[2021-05-18 10:31:06] [INFO ] Added : 341 causal constraints over 69 iterations in 9342 ms. Result :sat
[2021-05-18 10:31:06] [INFO ] Flatten gal took : 135 ms
[2021-05-18 10:31:06] [INFO ] Flatten gal took : 131 ms
[2021-05-18 10:31:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12245087283987784141.gal : 14 ms
[2021-05-18 10:31:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9877584419094385410.prop : 10642 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12245087283987784141.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9877584419094385410.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12245087283987784141.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9877584419094385410.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9877584419094385410.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 65
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 92
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
Detected timeout of ITS tools.
[2021-05-18 10:31:37] [INFO ] Flatten gal took : 136 ms
[2021-05-18 10:31:37] [INFO ] Applying decomposition
[2021-05-18 10:31:37] [INFO ] Flatten gal took : 134 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1555139404014900613.txt, -o, /tmp/graph1555139404014900613.bin, -w, /tmp/graph1555139404014900613.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1555139404014900613.bin, -l, -1, -v, -w, /tmp/graph1555139404014900613.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:31:37] [INFO ] Decomposing Gal with order
[2021-05-18 10:31:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:31:38] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-18 10:31:38] [INFO ] Flatten gal took : 190 ms
[2021-05-18 10:31:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2021-05-18 10:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2364328804914003117.gal : 9537 ms
[2021-05-18 10:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7289608316068393821.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2364328804914003117.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7289608316068393821.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2364328804914003117.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7289608316068393821.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7289608316068393821.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 73
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :73 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 77
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :77 after 154
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :154 after 157
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :157 after 177
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :177 after 302
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :302 after 444
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :444 after 1086
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1086 after 2138
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13297778152092516089
[2021-05-18 10:32:07] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13297778152092516089
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13297778152092516089]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13297778152092516089] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13297778152092516089] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Graph (trivial) has 1048 edges and 978 vertex of which 17 / 978 are part of one of the 1 SCC in 13 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4573 edges and 962 vertex of which 948 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 931 transition count 3235
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 289 rules applied. Total rules applied 390 place count 834 transition count 3043
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 651 place count 739 transition count 2877
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 3 with 210 rules applied. Total rules applied 861 place count 668 transition count 2738
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 4 with 184 rules applied. Total rules applied 1045 place count 600 transition count 2622
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 5 with 142 rules applied. Total rules applied 1187 place count 552 transition count 2528
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 6 with 122 rules applied. Total rules applied 1309 place count 506 transition count 2452
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 7 with 88 rules applied. Total rules applied 1397 place count 476 transition count 2394
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 73 rules applied. Total rules applied 1470 place count 448 transition count 2349
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 9 with 49 rules applied. Total rules applied 1519 place count 431 transition count 2317
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 38 rules applied. Total rules applied 1557 place count 416 transition count 2294
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1579 place count 408 transition count 2280
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1593 place count 402 transition count 2272
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 6 rules applied. Total rules applied 1599 place count 400 transition count 2268
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1603 place count 398 transition count 2266
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 14 Pre rules applied. Total rules applied 1603 place count 398 transition count 2252
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 15 with 28 rules applied. Total rules applied 1631 place count 384 transition count 2252
Discarding 281 places :
Symmetric choice reduction at 15 with 281 rule applications. Total rules 1912 place count 103 transition count 381
Iterating global reduction 15 with 281 rules applied. Total rules applied 2193 place count 103 transition count 381
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 15 with 242 rules applied. Total rules applied 2435 place count 103 transition count 139
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2441 place count 97 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2441 place count 97 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2443 place count 96 transition count 138
Discarding 10 places :
Symmetric choice reduction at 17 with 10 rule applications. Total rules 2453 place count 86 transition count 120
Iterating global reduction 17 with 10 rules applied. Total rules applied 2463 place count 86 transition count 120
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 2467 place count 82 transition count 116
Iterating global reduction 17 with 4 rules applied. Total rules applied 2471 place count 82 transition count 116
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 17 with 26 rules applied. Total rules applied 2497 place count 69 transition count 103
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 2505 place count 69 transition count 95
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2506 place count 68 transition count 92
Iterating global reduction 18 with 1 rules applied. Total rules applied 2507 place count 68 transition count 92
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 2509 place count 68 transition count 90
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 18 with 16 rules applied. Total rules applied 2525 place count 68 transition count 74
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 18 with 16 rules applied. Total rules applied 2541 place count 52 transition count 74
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 2545 place count 52 transition count 74
Applied a total of 2545 rules in 390 ms. Remains 52 /978 variables (removed 926) and now considering 74/4004 (removed 3930) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 74 rows 52 cols
[2021-05-18 10:32:10] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-18 10:32:10] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-18 10:32:10] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-18 10:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:32:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-18 10:32:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:32:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-18 10:32:10] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-18 10:32:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:32:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-18 10:32:10] [INFO ] Computed and/alt/rep : 10/31/10 causal constraints (skipped 49 transitions) in 5 ms.
[2021-05-18 10:32:10] [INFO ] Added : 2 causal constraints over 2 iterations in 23 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-18 10:32:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-18 10:32:10] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-18 10:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:32:10] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-18 10:32:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 10:32:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-18 10:32:10] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-18 10:32:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 10:32:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-18 10:32:10] [INFO ] Computed and/alt/rep : 10/31/10 causal constraints (skipped 49 transitions) in 4 ms.
[2021-05-18 10:32:10] [INFO ] Added : 2 causal constraints over 2 iterations in 23 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-18 10:32:10] [INFO ] Flatten gal took : 154 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6717693503731016896
[2021-05-18 10:32:10] [INFO ] Too many transitions (4004) to apply POR reductions. Disabling POR matrices.
[2021-05-18 10:32:10] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6717693503731016896
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6717693503731016896]
[2021-05-18 10:32:10] [INFO ] Flatten gal took : 201 ms
[2021-05-18 10:32:10] [INFO ] Applying decomposition
[2021-05-18 10:32:11] [INFO ] Input system was already deterministic with 4004 transitions.
[2021-05-18 10:32:11] [INFO ] Flatten gal took : 272 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph354798568627962874.txt, -o, /tmp/graph354798568627962874.bin, -w, /tmp/graph354798568627962874.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph354798568627962874.bin, -l, -1, -v, -w, /tmp/graph354798568627962874.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:32:11] [INFO ] Decomposing Gal with order
[2021-05-18 10:32:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:32:12] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-18 10:32:12] [INFO ] Flatten gal took : 214 ms
[2021-05-18 10:32:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2021-05-18 10:32:12] [INFO ] Ran tautology test, simplified 0 / 2 in 1407 ms.
[2021-05-18 10:32:12] [INFO ] BMC solution for property gen-ReachabilityCardinality-02(UNSAT) depth K=0 took 44 ms
[2021-05-18 10:32:12] [INFO ] BMC solution for property gen-ReachabilityCardinality-11(UNSAT) depth K=0 took 3 ms
[2021-05-18 10:32:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5157481819821322510.gal : 40 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 3606 out of 4004 initially.
// Phase 1: matrix 3606 rows 978 cols
[2021-05-18 10:32:13] [INFO ] Computed 48 place invariants in 21 ms
inv : Rx4IsActiveAndNotInTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node1NotifyThatHeIsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Node12IsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node4IsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node1IsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Rx0IsAtTheRightExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node12NotifyThatHeIsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Rx1IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node4NotifyThatHeIsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Rx0IsActiveAndNotInTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node6NotifyThatHeIsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : -Rx5IsActiveAndNotInTheLeafSet + Rx6IsActiveAndNotInTheLeafSet - Rx6IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node14IsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : Lx0IsAtTheLeftExtremityOfTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet - Lx6IsActiveAndNotInTheLeafSet + Lx6IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node15IsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Node8HasAskedItsLeafSetToLx4ToReplaceNode0 + Node8HasAskedItsLeafSetToLx4ToReplaceNode3 - RequestOfNode8IsSentToLx4 - Lx4HasReceivedTheRequestOfNode8 = 0
inv : Node6IsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : -NoCrashIsHappening + Node0IsActive - NodesCanDetectThatNode1HasCrashed - NodesCanDetectThatNode2HasCrashed - NodesCanDetectThatNode3HasCrashed - NodesCanDetectThatNode4HasCrashed - NodesCanDetectThatNode5HasCrashed - NodesCanDetectThatNode6HasCrashed - NodesCanDetectThatNode7HasCrashed + Node8IsActive - NodesCanDetectThatNode9HasCrashed - NodesCanDetectThatNode10HasCrashed - NodesCanDetectThatNode11HasCrashed - NodesCanDetectThatNode12HasCrashed - NodesCanDetectThatNode13HasCrashed - NodesCanDetectThatNode14HasCrashed - NodesCanDetectThatNode15HasCrashed + Node16IsActive + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet + 4*Lx4IsAtTheLeftExtremityOfTheLeafSet + 5*Lx5IsAtTheLeftExtremityOfTheLeafSet - 7*Lx6IsActiveAndNotInTheLeafSet + 6*Lx6IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet + 3*Rx3IsAtTheRightExtremityOfTheLeafSet + 4*Rx4IsAtTheRightExtremityOfTheLeafSet - 7*Rx5IsActiveAndNotInTheLeafSet + 5*Rx5IsAtTheRightExtremityOfTheLeafSet - Rx6IsAtTheRightExtremityOfTheLeafSet = -12
inv : Node15NotifyThatHeIsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Node10IsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node10NotifyThatHeIsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Lx3IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet - Lx6IsActiveAndNotInTheLeafSet + Lx6IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node9NotifyThatHeIsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node9IsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Lx5IsActiveAndNotInTheLeafSet - Lx6IsActiveAndNotInTheLeafSet + Lx6IsAtTheLeftExtremityOfTheLeafSet = 0
inv : NoCrashIsHappening + Node0HasDetectedCrashOfNode1 + Node0HasDetectedCrashOfNode2 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node0HasDetectedCrashOfNode3 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node0HasDetectedCrashOfNode4 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node0HasDetectedCrashOfNode5 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node0HasDetectedCrashOfNode6 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node0HasDetectedCrashOfNode7 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node0HasDetectedCrashOfNode8 + Node0ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node0HasDetectedCrashOfNode9 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node0HasDetectedCrashOfNode10 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node0HasDetectedCrashOfNode11 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node0HasDetectedCrashOfNode12 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node0HasDetectedCrashOfNode13 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node0HasDetectedCrashOfNode14 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node0HasDetectedCrashOfNode15 + Node0HasDetectedCrashOfNode16 + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + RequestOfNode0IsSentToLx5 + RequestOfNode0IsSentToRx5 + RequestOfNode0IsSentToLx6 + RequestOfNode0IsSentToRx6 + Node1HasDetectedCrashOfNode0 + Node1HasDetectedCrashOfNode2 + Node1HasDetectedCrashOfNode3 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node1HasDetectedCrashOfNode4 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node1HasDetectedCrashOfNode5 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node1HasDetectedCrashOfNode6 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node1HasDetectedCrashOfNode7 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node1HasDetectedCrashOfNode8 + Node1ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node1HasDetectedCrashOfNode9 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node1HasDetectedCrashOfNode10 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node1HasDetectedCrashOfNode11 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node1HasDetectedCrashOfNode12 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node1HasDetectedCrashOfNode13 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node1HasDetectedCrashOfNode14 + Node1HasDetectedCrashOfNode15 + Node1HasDetectedCrashOfNode16 + Node1DontAnswerToAnyNode + Node2HasDetectedCrashOfNode0 + Node2HasDetectedCrashOfNode1 + Node2HasDetectedCrashOfNode3 + Node2HasDetectedCrashOfNode4 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node2HasDetectedCrashOfNode5 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node2HasDetectedCrashOfNode6 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node2HasDetectedCrashOfNode7 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node2HasDetectedCrashOfNode8 + Node2ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node2HasDetectedCrashOfNode9 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node2HasDetectedCrashOfNode10 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node2HasDetectedCrashOfNode11 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node2HasDetectedCrashOfNode12 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node2HasDetectedCrashOfNode13 + Node2HasDetectedCrashOfNode14 + Node2HasDetectedCrashOfNode15 + Node2HasDetectedCrashOfNode16 + Node2DontAnswerToAnyNode + Node3HasDetectedCrashOfNode0 + Node3HasDetectedCrashOfNode1 + Node3HasDetectedCrashOfNode2 + Node3HasDetectedCrashOfNode4 + Node3HasDetectedCrashOfNode5 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node3HasDetectedCrashOfNode6 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node3HasDetectedCrashOfNode7 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node3HasDetectedCrashOfNode8 + Node3ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node3HasDetectedCrashOfNode9 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node3HasDetectedCrashOfNode10 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node3HasDetectedCrashOfNode11 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node3HasDetectedCrashOfNode12 + Node3HasDetectedCrashOfNode13 + Node3HasDetectedCrashOfNode14 + Node3HasDetectedCrashOfNode15 + Node3HasDetectedCrashOfNode16 + Node3DontAnswerToAnyNode + Node4HasDetectedCrashOfNode0 + Node4HasDetectedCrashOfNode1 + Node4HasDetectedCrashOfNode2 + Node4HasDetectedCrashOfNode3 + Node4HasDetectedCrashOfNode5 + Node4HasDetectedCrashOfNode6 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node4HasDetectedCrashOfNode7 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node4HasDetectedCrashOfNode8 + Node4ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node4HasDetectedCrashOfNode9 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node4HasDetectedCrashOfNode10 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node4HasDetectedCrashOfNode11 + Node4HasDetectedCrashOfNode12 + Node4HasDetectedCrashOfNode13 + Node4HasDetectedCrashOfNode14 + Node4HasDetectedCrashOfNode15 + Node4HasDetectedCrashOfNode16 + Node4DontAnswerToAnyNode + Node5HasDetectedCrashOfNode0 + Node5HasDetectedCrashOfNode1 + Node5HasDetectedCrashOfNode2 + Node5HasDetectedCrashOfNode3 + Node5HasDetectedCrashOfNode4 + Node5HasDetectedCrashOfNode6 + Node5HasDetectedCrashOfNode7 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node5HasDetectedCrashOfNode8 + Node5ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node5HasDetectedCrashOfNode9 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node5HasDetectedCrashOfNode10 + Node5HasDetectedCrashOfNode11 + Node5HasDetectedCrashOfNode12 + Node5HasDetectedCrashOfNode13 + Node5HasDetectedCrashOfNode14 + Node5HasDetectedCrashOfNode15 + Node5HasDetectedCrashOfNode16 + Node5DontAnswerToAnyNode + Node6HasDetectedCrashOfNode0 + Node6HasDetectedCrashOfNode1 + Node6HasDetectedCrashOfNode2 + Node6HasDetectedCrashOfNode3 + Node6HasDetectedCrashOfNode4 + Node6HasDetectedCrashOfNode5 + Node6HasDetectedCrashOfNode7 + Node6HasDetectedCrashOfNode8 + Node6ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node6HasDetectedCrashOfNode9 + Node6HasDetectedCrashOfNode10 + Node6HasDetectedCrashOfNode11 + Node6HasDetectedCrashOfNode12 + Node6HasDetectedCrashOfNode13 + Node6HasDetectedCrashOfNode14 + Node6HasDetectedCrashOfNode15 + Node6HasDetectedCrashOfNode16 + Node6DontAnswerToAnyNode + Node7HasDetectedCrashOfNode0 + Node7HasDetectedCrashOfNode1 + Node7HasDetectedCrashOfNode2 + Node7HasDetectedCrashOfNode3 + Node7HasDetectedCrashOfNode4 + Node7HasDetectedCrashOfNode5 + Node7HasDetectedCrashOfNode6 + Node7HasDetectedCrashOfNode8 + Node7HasDetectedCrashOfNode9 + Node7HasDetectedCrashOfNode10 + Node7HasDetectedCrashOfNode11 + Node7HasDetectedCrashOfNode12 + Node7HasDetectedCrashOfNode13 + Node7HasDetectedCrashOfNode14 + Node7HasDetectedCrashOfNode15 + Node7HasDetectedCrashOfNode16 + Node7DontAnswerToAnyNode + Node8HasDetectedCrashOfNode0 + Node8HasDetectedCrashOfNode1 + Node8HasDetectedCrashOfNode2 + Node8HasDetectedCrashOfNode3 + Node8HasTheLeafSetOfLx4ToReplaceNode3 + Node8HasDetectedCrashOfNode4 + Node8HasDetectedCrashOfNode5 + Node8HasDetectedCrashOfNode6 + Node8HasDetectedCrashOfNode7 + Node8HasDetectedCrashOfNode9 + Node8HasDetectedCrashOfNode10 + Node8HasDetectedCrashOfNode11 + Node8HasDetectedCrashOfNode12 + Node8HasDetectedCrashOfNode13 + Node8HasDetectedCrashOfNode14 + Node8HasDetectedCrashOfNode15 + Node8HasDetectedCrashOfNode16 + RequestOfNode8IsSentToLx4 + Node9HasDetectedCrashOfNode0 + Node9HasDetectedCrashOfNode1 + Node9HasDetectedCrashOfNode2 + Node9HasDetectedCrashOfNode3 + Node9HasDetectedCrashOfNode4 + Node9HasDetectedCrashOfNode5 + Node9HasDetectedCrashOfNode6 + Node9HasDetectedCrashOfNode7 + Node9HasDetectedCrashOfNode8 + Node9HasDetectedCrashOfNode10 + Node9HasDetectedCrashOfNode11 + Node9HasDetectedCrashOfNode12 + Node9HasDetectedCrashOfNode13 + Node9HasDetectedCrashOfNode14 + Node9HasDetectedCrashOfNode15 + Node9HasDetectedCrashOfNode16 + Node9DontAnswerToAnyNode + Node10HasDetectedCrashOfNode0 + Node10HasDetectedCrashOfNode1 + Node10HasDetectedCrashOfNode2 + Node10HasDetectedCrashOfNode3 + Node10HasDetectedCrashOfNode4 + Node10HasDetectedCrashOfNode5 + Node10HasDetectedCrashOfNode6 + Node10HasDetectedCrashOfNode7 + Node10HasDetectedCrashOfNode8 + Node10ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node10HasDetectedCrashOfNode9 + Node10HasDetectedCrashOfNode11 + Node10HasDetectedCrashOfNode12 + Node10HasDetectedCrashOfNode13 + Node10HasDetectedCrashOfNode14 + Node10HasDetectedCrashOfNode15 + Node10HasDetectedCrashOfNode16 + Node10DontAnswerToAnyNode + Node11HasDetectedCrashOfNode0 + Node11HasDetectedCrashOfNode1 + Node11HasDetectedCrashOfNode2 + Node11HasDetectedCrashOfNode3 + Node11HasDetectedCrashOfNode4 + Node11HasDetectedCrashOfNode5 + Node11HasDetectedCrashOfNode6 + Node11HasDetectedCrashOfNode7 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node11HasDetectedCrashOfNode8 + Node11ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node11HasDetectedCrashOfNode9 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node11HasDetectedCrashOfNode10 + Node11HasDetectedCrashOfNode12 + Node11HasDetectedCrashOfNode13 + Node11HasDetectedCrashOfNode14 + Node11HasDetectedCrashOfNode15 + Node11HasDetectedCrashOfNode16 + Node11DontAnswerToAnyNode + Node12HasDetectedCrashOfNode0 + Node12HasDetectedCrashOfNode1 + Node12HasDetectedCrashOfNode2 + Node12HasDetectedCrashOfNode3 + Node12HasDetectedCrashOfNode4 + Node12HasDetectedCrashOfNode5 + Node12HasDetectedCrashOfNode6 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node12HasDetectedCrashOfNode7 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node12HasDetectedCrashOfNode8 + Node12ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node12HasDetectedCrashOfNode9 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node12HasDetectedCrashOfNode10 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node12HasDetectedCrashOfNode11 + Node12HasDetectedCrashOfNode13 + Node12HasDetectedCrashOfNode14 + Node12HasDetectedCrashOfNode15 + Node12HasDetectedCrashOfNode16 + Node12DontAnswerToAnyNode + Node13HasDetectedCrashOfNode0 + Node13HasDetectedCrashOfNode1 + Node13HasDetectedCrashOfNode2 + Node13HasDetectedCrashOfNode3 + Node13HasDetectedCrashOfNode4 + Node13HasDetectedCrashOfNode5 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node13HasDetectedCrashOfNode6 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node13HasDetectedCrashOfNode7 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node13HasDetectedCrashOfNode8 + Node13ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node13HasDetectedCrashOfNode9 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node13HasDetectedCrashOfNode10 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node13HasDetectedCrashOfNode11 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node13HasDetectedCrashOfNode12 + Node13HasDetectedCrashOfNode14 + Node13HasDetectedCrashOfNode15 + Node13HasDetectedCrashOfNode16 + Node13DontAnswerToAnyNode + Node14HasDetectedCrashOfNode0 + Node14HasDetectedCrashOfNode1 + Node14HasDetectedCrashOfNode2 + Node14HasDetectedCrashOfNode3 + Node14HasDetectedCrashOfNode4 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node14HasDetectedCrashOfNode5 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node14HasDetectedCrashOfNode6 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node14HasDetectedCrashOfNode7 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node14HasDetectedCrashOfNode8 + Node14ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node14HasDetectedCrashOfNode9 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node14HasDetectedCrashOfNode10 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node14HasDetectedCrashOfNode11 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node14HasDetectedCrashOfNode12 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node14HasDetectedCrashOfNode13 + Node14HasDetectedCrashOfNode15 + Node14HasDetectedCrashOfNode16 + Node14DontAnswerToAnyNode + Node15HasDetectedCrashOfNode0 + Node15HasDetectedCrashOfNode1 + Node15HasDetectedCrashOfNode2 + Node15HasDetectedCrashOfNode3 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node15HasDetectedCrashOfNode4 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node15HasDetectedCrashOfNode5 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node15HasDetectedCrashOfNode6 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node15HasDetectedCrashOfNode7 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node15HasDetectedCrashOfNode8 + Node15ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node15HasDetectedCrashOfNode9 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node15HasDetectedCrashOfNode10 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node15HasDetectedCrashOfNode11 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node15HasDetectedCrashOfNode12 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node15HasDetectedCrashOfNode13 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node15HasDetectedCrashOfNode14 + Node15HasDetectedCrashOfNode16 + Node15DontAnswerToAnyNode + Node16HasDetectedCrashOfNode0 + Node16HasDetectedCrashOfNode1 + Node16HasDetectedCrashOfNode2 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node16HasDetectedCrashOfNode3 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node16HasDetectedCrashOfNode4 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node16HasDetectedCrashOfNode5 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node16HasDetectedCrashOfNode6 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node16HasDetectedCrashOfNode7 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node16HasDetectedCrashOfNode8 + Node16ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node16HasDetectedCrashOfNode9 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node16HasDetectedCrashOfNode10 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node16HasDetectedCrashOfNode11 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node16HasDetectedCrashOfNode12 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node16HasDetectedCrashOfNode13 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node16HasDetectedCrashOfNode14 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node16HasDetectedCrashOfNode15 + RequestOfNode16IsSentToLx6 + LeafSetOfLx6IsSentToNode16 + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Lx4HasReceivedTheRequestOfNode0 + Lx4HasReceivedTheRequestOfNode8 + Lx5HasReceivedTheRequestOfNode0 + Lx6HasReceivedTheRequestOfNode16 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx4HasReceivedTheRequestOfNode0 + Rx5HasReceivedTheRequestOfNode0 + Rx6HasReceivedTheRequestOfNode0 + ANodeFromTheLeafSetOfLx4IsACtiveInTheLeafSet = 1
inv : Node5NotifyThatHeIsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Node5IsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Node11IsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : Node3NotifyThatHeIsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Node13IsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Lx1IsActiveAndNotInTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet - Lx6IsActiveAndNotInTheLeafSet + Lx6IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node13NotifyThatHeIsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Rx3IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node3IsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : CrashReservoir - NoCrashIsHappening + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet + 4*Lx4IsAtTheLeftExtremityOfTheLeafSet + 5*Lx5IsAtTheLeftExtremityOfTheLeafSet - 7*Lx6IsActiveAndNotInTheLeafSet + 6*Lx6IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet + 3*Rx3IsAtTheRightExtremityOfTheLeafSet + 4*Rx4IsAtTheRightExtremityOfTheLeafSet - 7*Rx5IsActiveAndNotInTheLeafSet + 5*Rx5IsAtTheRightExtremityOfTheLeafSet - Rx6IsAtTheRightExtremityOfTheLeafSet = -8
inv : Rx2IsActiveAndNotInTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node2NotifyThatHeIsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Node14NotifyThatHeIsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : Node7NotifyThatHeIsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Node2IsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Lx4IsActiveAndNotInTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet - Lx6IsActiveAndNotInTheLeafSet + Lx6IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Lx2IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet - Lx6IsActiveAndNotInTheLeafSet + Lx6IsAtTheLeftExtremityOfTheLeafSet = 0
inv : NoCrashIsHappening + ThereIsAMasterInTheLeafSet + Node0AsksIsThereANodeMaster + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + RequestOfNode0IsSentToLx5 + RequestOfNode0IsSentToRx5 + RequestOfNode0IsSentToLx6 + RequestOfNode0IsSentToRx6 + Node1AsksIsThereANodeMaster + Node1DontAnswerToAnyNode + Node2AsksIsThereANodeMaster + Node2DontAnswerToAnyNode + Node3AsksIsThereANodeMaster + Node3DontAnswerToAnyNode + Node4AsksIsThereANodeMaster + Node4DontAnswerToAnyNode + Node5AsksIsThereANodeMaster + Node5DontAnswerToAnyNode + Node6AsksIsThereANodeMaster + Node6DontAnswerToAnyNode + Node7AsksIsThereANodeMaster + Node7DontAnswerToAnyNode + Node8AsksIsThereANodeMaster + Node8HasTheLeafSetOfLx4ToReplaceNode3 + RequestOfNode8IsSentToLx4 + Node9AsksIsThereANodeMaster + Node9DontAnswerToAnyNode + Node10AsksIsThereANodeMaster + Node10DontAnswerToAnyNode + Node11AsksIsThereANodeMaster + Node11DontAnswerToAnyNode + Node12AsksIsThereANodeMaster + Node12DontAnswerToAnyNode + Node13AsksIsThereANodeMaster + Node13DontAnswerToAnyNode + Node14AsksIsThereANodeMaster + Node14DontAnswerToAnyNode + Node15AsksIsThereANodeMaster + Node15DontAnswerToAnyNode + Node16AsksIsThereANodeMaster + RequestOfNode16IsSentToLx6 + LeafSetOfLx6IsSentToNode16 + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Lx4HasReceivedTheRequestOfNode0 + Lx4HasReceivedTheRequestOfNode8 + Lx5HasReceivedTheRequestOfNode0 + Lx6HasReceivedTheRequestOfNode16 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx4HasReceivedTheRequestOfNode0 + Rx5HasReceivedTheRequestOfNode0 + Rx6HasReceivedTheRequestOfNode0 + ANodeFromTheLeafSetOfLx4IsACtiveInTheLeafSet = 1
inv : Node11NotifyThatHeIsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : Node7IsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Lx0IsActiveAndNotInTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet - Lx6IsActiveAndNotInTheLeafSet + Lx6IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node0IsTheNodeMaster + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node1IsTheNodeMaster + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node2IsTheNodeMaster + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node3IsTheNodeMaster + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node4IsTheNodeMaster + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node5IsTheNodeMaster + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node6IsTheNodeMaster + Node6ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node7IsTheNodeMaster + Node8IsTheNodeMaster + Node9IsTheNodeMaster + Node10IsTheNodeMaster + Node10ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11IsTheNodeMaster + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12IsTheNodeMaster + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node13IsTheNodeMaster + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node14IsTheNodeMaster + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node15IsTheNodeMaster + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node16IsTheNodeMaster + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode14 = 1
Total of 48 invariants.
[2021-05-18 10:32:13] [INFO ] Computed 48 place invariants in 23 ms
[2021-05-18 10:32:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4965338721727928290.prop : 8827 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5157481819821322510.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4965338721727928290.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2021-05-18 10:32:21] [INFO ] BMC solution for property gen-ReachabilityCardinality-02(UNSAT) depth K=1 took 8805 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5157481819821322510.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4965338721727928290.prop --nowitness --gen-order FOLLOW
[2021-05-18 10:32:21] [INFO ] BMC solution for property gen-ReachabilityCardinality-11(UNSAT) depth K=1 took 122 ms
Loading property file /tmp/ReachabilityCardinality4965338721727928290.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 74
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :74 after 77
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :77 after 78
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :78 after 156
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :156 after 174
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :174 after 180
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :180 after 304
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :304 after 508
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :508 after 1066
[2021-05-18 10:32:37] [INFO ] Proved 978 variables to be positive in 23847 ms
[2021-05-18 10:32:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityCardinality-02
[2021-05-18 10:32:38] [INFO ] KInduction solution for property gen-ReachabilityCardinality-02(SAT) depth K=0 took 1190 ms
[2021-05-18 10:32:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityCardinality-11
[2021-05-18 10:32:38] [INFO ] KInduction solution for property gen-ReachabilityCardinality-11(SAT) depth K=0 took 279 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1066 after 2114
[2021-05-18 10:32:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityCardinality-02
[2021-05-18 10:32:47] [INFO ] KInduction solution for property gen-ReachabilityCardinality-02(SAT) depth K=1 took 8761 ms
[2021-05-18 10:32:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityCardinality-11
[2021-05-18 10:32:58] [INFO ] KInduction solution for property gen-ReachabilityCardinality-11(SAT) depth K=1 took 11112 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2114 after 3988
Compilation finished in 71902 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6717693503731016896]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, genReachabilityCardinality02==true], workingDir=/tmp/ltsmin6717693503731016896]
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3988 after 8580
[2021-05-18 10:35:00] [INFO ] BMC solution for property gen-ReachabilityCardinality-02(UNSAT) depth K=2 took 158649 ms
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :8580 after 19676
[2021-05-18 10:38:14] [INFO ] BMC solution for property gen-ReachabilityCardinality-11(UNSAT) depth K=2 took 194398 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :19676 after 44291
Detected timeout of ITS tools.
[2021-05-18 10:55:04] [INFO ] Applying decomposition
[2021-05-18 10:55:05] [INFO ] Flatten gal took : 440 ms
[2021-05-18 10:55:05] [INFO ] Decomposing Gal with order
[2021-05-18 10:55:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:55:06] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-18 10:55:06] [INFO ] Flatten gal took : 577 ms
[2021-05-18 10:55:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 0 ms.
[2021-05-18 10:55:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality945848500209020583.gal : 41 ms
[2021-05-18 10:55:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5011784283740943317.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality945848500209020583.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5011784283740943317.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality945848500209020583.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5011784283740943317.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5011784283740943317.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 73
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :73 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 77
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :77 after 154
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :154 after 157
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :157 after 177
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :177 after 302
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :302 after 444
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :444 after 1086
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1086 after 2138
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2138 after 3891
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3891 after 8232
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :8232 after 19352
LTSmin run took 1785180 ms.
Invariant validated
FORMULA gen-ReachabilityCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, genReachabilityCardinality11==true], workingDir=/tmp/ltsmin6717693503731016896]
[2021-05-18 11:06:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityCardinality-02
[2021-05-18 11:06:26] [INFO ] KInduction solution for property gen-ReachabilityCardinality-02(SAT) depth K=2 took 2007852 ms
[2021-05-18 11:08:15] [INFO ] BMC solution for property gen-ReachabilityCardinality-02(UNSAT) depth K=3 took 1801174 ms
[2021-05-18 11:09:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityCardinality-11
[2021-05-18 11:09:26] [INFO ] KInduction solution for property gen-ReachabilityCardinality-11(SAT) depth K=2 took 179866 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :19352 after 38097
Detected timeout of ITS tools.
[2021-05-18 11:17:50] [INFO ] Flatten gal took : 444 ms
[2021-05-18 11:17:50] [INFO ] Input system was already deterministic with 4004 transitions.
[2021-05-18 11:17:50] [INFO ] Transformed 978 places.
[2021-05-18 11:17:51] [INFO ] Transformed 4004 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 11:18:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15443324807811782981.gal : 9950 ms
[2021-05-18 11:18:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16092664161938152097.prop : 397 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15443324807811782981.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16092664161938152097.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15443324807811782981.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16092664161938152097.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality16092664161938152097.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 53
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :53 after 55
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :55 after 63
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :63 after 69
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :69 after 81
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :81 after 103
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :103 after 142
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :142 after 217
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :217 after 1035

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="MultiCrashLeafsetExtension-PT-S16C07"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156700614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C07.tgz
mv MultiCrashLeafsetExtension-PT-S16C07 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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