Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422000066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is HirschbergSinclair-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422000066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 136K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2023-12
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2023-13
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2023-14
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2023-15
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-00
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-01
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-02
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-03
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-04
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-05
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-06
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-07
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-08
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-09
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-10
FORMULA_NAME HirschbergSinclair-PT-10-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748774648693

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-01 10:44:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 10:44:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:44:10] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2025-06-01 10:44:10] [INFO ] Transformed 260 places.
[2025-06-01 10:44:10] [INFO ] Transformed 236 transitions.
[2025-06-01 10:44:10] [INFO ] Parsed PT model containing 260 places and 236 transitions and 721 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 117 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 250 transition count 236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 248 transition count 234
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 248 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 247 transition count 233
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 247 transition count 233
Applied a total of 16 rules in 62 ms. Remains 247 /260 variables (removed 13) and now considering 233/236 (removed 3) transitions.
// Phase 1: matrix 233 rows 247 cols
[2025-06-01 10:44:10] [INFO ] Computed 14 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:44:10] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-01 10:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:44:11] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-06-01 10:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 233/480 variables, 247/261 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 261 constraints, problems are : Problem set: 0 solved, 223 unsolved in 20460 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 233/480 variables, 247/261 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 223/484 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 484 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50590ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 50617ms
Starting structural reductions in LTL mode, iteration 1 : 247/260 places, 233/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51320 ms. Remains : 247/260 places, 233/236 transitions.
Support contains 117 out of 247 places after structural reductions.
[2025-06-01 10:45:01] [INFO ] Flatten gal took : 49 ms
[2025-06-01 10:45:02] [INFO ] Flatten gal took : 22 ms
[2025-06-01 10:45:02] [INFO ] Input system was already deterministic with 233 transitions.
Reduction of identical properties reduced properties to check from 88 to 87
RANDOM walk for 40000 steps (168 resets) in 2201 ms. (18 steps per ms) remains 6/87 properties
BEST_FIRST walk for 40003 steps (31 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (30 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (37 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
[2025-06-01 10:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 190/208 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/222 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 5 (OVERLAPS) 233/455 variables, 222/236 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/236 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/480 variables, 25/261 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/261 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/261 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 261 constraints, problems are : Problem set: 4 solved, 2 unsolved in 751 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 197/205 variables, 11/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/222 variables, 3/14 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 233/455 variables, 222/236 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/236 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/480 variables, 25/261 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 2/263 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 0/263 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/480 variables, 0/263 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 263 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1051 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1808ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 204 ms.
Support contains 8 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 233/233 transitions.
Graph (complete) has 465 edges and 247 vertex of which 243 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 243 transition count 150
Reduce places removed 79 places and 0 transitions.
Graph (complete) has 288 edges and 164 vertex of which 152 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 80 rules applied. Total rules applied 164 place count 152 transition count 150
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 176 place count 152 transition count 138
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 148 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 148 transition count 134
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 185 place count 148 transition count 133
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 264 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 187 place count 146 transition count 133
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 188 place count 146 transition count 132
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 191 place count 143 transition count 129
Iterating global reduction 6 with 3 rules applied. Total rules applied 194 place count 143 transition count 129
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 195 place count 142 transition count 128
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 142 transition count 128
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 202 place count 142 transition count 122
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 208 place count 136 transition count 122
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 216 place count 128 transition count 114
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 7 with 24 rules applied. Total rules applied 240 place count 124 transition count 94
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 260 place count 104 transition count 94
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 13 Pre rules applied. Total rules applied 260 place count 104 transition count 81
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 286 place count 91 transition count 81
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 287 place count 90 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 287 place count 90 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 289 place count 89 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 295 place count 86 transition count 77
Applied a total of 295 rules in 67 ms. Remains 86 /247 variables (removed 161) and now considering 77/233 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 86/247 places, 77/233 transitions.
RANDOM walk for 40000 steps (484 resets) in 568 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (146 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (149 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 566755 steps, run visited all 2 properties in 979 ms. (steps per millisecond=578 )
Probabilistic random walk after 566755 steps, saw 115523 distinct states, run finished after 982 ms. (steps per millisecond=577 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2025-06-01 10:45:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-01 10:45:06] [INFO ] Flatten gal took : 16 ms
FORMULA HirschbergSinclair-PT-10-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 10:45:06] [INFO ] Flatten gal took : 15 ms
[2025-06-01 10:45:06] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 100 out of 247 places (down from 111) after GAL structural reductions.
Computed a total of 247 stabilizing places and 233 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 233
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 226
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 226
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 235 transition count 221
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 235 transition count 221
Applied a total of 24 rules in 17 ms. Remains 235 /247 variables (removed 12) and now considering 221/233 (removed 12) transitions.
// Phase 1: matrix 221 rows 235 cols
[2025-06-01 10:45:06] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:45:06] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-01 10:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:45:07] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-01 10:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 10/235 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 221/456 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 249 constraints, problems are : Problem set: 0 solved, 211 unsolved in 17381 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 10/235 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 221/456 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 211/460 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 460 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47442ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 47446ms
Starting structural reductions in LTL mode, iteration 1 : 235/247 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48445 ms. Remains : 235/247 places, 221/233 transitions.
[2025-06-01 10:45:54] [INFO ] Flatten gal took : 15 ms
[2025-06-01 10:45:54] [INFO ] Flatten gal took : 11 ms
[2025-06-01 10:45:54] [INFO ] Input system was already deterministic with 221 transitions.
[2025-06-01 10:45:54] [INFO ] Flatten gal took : 11 ms
[2025-06-01 10:45:54] [INFO ] Flatten gal took : 10 ms
[2025-06-01 10:45:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2025793136932891321.gal : 5 ms
[2025-06-01 10:45:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10720152110284595496.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2025793136932891321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10720152110284595496.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43537e+12,0.579219,27908,2,20345,5,93373,6,0,1154,94776,0


Converting to forward existential form...Done !
original formula: A(((!(EX((rcv_left_election_10_3_3_3>=1))) + EG(((newmsg6>=1)&&(elected_10_to_left_7>=1)))) + !(EF(EG((rcv_left_reply_10_3_3>=1))))) U EG...520
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((!(EX(!((((newmsg6>=1)&&(reply_10_3_to_right_5>=1))&&(rcv_left_reply_9_0_9>=1))))) * !((E(...1740
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29...315
Detected timeout of ITS tools.
[2025-06-01 10:46:25] [INFO ] Flatten gal took : 10 ms
[2025-06-01 10:46:25] [INFO ] Applying decomposition
[2025-06-01 10:46:25] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10735289064144036208.txt' '-o' '/tmp/graph10735289064144036208.bin' '-w' '/tmp/graph10735289064144036208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10735289064144036208.bin' '-l' '-1' '-v' '-w' '/tmp/graph10735289064144036208.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:46:25] [INFO ] Decomposing Gal with order
[2025-06-01 10:46:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:46:25] [INFO ] Removed a total of 34 redundant transitions.
[2025-06-01 10:46:25] [INFO ] Flatten gal took : 59 ms
[2025-06-01 10:46:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-01 10:46:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3827468359017745294.gal : 11 ms
[2025-06-01 10:46:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3504620894912605119.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3827468359017745294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3504620894912605119.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43537e+12,2.65332,92712,2131,2697,122677,58279,680,336129,218,348405,0


Converting to forward existential form...Done !
original formula: A(((!(EX((i1.u2.rcv_left_election_10_3_3_3>=1))) + EG(((i2.u5.newmsg6>=1)&&(i6.i0.u29.elected_10_to_left_7>=1)))) + !(EF(EG((i1.u18.rcv_l...639
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((!(EX(!((((i2.u5.newmsg6>=1)&&(i4.i0.u4.reply_10_3_to_right_5>=1))&&(i5.i0.u8.rcv_left_rep...2111
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t7, t8, t9, t15, t210, t220, i0.u0.t190, i1.t23, i1.t19, i1.t2, i1.u1.t13...444
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 238 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 238 transition count 224
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 232 transition count 218
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 232 transition count 218
Applied a total of 30 rules in 20 ms. Remains 232 /247 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 232 cols
[2025-06-01 10:46:55] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:46:55] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-01 10:46:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:46:56] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-01 10:46:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 18011 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48069ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 48071ms
Starting structural reductions in LTL mode, iteration 1 : 232/247 places, 218/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49147 ms. Remains : 232/247 places, 218/233 transitions.
[2025-06-01 10:47:44] [INFO ] Flatten gal took : 11 ms
[2025-06-01 10:47:44] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:47:44] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-01 10:47:44] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:47:44] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:47:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4989154915610263099.gal : 2 ms
[2025-06-01 10:47:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13025243810157278331.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4989154915610263099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13025243810157278331.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.92597e+11,0.564967,26528,2,17623,5,88347,6,0,1139,88711,0


Converting to forward existential form...Done !
original formula: EF((AX((rcv_left_election_10_4_8_8>=1)) + (EX(E(A(((newmsg8>=1)&&(election_7_0_1_to_right_7>=1)) U ((newmsg8>=1)&&(election_10_4_8_to_rig...315
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((rcv_left_election_10_4_8_8>=1)))))] != FALSE + [(((FwdU(Init,TRUE) * EX(E(!((E(!(((...653
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t20, t22, t24, t26, t28, t30, t32...305
(forward)formula 0,1,11.8483,371892,1,0,399,1.87915e+06,453,223,6781,1.1956e+06,443
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 226
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 226
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 233 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 233 transition count 219
Applied a total of 28 rules in 17 ms. Remains 233 /247 variables (removed 14) and now considering 219/233 (removed 14) transitions.
// Phase 1: matrix 219 rows 233 cols
[2025-06-01 10:47:56] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:47:56] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-01 10:47:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:47:57] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-06-01 10:47:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 10/233 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 219/452 variables, 233/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 247 constraints, problems are : Problem set: 0 solved, 209 unsolved in 18434 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 10/233 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 219/452 variables, 233/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 209/456 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 456 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48483ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 48485ms
Starting structural reductions in LTL mode, iteration 1 : 233/247 places, 219/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49509 ms. Remains : 233/247 places, 219/233 transitions.
[2025-06-01 10:48:46] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:48:46] [INFO ] Flatten gal took : 8 ms
[2025-06-01 10:48:46] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-01 10:48:46] [INFO ] Flatten gal took : 14 ms
[2025-06-01 10:48:46] [INFO ] Flatten gal took : 29 ms
[2025-06-01 10:48:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7514373363668526627.gal : 1 ms
[2025-06-01 10:48:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8198341276062541458.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7514373363668526627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8198341276062541458.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.53383e+11,0.619232,26072,2,19023,5,84304,6,0,1144,84276,0


Converting to forward existential form...Done !
original formula: !(A((!((EG(((newmsg7>=1)&&(reply_10_3_to_left_8>=1))) * !((((newmsg5>=1)&&(reply_5_0_to_right_4>=1)) + A((init3>=1) U ((newmsg5>=1)&&(ele...454
=> equivalent forward existential formula: ([((FwdU(Init,!(E((((rcv_left_election_3_0_1_4>=1)&&(!((newmsg2>=1)&&(election_10_2_2_to_right_1>=1))))||(!(((rc...1132
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t25, t27, t30, t32, t34...305
Detected timeout of ITS tools.
[2025-06-01 10:49:16] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:49:16] [INFO ] Applying decomposition
[2025-06-01 10:49:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5074984257708096194.txt' '-o' '/tmp/graph5074984257708096194.bin' '-w' '/tmp/graph5074984257708096194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5074984257708096194.bin' '-l' '-1' '-v' '-w' '/tmp/graph5074984257708096194.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:49:16] [INFO ] Decomposing Gal with order
[2025-06-01 10:49:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:49:16] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 10:49:16] [INFO ] Flatten gal took : 17 ms
[2025-06-01 10:49:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-01 10:49:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15404258601242054894.gal : 4 ms
[2025-06-01 10:49:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1245887944660476423.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15404258601242054894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1245887944660476423.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.53383e+11,3.41211,110792,2198,3312,131681,88006,703,416835,245,500447,0


Converting to forward existential form...Done !
original formula: !(A((!((EG(((i0.u10.newmsg7>=1)&&(i0.u10.reply_10_3_to_left_8>=1))) * !((((i4.u4.newmsg5>=1)&&(i4.u3.reply_5_0_to_right_4>=1)) + A((i1.i1...569
=> equivalent forward existential formula: ([((FwdU(Init,!(E((((i4.u3.rcv_left_election_3_0_1_4>=1)&&(!((i1.i1.u1.newmsg2>=1)&&(i1.i1.u1.election_10_2_2_to...1395
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t9, t208, t218, i0.t6, i0.u5.t32, i0.u5.t38, i0.u10.t36, i0.u10.t42, ...431
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 232 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 232 transition count 218
Applied a total of 30 rules in 10 ms. Remains 232 /247 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 232 cols
[2025-06-01 10:49:46] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:49:46] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-01 10:49:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:49:47] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-01 10:49:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 18379 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48431ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 48433ms
Starting structural reductions in LTL mode, iteration 1 : 232/247 places, 218/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49614 ms. Remains : 232/247 places, 218/233 transitions.
[2025-06-01 10:50:36] [INFO ] Flatten gal took : 7 ms
[2025-06-01 10:50:36] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:50:36] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-01 10:50:36] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:50:36] [INFO ] Flatten gal took : 7 ms
[2025-06-01 10:50:36] [INFO ] Time to serialize gal into /tmp/CTLFireability439130527765047863.gal : 1 ms
[2025-06-01 10:50:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9024464987580795727.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability439130527765047863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9024464987580795727.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.96098e+11,0.50985,25272,2,17295,5,79229,6,0,1139,80569,0


Converting to forward existential form...Done !
original formula: AF((AF((EX(((newmsg7<1)||(election_10_3_7_to_right_6<1))) * (AX((rcv_left_election_3_0_1_4<1)) + ((rcv_right_election_10_4_8_2<1)&&(rcv_r...238
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((EX(((newmsg7<1)||(election_10_3_7_to_right_6<1))) * (!(EX(!((rcv_left_election_3_0_1_4<1))...301
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t25, t27, t29, t31, t33...305
Detected timeout of ITS tools.
[2025-06-01 10:51:06] [INFO ] Flatten gal took : 12 ms
[2025-06-01 10:51:06] [INFO ] Applying decomposition
[2025-06-01 10:51:06] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17330250531987801149.txt' '-o' '/tmp/graph17330250531987801149.bin' '-w' '/tmp/graph17330250531987801149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17330250531987801149.bin' '-l' '-1' '-v' '-w' '/tmp/graph17330250531987801149.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:51:06] [INFO ] Decomposing Gal with order
[2025-06-01 10:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:51:06] [INFO ] Removed a total of 19 redundant transitions.
[2025-06-01 10:51:06] [INFO ] Flatten gal took : 16 ms
[2025-06-01 10:51:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-01 10:51:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15967993773569236380.gal : 3 ms
[2025-06-01 10:51:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14515955151710728281.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15967993773569236380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14515955151710728281.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.96098e+11,2.43472,84524,1788,3975,84506,110520,645,197707,279,528287,0


Converting to forward existential form...Done !
original formula: AF((AF((EX(((i2.u4.newmsg7<1)||(i2.u4.election_10_3_7_to_right_6<1))) * (AX((i5.u3.rcv_left_election_3_0_1_4<1)) + ((i0.u1.rcv_right_elec...282
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((EX(((i2.u4.newmsg7<1)||(i2.u4.election_10_3_7_to_right_6<1))) * (!(EX(!((i5.u3.rcv_left_el...345
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t7, t8, t9, t187, t217, i0.t19, i0.t15, i0.t1, i0.u1.t13, i1.u7.t17, i2.t37, ...413
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 225
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 233 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 233 transition count 219
Applied a total of 28 rules in 15 ms. Remains 233 /247 variables (removed 14) and now considering 219/233 (removed 14) transitions.
// Phase 1: matrix 219 rows 233 cols
[2025-06-01 10:51:36] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:51:36] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-01 10:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:51:37] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-06-01 10:51:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 10/233 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 219/452 variables, 233/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 247 constraints, problems are : Problem set: 0 solved, 209 unsolved in 18284 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 10/233 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 219/452 variables, 233/247 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 209/456 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 456 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48329ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 48330ms
Starting structural reductions in LTL mode, iteration 1 : 233/247 places, 219/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49470 ms. Remains : 233/247 places, 219/233 transitions.
[2025-06-01 10:52:25] [INFO ] Flatten gal took : 8 ms
[2025-06-01 10:52:25] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:52:25] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-01 10:52:25] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:52:25] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:52:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10761014481350551412.gal : 1 ms
[2025-06-01 10:52:25] [INFO ] Time to serialize properties into /tmp/CTLFireability1389741737762905591.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10761014481350551412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1389741737762905591.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.49242e+11,0.520886,25748,2,17381,5,83912,6,0,1144,83981,0


Converting to forward existential form...Done !
original formula: E(AF(EX(((rcv_right_election_10_4_9_1>=1) + (EF(((newmsg6>=1)&&(election_5_0_1_to_right_5>=1))) * ((rcv_right_election_10_4_9_1>=1)||((ne...349
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(EX(((rcv_right_election_10_4_9_1>=1) + (E(TRUE U ((newmsg6>=1)&&(election_5_0_1_to_right_5>=1...431
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t21, t23, t25, t27, t29, t31, t34...305
(forward)formula 0,0,13.1613,416196,1,0,404,2.27838e+06,463,225,6948,1.28178e+06,456
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 232 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 232 transition count 218
Applied a total of 30 rules in 16 ms. Remains 232 /247 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 232 cols
[2025-06-01 10:52:39] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:52:39] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-01 10:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:52:40] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-01 10:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 18123 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48173ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 48174ms
Starting structural reductions in LTL mode, iteration 1 : 232/247 places, 218/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49245 ms. Remains : 232/247 places, 218/233 transitions.
[2025-06-01 10:53:28] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:53:28] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:53:28] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-01 10:53:28] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:53:28] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:53:28] [INFO ] Time to serialize gal into /tmp/CTLFireability8853065700272828634.gal : 2 ms
[2025-06-01 10:53:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16428630446747869297.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8853065700272828634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16428630446747869297.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.94977e+11,0.509415,25756,2,18833,5,83508,6,0,1139,82614,0


Converting to forward existential form...Done !
original formula: ((EG(EF(!(E((rcv_right_election_10_2_2_8>=1) U (init1>=1))))) * AF((((rcv_left_election_10_2_3_3<1) * EX(((newmsg6>=1)&&(election_7_0_1_t...389
=> equivalent forward existential formula: (([(Init * !(EG(E(TRUE U !(E((rcv_right_election_10_2_2_8>=1) U (init1>=1)))))))] = FALSE * [FwdG(Init,!((((rcv_...521
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31...305
Detected timeout of ITS tools.
[2025-06-01 10:53:58] [INFO ] Flatten gal took : 14 ms
[2025-06-01 10:53:58] [INFO ] Applying decomposition
[2025-06-01 10:53:58] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17045457870955629429.txt' '-o' '/tmp/graph17045457870955629429.bin' '-w' '/tmp/graph17045457870955629429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17045457870955629429.bin' '-l' '-1' '-v' '-w' '/tmp/graph17045457870955629429.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:53:58] [INFO ] Decomposing Gal with order
[2025-06-01 10:53:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:53:58] [INFO ] Removed a total of 22 redundant transitions.
[2025-06-01 10:53:58] [INFO ] Flatten gal took : 11 ms
[2025-06-01 10:53:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 10:53:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6796700367765136550.gal : 2 ms
[2025-06-01 10:53:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4896036795558097788.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6796700367765136550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4896036795558097788.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.94977e+11,3.68579,118596,3013,3121,201574,61950,717,304328,261,367408,0


Converting to forward existential form...Done !
original formula: ((EG(EF(!(E((i4.u16.rcv_right_election_10_2_2_8>=1) U (i5.i1.u0.init1>=1))))) * AF((((i0.u2.rcv_left_election_10_2_3_3<1) * EX(((i1.u4.ne...466
=> equivalent forward existential formula: (([(Init * !(EG(E(TRUE U !(E((i4.u16.rcv_right_election_10_2_2_8>=1) U (i5.i1.u0.init1>=1)))))))] = FALSE * [Fwd...598
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t5, t6, t8, t9, t41, t207, t217, u8.t25, u8.t31, i0.t27, i0.t23, i0.t3, i0.u2.t17...417
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 238 transition count 134
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 148 transition count 134
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 189 place count 139 transition count 125
Iterating global reduction 2 with 9 rules applied. Total rules applied 198 place count 139 transition count 125
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 139 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 137 transition count 123
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 137 transition count 123
Applied a total of 202 rules in 18 ms. Remains 137 /247 variables (removed 110) and now considering 123/233 (removed 110) transitions.
// Phase 1: matrix 123 rows 137 cols
[2025-06-01 10:54:28] [INFO ] Computed 14 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:54:28] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-01 10:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:54:29] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:54:29] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-01 10:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 108/230 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 2/232 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/260 variables, and 137 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5588 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 123/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 108/230 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 12/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/260 variables, and 243 constraints, problems are : Problem set: 0 solved, 106 unsolved in 17843 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 123/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23439ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 23439ms
Starting structural reductions in SI_CTL mode, iteration 1 : 137/247 places, 123/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23898 ms. Remains : 137/247 places, 123/233 transitions.
[2025-06-01 10:54:52] [INFO ] Flatten gal took : 8 ms
[2025-06-01 10:54:52] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:54:52] [INFO ] Input system was already deterministic with 123 transitions.
[2025-06-01 10:54:52] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:54:52] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:54:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16493974777083123664.gal : 1 ms
[2025-06-01 10:54:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8109699172152769626.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16493974777083123664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8109699172152769626.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37648e+09,0.062359,6840,2,2054,5,11751,6,0,657,10119,0


Converting to forward existential form...Done !
original formula: EF((EF((rcv_left_election_10_4_6_6>=1)) + ((newmsg9>=1)&&(reply_10_3_to_right_8>=1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * (rcv_left_election_10_4_6_6>=1))] != FALSE + [(FwdU(Init,TRUE) * ((newmsg9>=1)&&...194
(forward)formula 0,1,0.081994,7096,1,0,7,11751,9,1,1260,10119,3
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 232 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 232 transition count 218
Applied a total of 30 rules in 8 ms. Remains 232 /247 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 232 cols
[2025-06-01 10:54:52] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:54:52] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-01 10:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:54:53] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-01 10:54:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17987 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48040ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 48041ms
Starting structural reductions in LTL mode, iteration 1 : 232/247 places, 218/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48761 ms. Remains : 232/247 places, 218/233 transitions.
[2025-06-01 10:55:41] [INFO ] Flatten gal took : 10 ms
[2025-06-01 10:55:41] [INFO ] Flatten gal took : 8 ms
[2025-06-01 10:55:41] [INFO ] Input system was already deterministic with 218 transitions.
Support contains 21 out of 232 places (down from 23) after GAL structural reductions.
[2025-06-01 10:55:41] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:55:41] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:55:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12618853351133695161.gal : 1 ms
[2025-06-01 10:55:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7081619674105450481.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12618853351133695161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7081619674105450481.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.95491e+11,0.533355,27500,2,19168,5,87624,6,0,1139,90348,0


Converting to forward existential form...Done !
original formula: ((AX((rcv_right_reply_10_2_10<1)) + EX(TRUE)) * ((AF((((((AF(((newmsg1>=1)&&(election_2_0_1_to_left_2>=1))) + ((newmsg5>=1)&&(election_10...697
=> equivalent forward existential formula: ([(EY((Init * !(EX(TRUE)))) * !((rcv_right_reply_10_2_10<1)))] = FALSE * [FwdG(((Init * !(EG(!(!((E(!(((rcv_left...952
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t21, t23, t25, t27, t29, t31, t33...305
Detected timeout of ITS tools.
[2025-06-01 10:56:11] [INFO ] Flatten gal took : 11 ms
[2025-06-01 10:56:11] [INFO ] Applying decomposition
[2025-06-01 10:56:11] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12116601684053025332.txt' '-o' '/tmp/graph12116601684053025332.bin' '-w' '/tmp/graph12116601684053025332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12116601684053025332.bin' '-l' '-1' '-v' '-w' '/tmp/graph12116601684053025332.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:56:11] [INFO ] Decomposing Gal with order
[2025-06-01 10:56:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:56:11] [INFO ] Removed a total of 15 redundant transitions.
[2025-06-01 10:56:11] [INFO ] Flatten gal took : 12 ms
[2025-06-01 10:56:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 10:56:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3067324114451381743.gal : 2 ms
[2025-06-01 10:56:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14591289667938473969.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3067324114451381743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14591289667938473969.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.95491e+11,3.9589,129940,2033,4965,143047,124032,616,356160,266,834240,0


Converting to forward existential form...Done !
original formula: ((AX((i0.u8.rcv_right_reply_10_2_10<1)) + EX(TRUE)) * ((AF((((((AF(((i0.u0.newmsg1>=1)&&(i0.u0.election_2_0_1_to_left_2>=1))) + ((i5.u4.n...837
=> equivalent forward existential formula: ([(EY((Init * !(EX(TRUE)))) * !((i0.u8.rcv_right_reply_10_2_10<1)))] = FALSE * [FwdG(((Init * !(EG(!(!((E(!(((i4...1116
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t8, t9, t15, t207, t217, u1.t13, i0.u0.t187, i0.u8.t11, i1.u7.t43, i3.t7,...412
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 240 transition count 226
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 240 transition count 226
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 235 transition count 221
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 235 transition count 221
Applied a total of 24 rules in 15 ms. Remains 235 /247 variables (removed 12) and now considering 221/233 (removed 12) transitions.
// Phase 1: matrix 221 rows 235 cols
[2025-06-01 10:56:41] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:56:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-01 10:56:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:56:42] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-01 10:56:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 10/235 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 221/456 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 249 constraints, problems are : Problem set: 0 solved, 211 unsolved in 18359 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 10/235 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 221/456 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 211/460 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 460 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48407ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 48408ms
Starting structural reductions in LTL mode, iteration 1 : 235/247 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49240 ms. Remains : 235/247 places, 221/233 transitions.
[2025-06-01 10:57:30] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:57:30] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:57:30] [INFO ] Input system was already deterministic with 221 transitions.
[2025-06-01 10:57:30] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:57:30] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:57:30] [INFO ] Time to serialize gal into /tmp/CTLFireability263944352144218671.gal : 1 ms
[2025-06-01 10:57:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11688991448655872932.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability263944352144218671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11688991448655872932.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22787e+12,0.591458,27768,2,19725,5,89448,6,0,1154,88081,0


Converting to forward existential form...Done !
original formula: E(EF(((AX(((E(((newmsg7>=1)&&(election_10_4_7_to_right_6>=1)) U ((newmsg8>=1)&&(election_10_2_2_to_left_9>=1))) * (rcv_right_election_10_...476
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U ((!(EX(!(((E(((newmsg7>=1)&&(election_10_4_7_to_right_6>=1)) U ((newmsg8>=1)&&(election...637
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t20, t22, t24, t26, t28, t30, t32...305
Detected timeout of ITS tools.
[2025-06-01 10:58:00] [INFO ] Flatten gal took : 8 ms
[2025-06-01 10:58:00] [INFO ] Applying decomposition
[2025-06-01 10:58:00] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5040245260879878197.txt' '-o' '/tmp/graph5040245260879878197.bin' '-w' '/tmp/graph5040245260879878197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5040245260879878197.bin' '-l' '-1' '-v' '-w' '/tmp/graph5040245260879878197.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:58:00] [INFO ] Decomposing Gal with order
[2025-06-01 10:58:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:58:00] [INFO ] Removed a total of 16 redundant transitions.
[2025-06-01 10:58:00] [INFO ] Flatten gal took : 11 ms
[2025-06-01 10:58:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 10:58:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8306824015981296754.gal : 2 ms
[2025-06-01 10:58:00] [INFO ] Time to serialize properties into /tmp/CTLFireability485972573222089482.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8306824015981296754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability485972573222089482.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22787e+12,2.30996,83732,1850,3586,101370,91249,674,248754,281,388406,0


Converting to forward existential form...Done !
original formula: E(EF(((AX(((E(((i4.i0.u5.newmsg7>=1)&&(i4.i1.u4.election_10_4_7_to_right_6>=1)) U ((i2.u6.newmsg8>=1)&&(i2.u13.election_10_2_2_to_left_9>...586
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U ((!(EX(!(((E(((i4.i0.u5.newmsg7>=1)&&(i4.i1.u4.election_10_4_7_to_right_6>=1)) U ((i2.u...759
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t28, t42, t210, t220, i0.t15, i0.u0.t190, i0.u1.t13, ...404
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 232 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 232 transition count 218
Applied a total of 30 rules in 15 ms. Remains 232 /247 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 232 cols
[2025-06-01 10:58:31] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:58:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-01 10:58:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:58:32] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-01 10:58:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17551 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47607ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47615ms
Starting structural reductions in LTL mode, iteration 1 : 232/247 places, 218/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48627 ms. Remains : 232/247 places, 218/233 transitions.
[2025-06-01 10:59:19] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:59:19] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:59:19] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-01 10:59:19] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:59:19] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:59:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1344931565348277795.gal : 1 ms
[2025-06-01 10:59:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12841894157646105192.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1344931565348277795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12841894157646105192.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.28204e+11,0.496372,26280,2,18686,5,82348,6,0,1139,85012,0


Converting to forward existential form...Done !
original formula: AX(AX((EX(AF(((newmsg10>=1)&&(reply_10_2_to_left_1>=1)))) + ((AF(EG((rcv_left_reply_10_2_8>=1))) * A(((newmsg7>=1)&&(election_10_4_3_to_l...381
=> equivalent forward existential formula: (([FwdG((EY(EY(Init)) * !(EX(!(EG(!(((newmsg10>=1)&&(reply_10_2_to_left_1>=1)))))))),!(EG((rcv_left_reply_10_2_8...804
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31...305
Detected timeout of ITS tools.
[2025-06-01 10:59:49] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:59:49] [INFO ] Applying decomposition
[2025-06-01 10:59:49] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7719055378217996317.txt' '-o' '/tmp/graph7719055378217996317.bin' '-w' '/tmp/graph7719055378217996317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7719055378217996317.bin' '-l' '-1' '-v' '-w' '/tmp/graph7719055378217996317.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:59:49] [INFO ] Decomposing Gal with order
[2025-06-01 10:59:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:59:49] [INFO ] Removed a total of 17 redundant transitions.
[2025-06-01 10:59:49] [INFO ] Flatten gal took : 11 ms
[2025-06-01 10:59:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 10:59:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15053447509814048037.gal : 2 ms
[2025-06-01 10:59:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9604741549952081658.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15053447509814048037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9604741549952081658.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.28204e+11,2.97833,98140,1768,4992,93998,117743,674,238598,258,702467,0


Converting to forward existential form...Done !
original formula: AX(AX((EX(AF(((i3.u7.newmsg10>=1)&&(i0.i0.u0.reply_10_2_to_left_1>=1)))) + ((AF(EG((i5.i1.u6.rcv_left_reply_10_2_8>=1))) * A(((i2.u5.newm...472
=> equivalent forward existential formula: (([FwdG((EY(EY(Init)) * !(EX(!(EG(!(((i3.u7.newmsg10>=1)&&(i0.i0.u0.reply_10_2_to_left_1>=1)))))))),!(EG((i5.i1....952
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t6, t7, t8, t9, t39, t217, i0.t15, i0.t1, i0.i1.u1.t13, i0.i1.u1.t19, i1.t23,...429
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 238 transition count 133
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 182 place count 147 transition count 133
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 191 place count 138 transition count 124
Iterating global reduction 2 with 9 rules applied. Total rules applied 200 place count 138 transition count 124
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 201 place count 138 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 136 transition count 122
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 136 transition count 122
Applied a total of 204 rules in 23 ms. Remains 136 /247 variables (removed 111) and now considering 122/233 (removed 111) transitions.
// Phase 1: matrix 122 rows 136 cols
[2025-06-01 11:00:19] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:19] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-01 11:00:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:20] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:00:20] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-01 11:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 3/123 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 109/232 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/232 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4502 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 123/136 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 3/123 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 109/232 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 106/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/258 variables, and 243 constraints, problems are : Problem set: 0 solved, 106 unsolved in 12134 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 123/136 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16646ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 16648ms
Starting structural reductions in SI_CTL mode, iteration 1 : 136/247 places, 122/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17108 ms. Remains : 136/247 places, 122/233 transitions.
[2025-06-01 11:00:36] [INFO ] Flatten gal took : 6 ms
[2025-06-01 11:00:36] [INFO ] Flatten gal took : 3 ms
[2025-06-01 11:00:36] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-01 11:00:37] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 216 steps (0 resets) in 17 ms. (12 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-10-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-01 11:00:37] [INFO ] Flatten gal took : 3 ms
[2025-06-01 11:00:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality685891529142501991.gal : 1 ms
[2025-06-01 11:00:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16891080438908855736.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality685891529142501991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16891080438908855736.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 238 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 238 transition count 224
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 231 transition count 217
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 231 transition count 217
Applied a total of 32 rules in 12 ms. Remains 231 /247 variables (removed 16) and now considering 217/233 (removed 16) transitions.
// Phase 1: matrix 217 rows 231 cols
[2025-06-01 11:00:37] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:37] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-01 11:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:37] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-06-01 11:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 10/231 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 217/448 variables, 231/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 0/448 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 245 constraints, problems are : Problem set: 0 solved, 207 unsolved in 17798 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 10/231 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 217/448 variables, 231/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 207/452 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 452 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47838ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 47839ms
Starting structural reductions in LTL mode, iteration 1 : 231/247 places, 217/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48659 ms. Remains : 231/247 places, 217/233 transitions.
[2025-06-01 11:01:25] [INFO ] Flatten gal took : 7 ms
[2025-06-01 11:01:25] [INFO ] Flatten gal took : 6 ms
[2025-06-01 11:01:25] [INFO ] Input system was already deterministic with 217 transitions.
[2025-06-01 11:01:25] [INFO ] Flatten gal took : 4 ms
[2025-06-01 11:01:25] [INFO ] Flatten gal took : 5 ms
[2025-06-01 11:01:25] [INFO ] Time to serialize gal into /tmp/CTLFireability631601826973406422.gal : 1 ms
[2025-06-01 11:01:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3617481019423786555.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability631601826973406422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3617481019423786555.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.47627e+11,0.527388,27304,2,19441,5,85432,6,0,1134,88498,0


Converting to forward existential form...Done !
original formula: E(EG(((AG((rcv_left_election_10_1_2_2>=1)) + !((EX((rcv_left_election_10_1_1_1>=1)) + E((rcv_right_election_10_3_8_2>=1) U ((newmsg6>=1)&...556
=> equivalent forward existential formula: [(FwdU(Init,EG(((!(E(TRUE U !((rcv_left_election_10_1_2_2>=1)))) + !((EX((rcv_left_election_10_1_1_1>=1)) + E((r...632
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t24, t26, t28, t30, t32...305
Detected timeout of ITS tools.
[2025-06-01 11:01:55] [INFO ] Flatten gal took : 4 ms
[2025-06-01 11:01:55] [INFO ] Applying decomposition
[2025-06-01 11:01:55] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17615750851771064869.txt' '-o' '/tmp/graph17615750851771064869.bin' '-w' '/tmp/graph17615750851771064869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17615750851771064869.bin' '-l' '-1' '-v' '-w' '/tmp/graph17615750851771064869.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:01:55] [INFO ] Decomposing Gal with order
[2025-06-01 11:01:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:01:55] [INFO ] Removed a total of 21 redundant transitions.
[2025-06-01 11:01:55] [INFO ] Flatten gal took : 13 ms
[2025-06-01 11:01:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 11:01:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2601835615691925612.gal : 2 ms
[2025-06-01 11:01:55] [INFO ] Time to serialize properties into /tmp/CTLFireability13892378969607066633.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2601835615691925612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13892378969607066633.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.47627e+11,1.88094,72528,2120,3825,86646,75728,745,207240,269,357763,0


Converting to forward existential form...Done !
original formula: E(EG(((AG((i4.i0.u1.rcv_left_election_10_1_2_2>=1)) + !((EX((i4.i1.u0.rcv_left_election_10_1_1_1>=1)) + E((i4.i0.u1.rcv_right_election_10...703
=> equivalent forward existential formula: [(FwdU(Init,EG(((!(E(TRUE U !((i4.i0.u1.rcv_left_election_10_1_2_2>=1)))) + !((EX((i4.i1.u0.rcv_left_election_10...779
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t7, t8, t9, t28, t40, t186, t216, i0.u2.t17, i0.u3.t21, i0.u3.t24, i1...418
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 225
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 232 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 232 transition count 218
Applied a total of 30 rules in 18 ms. Remains 232 /247 variables (removed 15) and now considering 218/233 (removed 15) transitions.
// Phase 1: matrix 218 rows 232 cols
[2025-06-01 11:02:25] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:26] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-01 11:02:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:26] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-01 11:02:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17357 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47401ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47402ms
Starting structural reductions in LTL mode, iteration 1 : 232/247 places, 218/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48491 ms. Remains : 232/247 places, 218/233 transitions.
[2025-06-01 11:03:14] [INFO ] Flatten gal took : 8 ms
[2025-06-01 11:03:14] [INFO ] Flatten gal took : 9 ms
[2025-06-01 11:03:14] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-01 11:03:14] [INFO ] Flatten gal took : 5 ms
[2025-06-01 11:03:14] [INFO ] Flatten gal took : 5 ms
[2025-06-01 11:03:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12909379187814402149.gal : 1 ms
[2025-06-01 11:03:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12716241062166631841.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12909379187814402149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12716241062166631841.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.95621e+11,0.483992,26176,2,19327,5,85816,6,0,1139,84261,0


Converting to forward existential form...Done !
original formula: AG(AX(EG((AF((rcv_left_election_7_0_1_8>=1)) + (rcv_right_reply_10_1_1>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG((!(EG(!((rcv_left_election_7_0_1_8>=1)))) + (rcv_right_reply_10_1_1>=1)))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31...305
Detected timeout of ITS tools.
[2025-06-01 11:03:44] [INFO ] Flatten gal took : 11 ms
[2025-06-01 11:03:44] [INFO ] Applying decomposition
[2025-06-01 11:03:44] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9605298681121018847.txt' '-o' '/tmp/graph9605298681121018847.bin' '-w' '/tmp/graph9605298681121018847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9605298681121018847.bin' '-l' '-1' '-v' '-w' '/tmp/graph9605298681121018847.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:03:44] [INFO ] Decomposing Gal with order
[2025-06-01 11:03:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:03:44] [INFO ] Removed a total of 39 redundant transitions.
[2025-06-01 11:03:44] [INFO ] Flatten gal took : 11 ms
[2025-06-01 11:03:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 11:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11981797015079364682.gal : 2 ms
[2025-06-01 11:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11862608670131475510.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11981797015079364682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11862608670131475510.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.95621e+11,1.81244,74676,2460,1820,124945,34843,669,282715,225,144891,0


Converting to forward existential form...Done !
original formula: AG(AX(EG((AF((i4.u15.rcv_left_election_7_0_1_8>=1)) + (i2.i0.u0.rcv_right_reply_10_1_1>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG((!(EG(!((i4.u15.rcv_left_election_7_0_1_8>=1)))) + (i2.i0.u0.rcv_right_reply_10_1_1...172
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t19, t27, t187, t217, i0.t31, i0.u4.t25, i1.t35, i1.u...396
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-01 11:04:14] [INFO ] Flatten gal took : 18 ms
[2025-06-01 11:04:14] [INFO ] Flatten gal took : 5 ms
[2025-06-01 11:04:14] [INFO ] Applying decomposition
[2025-06-01 11:04:14] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3628154087385436436.txt' '-o' '/tmp/graph3628154087385436436.bin' '-w' '/tmp/graph3628154087385436436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3628154087385436436.bin' '-l' '-1' '-v' '-w' '/tmp/graph3628154087385436436.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:04:14] [INFO ] Decomposing Gal with order
[2025-06-01 11:04:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:04:14] [INFO ] Removed a total of 33 redundant transitions.
[2025-06-01 11:04:14] [INFO ] Flatten gal took : 13 ms
[2025-06-01 11:04:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 11:04:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8847391974275768768.gal : 2 ms
[2025-06-01 11:04:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5091047062816423086.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8847391974275768768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5091047062816423086.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.19417e+12,1.79627,69996,2104,2503,100247,47046,651,237100,260,213052,0


Converting to forward existential form...Done !
original formula: A(((!(EX((i2.u2.rcv_left_election_10_3_3_3>=1))) + EG(((i3.u5.newmsg6>=1)&&(i7.i0.u28.elected_10_to_left_7>=1)))) + !(EF(EG((i2.u2.rcv_le...632
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((!(EX(!((((i3.u5.newmsg6>=1)&&(i4.u24.reply_10_3_to_right_5>=1))&&(i6.u15.rcv_left_reply_9...2092
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t232, i0.t0, i0.u0.t15, i0.u8.t11, i0.u8.t58, i0.u8.t202,...433
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-01 11:06:47] [INFO ] Flatten gal took : 6 ms
[2025-06-01 11:06:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14915103262228843508.gal : 1 ms
[2025-06-01 11:06:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15221201492554515856.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14915103262228843508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15221201492554515856.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.19417e+12,0.578132,28320,2,22034,5,98405,6,0,1214,91781,0


Converting to forward existential form...Done !
original formula: A(((!(EX((rcv_left_election_10_3_3_3>=1))) + EG(((newmsg6>=1)&&(elected_10_to_left_7>=1)))) + !(EF(EG((rcv_left_reply_10_3_3>=1))))) U EG...520
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((!(EX(!((((newmsg6>=1)&&(reply_10_3_to_right_5>=1))&&(rcv_left_reply_9_0_9>=1))))) * !((E(...1740
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t21, t23, t27, t29, t32, t34, t38...310
(forward)formula 0,0,64.1563,1871620,1,0,714,1.07312e+07,506,272,7677,7.59897e+06,785
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: !(A((!((EG(((newmsg7>=1)&&(reply_10_3_to_left_8>=1))) * !((((newmsg5>=1)&&(reply_5_0_to_right_4>=1)) + A((init3>=1) U ((newmsg5>=1)&&(ele...454
=> equivalent forward existential formula: ([((FwdU(Init,!(E((((rcv_left_election_3_0_1_4>=1)&&(!((newmsg2>=1)&&(election_10_2_2_to_right_1>=1))))||(!(((rc...1132
(forward)formula 1,0,262.673,3710004,1,0,2449,2.53743e+07,11,1291,3452,2.41688e+07,271
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: AF((AF((EX(((newmsg7<1)||(election_10_3_7_to_right_6<1))) * (AX((rcv_left_election_3_0_1_4<1)) + ((rcv_right_election_10_4_8_2<1)&&(rcv_r...238
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((EX(((newmsg7<1)||(election_10_3_7_to_right_6<1))) * (!(EX(!((rcv_left_election_3_0_1_4<1))...301
(forward)formula 2,1,276.004,3710004,1,0,2449,2.53743e+07,27,1291,4656,2.41688e+07,344
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: ((EG(EF(!(E((rcv_right_election_10_2_2_8>=1) U (init1>=1))))) * AF((((rcv_left_election_10_2_3_3<1) * EX(((newmsg6>=1)&&(election_7_0_1_t...389
=> equivalent forward existential formula: (([(Init * !(EG(E(TRUE U !(E((rcv_right_election_10_2_2_8>=1) U (init1>=1)))))))] = FALSE * [FwdG(Init,!((((rcv_...521
(forward)formula 3,0,301.23,3710004,1,0,2449,2.53743e+07,43,1291,4668,2.41688e+07,896
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: ((AX((rcv_right_reply_10_2_10<1)) + EX(TRUE)) * ((AF((((((AF(((newmsg1>=1)&&(election_2_0_1_to_left_2>=1))) + ((newmsg5>=1)&&(election_10...697
=> equivalent forward existential formula: ([(EY((Init * !(EX(TRUE)))) * !((rcv_right_reply_10_2_10<1)))] = FALSE * [FwdG(((Init * !(EG(!(!((E(!(((rcv_left...952
(forward)formula 4,1,459.152,4080348,1,0,2449,2.62842e+07,41,1291,4262,2.63184e+07,2190
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: E(EF(((AX(((E(((newmsg7>=1)&&(election_10_4_7_to_right_6>=1)) U ((newmsg8>=1)&&(election_10_2_2_to_left_9>=1))) * (rcv_right_election_10_...476
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U ((!(EX(!(((E(((newmsg7>=1)&&(election_10_4_7_to_right_6>=1)) U ((newmsg8>=1)&&(election...637
(forward)formula 5,1,559.711,4464564,1,0,2717,3.06685e+07,30,1610,4993,3.06013e+07,1293
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: AX(AX((EX(AF(((newmsg10>=1)&&(reply_10_2_to_left_1>=1)))) + ((AF(EG((rcv_left_reply_10_2_8>=1))) * A(((newmsg7>=1)&&(election_10_4_3_to_l...381
=> equivalent forward existential formula: (([FwdG((EY(EY(Init)) * !(EX(!(EG(!(((newmsg10>=1)&&(reply_10_2_to_left_1>=1)))))))),!(EG((rcv_left_reply_10_2_8...804
(forward)formula 6,1,561.943,4464564,1,0,2717,3.06685e+07,57,1610,5025,3.06013e+07,2000
FORMULA HirschbergSinclair-PT-10-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: E(EG(((AG((rcv_left_election_10_1_2_2>=1)) + !((EX((rcv_left_election_10_1_1_1>=1)) + E((rcv_right_election_10_3_8_2>=1) U ((newmsg6>=1)&...556
=> equivalent forward existential formula: [(FwdU(Init,EG(((!(E(TRUE U !((rcv_left_election_10_1_2_2>=1)))) + !((EX((rcv_left_election_10_1_1_1>=1)) + E((r...632
(forward)formula 7,0,572.964,4464564,1,0,2717,3.06685e+07,60,1610,5028,3.06013e+07,2061
FORMULA HirschbergSinclair-PT-10-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: AG(AX(EG((AF((rcv_left_election_7_0_1_8>=1)) + (rcv_right_reply_10_1_1>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG((!(EG(!((rcv_left_election_7_0_1_8>=1)))) + (rcv_right_reply_10_1_1>=1)))))] = FALS...156
(forward)formula 8,0,582.694,4464564,1,0,2717,3.06685e+07,69,1610,5029,3.06013e+07,3014
FORMULA HirschbergSinclair-PT-10-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Total runtime 1942070 ms.

BK_STOP 1748776592258

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="HirschbergSinclair-PT-10"
export BK_EXAMINATION="CTLFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422000066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-10.tgz
mv HirschbergSinclair-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;