Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900178.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 StigmergyElection-PT-03a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 31K May 29 14:33 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 StigmergyElection-PT-03a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2023-15
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-00
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-01
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-02
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-03
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-04
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-05
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-06
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-07
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-08
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-09
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-10
FORMULA_NAME StigmergyElection-PT-03a-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749135835005

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 15:03:57] [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-05 15:03:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:03:57] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-06-05 15:03:57] [INFO ] Transformed 44 places.
[2025-06-05 15:03:57] [INFO ] Transformed 118 transitions.
[2025-06-05 15:03:57] [INFO ] Found NUPN structural information;
[2025-06-05 15:03:57] [INFO ] Parsed PT model containing 44 places and 118 transitions and 467 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Applied a total of 0 rules in 15 ms. Remains 44 /44 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2025-06-05 15:03:57] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
// Phase 1: matrix 64 rows 44 cols
[2025-06-05 15:03:57] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:58] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-05 15:03:58] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2025-06-05 15:03:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:03:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:03:58] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-05 15:03:58] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2025-06-05 15:03:58] [INFO ] Invariant cache hit.
[2025-06-05 15:03:58] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:03:59] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:00] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:01] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 63/107 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 27/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:02] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 1/108 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (OVERLAPS) 0/108 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 133 constraints, problems are : Problem set: 0 solved, 72 unsolved in 7580 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 63/107 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 27/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 72/204 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:08] [INFO ] Deduced a trap along path composed of 9 places in 57 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 1/108 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (OVERLAPS) 0/108 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 206 constraints, problems are : Problem set: 0 solved, 72 unsolved in 7479 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 15188ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 15211ms
Finished structural reductions in LTL mode , in 1 iterations and 15797 ms. Remains : 44/44 places, 73/73 transitions.
Support contains 31 out of 44 places after structural reductions.
[2025-06-05 15:04:13] [INFO ] Flatten gal took : 45 ms
[2025-06-05 15:04:13] [INFO ] Flatten gal took : 20 ms
[2025-06-05 15:04:14] [INFO ] Input system was already deterministic with 73 transitions.
Reduction of identical properties reduced properties to check from 42 to 35
RANDOM walk for 40000 steps (568 resets) in 1943 ms. (20 steps per ms) remains 5/35 properties
BEST_FIRST walk for 40004 steps (262 resets) in 417 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (256 resets) in 145 ms. (274 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (69 resets) in 373 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (257 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
[2025-06-05 15:04:15] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2025-06-05 15:04:15] [INFO ] Invariant cache hit.
[2025-06-05 15:04:15] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp17 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 2 (OVERLAPS) 34/44 variables, 4/14 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 34/48 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/48 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/107 variables, 44/92 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 27/119 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/108 variables, 1/120 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/120 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/120 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 120 constraints, problems are : Problem set: 4 solved, 1 unsolved in 120 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 38/44 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 38/48 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:15] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:15] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 3 ms to minimize.
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Int declared 44/108 variables, and 51 constraints, problems are : Problem set: 5 solved, 0 unsolved in 201 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/44 constraints, ReadFeed: 0/28 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2025-06-05 15:04:15] [INFO ] Flatten gal took : 10 ms
[2025-06-05 15:04:15] [INFO ] Flatten gal took : 10 ms
[2025-06-05 15:04:15] [INFO ] Input system was already deterministic with 73 transitions.
Computed a total of 8 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 41 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 41 transition count 68
Applied a total of 6 rules in 12 ms. Remains 41 /44 variables (removed 3) and now considering 68/73 (removed 5) transitions.
[2025-06-05 15:04:15] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
// Phase 1: matrix 61 rows 41 cols
[2025-06-05 15:04:15] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 15:04:15] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
[2025-06-05 15:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:15] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:04:15] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 178 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/44 places, 68/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 64
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 33 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 33 transition count 61
Applied a total of 14 rules in 4 ms. Remains 33 /40 variables (removed 7) and now considering 61/68 (removed 7) transitions.
[2025-06-05 15:04:15] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 33 cols
[2025-06-05 15:04:15] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 15:04:15] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
[2025-06-05 15:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 15:04:15] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 33/44 places, 61/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 286 ms. Remains : 33/44 places, 61/73 transitions.
[2025-06-05 15:04:15] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:04:15] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:15] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-05 15:04:15] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:15] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:15] [INFO ] Time to serialize gal into /tmp/CTLFireability18023990215332918717.gal : 3 ms
[2025-06-05 15:04:15] [INFO ] Time to serialize properties into /tmp/CTLFireability18193323147838041979.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/CTLFireability18023990215332918717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18193323147838041979.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,218,0.03987,4092,2,213,5,953,6,0,184,716,0


Converting to forward existential form...Done !
original formula: AX((A((p36==1) U (((p12==1)&&(p26==1))&&(p40==1))) + (((p12==1)&&(p26==1)) * ((p40==1) * ((A(AG((p15==1)) U (EG((((p12==1)&&(p26==1))&&(p...284
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !((((p12==1)&&(p26==1)) * ((p40==1) * ((!((E(!((EG((((p12==1)&&(p26==1))&&(p40==1))) * (p39=...940
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t8, t9, t11, t12, t14, t16, t17, t19, t20, t22, t31, t32, t34, t53, t55, t58, In...250
Hit Full ! (commute/partial/dont) 30/0/31
Hit Full ! (commute/partial/dont) 30/0/31
(forward)formula 0,0,0.118013,6140,1,0,128,8272,171,64,1280,8186,167
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 39 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 39 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 38 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 38 transition count 63
Applied a total of 12 rules in 4 ms. Remains 38 /44 variables (removed 6) and now considering 63/73 (removed 10) transitions.
[2025-06-05 15:04:16] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 38 cols
[2025-06-05 15:04:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 15:04:16] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2025-06-05 15:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:16] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:04:16] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 161 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/44 places, 63/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 34 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 34 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 31 transition count 57
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 31 transition count 57
Applied a total of 12 rules in 3 ms. Remains 31 /37 variables (removed 6) and now considering 57/63 (removed 6) transitions.
[2025-06-05 15:04:16] [INFO ] Flow matrix only has 53 transitions (discarded 4 similar events)
// Phase 1: matrix 53 rows 31 cols
[2025-06-05 15:04:16] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-05 15:04:16] [INFO ] Flow matrix only has 53 transitions (discarded 4 similar events)
[2025-06-05 15:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 15:04:16] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 31/44 places, 57/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 31/44 places, 57/73 transitions.
[2025-06-05 15:04:16] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:04:16] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:16] [INFO ] Input system was already deterministic with 57 transitions.
[2025-06-05 15:04:16] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:04:16] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13656308035810253701.gal : 2 ms
[2025-06-05 15:04:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5455780983950459226.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/CTLFireability13656308035810253701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5455780983950459226.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,210,0.023708,4076,2,255,5,1181,6,0,177,960,0


Converting to forward existential form...Done !
original formula: AX(((p30==1) + A(!((AX((((p12==1)&&(p26==1))&&(p40==1))) + (((p12==1)&&(p26==1))&&(p40==1)))) U (AX((p6!=1)) * (p17==1)))))
=> equivalent forward existential formula: (([(EY((FwdU((EY(Init) * !((p30==1))),!((!(EX(!((p6!=1)))) * (p17==1)))) * !(!((!(EX(!((((p12==1)&&(p26==1))&&(p...490
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t24, t29, t30, t32, ...268
(forward)formula 0,0,0.118628,5996,1,0,164,9908,135,78,1093,10915,157
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 44 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 38 transition count 67
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 34 transition count 61
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 34 transition count 61
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 32 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 32 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 31 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 31 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 31 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 28 transition count 52
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 25 transition count 49
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 25 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 25 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 22 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 22 transition count 43
Applied a total of 49 rules in 52 ms. Remains 22 /44 variables (removed 22) and now considering 43/73 (removed 30) transitions.
[2025-06-05 15:04:16] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
// Phase 1: matrix 38 rows 22 cols
[2025-06-05 15:04:16] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 15:04:16] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
[2025-06-05 15:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 15:04:16] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:04:16] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2025-06-05 15:04:16] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
[2025-06-05 15:04:16] [INFO ] Invariant cache hit.
[2025-06-05 15:04:16] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:17] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 37/59 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 61 constraints, problems are : Problem set: 0 solved, 42 unsolved in 2684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 37/59 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 42/102 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:20] [INFO ] Deduced a trap along path composed of 4 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/60 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 104 constraints, problems are : Problem set: 0 solved, 42 unsolved in 3250 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5963ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 5964ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/44 places, 43/73 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6131 ms. Remains : 22/44 places, 43/73 transitions.
[2025-06-05 15:04:22] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:04:22] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:22] [INFO ] Input system was already deterministic with 43 transitions.
[2025-06-05 15:04:22] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:22] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5601046233148779269.gal : 2 ms
[2025-06-05 15:04:22] [INFO ] Time to serialize properties into /tmp/CTLFireability18120008577443415151.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/CTLFireability5601046233148779269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18120008577443415151.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,71,0.02065,4028,2,121,5,707,6,0,124,560,0


Converting to forward existential form...Done !
original formula: EG(((!(A(EF(((p18==1)&&(p43==1))) U (p29==1))) + (p35==0)) + (p43==0)))
=> equivalent forward existential formula: [FwdG(Init,((!(!((E(!((p29==1)) U (!(E(TRUE U ((p18==1)&&(p43==1)))) * !((p29==1)))) + EG(!((p29==1)))))) + (p35...183
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t10, t12, t35, t36, t37, t39, t40, t42, Intersection with re...232
(forward)formula 0,1,0.089184,5692,1,0,143,6945,113,72,889,7501,186
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 41 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 41 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 39 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 39 transition count 64
Applied a total of 10 rules in 5 ms. Remains 39 /44 variables (removed 5) and now considering 64/73 (removed 9) transitions.
[2025-06-05 15:04:22] [INFO ] Flow matrix only has 58 transitions (discarded 6 similar events)
// Phase 1: matrix 58 rows 39 cols
[2025-06-05 15:04:22] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-05 15:04:22] [INFO ] Flow matrix only has 58 transitions (discarded 6 similar events)
[2025-06-05 15:04:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:22] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:04:22] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-06-05 15:04:22] [INFO ] Flow matrix only has 58 transitions (discarded 6 similar events)
[2025-06-05 15:04:22] [INFO ] Invariant cache hit.
[2025-06-05 15:04:22] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:23] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:24] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:24] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:24] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:24] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:24] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 57/96 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 84 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 39/39 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 57/96 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 63/146 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:28] [INFO ] Deduced a trap along path composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 1/97 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/97 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 148 constraints, problems are : Problem set: 0 solved, 63 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 39/39 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9486ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 9488ms
Starting structural reductions in LTL mode, iteration 1 : 39/44 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9654 ms. Remains : 39/44 places, 64/73 transitions.
[2025-06-05 15:04:32] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:32] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:32] [INFO ] Input system was already deterministic with 64 transitions.
[2025-06-05 15:04:32] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:04:32] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4243343807677547843.gal : 2 ms
[2025-06-05 15:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14850330748009723309.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/CTLFireability4243343807677547843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14850330748009723309.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,219,0.029515,4272,2,288,5,1293,6,0,210,1079,0


Converting to forward existential form...Done !
original formula: AX((((p5==0) * ((!(E((((p12==1)&&(p26==1))&&(p40==1)) U (((p12==1)&&(p26==1))&&(p40==1)))) + EG((((p12==1)&&(p26==1))&&(p40==1)))) + (((p...360
=> equivalent forward existential formula: (([(EY(Init) * !((p5==0)))] = FALSE * [(FwdU(((EY(Init) * !((((p42==1)&&(p13==1))&&(p43==1)))) * !(EG((((p12==1)...493
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t16, t17, t20, t23, t26, t27, t29, t57, t59, t61,...254
Hit Full ! (commute/partial/dont) 32/0/32
Hit Full ! (commute/partial/dont) 32/28/32
(forward)formula 0,1,0.103234,6832,1,0,161,11261,173,77,1498,10789,207
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 63
Applied a total of 12 rules in 3 ms. Remains 38 /44 variables (removed 6) and now considering 63/73 (removed 10) transitions.
[2025-06-05 15:04:32] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 38 cols
[2025-06-05 15:04:32] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-05 15:04:32] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2025-06-05 15:04:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:32] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:04:32] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-05 15:04:32] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2025-06-05 15:04:32] [INFO ] Invariant cache hit.
[2025-06-05 15:04:32] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:33] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:34] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:34] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:34] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:37] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 5 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/96 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/96 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/96 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 84 constraints, problems are : Problem set: 0 solved, 62 unsolved in 6607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 57/95 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 62/145 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:41] [INFO ] Deduced a trap along path composed of 9 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:42] [INFO ] Deduced a trap along path composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 1/96 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/96 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/96 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 148 constraints, problems are : Problem set: 0 solved, 62 unsolved in 8947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15572ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 15573ms
Starting structural reductions in LTL mode, iteration 1 : 38/44 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15686 ms. Remains : 38/44 places, 63/73 transitions.
[2025-06-05 15:04:48] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:04:48] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:04:48] [INFO ] Input system was already deterministic with 63 transitions.
[2025-06-05 15:04:48] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:04:48] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:04:48] [INFO ] Time to serialize gal into /tmp/CTLFireability2118399834360521872.gal : 1 ms
[2025-06-05 15:04:48] [INFO ] Time to serialize properties into /tmp/CTLFireability13740271590241533786.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/CTLFireability2118399834360521872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13740271590241533786.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,219,0.028631,4140,2,266,5,1359,6,0,208,952,0


Converting to forward existential form...Done !
original formula: EX((EX((((((p31==1)&&(p12==1))&&((p26==1)&&(p40==1)))||(((p12==1)&&(p26==1))&&(p40==1)))||((((p12==1)&&(p26==1))&&(p40==1))||(p33==1)))) ...324
=> equivalent forward existential formula: ([(EY(EY(Init)) * (((((p31==1)&&(p12==1))&&((p26==1)&&(p40==1)))||(((p12==1)&&(p26==1))&&(p40==1)))||((((p12==1)...403
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t13, t14, t16, t17, t18, t21, t23, t26, t27, t29, t56, t59,...259
(forward)formula 0,0,0.111744,5932,1,0,128,9206,148,56,1317,8613,145
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 42 transition count 60
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 30 transition count 60
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 25 place count 30 transition count 54
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 24 transition count 54
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 21 transition count 50
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 21 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 20 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 20 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 20 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 61 place count 20 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 67 place count 17 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 17 transition count 29
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 14 transition count 26
Applied a total of 71 rules in 34 ms. Remains 14 /44 variables (removed 30) and now considering 26/73 (removed 47) transitions.
[2025-06-05 15:04:48] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 14 cols
[2025-06-05 15:04:48] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-05 15:04:48] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2025-06-05 15:04:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 15:04:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:04:48] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-05 15:04:48] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2025-06-05 15:04:48] [INFO ] Invariant cache hit.
[2025-06-05 15:04:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:48] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:48] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:48] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:48] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:48] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:48] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:49] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:49] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:49] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:49] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 20/34 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 27 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:49] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 20/34 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 48 constraints, problems are : Problem set: 0 solved, 20 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2035ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 2037ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/44 places, 26/73 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2177 ms. Remains : 14/44 places, 26/73 transitions.
[2025-06-05 15:04:50] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:50] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:04:50] [INFO ] Input system was already deterministic with 26 transitions.
[2025-06-05 15:04:50] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:04:50] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:04:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15560610294092516966.gal : 1 ms
[2025-06-05 15:04:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16693038012913995559.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/CTLFireability15560610294092516966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16693038012913995559.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,30,0.011219,3892,2,59,5,265,6,0,77,200,0


Converting to forward existential form...Done !
original formula: AF(!(E(EF((p19==1)) U EG((p33==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(E(TRUE U (p19==1)) U EG((p33==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t22, Intersection with reachable at each step e...210
(forward)formula 0,0,0.029637,4404,1,0,85,1886,81,58,501,2153,116
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 42 transition count 67
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 37 transition count 67
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 11 place count 37 transition count 58
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 29 place count 28 transition count 58
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 20 transition count 47
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 20 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 18 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 18 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 18 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 18 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 15 transition count 34
Applied a total of 61 rules in 19 ms. Remains 15 /44 variables (removed 29) and now considering 34/73 (removed 39) transitions.
[2025-06-05 15:04:50] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 15 cols
[2025-06-05 15:04:50] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-05 15:04:50] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2025-06-05 15:04:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-05 15:04:50] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:04:50] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2025-06-05 15:04:50] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2025-06-05 15:04:50] [INFO ] Invariant cache hit.
[2025-06-05 15:04:50] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 29/44 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 38 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 29/44 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 31/68 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 69 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2877ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 2878ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/44 places, 34/73 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2986 ms. Remains : 15/44 places, 34/73 transitions.
[2025-06-05 15:04:53] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:53] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:04:53] [INFO ] Input system was already deterministic with 34 transitions.
[2025-06-05 15:04:53] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:04:53] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:04:53] [INFO ] Time to serialize gal into /tmp/CTLFireability834060262969263784.gal : 0 ms
[2025-06-05 15:04:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1650274013399209514.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/CTLFireability834060262969263784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1650274013399209514.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,29,0.011079,3916,2,66,5,290,6,0,91,207,0


Converting to forward existential form...Done !
original formula: E((p30==1) U !(AG(!(EF((((p12==1)&&(p26==1))&&(p40==1)))))))
=> equivalent forward existential formula: [(FwdU(FwdU(FwdU(Init,(p30==1)),TRUE),TRUE) * (((p12==1)&&(p26==1))&&(p40==1)))] != FALSE
Hit Full ! (commute/partial/dont) 31/0/3
(forward)formula 0,1,0.014748,4172,1,0,7,295,16,1,180,207,8
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 39 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 36 transition count 59
Applied a total of 16 rules in 5 ms. Remains 36 /44 variables (removed 8) and now considering 59/73 (removed 14) transitions.
[2025-06-05 15:04:53] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
// Phase 1: matrix 55 rows 36 cols
[2025-06-05 15:04:53] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:53] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 15:04:53] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2025-06-05 15:04:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:53] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:04:53] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/44 places, 59/73 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 29 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 29 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 26 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 26 transition count 50
Applied a total of 18 rules in 5 ms. Remains 26 /35 variables (removed 9) and now considering 50/59 (removed 9) transitions.
[2025-06-05 15:04:53] [INFO ] Flow matrix only has 46 transitions (discarded 4 similar events)
// Phase 1: matrix 46 rows 26 cols
[2025-06-05 15:04:53] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:53] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 15:04:53] [INFO ] Flow matrix only has 46 transitions (discarded 4 similar events)
[2025-06-05 15:04:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 15:04:53] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 26/44 places, 50/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 285 ms. Remains : 26/44 places, 50/73 transitions.
[2025-06-05 15:04:53] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:53] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:04:54] [INFO ] Input system was already deterministic with 50 transitions.
[2025-06-05 15:04:54] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:54] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11011657637810709287.gal : 1 ms
[2025-06-05 15:04:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3777774230100407638.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/CTLFireability11011657637810709287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3777774230100407638.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,158,0.017561,4108,2,157,5,789,6,0,150,568,0


Converting to forward existential form...Done !
original formula: AX(EX((((p12==1)&&(p26==1))&&(p40==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((((p12==1)&&(p26==1))&&(p40==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t22, t23, t25, t44, t46, t48, Intersection with reach...229
(forward)formula 0,0,0.049527,4620,1,0,90,3913,111,38,953,2880,103
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 41 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 41 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 40 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 40 transition count 67
Applied a total of 8 rules in 6 ms. Remains 40 /44 variables (removed 4) and now considering 67/73 (removed 6) transitions.
[2025-06-05 15:04:54] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
// Phase 1: matrix 61 rows 40 cols
[2025-06-05 15:04:54] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 15:04:54] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
[2025-06-05 15:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:54] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:04:54] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/44 places, 67/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 35 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 35 transition count 63
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 32 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 32 transition count 60
Applied a total of 14 rules in 4 ms. Remains 32 /39 variables (removed 7) and now considering 60/67 (removed 7) transitions.
[2025-06-05 15:04:54] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 32 cols
[2025-06-05 15:04:54] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 15:04:54] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2025-06-05 15:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 15:04:54] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 32/44 places, 60/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 32/44 places, 60/73 transitions.
[2025-06-05 15:04:54] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:54] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:04:54] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-05 15:04:54] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:54] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:04:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17363629320268882242.gal : 1 ms
[2025-06-05 15:04:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10504456575526765452.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/CTLFireability17363629320268882242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10504456575526765452.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,218,0.021517,4084,2,216,5,1018,6,0,182,746,0


Converting to forward existential form...Done !
original formula: (AX(((AX((p39==1)) * (p12==1)) * ((p26==1)&&(p40==1)))) + EF(((p15==1)||(p5==1))))
=> equivalent forward existential formula: (([(EY(EY((Init * !(E(TRUE U ((p15==1)||(p5==1))))))) * !((p39==1)))] = FALSE * [(EY((Init * !(E(TRUE U ((p15==1...282
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t14, t16, t17, t19, t20, t22, t30, t31, t33, t52, t54, t57,...254
(forward)formula 0,1,0.090022,6004,1,0,124,7908,140,56,1138,6882,139
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 39 transition count 65
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 36 transition count 59
Applied a total of 16 rules in 4 ms. Remains 36 /44 variables (removed 8) and now considering 59/73 (removed 14) transitions.
[2025-06-05 15:04:54] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
// Phase 1: matrix 55 rows 36 cols
[2025-06-05 15:04:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 15:04:54] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2025-06-05 15:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:04:54] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:04:54] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2025-06-05 15:04:54] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2025-06-05 15:04:54] [INFO ] Invariant cache hit.
[2025-06-05 15:04:54] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 54/90 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 27/78 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 79 constraints, problems are : Problem set: 0 solved, 58 unsolved in 4292 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:59] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:04:59] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 54/90 variables, 36/53 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 58/138 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:01] [INFO ] Deduced a trap along path composed of 7 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 1/91 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/91 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 141 constraints, problems are : Problem set: 0 solved, 58 unsolved in 7664 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11974ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 11975ms
Starting structural reductions in LTL mode, iteration 1 : 36/44 places, 59/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12117 ms. Remains : 36/44 places, 59/73 transitions.
[2025-06-05 15:05:06] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:06] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:06] [INFO ] Input system was already deterministic with 59 transitions.
[2025-06-05 15:05:06] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:06] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17590716065258549942.gal : 1 ms
[2025-06-05 15:05:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8315144374667720956.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/CTLFireability17590716065258549942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8315144374667720956.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,201,0.026548,4124,2,257,5,1299,6,0,197,1008,0


Converting to forward existential form...Done !
original formula: AG(A(AX(!(((!((p18==1)&&(p43==1)))&&(((p18==1)&&(p43==1))||(((p12==1)&&(p26==1))&&(p40==1)))))) U ((EX((((p12==1)&&(p26==1))&&(p40==1))) ...242
=> equivalent forward existential formula: ([((((FwdU(FwdU(Init,TRUE),!(((EX((((p12==1)&&(p26==1))&&(p40==1))) + !(((p32==1)&&(p43==1)))) + ((((p12==1)&&(p...608
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t17, t18, t20, t23, t24, t26, t53, t55, ...258
(forward)formula 0,0,0.100773,5660,1,0,124,7975,138,52,1255,6944,135
FORMULA StigmergyElection-PT-03a-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 37 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 37 transition count 60
Applied a total of 14 rules in 4 ms. Remains 37 /44 variables (removed 7) and now considering 60/73 (removed 13) transitions.
[2025-06-05 15:05:06] [INFO ] Flow matrix only has 55 transitions (discarded 5 similar events)
// Phase 1: matrix 55 rows 37 cols
[2025-06-05 15:05:06] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 15:05:06] [INFO ] Flow matrix only has 55 transitions (discarded 5 similar events)
[2025-06-05 15:05:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:06] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:05:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-05 15:05:06] [INFO ] Flow matrix only has 55 transitions (discarded 5 similar events)
[2025-06-05 15:05:06] [INFO ] Invariant cache hit.
[2025-06-05 15:05:06] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:07] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:08] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 54/91 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 27/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/92 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:09] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/92 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 81 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 37/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:11] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 54/91 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 27/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 59/140 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:12] [INFO ] Deduced a trap along path composed of 7 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:05:12] [INFO ] Deduced a trap along path composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 1/92 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 143 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5949 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 37/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10321ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 10322ms
Starting structural reductions in LTL mode, iteration 1 : 37/44 places, 60/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10467 ms. Remains : 37/44 places, 60/73 transitions.
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 12 ms
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:05:17] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8094743352645596942.gal : 1 ms
[2025-06-05 15:05:17] [INFO ] Time to serialize properties into /tmp/CTLFireability9615466474178391337.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/CTLFireability8094743352645596942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9615466474178391337.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,201,0.027981,4132,2,260,5,1164,6,0,199,960,0


Converting to forward existential form...Done !
original formula: EF(((E((EX(((p27==1)&&(p43==1))) * (p42==1)) U EX(EX((p8==1)))) * EG(((p38==1)&&(p43==1)))) * (AG(((p32==1)&&(p43==1))) + (((p12==1)&&(p2...175
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (E((EX(((p27==1)&&(p43==1))) * (p42==1)) U EX(EX((p8==1)))) * EG(((p38==1)&&(p43==1))))) *...362
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t13, t14, t15, t17, t18, t20, t23, t24, t26, t54, t56, t58, ...253
(forward)formula 0,0,0.105543,5796,1,0,118,7399,145,47,1310,6808,142
FORMULA StigmergyElection-PT-03a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 63
Applied a total of 12 rules in 5 ms. Remains 38 /44 variables (removed 6) and now considering 63/73 (removed 10) transitions.
[2025-06-05 15:05:17] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 38 cols
[2025-06-05 15:05:17] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 15:05:17] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2025-06-05 15:05:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:17] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:05:17] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/44 places, 63/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 32 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 32 transition count 58
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 29 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 29 transition count 55
Applied a total of 16 rules in 4 ms. Remains 29 /37 variables (removed 8) and now considering 55/63 (removed 8) transitions.
[2025-06-05 15:05:17] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
// Phase 1: matrix 50 rows 29 cols
[2025-06-05 15:05:17] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 15:05:17] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
[2025-06-05 15:05:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:17] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 15:05:17] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 29/44 places, 55/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 279 ms. Remains : 29/44 places, 55/73 transitions.
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Input system was already deterministic with 55 transitions.
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9774379343008303366.gal : 1 ms
[2025-06-05 15:05:17] [INFO ] Time to serialize properties into /tmp/CTLFireability2353341714441574637.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/CTLFireability9774379343008303366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2353341714441574637.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,206,0.011705,4184,2,188,5,933,6,0,166,632,0


Converting to forward existential form...Done !
original formula: (AF((((p12==1)&&(p26==1))&&(p40==1))) * EG(EX((p29==0))))
=> equivalent forward existential formula: ([FwdG(Init,!((((p12==1)&&(p26==1))&&(p40==1))))] = FALSE * [(Init * !(EG(EX((p29==0)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t21, t22, t26, t27, t29, t48, t51, t53, Int...249
Hit Full ! (commute/partial/dont) 26/0/29
(forward)formula 0,1,0.041904,5336,1,0,113,5995,135,45,1106,5542,128
FORMULA StigmergyElection-PT-03a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 63
Applied a total of 12 rules in 5 ms. Remains 38 /44 variables (removed 6) and now considering 63/73 (removed 10) transitions.
[2025-06-05 15:05:17] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 38 cols
[2025-06-05 15:05:17] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:17] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 15:05:17] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2025-06-05 15:05:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:17] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 15:05:17] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/44 places, 63/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 59
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 30 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 30 transition count 56
Applied a total of 14 rules in 4 ms. Remains 30 /37 variables (removed 7) and now considering 56/63 (removed 7) transitions.
[2025-06-05 15:05:17] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
// Phase 1: matrix 51 rows 30 cols
[2025-06-05 15:05:17] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 15:05:17] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
[2025-06-05 15:05:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:05:17] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 15:05:17] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 30/44 places, 56/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 239 ms. Remains : 30/44 places, 56/73 transitions.
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Input system was already deterministic with 56 transitions.
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:05:17] [INFO ] Time to serialize gal into /tmp/CTLFireability451026817345893326.gal : 0 ms
[2025-06-05 15:05:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10439603320927391816.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/CTLFireability451026817345893326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10439603320927391816.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,210,0.012313,4068,2,206,5,992,6,0,171,753,0


Converting to forward existential form...Done !
original formula: (AX(AG((((p12==1)&&(p26==1))&&(p40==1)))) + EG(((EG((((p12==0)||(p26==0))||(p40==0))) + (((p31==0)&&(p33==0))&&(((p29==0)||(p12==0))||((p...196
=> equivalent forward existential formula: [(FwdU(EY((Init * !(EG(((EG((((p12==0)||(p26==0))||(p40==0))) + (((p31==0)&&(p33==0))&&(((p29==0)||(p12==0))||((...271
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t18, t21, t23, t27, t28, t30, t49, t52, t54,...254
(forward)formula 0,1,0.084475,6756,1,0,181,15735,139,81,1107,13825,230
FORMULA StigmergyElection-PT-03a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-05 15:05:18] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:05:18] [INFO ] Flatten gal took : 2 ms
Total runtime 80814 ms.

BK_STOP 1749135918154

--------------------
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="StigmergyElection-PT-03a"
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 StigmergyElection-PT-03a, 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 r226-smll-174903490900178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03a.tgz
mv StigmergyElection-PT-03a 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 ;