Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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.8K 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 117K 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-03b-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2023-15
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-00
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-01
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-02
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-03
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-04
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-05
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-06
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-07
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-08
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-09
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-10
FORMULA_NAME StigmergyElection-PT-03b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749136137791

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 15:09:00] [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:09:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:09:00] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2025-06-05 15:09:00] [INFO ] Transformed 427 places.
[2025-06-05 15:09:00] [INFO ] Transformed 518 transitions.
[2025-06-05 15:09:00] [INFO ] Found NUPN structural information;
[2025-06-05 15:09:00] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 114 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 392 transition count 483
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 392 transition count 483
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 381 transition count 472
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 381 transition count 472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 380 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 380 transition count 471
Applied a total of 94 rules in 160 ms. Remains 380 /427 variables (removed 47) and now considering 471/518 (removed 47) transitions.
// Phase 1: matrix 471 rows 380 cols
[2025-06-05 15:09:01] [INFO ] Computed 4 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:09:01] [INFO ] Implicit Places using invariants in 600 ms returned []
[2025-06-05 15:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:09:02] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2025-06-05 15:09:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:20] [INFO ] Deduced a trap composed of 171 places in 534 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:21] [INFO ] Deduced a trap composed of 176 places in 428 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:21] [INFO ] Deduced a trap composed of 178 places in 396 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:21] [INFO ] Deduced a trap composed of 179 places in 227 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:22] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:22] [INFO ] Deduced a trap composed of 101 places in 193 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:23] [INFO ] Deduced a trap composed of 176 places in 300 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:25] [INFO ] Deduced a trap composed of 173 places in 321 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:25] [INFO ] Deduced a trap composed of 176 places in 318 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:27] [INFO ] Deduced a trap composed of 176 places in 336 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:27] [INFO ] Deduced a trap composed of 173 places in 290 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:28] [INFO ] Deduced a trap composed of 177 places in 382 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:28] [INFO ] Deduced a trap composed of 179 places in 443 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:29] [INFO ] Deduced a trap composed of 178 places in 329 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:30] [INFO ] Deduced a trap composed of 180 places in 403 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:31] [INFO ] Deduced a trap composed of 179 places in 427 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:31] [INFO ] Deduced a trap composed of 174 places in 329 ms of which 56 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/851 variables, and 21 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:39] [INFO ] Deduced a trap composed of 177 places in 256 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:43] [INFO ] Deduced a trap composed of 176 places in 275 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:09:45] [INFO ] Deduced a trap composed of 176 places in 312 ms of which 62 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (OVERLAPS) 471/851 variables, 380/404 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 470/874 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/851 variables, and 874 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Starting structural reductions in LTL mode, iteration 1 : 380/427 places, 471/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61937 ms. Remains : 380/427 places, 471/518 transitions.
Support contains 114 out of 380 places after structural reductions.
[2025-06-05 15:10:03] [INFO ] Flatten gal took : 147 ms
[2025-06-05 15:10:03] [INFO ] Flatten gal took : 70 ms
[2025-06-05 15:10:03] [INFO ] Input system was already deterministic with 471 transitions.
Support contains 113 out of 380 places (down from 114) after GAL structural reductions.
RANDOM walk for 40000 steps (697 resets) in 2338 ms. (17 steps per ms) remains 43/87 properties
BEST_FIRST walk for 4003 steps (16 resets) in 57 ms. (69 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (15 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (14 resets) in 35 ms. (111 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (14 resets) in 59 ms. (66 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (14 resets) in 48 ms. (81 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (15 resets) in 40 ms. (97 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (15 resets) in 38 ms. (102 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (15 resets) in 41 ms. (95 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (14 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 36/43 properties
BEST_FIRST walk for 4004 steps (15 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (16 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (16 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (16 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (16 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (14 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (16 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
[2025-06-05 15:10:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 327/380 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:05] [INFO ] Deduced a trap composed of 100 places in 257 ms of which 75 ms to minimize.
Problem AtomicPropp34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:05] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:05] [INFO ] Deduced a trap composed of 172 places in 316 ms of which 121 ms to minimize.
Problem AtomicPropp37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:06] [INFO ] Deduced a trap composed of 173 places in 349 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:06] [INFO ] Deduced a trap composed of 211 places in 312 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:07] [INFO ] Deduced a trap composed of 176 places in 386 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:07] [INFO ] Deduced a trap composed of 176 places in 431 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:07] [INFO ] Deduced a trap composed of 179 places in 424 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:08] [INFO ] Deduced a trap composed of 101 places in 311 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:08] [INFO ] Deduced a trap composed of 177 places in 266 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 10/14 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:09] [INFO ] Deduced a trap composed of 171 places in 272 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:09] [INFO ] Deduced a trap composed of 180 places in 259 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:09] [INFO ] Deduced a trap composed of 176 places in 272 ms of which 50 ms to minimize.
SMT process timed out in 5171ms, After SMT, problems are : Problem set: 4 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 471/471 transitions.
Graph (trivial) has 308 edges and 380 vertex of which 9 / 380 are part of one of the 2 SCC in 6 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 592 edges and 373 vertex of which 372 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 372 transition count 264
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 205 rules applied. Total rules applied 405 place count 175 transition count 256
Reduce places removed 4 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 18 rules applied. Total rules applied 423 place count 171 transition count 242
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 16 rules applied. Total rules applied 439 place count 157 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 440 place count 156 transition count 240
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 440 place count 156 transition count 225
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 470 place count 141 transition count 225
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 475 place count 136 transition count 220
Iterating global reduction 5 with 5 rules applied. Total rules applied 480 place count 136 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 480 place count 136 transition count 219
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 482 place count 135 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 483 place count 134 transition count 218
Iterating global reduction 5 with 1 rules applied. Total rules applied 484 place count 134 transition count 218
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 512 place count 120 transition count 204
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 513 place count 120 transition count 203
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 514 place count 119 transition count 197
Iterating global reduction 6 with 1 rules applied. Total rules applied 515 place count 119 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 516 place count 119 transition count 196
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 524 place count 115 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 528 place count 113 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 529 place count 113 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 533 place count 113 transition count 189
Free-agglomeration rule applied 25 times.
Iterating global reduction 8 with 25 rules applied. Total rules applied 558 place count 113 transition count 164
Reduce places removed 25 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 584 place count 88 transition count 163
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 585 place count 88 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 586 place count 87 transition count 162
Applied a total of 586 rules in 208 ms. Remains 87 /380 variables (removed 293) and now considering 162/471 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 87/380 places, 162/471 transitions.
RANDOM walk for 40000 steps (67 resets) in 845 ms. (47 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40004 steps (429 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (426 resets) in 106 ms. (373 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (398 resets) in 154 ms. (258 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (406 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (85 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
// Phase 1: matrix 162 rows 87 cols
[2025-06-05 15:10:10] [INFO ] Computed 4 invariants in 3 ms
[2025-06-05 15:10:10] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:10] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:10] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 7 ms to minimize.
Problem AtomicPropp65 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 161/246 variables, 85/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 36/126 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/249 variables, 2/128 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 1 solved, 2 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/85 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:11] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:11] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:11] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 6 ms to minimize.
Problem AtomicPropp59 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/246 variables, 85/93 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 36/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 1/130 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/130 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/249 variables, 2/132 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/133 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 133 constraints, problems are : Problem set: 2 solved, 1 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1007ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 12 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2025-06-05 15:10:11] [INFO ] Flatten gal took : 64 ms
[2025-06-05 15:10:11] [INFO ] Flatten gal took : 57 ms
[2025-06-05 15:10:11] [INFO ] Input system was already deterministic with 471 transitions.
Computed a total of 50 stabilizing places and 53 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 356 transition count 447
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 356 transition count 447
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 346 transition count 437
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 346 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 344 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 344 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 343 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 343 transition count 434
Applied a total of 74 rules in 62 ms. Remains 343 /380 variables (removed 37) and now considering 434/471 (removed 37) transitions.
// Phase 1: matrix 434 rows 343 cols
[2025-06-05 15:10:12] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:10:12] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-05 15:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:10:12] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2025-06-05 15:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:27] [INFO ] Deduced a trap composed of 163 places in 253 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:27] [INFO ] Deduced a trap composed of 166 places in 286 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:27] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:28] [INFO ] Deduced a trap composed of 167 places in 288 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:31] [INFO ] Deduced a trap composed of 162 places in 405 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:32] [INFO ] Deduced a trap composed of 163 places in 363 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:32] [INFO ] Deduced a trap composed of 163 places in 393 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:33] [INFO ] Deduced a trap composed of 166 places in 413 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:33] [INFO ] Deduced a trap composed of 167 places in 329 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:33] [INFO ] Deduced a trap composed of 170 places in 310 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:34] [INFO ] Deduced a trap composed of 166 places in 337 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:35] [INFO ] Deduced a trap composed of 165 places in 296 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:35] [INFO ] Deduced a trap composed of 164 places in 291 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:36] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:39] [INFO ] Deduced a trap composed of 169 places in 256 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:40] [INFO ] Deduced a trap composed of 168 places in 255 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:40] [INFO ] Deduced a trap composed of 169 places in 204 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/777 variables, and 21 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/343 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:49] [INFO ] Deduced a trap composed of 164 places in 294 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:10:53] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 434/777 variables, 343/366 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 433/799 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:11:10] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 31 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 800 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 343/380 places, 434/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60899 ms. Remains : 343/380 places, 434/471 transitions.
[2025-06-05 15:11:12] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:11:12] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:11:12] [INFO ] Input system was already deterministic with 434 transitions.
[2025-06-05 15:11:12] [INFO ] Flatten gal took : 22 ms
[2025-06-05 15:11:12] [INFO ] Flatten gal took : 21 ms
[2025-06-05 15:11:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15585375067575479031.gal : 17 ms
[2025-06-05 15:11:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7022157624392916022.ctl : 4 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/CTLFireability15585375067575479031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7022157624392916022.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08679e+07,1.90573,53428,2,6437,5,162332,6,0,1808,244561,0


Converting to forward existential form...Done !
original formula: EG(E(!((!(E((p391==1) U (p288==1))) * AG((((p38==1)&&(p161==1))&&(p308==1))))) U EX(!((AF((p195==1)) + E((p240==1) U (p143==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(!((!(E((p391==1) U (p288==1))) * !(E(TRUE U !((((p38==1)&&(p161==1))&&(p308==1))))))) U EX(!((!(EG(...211
Reverse transition relation is NOT exact ! Due to transitions t52, t61, t95, t96, t97, t132, t133, t135, t152, t163, t199, t200, t234, t235, t236, t252, t2...313
Detected timeout of ITS tools.
[2025-06-05 15:11:43] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:11:43] [INFO ] Applying decomposition
[2025-06-05 15:11:43] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4608693272278583380.txt' '-o' '/tmp/graph4608693272278583380.bin' '-w' '/tmp/graph4608693272278583380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4608693272278583380.bin' '-l' '-1' '-v' '-w' '/tmp/graph4608693272278583380.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:11:43] [INFO ] Decomposing Gal with order
[2025-06-05 15:11:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:11:43] [INFO ] Removed a total of 336 redundant transitions.
[2025-06-05 15:11:43] [INFO ] Flatten gal took : 139 ms
[2025-06-05 15:11:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 28 ms.
[2025-06-05 15:11:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16566469249356860505.gal : 17 ms
[2025-06-05 15:11:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9948920363213203884.ctl : 4 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/CTLFireability16566469249356860505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9948920363213203884.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08679e+07,0.206313,7568,635,22,5780,386,642,6195,66,731,0


Converting to forward existential form...Done !
original formula: EG(E(!((!(E((i20.i2.u117.p391==1) U (i15.i0.u84.p288==1))) * AG((((i2.i0.u12.p38==1)&&(i8.i0.u45.p161==1))&&(i17.i0.u92.p308==1))))) U EX...230
=> equivalent forward existential formula: [FwdG(Init,E(!((!(E((i20.i2.u117.p391==1) U (i15.i0.u84.p288==1))) * !(E(TRUE U !((((i2.i0.u12.p38==1)&&(i8.i0.u...291
Reverse transition relation is NOT exact ! Due to transitions t96, t97, t133, t135, t163, t199, t200, t234, t236, t297, t330, t331, t333, t350, t351, t353,...393
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,6.52811,191376,1,0,386396,554,5025,565744,312,1792,916241
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 354 transition count 445
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 354 transition count 445
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 343 transition count 434
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 343 transition count 434
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 337 transition count 428
Applied a total of 86 rules in 35 ms. Remains 337 /380 variables (removed 43) and now considering 428/471 (removed 43) transitions.
// Phase 1: matrix 428 rows 337 cols
[2025-06-05 15:11:50] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:11:50] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-05 15:11:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:11:51] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-05 15:11:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:06] [INFO ] Deduced a trap composed of 162 places in 287 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:07] [INFO ] Deduced a trap composed of 162 places in 260 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:07] [INFO ] Deduced a trap composed of 163 places in 277 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:08] [INFO ] Deduced a trap composed of 164 places in 284 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:09] [INFO ] Deduced a trap composed of 163 places in 247 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:09] [INFO ] Deduced a trap composed of 164 places in 376 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:10] [INFO ] Deduced a trap composed of 165 places in 315 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:10] [INFO ] Deduced a trap composed of 163 places in 237 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:11] [INFO ] Deduced a trap composed of 164 places in 348 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:12] [INFO ] Deduced a trap composed of 164 places in 271 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:12] [INFO ] Deduced a trap composed of 165 places in 360 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:13] [INFO ] Deduced a trap composed of 164 places in 410 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:13] [INFO ] Deduced a trap composed of 165 places in 373 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:13] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:18] [INFO ] Deduced a trap composed of 165 places in 279 ms of which 49 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 337/765 variables, and 19 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 428/765 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 427/783 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:41] [INFO ] Deduced a trap composed of 164 places in 289 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:12:48] [INFO ] Deduced a trap composed of 165 places in 337 ms of which 82 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/765 variables, and 785 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 337/380 places, 428/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60869 ms. Remains : 337/380 places, 428/471 transitions.
[2025-06-05 15:12:51] [INFO ] Flatten gal took : 25 ms
[2025-06-05 15:12:51] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:12:51] [INFO ] Input system was already deterministic with 428 transitions.
[2025-06-05 15:12:51] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:12:51] [INFO ] Flatten gal took : 22 ms
[2025-06-05 15:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10090598198646953471.gal : 6 ms
[2025-06-05 15:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14063076549574495402.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/CTLFireability10090598198646953471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14063076549574495402.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,1.05662e+07,2.24696,53052,2,6532,5,161452,6,0,1778,242125,0


Converting to forward existential form...Done !
original formula: E(((p39==1) + (EF((EX((p281==1)) * EX((((p51==1)&&(p161==1))&&(p308==1))))) * EF(AX(((((p51==1)&&(p161==1))&&(p321==1))||(p316==1)))))) U...165
=> equivalent forward existential formula: [(FwdU(Init,((p39==1) + (E(TRUE U (EX((p281==1)) * EX((((p51==1)&&(p161==1))&&(p308==1))))) * E(TRUE U !(EX(!(((...229
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t131, t132, t134, t151, t160, t194, t195, t196, t229, t230, t232, t2...319
Detected timeout of ITS tools.
[2025-06-05 15:13:21] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:13:21] [INFO ] Applying decomposition
[2025-06-05 15:13:21] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9702143172837289815.txt' '-o' '/tmp/graph9702143172837289815.bin' '-w' '/tmp/graph9702143172837289815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9702143172837289815.bin' '-l' '-1' '-v' '-w' '/tmp/graph9702143172837289815.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:13:21] [INFO ] Decomposing Gal with order
[2025-06-05 15:13:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:13:21] [INFO ] Removed a total of 331 redundant transitions.
[2025-06-05 15:13:21] [INFO ] Flatten gal took : 35 ms
[2025-06-05 15:13:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-06-05 15:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11035179656835878071.gal : 12 ms
[2025-06-05 15:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability3622434038481566326.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/CTLFireability11035179656835878071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3622434038481566326.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05662e+07,0.177752,8496,693,20,7605,407,675,8347,71,832,0


Converting to forward existential form...Done !
original formula: E(((i3.i0.u11.p39==1) + (EF((EX((i16.i0.u76.p281==1)) * EX((((i19.i0.u16.p51==1)&&(i9.i0.u42.p161==1))&&(i18.i0.u86.p308==1))))) * EF(AX(...271
=> equivalent forward existential formula: [(FwdU(Init,((i3.i0.u11.p39==1) + (E(TRUE U (EX((i16.i0.u76.p281==1)) * EX((((i19.i0.u16.p51==1)&&(i9.i0.u42.p16...335
Reverse transition relation is NOT exact ! Due to transitions t51, t95, t96, t132, t134, t196, t229, t230, t232, t248, t293, t326, t327, t329, t346, t347, ...390
(forward)formula 0,0,0.935446,33584,1,0,56226,407,4571,76563,310,832,286096
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Graph (trivial) has 382 edges and 380 vertex of which 41 / 380 are part of one of the 7 SCC in 2 ms
Free SCC test removed 34 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 345 transition count 188
Reduce places removed 244 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 252 rules applied. Total rules applied 497 place count 101 transition count 180
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 505 place count 97 transition count 176
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 511 place count 93 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 92 transition count 174
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 512 place count 92 transition count 164
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 532 place count 82 transition count 164
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 542 place count 72 transition count 154
Iterating global reduction 5 with 10 rules applied. Total rules applied 552 place count 72 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 552 place count 72 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 554 place count 71 transition count 153
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 555 place count 70 transition count 152
Iterating global reduction 5 with 1 rules applied. Total rules applied 556 place count 70 transition count 152
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 572 place count 62 transition count 144
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 582 place count 52 transition count 101
Iterating global reduction 5 with 10 rules applied. Total rules applied 592 place count 52 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 598 place count 52 transition count 95
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 599 place count 51 transition count 93
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 601 place count 50 transition count 91
Iterating global reduction 6 with 1 rules applied. Total rules applied 602 place count 50 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 604 place count 49 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 605 place count 48 transition count 85
Iterating global reduction 6 with 1 rules applied. Total rules applied 606 place count 48 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 607 place count 48 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 611 place count 48 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 619 place count 44 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 620 place count 43 transition count 75
Applied a total of 620 rules in 66 ms. Remains 43 /380 variables (removed 337) and now considering 75/471 (removed 396) transitions.
[2025-06-05 15:13:22] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
// Phase 1: matrix 71 rows 43 cols
[2025-06-05 15:13:22] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 15:13:22] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
[2025-06-05 15:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:13:22] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:13:22] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2025-06-05 15:13:22] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
[2025-06-05 15:13:22] [INFO ] Invariant cache hit.
[2025-06-05 15:13:22] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:23] [INFO ] Deduced a trap composed of 16 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:13:23] [INFO ] Deduced a trap composed of 18 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:13:23] [INFO ] Deduced a trap composed of 20 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:13:23] [INFO ] Deduced a trap composed of 22 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:13:23] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:23] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:23] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 70/113 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 1/114 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 62 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:27] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 70/113 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 68/130 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:27] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (OVERLAPS) 1/114 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 14 (OVERLAPS) 0/114 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 133 constraints, problems are : Problem set: 0 solved, 68 unsolved in 5582 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9271ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 9272ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/380 places, 75/471 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9481 ms. Remains : 43/380 places, 75/471 transitions.
[2025-06-05 15:13:32] [INFO ] Flatten gal took : 5 ms
[2025-06-05 15:13:32] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:13:32] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-05 15:13:32] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:13:32] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:13:32] [INFO ] Time to serialize gal into /tmp/CTLFireability139110500878968595.gal : 1 ms
[2025-06-05 15:13:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13058481140585558612.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/CTLFireability139110500878968595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13058481140585558612.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,3220,0.043556,4920,2,747,5,4063,6,0,241,4824,0


Converting to forward existential form...Done !
original formula: (AG(AF((p17==1))) + EF((p201==1)))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(E(TRUE U (p201==1)))),TRUE),!((p17==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t11, t13, t14, t17, t31, t35, t36, t37, t38, t51, t53, t59, t67, t68, t69...260
(forward)formula 0,1,0.465807,17328,1,0,188,72755,176,80,1821,54794,194
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Graph (trivial) has 385 edges and 380 vertex of which 56 / 380 are part of one of the 9 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 332 transition count 180
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 243 rules applied. Total rules applied 481 place count 95 transition count 174
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 485 place count 92 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 486 place count 91 transition count 173
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 486 place count 91 transition count 163
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 506 place count 81 transition count 163
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 517 place count 70 transition count 151
Iterating global reduction 4 with 11 rules applied. Total rules applied 528 place count 70 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 528 place count 70 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 530 place count 69 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 531 place count 68 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 532 place count 68 transition count 149
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 548 place count 60 transition count 141
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 559 place count 49 transition count 96
Iterating global reduction 4 with 11 rules applied. Total rules applied 570 place count 49 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 576 place count 49 transition count 90
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 578 place count 47 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 580 place count 47 transition count 86
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 582 place count 45 transition count 82
Iterating global reduction 5 with 2 rules applied. Total rules applied 584 place count 45 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 586 place count 44 transition count 81
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 587 place count 43 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 588 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 589 place count 43 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 593 place count 43 transition count 72
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 6 with 6 rules applied. Total rules applied 599 place count 40 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 39 transition count 68
Applied a total of 600 rules in 39 ms. Remains 39 /380 variables (removed 341) and now considering 68/471 (removed 403) transitions.
[2025-06-05 15:13:32] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
// Phase 1: matrix 64 rows 39 cols
[2025-06-05 15:13: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:13:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 15:13:32] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2025-06-05 15:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:13:32] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:13:32] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 15:13:32] [INFO ] Flow matrix only has 64 transitions (discarded 4 similar events)
[2025-06-05 15:13:32] [INFO ] Invariant cache hit.
[2025-06-05 15:13:32] [INFO ] State equation strengthened by 7 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, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 3/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:33] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:33] [INFO ] Deduced a trap composed of 18 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:13:33] [INFO ] Deduced a trap composed of 12 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:13:33] [INFO ] Deduced a trap composed of 19 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:13:33] [INFO ] Deduced a trap composed of 19 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:13:33] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:33] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:33] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:33] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:33] [INFO ] Deduced a trap composed of 18 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:13:33] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:34] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 63/102 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 1/103 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/103 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 60 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 3/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 63/102 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 61/120 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 1/103 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/103 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 121 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8177ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 8177ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/380 places, 68/471 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8344 ms. Remains : 39/380 places, 68/471 transitions.
[2025-06-05 15:13:40] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:13:40] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:13:40] [INFO ] Input system was already deterministic with 68 transitions.
[2025-06-05 15:13:40] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:13:40] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:13:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4475740476646142883.gal : 1 ms
[2025-06-05 15:13:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3460008325357073715.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/CTLFireability4475740476646142883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3460008325357073715.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,2772,0.053721,4656,2,670,5,3881,6,0,218,3896,0


Converting to forward existential form...Done !
original formula: AG(EF((p20==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p20==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t10, t12, t13, t18, t31, t32, t33, t34, t48, t54, t62, t63, t64, Interse...245
(forward)formula 0,0,0.530773,15152,1,0,163,63343,152,72,1631,40479,169
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Graph (trivial) has 338 edges and 380 vertex of which 53 / 380 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 335 transition count 223
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 204 rules applied. Total rules applied 403 place count 137 transition count 217
Reduce places removed 3 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 19 rules applied. Total rules applied 422 place count 134 transition count 201
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 438 place count 118 transition count 201
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 438 place count 118 transition count 189
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 462 place count 106 transition count 189
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 472 place count 96 transition count 179
Iterating global reduction 4 with 10 rules applied. Total rules applied 482 place count 96 transition count 179
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 483 place count 95 transition count 178
Iterating global reduction 4 with 1 rules applied. Total rules applied 484 place count 95 transition count 178
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 496 place count 89 transition count 172
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 503 place count 82 transition count 138
Iterating global reduction 4 with 7 rules applied. Total rules applied 510 place count 82 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 513 place count 82 transition count 135
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 514 place count 81 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 515 place count 81 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 516 place count 80 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 517 place count 80 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 519 place count 79 transition count 130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 520 place count 78 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 521 place count 78 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 522 place count 78 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 526 place count 78 transition count 120
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 6 with 6 rules applied. Total rules applied 532 place count 75 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 533 place count 74 transition count 116
Applied a total of 533 rules in 47 ms. Remains 74 /380 variables (removed 306) and now considering 116/471 (removed 355) transitions.
[2025-06-05 15:13:41] [INFO ] Flow matrix only has 111 transitions (discarded 5 similar events)
// Phase 1: matrix 111 rows 74 cols
[2025-06-05 15:13:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:41] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 15:13:41] [INFO ] Flow matrix only has 111 transitions (discarded 5 similar events)
[2025-06-05 15:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:13:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-05 15:13:41] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:13:41] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-05 15:13:41] [INFO ] Flow matrix only has 111 transitions (discarded 5 similar events)
[2025-06-05 15:13:41] [INFO ] Invariant cache hit.
[2025-06-05 15:13:41] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 3/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:42] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:42] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:43] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:43] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:43] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:43] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:43] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:44] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/184 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:46] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:46] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 109 unsolved in 12373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 3/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/184 variables, 74/86 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 109/199 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:56] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:13:57] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:06] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/185 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/185 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 203 constraints, problems are : Problem set: 0 solved, 109 unsolved in 21098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33498ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 33498ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/380 places, 116/471 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33711 ms. Remains : 74/380 places, 116/471 transitions.
[2025-06-05 15:14:15] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:14:15] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:14:15] [INFO ] Input system was already deterministic with 116 transitions.
[2025-06-05 15:14:15] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:14:15] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:14:15] [INFO ] Time to serialize gal into /tmp/CTLFireability91172927457204858.gal : 1 ms
[2025-06-05 15:14:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5186324130866796797.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/CTLFireability91172927457204858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5186324130866796797.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 -...281
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,17890,0.122843,7316,2,1372,5,13889,6,0,404,14808,0


Converting to forward existential form...Done !
original formula: EG((E(E(((p182==1)||((p322==1)&&(p20==1))) U E((p153==1) U (((p119==1)&&(p256==1))&&(p391==1)))) U (!(((((p98==1)&&(p208==1))&&((p343==1)...314
=> equivalent forward existential formula: [FwdG(Init,(E(E(((p182==1)||((p322==1)&&(p20==1))) U E((p153==1) U (((p119==1)&&(p256==1))&&(p391==1)))) U (!(((...408
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t13, t22, t25, t26, t35, t40, t70, t71, t77, t79, t81, t84, t102, t103, t108, t109, t...265
(forward)formula 0,1,4.29072,116280,1,0,508,690650,281,270,3042,494744,609
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Graph (trivial) has 380 edges and 380 vertex of which 53 / 380 are part of one of the 9 SCC in 0 ms
Free SCC test removed 44 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 335 transition count 188
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 239 rules applied. Total rules applied 473 place count 102 transition count 182
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 480 place count 99 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 484 place count 95 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 484 place count 95 transition count 168
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 504 place count 85 transition count 168
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 514 place count 75 transition count 158
Iterating global reduction 4 with 10 rules applied. Total rules applied 524 place count 75 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 524 place count 75 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 526 place count 74 transition count 157
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 527 place count 73 transition count 156
Iterating global reduction 4 with 1 rules applied. Total rules applied 528 place count 73 transition count 156
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 544 place count 65 transition count 148
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 555 place count 54 transition count 103
Iterating global reduction 4 with 11 rules applied. Total rules applied 566 place count 54 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 572 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 574 place count 52 transition count 93
Iterating global reduction 5 with 2 rules applied. Total rules applied 576 place count 52 transition count 93
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 578 place count 50 transition count 89
Iterating global reduction 5 with 2 rules applied. Total rules applied 580 place count 50 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 582 place count 49 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 583 place count 48 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 584 place count 48 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 585 place count 48 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 589 place count 48 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 597 place count 44 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 598 place count 43 transition count 74
Applied a total of 598 rules in 36 ms. Remains 43 /380 variables (removed 337) and now considering 74/471 (removed 397) transitions.
[2025-06-05 15:14:19] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
// Phase 1: matrix 69 rows 43 cols
[2025-06-05 15:14:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:14:19] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 15:14:19] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
[2025-06-05 15:14:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:14:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:14:19] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:14:19] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2025-06-05 15:14:19] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
[2025-06-05 15:14:19] [INFO ] Invariant cache hit.
[2025-06-05 15:14:19] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:20] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:20] [INFO ] Deduced a trap composed of 20 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:14:20] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:20] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:20] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:20] [INFO ] Deduced a trap composed of 25 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:14:20] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:20] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:20] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:21] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:21] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 68/111 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 63 constraints, problems are : Problem set: 0 solved, 67 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 68/111 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 67/129 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 130 constraints, problems are : Problem set: 0 solved, 67 unsolved in 5142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10242ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 10242ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/380 places, 74/471 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10420 ms. Remains : 43/380 places, 74/471 transitions.
[2025-06-05 15:14:29] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:14:29] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:14:29] [INFO ] Input system was already deterministic with 74 transitions.
[2025-06-05 15:14:29] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:14:29] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:14:29] [INFO ] Time to serialize gal into /tmp/CTLFireability1935230506295175525.gal : 1 ms
[2025-06-05 15:14:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4841027218083484815.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/CTLFireability1935230506295175525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4841027218083484815.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,4076,0.080759,5424,2,782,5,5838,6,0,239,6836,0


Converting to forward existential form...Done !
original formula: EF((AF((p118==1)) * ((p215==1) + A(AG((p350==1)) U (p65!=1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((p118==1))))) * (p215==1))] != FALSE + [(((FwdU(Init,TRUE) * !(EG(!((p118==1))))) *...254
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t12, t14, t18, t21, t33, t36, t37, t38, t39, t53, t59, t67, t68, t69, In...250
(forward)formula 0,1,0.820692,22384,1,0,310,104214,166,139,1752,94511,352
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 355 transition count 446
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 355 transition count 446
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 345 transition count 436
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 345 transition count 436
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 342 transition count 433
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 342 transition count 433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 340 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 340 transition count 431
Applied a total of 80 rules in 58 ms. Remains 340 /380 variables (removed 40) and now considering 431/471 (removed 40) transitions.
// Phase 1: matrix 431 rows 340 cols
[2025-06-05 15:14:30] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:14:31] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-05 15:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:14:31] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2025-06-05 15:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:47] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:47] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:47] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:47] [INFO ] Deduced a trap composed of 165 places in 260 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:48] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:49] [INFO ] Deduced a trap composed of 163 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:49] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:50] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:50] [INFO ] Deduced a trap composed of 165 places in 205 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:50] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:50] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:51] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:51] [INFO ] Deduced a trap composed of 163 places in 316 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:51] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:53] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:14:54] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/771 variables, and 20 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 431/771 variables, 340/360 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 430/790 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:15:18] [INFO ] Deduced a trap composed of 165 places in 186 ms of which 40 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 791 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 340/380 places, 431/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60762 ms. Remains : 340/380 places, 431/471 transitions.
[2025-06-05 15:15:31] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:15:31] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:15:31] [INFO ] Input system was already deterministic with 431 transitions.
[2025-06-05 15:15:31] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:15:31] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:15:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11235926112561738358.gal : 3 ms
[2025-06-05 15:15:31] [INFO ] Time to serialize properties into /tmp/CTLFireability4821921622637873070.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/CTLFireability11235926112561738358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4821921622637873070.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06902e+07,2.08567,51156,2,6742,5,160819,6,0,1793,231804,0


Converting to forward existential form...Done !
original formula: E((!((EX((p137==1)) * (EG((p167==1)) + ((p411!=1)&&(p188==1))))) * AF((A((p70==1) U (p286!=1)) + AF((p141==1))))) U !(EG(EF((p392==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(!((EX((p137==1)) * (EG((p167==1)) + ((p411!=1)&&(p188==1))))) * !(EG(!((!((E(!((p286!=1)) U (!((p70...266
Reverse transition relation is NOT exact ! Due to transitions t53, t62, t96, t97, t98, t131, t134, t135, t151, t160, t194, t196, t197, t234, t235, t251, t2...307
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-05 15:16:01] [INFO ] Flatten gal took : 9 ms
[2025-06-05 15:16:01] [INFO ] Applying decomposition
[2025-06-05 15:16:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2709760860243235409.txt' '-o' '/tmp/graph2709760860243235409.bin' '-w' '/tmp/graph2709760860243235409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2709760860243235409.bin' '-l' '-1' '-v' '-w' '/tmp/graph2709760860243235409.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:16:01] [INFO ] Decomposing Gal with order
[2025-06-05 15:16:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:16:01] [INFO ] Removed a total of 340 redundant transitions.
[2025-06-05 15:16:01] [INFO ] Flatten gal took : 26 ms
[2025-06-05 15:16:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2025-06-05 15:16:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12270944269475761652.gal : 6 ms
[2025-06-05 15:16:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14508073218084604314.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/CTLFireability12270944269475761652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14508073218084604314.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06902e+07,0.209049,8248,644,17,7180,353,648,8396,49,721,0


Converting to forward existential form...Done !
original formula: E((!((EX((i0.i0.u1.p137==1)) * (EG((i8.i1.u54.p167==1)) + ((i23.i0.u132.p411!=1)&&(i12.i0.u61.p188==1))))) * AF((A((i5.i2.u22.p70==1) U (...240
=> equivalent forward existential formula: [(FwdU(Init,(!((EX((i0.i0.u1.p137==1)) * (EG((i8.i1.u54.p167==1)) + ((i23.i0.u132.p411!=1)&&(i12.i0.u61.p188==1)...373
Reverse transition relation is NOT exact ! Due to transitions t53, t97, t98, t131, t134, t151, t197, t234, t235, t330, t332, t350, t352, i0.i1.u41.t251, i5...383
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,5.66011,177848,1,0,363663,353,5402,480851,246,747,883367
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 355 transition count 446
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 355 transition count 446
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 344 transition count 435
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 344 transition count 435
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 340 transition count 431
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 340 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 338 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 338 transition count 429
Applied a total of 84 rules in 37 ms. Remains 338 /380 variables (removed 42) and now considering 429/471 (removed 42) transitions.
// Phase 1: matrix 429 rows 338 cols
[2025-06-05 15:16:07] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:16:07] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-05 15:16:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:16:08] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2025-06-05 15:16:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:23] [INFO ] Deduced a trap composed of 162 places in 316 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:24] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:25] [INFO ] Deduced a trap composed of 165 places in 257 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:25] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:26] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:26] [INFO ] Deduced a trap composed of 163 places in 230 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:26] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:27] [INFO ] Deduced a trap composed of 165 places in 340 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:27] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:27] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:28] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:29] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:29] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:30] [INFO ] Deduced a trap composed of 165 places in 378 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:30] [INFO ] Deduced a trap composed of 164 places in 297 ms of which 63 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:34] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:16:34] [INFO ] Deduced a trap composed of 165 places in 261 ms of which 47 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/767 variables, and 21 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/338 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 429/767 variables, 338/359 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 428/787 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:00] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:03] [INFO ] Deduced a trap composed of 165 places in 360 ms of which 89 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/767 variables, and 789 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 338/380 places, 429/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60922 ms. Remains : 338/380 places, 429/471 transitions.
[2025-06-05 15:17:08] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:17:08] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:17:08] [INFO ] Input system was already deterministic with 429 transitions.
[2025-06-05 15:17:08] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:17:08] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:17:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12713627361101841006.gal : 5 ms
[2025-06-05 15:17:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12663556260292155769.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/CTLFireability12713627361101841006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12663556260292155769.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,1.06048e+07,2.26165,51340,2,6318,5,160823,6,0,1783,234763,0


Converting to forward existential form...Done !
original formula: EG(!(A((A(((p315==1)||(p81==1)) U (p277==1)) * AX((p1!=1))) U E(EX((p290==1)) U AX((p330==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(E(EX((p290==1)) U !(EX(!((p330==1)))))) U (!((!((E(!((p277==1)) U (!(((p315==1)||(p81==1))) ...322
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t96, t97, t133, t134, t151, t160, t194, t195, t196, t229, t230, t232, t248, t2...313
Detected timeout of ITS tools.
[2025-06-05 15:17:38] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:17:38] [INFO ] Applying decomposition
[2025-06-05 15:17:38] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17145391376630712959.txt' '-o' '/tmp/graph17145391376630712959.bin' '-w' '/tmp/graph17145391376630712959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17145391376630712959.bin' '-l' '-1' '-v' '-w' '/tmp/graph17145391376630712959.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:17:38] [INFO ] Decomposing Gal with order
[2025-06-05 15:17:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:17:38] [INFO ] Removed a total of 341 redundant transitions.
[2025-06-05 15:17:38] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:17:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2025-06-05 15:17:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6093989309827274102.gal : 5 ms
[2025-06-05 15:17:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7718184123816046758.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/CTLFireability6093989309827274102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7718184123816046758.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06048e+07,0.146571,7784,610,22,6195,379,677,6984,66,855,0


Converting to forward existential form...Done !
original formula: EG(!(A((A(((i18.i1.u96.p315==1)||(i4.i1.u24.p81==1)) U (i16.i1.u85.p277==1)) * AX((i6.i1.u0.p1!=1))) U E(EX((i16.i0.u83.p290==1)) U AX((i...175
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(E(EX((i16.i0.u83.p290==1)) U !(EX(!((i19.u99.p330==1)))))) U (!((!((E(!((i16.i1.u85.p277==1)...442
Reverse transition relation is NOT exact ! Due to transitions t96, t97, t134, t151, t196, t230, t232, t248, t293, t326, t327, t329, t346, t347, t349, i3.t2...378
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,1,6.30484,180712,1,0,367914,533,5455,470180,335,1429,960791
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 356 transition count 447
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 356 transition count 447
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 345 transition count 436
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 345 transition count 436
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 341 transition count 432
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 341 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 339 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 339 transition count 430
Applied a total of 82 rules in 31 ms. Remains 339 /380 variables (removed 41) and now considering 430/471 (removed 41) transitions.
// Phase 1: matrix 430 rows 339 cols
[2025-06-05 15:17:45] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:17:45] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-05 15:17:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:17:45] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2025-06-05 15:17:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:56] [INFO ] Deduced a trap composed of 163 places in 189 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:57] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:57] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:57] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:58] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:58] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:58] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:59] [INFO ] Deduced a trap composed of 165 places in 257 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:17:59] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:00] [INFO ] Deduced a trap composed of 165 places in 202 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:00] [INFO ] Deduced a trap composed of 165 places in 194 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:00] [INFO ] Deduced a trap composed of 165 places in 188 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:01] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:01] [INFO ] Deduced a trap composed of 165 places in 133 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:02] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:03] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:04] [INFO ] Deduced a trap composed of 165 places in 175 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:12] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 46 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 339/769 variables, and 22 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/339 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/769 variables, 339/361 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 429/790 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:18:38] [INFO ] Deduced a trap composed of 166 places in 291 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 791 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 339/380 places, 430/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60856 ms. Remains : 339/380 places, 430/471 transitions.
[2025-06-05 15:18:45] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:18:45] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:18:46] [INFO ] Input system was already deterministic with 430 transitions.
[2025-06-05 15:18:46] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:18:46] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:18:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7372136118024431279.gal : 4 ms
[2025-06-05 15:18:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12500303596259509466.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/CTLFireability7372136118024431279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12500303596259509466.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07005e+07,2.3031,52496,2,6225,5,160027,6,0,1788,239912,0


Converting to forward existential form...Done !
original formula: AG(((EX(((p139==0)&&(p230==0))) + (p388==0)) + ((p12==0) * AG((p288==0)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((EX(((p139==0)&&(p230==0))) + (p388==0)))) * !((p12==0)))] = FALSE * [(FwdU((FwdU(Init,T...238
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t131, t132, t134, t151, t160, t194, t195, t196, t230, t231, t233, t2...319
(forward)formula 0,1,12.0026,259860,1,0,572,876996,881,405,10336,845343,870
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 355 transition count 446
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 355 transition count 446
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 343 transition count 434
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 343 transition count 434
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 337 transition count 428
Applied a total of 86 rules in 30 ms. Remains 337 /380 variables (removed 43) and now considering 428/471 (removed 43) transitions.
// Phase 1: matrix 428 rows 337 cols
[2025-06-05 15:18:58] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:18:58] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-05 15:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:18:58] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-05 15:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:13] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:13] [INFO ] Deduced a trap composed of 163 places in 238 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:14] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:16] [INFO ] Deduced a trap composed of 165 places in 270 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:17] [INFO ] Deduced a trap composed of 162 places in 309 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:17] [INFO ] Deduced a trap composed of 164 places in 308 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:18] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:18] [INFO ] Deduced a trap composed of 165 places in 296 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:20] [INFO ] Deduced a trap composed of 163 places in 326 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:20] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:20] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:20] [INFO ] Deduced a trap composed of 163 places in 136 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 337/765 variables, and 16 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:36] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:36] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 41 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 427/782 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:51] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:56] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:19:57] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 3/785 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/765 variables, and 785 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 337/380 places, 428/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60834 ms. Remains : 337/380 places, 428/471 transitions.
[2025-06-05 15:19:59] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:19:59] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:19:59] [INFO ] Input system was already deterministic with 428 transitions.
[2025-06-05 15:19:59] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:19:59] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15863308313058209413.gal : 2 ms
[2025-06-05 15:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5395142491747160827.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/CTLFireability15863308313058209413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5395142491747160827.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05682e+07,2.10577,52916,2,6131,5,161935,6,0,1778,244169,0


Converting to forward existential form...Done !
original formula: AF((AG(((EX((p121==1)) * !(E((p181==1) U (p258==1)))) * (EG((((p85==1)&&(p208==1))&&(p368==1))) + ((p216==0) * AX((p111==1)))))) + (p236=...160
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((EX((p121==1)) * !(E((p181==1) U (p258==1)))) * (EG((((p85==1)&&(p208==1))&&(p368==1...223
Reverse transition relation is NOT exact ! Due to transitions t16, t52, t61, t95, t96, t97, t130, t131, t133, t159, t194, t195, t196, t229, t230, t232, t24...318
Detected timeout of ITS tools.
[2025-06-05 15:20:29] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:20:29] [INFO ] Applying decomposition
[2025-06-05 15:20:29] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15383088973701792149.txt' '-o' '/tmp/graph15383088973701792149.bin' '-w' '/tmp/graph15383088973701792149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15383088973701792149.bin' '-l' '-1' '-v' '-w' '/tmp/graph15383088973701792149.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:20:29] [INFO ] Decomposing Gal with order
[2025-06-05 15:20:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:20:29] [INFO ] Removed a total of 323 redundant transitions.
[2025-06-05 15:20:29] [INFO ] Flatten gal took : 24 ms
[2025-06-05 15:20:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2025-06-05 15:20:29] [INFO ] Time to serialize gal into /tmp/CTLFireability11815631422099621510.gal : 4 ms
[2025-06-05 15:20:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6159478472935033790.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/CTLFireability11815631422099621510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6159478472935033790.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05682e+07,0.185765,8252,567,18,7247,483,720,8334,64,1077,0


Converting to forward existential form...Done !
original formula: AF((AG(((EX((i15.i0.u3.p121==1)) * !(E((i10.i1.u49.p181==1) U (i16.i0.u73.p258==1)))) * (EG((((i5.i0.u27.p85==1)&&(i12.i0.u56.p208==1))&&...254
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((EX((i15.i0.u3.p121==1)) * !(E((i10.i1.u49.p181==1) U (i16.i0.u73.p258==1)))) * (EG(...317
Reverse transition relation is NOT exact ! Due to transitions t16, t52, t131, t133, t196, t229, t230, t232, t248, t293, t326, t327, t329, t346, t347, t349,...383
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,3.13987,98620,1,0,205616,483,5099,291008,299,1077,518564
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 357 transition count 448
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 357 transition count 448
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 346 transition count 437
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 346 transition count 437
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 342 transition count 433
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 342 transition count 433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 340 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 340 transition count 431
Applied a total of 80 rules in 29 ms. Remains 340 /380 variables (removed 40) and now considering 431/471 (removed 40) transitions.
// Phase 1: matrix 431 rows 340 cols
[2025-06-05 15:20:32] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:32] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-05 15:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:33] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2025-06-05 15:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:49] [INFO ] Deduced a trap composed of 163 places in 338 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:49] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:50] [INFO ] Deduced a trap composed of 165 places in 270 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:51] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:51] [INFO ] Deduced a trap composed of 165 places in 307 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:53] [INFO ] Deduced a trap composed of 164 places in 331 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:53] [INFO ] Deduced a trap composed of 166 places in 312 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:54] [INFO ] Deduced a trap composed of 164 places in 288 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:54] [INFO ] Deduced a trap composed of 165 places in 396 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:55] [INFO ] Deduced a trap composed of 165 places in 375 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:55] [INFO ] Deduced a trap composed of 164 places in 354 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:20:55] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/771 variables, and 16 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:21:13] [INFO ] Deduced a trap composed of 165 places in 258 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 431/771 variables, 340/357 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 430/787 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:21:31] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:21:32] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 46 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/771 variables, and 789 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 340/380 places, 431/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 340/380 places, 431/471 transitions.
[2025-06-05 15:21:33] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:21:33] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:21:33] [INFO ] Input system was already deterministic with 431 transitions.
[2025-06-05 15:21:33] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:21:33] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:21:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15905764302689508884.gal : 2 ms
[2025-06-05 15:21:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7813118169071841783.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/CTLFireability15905764302689508884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7813118169071841783.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11555e+07,3.36951,74252,2,8697,5,212621,6,0,1793,364810,0


Converting to forward existential form...Done !
original formula: (((AG(EF((p267==1))) * EG((((p218==1)||((p385==0)&&(p146==0)))&&(p256==0)))) * (AG((EX((((p213==1)||(p307==0))||(p37==0))) + !(E(EX((p235...247
=> equivalent forward existential formula: ((([(FwdU(Init,TRUE) * !(E(TRUE U (p267==1))))] = FALSE * [(Init * !(EG((((p218==1)||((p385==0)&&(p146==0)))&&(p...412
Reverse transition relation is NOT exact ! Due to transitions t25, t26, t52, t61, t95, t96, t97, t110, t131, t132, t133, t134, t151, t160, t194, t195, t196...359
Detected timeout of ITS tools.
[2025-06-05 15:22:03] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:22:03] [INFO ] Applying decomposition
[2025-06-05 15:22:03] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3403019669994306186.txt' '-o' '/tmp/graph3403019669994306186.bin' '-w' '/tmp/graph3403019669994306186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3403019669994306186.bin' '-l' '-1' '-v' '-w' '/tmp/graph3403019669994306186.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:22:03] [INFO ] Decomposing Gal with order
[2025-06-05 15:22:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:22:03] [INFO ] Removed a total of 324 redundant transitions.
[2025-06-05 15:22:03] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:22:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 15:22:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6337980132698646257.gal : 5 ms
[2025-06-05 15:22:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5277969504048113419.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/CTLFireability6337980132698646257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5277969504048113419.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11555e+07,0.267908,7920,780,18,6661,326,661,7963,45,623,0


Converting to forward existential form...Done !
original formula: (((AG(EF((i15.i1.u86.p267==1))) * EG((((i12.i1.u72.p218==1)||((i22.u124.p385==0)&&(i9.i1.u49.p146==0)))&&(i11.i0.u46.p256==0)))) * (AG((E...404
=> equivalent forward existential formula: ((([(FwdU(Init,TRUE) * !(E(TRUE U (i15.i1.u86.p267==1))))] = FALSE * [(Init * !(EG((((i12.i1.u72.p218==1)||((i22...569
Reverse transition relation is NOT exact ! Due to transitions t52, t96, t97, t110, t132, t134, t151, t195, t196, t231, t234, t250, t295, t308, t329, t330, ...460
(forward)formula 0,0,1.76552,50416,1,0,90891,326,4465,140216,206,623,392878
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Graph (trivial) has 387 edges and 380 vertex of which 56 / 380 are part of one of the 9 SCC in 0 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 332 transition count 178
Reduce places removed 239 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 245 rules applied. Total rules applied 485 place count 93 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 488 place count 90 transition count 172
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 488 place count 90 transition count 162
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 508 place count 80 transition count 162
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 519 place count 69 transition count 150
Iterating global reduction 3 with 11 rules applied. Total rules applied 530 place count 69 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 530 place count 69 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 532 place count 68 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 533 place count 67 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 534 place count 67 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 535 place count 66 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 536 place count 66 transition count 145
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 552 place count 58 transition count 137
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 562 place count 48 transition count 93
Iterating global reduction 3 with 10 rules applied. Total rules applied 572 place count 48 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 578 place count 48 transition count 87
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 580 place count 46 transition count 83
Iterating global reduction 4 with 2 rules applied. Total rules applied 582 place count 46 transition count 83
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 584 place count 44 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 586 place count 44 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 588 place count 43 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 589 place count 42 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 590 place count 42 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 591 place count 42 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 594 place count 42 transition count 71
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 5 with 6 rules applied. Total rules applied 600 place count 39 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 601 place count 38 transition count 67
Applied a total of 601 rules in 28 ms. Remains 38 /380 variables (removed 342) and now considering 67/471 (removed 404) transitions.
[2025-06-05 15:22:05] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 38 cols
[2025-06-05 15:22:05] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:22:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 15:22:05] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2025-06-05 15:22:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:22:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:22:05] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:22:05] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 15:22:05] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2025-06-05 15:22:05] [INFO ] Invariant cache hit.
[2025-06-05 15:22:05] [INFO ] State equation strengthened by 7 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, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:05] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:05] [INFO ] Deduced a trap composed of 12 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:22:05] [INFO ] Deduced a trap composed of 18 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:22:06] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:06] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:06] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:06] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:06] [INFO ] Deduced a trap composed of 20 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:22:06] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 62/100 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:07] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/101 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/101 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 57 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4648 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 62/100 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 60/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 1/101 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 117 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8988ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 8990ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/380 places, 67/471 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9138 ms. Remains : 38/380 places, 67/471 transitions.
[2025-06-05 15:22:14] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:22:14] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:22:14] [INFO ] Input system was already deterministic with 67 transitions.
RANDOM walk for 202 steps (25 resets) in 9 ms. (20 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-03b-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 15:22:14] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:22:14] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:22:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14323088359654437690.gal : 1 ms
[2025-06-05 15:22:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13853645470314652804.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14323088359654437690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13853645470314652804.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 359 transition count 450
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 359 transition count 450
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 350 transition count 441
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 350 transition count 441
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 347 transition count 438
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 347 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 346 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 346 transition count 437
Applied a total of 68 rules in 49 ms. Remains 346 /380 variables (removed 34) and now considering 437/471 (removed 34) transitions.
// Phase 1: matrix 437 rows 346 cols
[2025-06-05 15:22:14] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:22:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-05 15:22:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:22:15] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2025-06-05 15:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:31] [INFO ] Deduced a trap composed of 163 places in 348 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:32] [INFO ] Deduced a trap composed of 165 places in 267 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:33] [INFO ] Deduced a trap composed of 165 places in 327 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:33] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:34] [INFO ] Deduced a trap composed of 165 places in 309 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:35] [INFO ] Deduced a trap composed of 165 places in 299 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:36] [INFO ] Deduced a trap composed of 165 places in 368 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:36] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:36] [INFO ] Deduced a trap composed of 170 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:36] [INFO ] Deduced a trap composed of 170 places in 188 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:36] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:37] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:37] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:37] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:22:42] [INFO ] Deduced a trap composed of 169 places in 229 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/783 variables, and 19 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/346 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 437/783 variables, 346/365 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 436/801 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:23:07] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 783/783 variables, and 802 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 346/380 places, 437/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60934 ms. Remains : 346/380 places, 437/471 transitions.
[2025-06-05 15:23:15] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:23:15] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:23:15] [INFO ] Input system was already deterministic with 437 transitions.
[2025-06-05 15:23:15] [INFO ] Flatten gal took : 15 ms
[2025-06-05 15:23:15] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:23:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16084629159660679516.gal : 2 ms
[2025-06-05 15:23:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10903502132966715494.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/CTLFireability16084629159660679516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10903502132966715494.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,1.14439e+07,2.87511,70756,2,9008,5,208248,6,0,1823,347759,0


Converting to forward existential form...Done !
original formula: (EF(AG(((!(A((p87==1) U (p391==1))) * EX((p79==0))) + (((((p98==0)||(p208==0))||(p368==0))&&(p286==0))&&(p336==0))))) * ((EF((((p51==1)&&...505
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !(((!(!((E(!((p391==1)) U (!((p87==1)) * !((p391==1)))) + EG(!((p391==1)))))) * ...1432
Reverse transition relation is NOT exact ! Due to transitions t26, t27, t53, t54, t63, t98, t99, t100, t133, t134, t135, t136, t137, t153, t162, t197, t198...347
Detected timeout of ITS tools.
[2025-06-05 15:23:45] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:23:45] [INFO ] Applying decomposition
[2025-06-05 15:23:45] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12360621237146484187.txt' '-o' '/tmp/graph12360621237146484187.bin' '-w' '/tmp/graph12360621237146484187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12360621237146484187.bin' '-l' '-1' '-v' '-w' '/tmp/graph12360621237146484187.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:23:45] [INFO ] Decomposing Gal with order
[2025-06-05 15:23:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:23:45] [INFO ] Removed a total of 315 redundant transitions.
[2025-06-05 15:23:45] [INFO ] Flatten gal took : 31 ms
[2025-06-05 15:23:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-06-05 15:23:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15445198151479340399.gal : 5 ms
[2025-06-05 15:23:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3475386436329650796.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/CTLFireability15445198151479340399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3475386436329650796.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14439e+07,0.192031,8860,773,24,8532,433,742,10494,57,957,0


Converting to forward existential form...Done !
original formula: (EF(AG(((!(A((i5.i0.u30.p87==1) U (i17.i3.u115.p391==1))) * EX((i4.i1.u27.p79==0))) + (((((i17.i0.u34.p98==0)||(i12.i0.u63.p208==0))||(i1...846
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !(((!(!((E(!((i17.i3.u115.p391==1)) U (!((i5.i0.u30.p87==1)) * !((i17.i3.u115.p3...2195
Reverse transition relation is NOT exact ! Due to transitions t54, t100, t133, t134, t136, t153, t199, t232, t233, t235, t251, t301, t302, t336, t338, t356...453
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,21.2373,504180,1,0,921101,433,5703,1.76327e+06,309,1127,2012786
FORMULA StigmergyElection-PT-03b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 354 transition count 445
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 354 transition count 445
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 343 transition count 434
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 343 transition count 434
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 337 transition count 428
Applied a total of 86 rules in 28 ms. Remains 337 /380 variables (removed 43) and now considering 428/471 (removed 43) transitions.
// Phase 1: matrix 428 rows 337 cols
[2025-06-05 15:24:06] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:24:07] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-05 15:24:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:24:07] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-05 15:24:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:23] [INFO ] Deduced a trap composed of 162 places in 311 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:23] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:24] [INFO ] Deduced a trap composed of 163 places in 254 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:24] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:25] [INFO ] Deduced a trap composed of 163 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:26] [INFO ] Deduced a trap composed of 164 places in 426 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:26] [INFO ] Deduced a trap composed of 165 places in 310 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:26] [INFO ] Deduced a trap composed of 163 places in 241 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:27] [INFO ] Deduced a trap composed of 164 places in 348 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:28] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:28] [INFO ] Deduced a trap composed of 165 places in 337 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:29] [INFO ] Deduced a trap composed of 164 places in 402 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:29] [INFO ] Deduced a trap composed of 165 places in 368 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:30] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:34] [INFO ] Deduced a trap composed of 165 places in 272 ms of which 50 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 337/765 variables, and 19 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 428/765 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/765 variables, 427/783 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:24:58] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:04] [INFO ] Deduced a trap composed of 165 places in 364 ms of which 84 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/765 variables, and 785 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 337/380 places, 428/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60627 ms. Remains : 337/380 places, 428/471 transitions.
[2025-06-05 15:25:07] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:25:07] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:25:07] [INFO ] Input system was already deterministic with 428 transitions.
[2025-06-05 15:25:07] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:25:07] [INFO ] Flatten gal took : 13 ms
[2025-06-05 15:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16123028239858549096.gal : 4 ms
[2025-06-05 15:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13145009059141225104.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/CTLFireability16123028239858549096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13145009059141225104.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,1.05662e+07,2.2508,52924,2,6532,5,161452,6,0,1778,242125,0


Converting to forward existential form...Done !
original formula: !(E(!((EG(EF((((p85==1)&&(p220==1))&&(p355==1)))) * EF(AX((p251==1))))) U E(E(EF((p288==1)) U EF((p156==1))) U !(((((p26==1)&&(p186==1))&...195
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((EG(E(TRUE U (((p85==1)&&(p220==1))&&(p355==1)))) * E(TRUE U !(EX(!((p251==1)))))))),E(E(TRUE...268
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t94, t95, t96, t131, t132, t134, t151, t160, t194, t195, t196, t229, t230, t232, t2...319
Detected timeout of ITS tools.
[2025-06-05 15:25:37] [INFO ] Flatten gal took : 7 ms
[2025-06-05 15:25:37] [INFO ] Applying decomposition
[2025-06-05 15:25:37] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13650182166606729831.txt' '-o' '/tmp/graph13650182166606729831.bin' '-w' '/tmp/graph13650182166606729831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13650182166606729831.bin' '-l' '-1' '-v' '-w' '/tmp/graph13650182166606729831.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:25:37] [INFO ] Decomposing Gal with order
[2025-06-05 15:25:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:25:37] [INFO ] Removed a total of 330 redundant transitions.
[2025-06-05 15:25:37] [INFO ] Flatten gal took : 21 ms
[2025-06-05 15:25:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2025-06-05 15:25:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1812829807876492615.gal : 4 ms
[2025-06-05 15:25:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17547043659473038439.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/CTLFireability1812829807876492615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17547043659473038439.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05662e+07,0.175653,7820,638,17,6448,410,650,7286,60,894,0


Converting to forward existential form...Done !
original formula: !(E(!((EG(EF((((i4.i0.u25.p85==1)&&(i13.i0.u66.p220==1))&&(i21.i0.u106.p355==1)))) * EF(AX((i14.i0.u75.p251==1))))) U E(E(EF((i16.i1.u85....310
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((EG(E(TRUE U (((i4.i0.u25.p85==1)&&(i13.i0.u66.p220==1))&&(i21.i0.u106.p355==1)))) * E(TRUE U...383
Reverse transition relation is NOT exact ! Due to transitions t51, t96, t131, t132, t134, t151, t196, t229, t230, t232, t248, t292, t293, t346, t347, t349,...389
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,6.0116,162188,1,0,317085,410,5236,510142,294,947,811666
FORMULA StigmergyElection-PT-03b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Graph (trivial) has 386 edges and 380 vertex of which 56 / 380 are part of one of the 9 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 332 transition count 180
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 243 rules applied. Total rules applied 481 place count 95 transition count 174
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 485 place count 92 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 486 place count 91 transition count 173
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 486 place count 91 transition count 163
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 506 place count 81 transition count 163
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 517 place count 70 transition count 151
Iterating global reduction 4 with 11 rules applied. Total rules applied 528 place count 70 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 528 place count 70 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 530 place count 69 transition count 150
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 532 place count 67 transition count 147
Iterating global reduction 4 with 2 rules applied. Total rules applied 534 place count 67 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 535 place count 66 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 536 place count 66 transition count 145
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 552 place count 58 transition count 137
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 563 place count 47 transition count 92
Iterating global reduction 4 with 11 rules applied. Total rules applied 574 place count 47 transition count 92
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 579 place count 47 transition count 87
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 581 place count 45 transition count 83
Iterating global reduction 5 with 2 rules applied. Total rules applied 583 place count 45 transition count 83
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 585 place count 43 transition count 79
Iterating global reduction 5 with 2 rules applied. Total rules applied 587 place count 43 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 589 place count 42 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 590 place count 41 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 591 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 592 place count 41 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 595 place count 41 transition count 71
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 6 with 6 rules applied. Total rules applied 601 place count 38 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 602 place count 37 transition count 67
Applied a total of 602 rules in 42 ms. Remains 37 /380 variables (removed 343) and now considering 67/471 (removed 404) transitions.
[2025-06-05 15:25:43] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 37 cols
[2025-06-05 15:25:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:25:43] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 15:25:43] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2025-06-05 15:25:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:25:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:25:44] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:25:44] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 15:25:44] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2025-06-05 15:25:44] [INFO ] Invariant cache hit.
[2025-06-05 15:25:44] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:44] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:44] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:44] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:44] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:44] [INFO ] Deduced a trap composed of 12 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:25:45] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:45] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:45] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 62/99 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/100 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/100 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 55 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 62/99 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 60/114 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 1/100 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/100 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 115 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8156ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 8158ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/380 places, 67/471 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8389 ms. Remains : 37/380 places, 67/471 transitions.
[2025-06-05 15:25:52] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:25:52] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:25:52] [INFO ] Input system was already deterministic with 67 transitions.
[2025-06-05 15:25:52] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:25:52] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:25:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4428279329695022997.gal : 1 ms
[2025-06-05 15:25:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11053369062755858107.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/CTLFireability4428279329695022997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11053369062755858107.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,2636,0.055485,4744,2,599,5,3233,6,0,209,3711,0


Converting to forward existential form...Done !
original formula: AG(EF(EG((p48==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG((p48==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t10, t12, t13, t19, t30, t31, t32, t33, t47, t53, t61, t62, t63, Interse...245
(forward)formula 0,0,0.639158,16184,1,0,206,66547,156,88,1619,51884,233
FORMULA StigmergyElection-PT-03b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 471/471 transitions.
Graph (trivial) has 386 edges and 380 vertex of which 56 / 380 are part of one of the 9 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 332 transition count 181
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 242 rules applied. Total rules applied 479 place count 96 transition count 175
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 483 place count 93 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 484 place count 92 transition count 174
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 484 place count 92 transition count 164
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 504 place count 82 transition count 164
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 515 place count 71 transition count 152
Iterating global reduction 4 with 11 rules applied. Total rules applied 526 place count 71 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 526 place count 71 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 528 place count 70 transition count 151
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 530 place count 68 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 532 place count 68 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 533 place count 67 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 534 place count 67 transition count 146
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 550 place count 59 transition count 138
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 561 place count 48 transition count 93
Iterating global reduction 4 with 11 rules applied. Total rules applied 572 place count 48 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 578 place count 48 transition count 87
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 580 place count 46 transition count 83
Iterating global reduction 5 with 2 rules applied. Total rules applied 582 place count 46 transition count 83
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 584 place count 44 transition count 79
Iterating global reduction 5 with 2 rules applied. Total rules applied 586 place count 44 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 588 place count 43 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 589 place count 42 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 590 place count 42 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 591 place count 42 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 594 place count 42 transition count 71
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 6 with 6 rules applied. Total rules applied 600 place count 39 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 38 transition count 67
Applied a total of 601 rules in 23 ms. Remains 38 /380 variables (removed 342) and now considering 67/471 (removed 404) transitions.
[2025-06-05 15:25:52] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 38 cols
[2025-06-05 15:25:52] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:25:52] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 15:25:52] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2025-06-05 15:25:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:25:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 15:25:53] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:25:53] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 15:25:53] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2025-06-05 15:25:53] [INFO ] Invariant cache hit.
[2025-06-05 15:25:53] [INFO ] State equation strengthened by 7 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, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:53] [INFO ] Deduced a trap composed of 14 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:25:53] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:53] [INFO ] Deduced a trap composed of 18 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:25:53] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:53] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:53] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 62/100 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 1/101 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 56 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:25:57] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 62/100 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 60/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/101 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:26:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/101 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/101 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:26:01] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/101 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 16 (OVERLAPS) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 119 constraints, problems are : Problem set: 0 solved, 60 unsolved in 8054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11720ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 11721ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/380 places, 67/471 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11880 ms. Remains : 38/380 places, 67/471 transitions.
[2025-06-05 15:26:04] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:26:04] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:26:04] [INFO ] Input system was already deterministic with 67 transitions.
[2025-06-05 15:26:04] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:26:04] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:26:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6384314352988211875.gal : 1 ms
[2025-06-05 15:26:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12738489901472472171.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/CTLFireability6384314352988211875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12738489901472472171.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,2712,0.058877,4744,2,739,5,3921,6,0,213,4083,0


Converting to forward existential form...Done !
original formula: AG(EF((p116==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p116==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t10, t14, t19, t29, t30, t31, t32, t33, t47, t53, t61, t62, t63, Interse...245
(forward)formula 0,1,0.397114,11656,1,0,137,41735,150,60,1554,31373,142
FORMULA StigmergyElection-PT-03b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 15:26:05] [INFO ] Flatten gal took : 14 ms
[2025-06-05 15:26:05] [INFO ] Flatten gal took : 14 ms
Total runtime 1025024 ms.

BK_STOP 1749137165298

--------------------
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-03b"
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-03b, 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-174903490900186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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