Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900426.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 MedleyB-PT-B01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 6 09:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 155K Jun 5 20:08 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 MedleyB-PT-B01-CTLFireability-2025-00
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-01
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-02
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-03
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-04
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-05
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-06
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-07
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-08
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-09
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-10
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-11
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-12
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-13
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-14
FORMULA_NAME MedleyB-PT-B01-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749385538676

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-08 12:25:39] [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-08 12:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:25:40] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-08 12:25:40] [INFO ] Transformed 925 places.
[2025-06-08 12:25:40] [INFO ] Transformed 1037 transitions.
[2025-06-08 12:25:40] [INFO ] Found NUPN structural information;
[2025-06-08 12:25:40] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 122 out of 925 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 859 transition count 971
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 859 transition count 971
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 164 place count 827 transition count 939
Iterating global reduction 0 with 32 rules applied. Total rules applied 196 place count 827 transition count 939
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 210 place count 813 transition count 925
Iterating global reduction 0 with 14 rules applied. Total rules applied 224 place count 813 transition count 925
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 235 place count 802 transition count 914
Iterating global reduction 0 with 11 rules applied. Total rules applied 246 place count 802 transition count 914
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 251 place count 797 transition count 909
Iterating global reduction 0 with 5 rules applied. Total rules applied 256 place count 797 transition count 909
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 792 transition count 904
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 792 transition count 904
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 271 place count 787 transition count 899
Iterating global reduction 0 with 5 rules applied. Total rules applied 276 place count 787 transition count 899
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 281 place count 782 transition count 894
Iterating global reduction 0 with 5 rules applied. Total rules applied 286 place count 782 transition count 894
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 289 place count 779 transition count 891
Iterating global reduction 0 with 3 rules applied. Total rules applied 292 place count 779 transition count 891
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 778 transition count 890
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 778 transition count 890
Applied a total of 294 rules in 534 ms. Remains 778 /925 variables (removed 147) and now considering 890/1037 (removed 147) transitions.
// Phase 1: matrix 890 rows 778 cols
[2025-06-08 12:25:40] [INFO ] Computed 4 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:25:41] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-06-08 12:25:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:25:41] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Running 889 sub problems to find dead transitions.
[2025-06-08 12:25:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/777 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 1/778 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/1668 variables, and 4 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/778 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 889 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/777 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 1/778 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:33] [INFO ] Deduced a trap composed of 339 places in 412 ms of which 182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:33] [INFO ] Deduced a trap composed of 340 places in 428 ms of which 230 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:34] [INFO ] Deduced a trap composed of 358 places in 268 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:34] [INFO ] Deduced a trap composed of 361 places in 273 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:34] [INFO ] Deduced a trap composed of 348 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:35] [INFO ] Deduced a trap composed of 361 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:35] [INFO ] Deduced a trap composed of 350 places in 296 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:36] [INFO ] Deduced a trap composed of 344 places in 353 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:36] [INFO ] Deduced a trap composed of 350 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:39] [INFO ] Deduced a trap composed of 336 places in 190 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:39] [INFO ] Deduced a trap composed of 338 places in 291 ms of which 125 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 778/1668 variables, and 15 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/778 constraints, PredecessorRefiner: 0/889 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in LTL mode, iteration 1 : 778/925 places, 890/1037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62036 ms. Remains : 778/925 places, 890/1037 transitions.
Support contains 122 out of 778 places after structural reductions.
[2025-06-08 12:26:42] [INFO ] Flatten gal took : 76 ms
[2025-06-08 12:26:42] [INFO ] Flatten gal took : 38 ms
[2025-06-08 12:26:42] [INFO ] Input system was already deterministic with 890 transitions.
Support contains 118 out of 778 places (down from 122) after GAL structural reductions.
RANDOM walk for 40000 steps (590 resets) in 1930 ms. (20 steps per ms) remains 43/90 properties
BEST_FIRST walk for 4003 steps (15 resets) in 30 ms. (129 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (14 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (12 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (14 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (12 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (16 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (16 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (13 resets) in 44 ms. (88 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (15 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
[2025-06-08 12:26:43] [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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (OVERLAPS) 710/778 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:44] [INFO ] Deduced a trap composed of 348 places in 363 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:44] [INFO ] Deduced a trap composed of 336 places in 301 ms of which 102 ms to minimize.
Problem AtomicPropp2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:44] [INFO ] Deduced a trap composed of 339 places in 257 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:45] [INFO ] Deduced a trap composed of 350 places in 453 ms of which 239 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:45] [INFO ] Deduced a trap composed of 351 places in 193 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:46] [INFO ] Deduced a trap composed of 360 places in 278 ms of which 105 ms to minimize.
Problem AtomicPropp41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:46] [INFO ] Deduced a trap composed of 349 places in 202 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:46] [INFO ] Deduced a trap composed of 358 places in 274 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:47] [INFO ] Deduced a trap composed of 354 places in 276 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:47] [INFO ] Deduced a trap composed of 351 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:47] [INFO ] Deduced a trap composed of 356 places in 139 ms of which 7 ms to minimize.
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/778 variables, 11/15 constraints. Problems are: Problem set: 8 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:48] [INFO ] Deduced a trap composed of 353 places in 157 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/1668 variables, and 16 constraints, problems are : Problem set: 8 solved, 34 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/778 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 34 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 735/778 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/778 variables, 12/16 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/778 variables, 0/16 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 890/1668 variables, 778/794 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1668 variables, 34/828 constraints. Problems are: Problem set: 8 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1668/1668 variables, and 828 constraints, problems are : Problem set: 8 solved, 34 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 778/778 constraints, PredecessorRefiner: 34/42 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10044ms problems are : Problem set: 8 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 890/890 transitions.
Graph (trivial) has 664 edges and 778 vertex of which 26 / 778 are part of one of the 6 SCC in 7 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (complete) has 1064 edges and 758 vertex of which 755 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 755 transition count 370
Reduce places removed 489 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 495 rules applied. Total rules applied 989 place count 266 transition count 364
Reduce places removed 3 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 45 rules applied. Total rules applied 1034 place count 263 transition count 322
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 46 rules applied. Total rules applied 1080 place count 221 transition count 318
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1082 place count 219 transition count 318
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 43 Pre rules applied. Total rules applied 1082 place count 219 transition count 275
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1168 place count 176 transition count 275
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1176 place count 168 transition count 267
Iterating global reduction 5 with 8 rules applied. Total rules applied 1184 place count 168 transition count 267
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1188 place count 164 transition count 255
Iterating global reduction 5 with 4 rules applied. Total rules applied 1192 place count 164 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1193 place count 164 transition count 254
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1196 place count 161 transition count 251
Iterating global reduction 6 with 3 rules applied. Total rules applied 1199 place count 161 transition count 251
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1201 place count 159 transition count 249
Iterating global reduction 6 with 2 rules applied. Total rules applied 1203 place count 159 transition count 249
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1239 place count 141 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1241 place count 141 transition count 229
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1250 place count 132 transition count 202
Iterating global reduction 7 with 9 rules applied. Total rules applied 1259 place count 132 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1262 place count 132 transition count 199
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1265 place count 129 transition count 196
Iterating global reduction 8 with 3 rules applied. Total rules applied 1268 place count 129 transition count 196
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1271 place count 126 transition count 193
Iterating global reduction 8 with 3 rules applied. Total rules applied 1274 place count 126 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1277 place count 126 transition count 190
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 9 with 2 rules applied. Total rules applied 1279 place count 125 transition count 189
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 1295 place count 117 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1299 place count 117 transition count 203
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1301 place count 117 transition count 203
Applied a total of 1301 rules in 111 ms. Remains 117 /778 variables (removed 661) and now considering 203/890 (removed 687) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 117/778 places, 203/890 transitions.
RANDOM walk for 40000 steps (4042 resets) in 438 ms. (91 steps per ms) remains 15/34 properties
BEST_FIRST walk for 4004 steps (88 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (86 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (75 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (84 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (79 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (85 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (80 resets) in 9 ms. (400 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (88 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (87 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (75 resets) in 6 ms. (572 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (88 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (77 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (76 resets) in 10 ms. (364 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (82 resets) in 6 ms. (571 steps per ms) remains 14/14 properties
// Phase 1: matrix 203 rows 117 cols
[2025-06-08 12:26:53] [INFO ] Computed 4 invariants in 2 ms
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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 100/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 203/320 variables, 117/121 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/320 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 121 constraints, problems are : Problem set: 0 solved, 14 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 100/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:54] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:54] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 203/320 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 137 constraints, problems are : Problem set: 0 solved, 14 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1169ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 199 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2025-06-08 12:26:55] [INFO ] Flatten gal took : 33 ms
[2025-06-08 12:26:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyB-PT-B01-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-08 12:26:55] [INFO ] Flatten gal took : 30 ms
[2025-06-08 12:26:55] [INFO ] Input system was already deterministic with 890 transitions.
Support contains 81 out of 778 places (down from 90) after GAL structural reductions.
Computed a total of 136 stabilizing places and 142 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 756 transition count 868
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 756 transition count 868
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 63 place count 737 transition count 849
Iterating global reduction 0 with 19 rules applied. Total rules applied 82 place count 737 transition count 849
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 97 place count 722 transition count 834
Iterating global reduction 0 with 15 rules applied. Total rules applied 112 place count 722 transition count 834
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 126 place count 708 transition count 820
Iterating global reduction 0 with 14 rules applied. Total rules applied 140 place count 708 transition count 820
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 154 place count 694 transition count 806
Iterating global reduction 0 with 14 rules applied. Total rules applied 168 place count 694 transition count 806
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 182 place count 680 transition count 792
Iterating global reduction 0 with 14 rules applied. Total rules applied 196 place count 680 transition count 792
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 198 place count 680 transition count 790
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 208 place count 670 transition count 780
Iterating global reduction 1 with 10 rules applied. Total rules applied 218 place count 670 transition count 780
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 227 place count 661 transition count 771
Iterating global reduction 1 with 9 rules applied. Total rules applied 236 place count 661 transition count 771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 237 place count 661 transition count 770
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 242 place count 656 transition count 765
Iterating global reduction 2 with 5 rules applied. Total rules applied 247 place count 656 transition count 765
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 252 place count 651 transition count 760
Iterating global reduction 2 with 5 rules applied. Total rules applied 257 place count 651 transition count 760
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 260 place count 648 transition count 757
Iterating global reduction 2 with 3 rules applied. Total rules applied 263 place count 648 transition count 757
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 265 place count 646 transition count 755
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 646 transition count 755
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 269 place count 644 transition count 753
Iterating global reduction 2 with 2 rules applied. Total rules applied 271 place count 644 transition count 753
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 273 place count 642 transition count 751
Iterating global reduction 2 with 2 rules applied. Total rules applied 275 place count 642 transition count 751
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 277 place count 640 transition count 749
Iterating global reduction 2 with 2 rules applied. Total rules applied 279 place count 640 transition count 749
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 281 place count 638 transition count 747
Iterating global reduction 2 with 2 rules applied. Total rules applied 283 place count 638 transition count 747
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 285 place count 636 transition count 745
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 636 transition count 745
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 289 place count 634 transition count 743
Iterating global reduction 2 with 2 rules applied. Total rules applied 291 place count 634 transition count 743
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 293 place count 632 transition count 741
Iterating global reduction 2 with 2 rules applied. Total rules applied 295 place count 632 transition count 741
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 297 place count 630 transition count 739
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 630 transition count 739
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 628 transition count 737
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 628 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 628 transition count 736
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 627 transition count 735
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 627 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 627 transition count 734
Applied a total of 307 rules in 364 ms. Remains 627 /778 variables (removed 151) and now considering 734/890 (removed 156) transitions.
// Phase 1: matrix 734 rows 627 cols
[2025-06-08 12:26:55] [INFO ] Computed 4 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:26:56] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-06-08 12:26:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:26:56] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Running 733 sub problems to find dead transitions.
[2025-06-08 12:26:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 1/627 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:16] [INFO ] Deduced a trap composed of 289 places in 206 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:16] [INFO ] Deduced a trap composed of 290 places in 187 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:16] [INFO ] Deduced a trap composed of 297 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:17] [INFO ] Deduced a trap composed of 297 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:18] [INFO ] Deduced a trap composed of 301 places in 199 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:23] [INFO ] Deduced a trap composed of 303 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:26] [INFO ] Deduced a trap composed of 292 places in 246 ms of which 94 ms to minimize.
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 733 unsolved
Search for dead transitions found 0 dead transitions in 30143ms
Starting structural reductions in LTL mode, iteration 1 : 627/778 places, 734/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31324 ms. Remains : 627/778 places, 734/890 transitions.
[2025-06-08 12:27:26] [INFO ] Flatten gal took : 23 ms
[2025-06-08 12:27:26] [INFO ] Flatten gal took : 21 ms
[2025-06-08 12:27:26] [INFO ] Input system was already deterministic with 734 transitions.
[2025-06-08 12:27:26] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:27:26] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:27:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2249280251484191943.gal : 15 ms
[2025-06-08 12:27:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17553835532516968410.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2249280251484191943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17553835532516968410.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:27:56] [INFO ] Flatten gal took : 18 ms
[2025-06-08 12:27:56] [INFO ] Applying decomposition
[2025-06-08 12:27:57] [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/graph1120736993217208198.txt' '-o' '/tmp/graph1120736993217208198.bin' '-w' '/tmp/graph1120736993217208198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1120736993217208198.bin' '-l' '-1' '-v' '-w' '/tmp/graph1120736993217208198.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:27:57] [INFO ] Decomposing Gal with order
[2025-06-08 12:27:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:27:57] [INFO ] Removed a total of 396 redundant transitions.
[2025-06-08 12:27:57] [INFO ] Flatten gal took : 88 ms
[2025-06-08 12:27:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 15 ms.
[2025-06-08 12:27:57] [INFO ] Time to serialize gal into /tmp/CTLFireability3065600571410234517.gal : 11 ms
[2025-06-08 12:27:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6858981181584019252.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/CTLFireability3065600571410234517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6858981181584019252.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.32133e+07,1.7299,64364,1318,19,121968,535,907,290187,58,1165,0


Converting to forward existential form...Done !
original formula: A((i17.u136.p472==1) U ((EG(EF(AX((i0.u63.p219==1)))) + AG(!(E((i22.u177.p655==1) U (i3.u28.p83==1))))) + EF(AG((i23.u25.p69==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(((EG(E(TRUE U !(EX(!((i0.u63.p219==1)))))) + !(E(TRUE U !(!(E((i22.u177.p655==1) U (i3.u28.p83=...569
Reverse transition relation is NOT exact ! Due to transitions t16, t69, t151, t241, t275, t386, t419, t515, t516, t574, t590, t591, t594, t597, t602, t605,...492
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 752 transition count 864
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 752 transition count 864
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 75 place count 729 transition count 841
Iterating global reduction 0 with 23 rules applied. Total rules applied 98 place count 729 transition count 841
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 115 place count 712 transition count 824
Iterating global reduction 0 with 17 rules applied. Total rules applied 132 place count 712 transition count 824
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 148 place count 696 transition count 808
Iterating global reduction 0 with 16 rules applied. Total rules applied 164 place count 696 transition count 808
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 180 place count 680 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 196 place count 680 transition count 792
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 212 place count 664 transition count 776
Iterating global reduction 0 with 16 rules applied. Total rules applied 228 place count 664 transition count 776
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 230 place count 664 transition count 774
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 242 place count 652 transition count 762
Iterating global reduction 1 with 12 rules applied. Total rules applied 254 place count 652 transition count 762
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 265 place count 641 transition count 751
Iterating global reduction 1 with 11 rules applied. Total rules applied 276 place count 641 transition count 751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 277 place count 641 transition count 750
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 284 place count 634 transition count 743
Iterating global reduction 2 with 7 rules applied. Total rules applied 291 place count 634 transition count 743
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 297 place count 628 transition count 737
Iterating global reduction 2 with 6 rules applied. Total rules applied 303 place count 628 transition count 737
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 307 place count 624 transition count 733
Iterating global reduction 2 with 4 rules applied. Total rules applied 311 place count 624 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 313 place count 622 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 315 place count 622 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 317 place count 620 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 620 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 321 place count 618 transition count 727
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 618 transition count 727
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 325 place count 616 transition count 725
Iterating global reduction 2 with 2 rules applied. Total rules applied 327 place count 616 transition count 725
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 329 place count 614 transition count 723
Iterating global reduction 2 with 2 rules applied. Total rules applied 331 place count 614 transition count 723
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 333 place count 612 transition count 721
Iterating global reduction 2 with 2 rules applied. Total rules applied 335 place count 612 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 337 place count 610 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 610 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 341 place count 608 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 343 place count 608 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 344 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 345 place count 607 transition count 715
Iterating global reduction 3 with 1 rules applied. Total rules applied 346 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 347 place count 606 transition count 714
Iterating global reduction 3 with 1 rules applied. Total rules applied 348 place count 606 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 349 place count 606 transition count 713
Applied a total of 349 rules in 334 ms. Remains 606 /778 variables (removed 172) and now considering 713/890 (removed 177) transitions.
// Phase 1: matrix 713 rows 606 cols
[2025-06-08 12:28:27] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:28:28] [INFO ] Implicit Places using invariants in 331 ms returned []
[2025-06-08 12:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:28:28] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2025-06-08 12:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/606 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:50] [INFO ] Deduced a trap composed of 289 places in 226 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:50] [INFO ] Deduced a trap composed of 296 places in 213 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:50] [INFO ] Deduced a trap composed of 309 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:52] [INFO ] Deduced a trap composed of 304 places in 213 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:53] [INFO ] Deduced a trap composed of 290 places in 207 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:53] [INFO ] Deduced a trap composed of 303 places in 207 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:54] [INFO ] Deduced a trap composed of 289 places in 291 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:54] [INFO ] Deduced a trap composed of 297 places in 219 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:54] [INFO ] Deduced a trap composed of 297 places in 168 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:56] [INFO ] Deduced a trap composed of 291 places in 291 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:57] [INFO ] Deduced a trap composed of 290 places in 227 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:58] [INFO ] Deduced a trap composed of 290 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:58] [INFO ] Deduced a trap composed of 297 places in 146 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1319 variables, and 17 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/606 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/606 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:12] [INFO ] Deduced a trap composed of 297 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:12] [INFO ] Deduced a trap composed of 303 places in 206 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:15] [INFO ] Deduced a trap composed of 291 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:15] [INFO ] Deduced a trap composed of 310 places in 155 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/1319 variables, and 21 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/606 constraints, PredecessorRefiner: 0/712 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 606/778 places, 713/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61281 ms. Remains : 606/778 places, 713/890 transitions.
[2025-06-08 12:29:28] [INFO ] Flatten gal took : 17 ms
[2025-06-08 12:29:28] [INFO ] Flatten gal took : 15 ms
[2025-06-08 12:29:28] [INFO ] Input system was already deterministic with 713 transitions.
[2025-06-08 12:29:28] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:29:28] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:29:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3762523113961092286.gal : 4 ms
[2025-06-08 12:29:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15240967233537847718.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/CTLFireability3762523113961092286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15240967233537847718.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(AF(((p263==1) + (!(A((p736==1) U (p693==1))) * (EF((p328==1)) + (p910==1))))) U ((!(EF(AG(((p526==1)&&(p923==1))))) + !(AF((p702==1))))...287
=> equivalent forward existential formula: ([(EY(((EY((FwdU(Init,!(EG(!(((p263==1) + (!(!((E(!((p693==1)) U (!((p736==1)) * !((p693==1)))) + EG(!((p693==1)...674
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t148, t149, t150, t203, t206, t240, t251, t266, t275, t328, t329, t330, t...398
Detected timeout of ITS tools.
[2025-06-08 12:29:58] [INFO ] Flatten gal took : 15 ms
[2025-06-08 12:29:58] [INFO ] Applying decomposition
[2025-06-08 12:29:58] [INFO ] Flatten gal took : 14 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/graph11512573856288710946.txt' '-o' '/tmp/graph11512573856288710946.bin' '-w' '/tmp/graph11512573856288710946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11512573856288710946.bin' '-l' '-1' '-v' '-w' '/tmp/graph11512573856288710946.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:29:58] [INFO ] Decomposing Gal with order
[2025-06-08 12:29:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:29:59] [INFO ] Removed a total of 391 redundant transitions.
[2025-06-08 12:29:59] [INFO ] Flatten gal took : 30 ms
[2025-06-08 12:29:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2025-06-08 12:29:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16112177760925902881.gal : 5 ms
[2025-06-08 12:29:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16394014917117647736.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/CTLFireability16112177760925902881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16394014917117647736.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,6.82341e+07,0.273233,15560,1053,22,22557,366,957,34377,61,615,0


Converting to forward existential form...Done !
original formula: E(AF(((i6.u63.p263==1) + (!(A((i23.i1.i1.u203.p736==1) U (i19.u184.p693==1))) * (EF((i10.i0.i0.u81.p328==1)) + (i27.u235.p910==1))))) U (...442
=> equivalent forward existential formula: ([(EY(((EY((FwdU(Init,!(EG(!(((i6.u63.p263==1) + (!(!((E(!((i19.u184.p693==1)) U (!((i23.i1.i1.u203.p736==1)) * ...952
Reverse transition relation is NOT exact ! Due to transitions t150, t206, t240, t275, t386, t501, t573, t574, t577, t580, t585, t588, t591, t592, t595, t59...490
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Fast SCC detection found an SCC at level 8
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
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 755 transition count 867
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 755 transition count 867
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 67 place count 734 transition count 846
Iterating global reduction 0 with 21 rules applied. Total rules applied 88 place count 734 transition count 846
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 102 place count 720 transition count 832
Iterating global reduction 0 with 14 rules applied. Total rules applied 116 place count 720 transition count 832
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 129 place count 707 transition count 819
Iterating global reduction 0 with 13 rules applied. Total rules applied 142 place count 707 transition count 819
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 155 place count 694 transition count 806
Iterating global reduction 0 with 13 rules applied. Total rules applied 168 place count 694 transition count 806
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 181 place count 681 transition count 793
Iterating global reduction 0 with 13 rules applied. Total rules applied 194 place count 681 transition count 793
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 195 place count 681 transition count 792
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 204 place count 672 transition count 783
Iterating global reduction 1 with 9 rules applied. Total rules applied 213 place count 672 transition count 783
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 221 place count 664 transition count 775
Iterating global reduction 1 with 8 rules applied. Total rules applied 229 place count 664 transition count 775
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 233 place count 660 transition count 771
Iterating global reduction 1 with 4 rules applied. Total rules applied 237 place count 660 transition count 771
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 241 place count 656 transition count 767
Iterating global reduction 1 with 4 rules applied. Total rules applied 245 place count 656 transition count 767
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 248 place count 653 transition count 764
Iterating global reduction 1 with 3 rules applied. Total rules applied 251 place count 653 transition count 764
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 252 place count 652 transition count 763
Iterating global reduction 1 with 1 rules applied. Total rules applied 253 place count 652 transition count 763
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 254 place count 651 transition count 762
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 651 transition count 762
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 256 place count 650 transition count 761
Iterating global reduction 1 with 1 rules applied. Total rules applied 257 place count 650 transition count 761
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 258 place count 649 transition count 760
Iterating global reduction 1 with 1 rules applied. Total rules applied 259 place count 649 transition count 760
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 260 place count 648 transition count 759
Iterating global reduction 1 with 1 rules applied. Total rules applied 261 place count 648 transition count 759
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 262 place count 647 transition count 758
Iterating global reduction 1 with 1 rules applied. Total rules applied 263 place count 647 transition count 758
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 264 place count 646 transition count 757
Iterating global reduction 1 with 1 rules applied. Total rules applied 265 place count 646 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 266 place count 645 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 645 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 268 place count 644 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 269 place count 644 transition count 755
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 270 place count 643 transition count 754
Iterating global reduction 1 with 1 rules applied. Total rules applied 271 place count 643 transition count 754
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 272 place count 642 transition count 753
Iterating global reduction 1 with 1 rules applied. Total rules applied 273 place count 642 transition count 753
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 274 place count 642 transition count 752
Applied a total of 274 rules in 373 ms. Remains 642 /778 variables (removed 136) and now considering 752/890 (removed 138) transitions.
// Phase 1: matrix 752 rows 642 cols
[2025-06-08 12:30:29] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:29] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-08 12:30:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:30] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Running 751 sub problems to find dead transitions.
[2025-06-08 12:30:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (OVERLAPS) 1/642 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:54] [INFO ] Deduced a trap composed of 298 places in 248 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:55] [INFO ] Deduced a trap composed of 320 places in 217 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:56] [INFO ] Deduced a trap composed of 293 places in 224 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:58] [INFO ] Deduced a trap composed of 292 places in 318 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:58] [INFO ] Deduced a trap composed of 311 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:59] [INFO ] Deduced a trap composed of 320 places in 233 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:59] [INFO ] Deduced a trap composed of 292 places in 222 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:00] [INFO ] Deduced a trap composed of 306 places in 173 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/1394 variables, and 12 constraints, problems are : Problem set: 0 solved, 751 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/642 constraints, PredecessorRefiner: 751/751 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 751 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (OVERLAPS) 1/642 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:18] [INFO ] Deduced a trap composed of 306 places in 265 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:18] [INFO ] Deduced a trap composed of 294 places in 216 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:19] [INFO ] Deduced a trap composed of 328 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:19] [INFO ] Deduced a trap composed of 299 places in 191 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:19] [INFO ] Deduced a trap composed of 328 places in 183 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:27] [INFO ] Deduced a trap composed of 306 places in 207 ms of which 67 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/1394 variables, and 18 constraints, problems are : Problem set: 0 solved, 751 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/642 constraints, PredecessorRefiner: 0/751 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 751 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 642/778 places, 752/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61284 ms. Remains : 642/778 places, 752/890 transitions.
[2025-06-08 12:31:30] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:31:30] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:31:30] [INFO ] Input system was already deterministic with 752 transitions.
[2025-06-08 12:31:30] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:31:30] [INFO ] Flatten gal took : 15 ms
[2025-06-08 12:31:30] [INFO ] Time to serialize gal into /tmp/CTLFireability924513031746284353.gal : 4 ms
[2025-06-08 12:31:30] [INFO ] Time to serialize properties into /tmp/CTLFireability9770256099746267049.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/CTLFireability924513031746284353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9770256099746267049.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.75644e+07,4.25501,113580,2,13143,5,356560,6,0,3322,497442,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:32:00] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:32:00] [INFO ] Applying decomposition
[2025-06-08 12:32:00] [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/graph1275697833424976579.txt' '-o' '/tmp/graph1275697833424976579.bin' '-w' '/tmp/graph1275697833424976579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1275697833424976579.bin' '-l' '-1' '-v' '-w' '/tmp/graph1275697833424976579.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:32:00] [INFO ] Decomposing Gal with order
[2025-06-08 12:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:32:00] [INFO ] Removed a total of 385 redundant transitions.
[2025-06-08 12:32:00] [INFO ] Flatten gal took : 64 ms
[2025-06-08 12:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 24 ms.
[2025-06-08 12:32:00] [INFO ] Time to serialize gal into /tmp/CTLFireability13664505228516824214.gal : 6 ms
[2025-06-08 12:32:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14403568383513407261.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/CTLFireability13664505228516824214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14403568383513407261.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.75644e+07,2.27652,77564,1255,21,154923,618,944,286614,61,1263,0


Converting to forward existential form...Done !
original formula: EG(AX((!(E(((i26.u217.p787==1)||(i23.u201.p734==1)) U ((i28.u241.p898==1)||(i15.u141.p515==1)))) + ((EG((i25.u209.p759==0)) * ((i5.u48.p1...226
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(E(((i26.u217.p787==1)||(i23.u201.p734==1)) U ((i28.u241.p898==1)||(i15.u141.p515==1)))) + (...275
Reverse transition relation is NOT exact ! Due to transitions t25, t70, t110, t173, t263, t293, t404, t437, t476, t532, t604, t605, t611, t614, t619, t622,...508
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 754 transition count 866
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 754 transition count 866
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 69 place count 733 transition count 845
Iterating global reduction 0 with 21 rules applied. Total rules applied 90 place count 733 transition count 845
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 105 place count 718 transition count 830
Iterating global reduction 0 with 15 rules applied. Total rules applied 120 place count 718 transition count 830
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 134 place count 704 transition count 816
Iterating global reduction 0 with 14 rules applied. Total rules applied 148 place count 704 transition count 816
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 162 place count 690 transition count 802
Iterating global reduction 0 with 14 rules applied. Total rules applied 176 place count 690 transition count 802
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 190 place count 676 transition count 788
Iterating global reduction 0 with 14 rules applied. Total rules applied 204 place count 676 transition count 788
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 216 place count 664 transition count 776
Iterating global reduction 0 with 12 rules applied. Total rules applied 228 place count 664 transition count 776
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 239 place count 653 transition count 765
Iterating global reduction 0 with 11 rules applied. Total rules applied 250 place count 653 transition count 765
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 251 place count 653 transition count 764
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 258 place count 646 transition count 757
Iterating global reduction 1 with 7 rules applied. Total rules applied 265 place count 646 transition count 757
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 272 place count 639 transition count 750
Iterating global reduction 1 with 7 rules applied. Total rules applied 279 place count 639 transition count 750
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 284 place count 634 transition count 745
Iterating global reduction 1 with 5 rules applied. Total rules applied 289 place count 634 transition count 745
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 292 place count 631 transition count 742
Iterating global reduction 1 with 3 rules applied. Total rules applied 295 place count 631 transition count 742
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 298 place count 628 transition count 739
Iterating global reduction 1 with 3 rules applied. Total rules applied 301 place count 628 transition count 739
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 304 place count 625 transition count 736
Iterating global reduction 1 with 3 rules applied. Total rules applied 307 place count 625 transition count 736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 310 place count 622 transition count 733
Iterating global reduction 1 with 3 rules applied. Total rules applied 313 place count 622 transition count 733
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 316 place count 619 transition count 730
Iterating global reduction 1 with 3 rules applied. Total rules applied 319 place count 619 transition count 730
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 322 place count 616 transition count 727
Iterating global reduction 1 with 3 rules applied. Total rules applied 325 place count 616 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 328 place count 613 transition count 724
Iterating global reduction 1 with 3 rules applied. Total rules applied 331 place count 613 transition count 724
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 334 place count 610 transition count 721
Iterating global reduction 1 with 3 rules applied. Total rules applied 337 place count 610 transition count 721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 338 place count 610 transition count 720
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 340 place count 608 transition count 718
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 608 transition count 718
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 344 place count 606 transition count 716
Iterating global reduction 2 with 2 rules applied. Total rules applied 346 place count 606 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 606 transition count 715
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 348 place count 605 transition count 714
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 605 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 605 transition count 713
Applied a total of 350 rules in 364 ms. Remains 605 /778 variables (removed 173) and now considering 713/890 (removed 177) transitions.
// Phase 1: matrix 713 rows 605 cols
[2025-06-08 12:32:31] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:32:31] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-06-08 12:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:32:32] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2025-06-08 12:32:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/605 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:53] [INFO ] Deduced a trap composed of 295 places in 233 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:53] [INFO ] Deduced a trap composed of 295 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:55] [INFO ] Deduced a trap composed of 291 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:56] [INFO ] Deduced a trap composed of 290 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:56] [INFO ] Deduced a trap composed of 290 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:58] [INFO ] Deduced a trap composed of 297 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:59] [INFO ] Deduced a trap composed of 296 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:59] [INFO ] Deduced a trap composed of 291 places in 210 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:00] [INFO ] Deduced a trap composed of 296 places in 208 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:00] [INFO ] Deduced a trap composed of 297 places in 197 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:00] [INFO ] Deduced a trap composed of 303 places in 251 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:01] [INFO ] Deduced a trap composed of 303 places in 213 ms of which 54 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 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(timeout
s313 0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1318 variables, and 16 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/605 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/605 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:17] [INFO ] Deduced a trap composed of 296 places in 220 ms of which 66 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/605 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/1318 variables, and 17 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/605 constraints, PredecessorRefiner: 0/712 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 605/778 places, 713/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61287 ms. Remains : 605/778 places, 713/890 transitions.
[2025-06-08 12:33:32] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:33:32] [INFO ] Flatten gal took : 13 ms
[2025-06-08 12:33:32] [INFO ] Input system was already deterministic with 713 transitions.
[2025-06-08 12:33:32] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:33:32] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:33:32] [INFO ] Time to serialize gal into /tmp/CTLFireability405465481084547604.gal : 3 ms
[2025-06-08 12:33:32] [INFO ] Time to serialize properties into /tmp/CTLFireability12900513186236407034.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/CTLFireability405465481084547604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12900513186236407034.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,6.80661e+07,4.45429,110416,2,12944,5,346910,6,0,3135,488951,0


Converting to forward existential form...Done !
original formula: EX(EF(((p844==1) + EX(EF((p210==1))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * (p844==1))] != FALSE + [(FwdU(EY(FwdU(EY(Init),TRUE)),TRUE) * (p210==1))] != FALSE)
(forward)formula 0,1,7.05144,112592,1,0,8,347395,9,1,6234,488951,4
FORMULA MedleyB-PT-B01-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 753 transition count 865
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 753 transition count 865
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 72 place count 731 transition count 843
Iterating global reduction 0 with 22 rules applied. Total rules applied 94 place count 731 transition count 843
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 110 place count 715 transition count 827
Iterating global reduction 0 with 16 rules applied. Total rules applied 126 place count 715 transition count 827
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 141 place count 700 transition count 812
Iterating global reduction 0 with 15 rules applied. Total rules applied 156 place count 700 transition count 812
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 170 place count 686 transition count 798
Iterating global reduction 0 with 14 rules applied. Total rules applied 184 place count 686 transition count 798
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 198 place count 672 transition count 784
Iterating global reduction 0 with 14 rules applied. Total rules applied 212 place count 672 transition count 784
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 214 place count 672 transition count 782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 225 place count 661 transition count 771
Iterating global reduction 1 with 11 rules applied. Total rules applied 236 place count 661 transition count 771
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 246 place count 651 transition count 761
Iterating global reduction 1 with 10 rules applied. Total rules applied 256 place count 651 transition count 761
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 263 place count 644 transition count 754
Iterating global reduction 1 with 7 rules applied. Total rules applied 270 place count 644 transition count 754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 277 place count 637 transition count 747
Iterating global reduction 1 with 7 rules applied. Total rules applied 284 place count 637 transition count 747
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 289 place count 632 transition count 742
Iterating global reduction 1 with 5 rules applied. Total rules applied 294 place count 632 transition count 742
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 297 place count 629 transition count 739
Iterating global reduction 1 with 3 rules applied. Total rules applied 300 place count 629 transition count 739
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 303 place count 626 transition count 736
Iterating global reduction 1 with 3 rules applied. Total rules applied 306 place count 626 transition count 736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 309 place count 623 transition count 733
Iterating global reduction 1 with 3 rules applied. Total rules applied 312 place count 623 transition count 733
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 315 place count 620 transition count 730
Iterating global reduction 1 with 3 rules applied. Total rules applied 318 place count 620 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 320 place count 618 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 322 place count 618 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 324 place count 616 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 326 place count 616 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 328 place count 614 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 330 place count 614 transition count 724
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 332 place count 612 transition count 722
Iterating global reduction 1 with 2 rules applied. Total rules applied 334 place count 612 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 335 place count 612 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 336 place count 611 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 337 place count 611 transition count 720
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 338 place count 610 transition count 719
Iterating global reduction 2 with 1 rules applied. Total rules applied 339 place count 610 transition count 719
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 340 place count 609 transition count 718
Iterating global reduction 2 with 1 rules applied. Total rules applied 341 place count 609 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 342 place count 609 transition count 717
Applied a total of 342 rules in 344 ms. Remains 609 /778 variables (removed 169) and now considering 717/890 (removed 173) transitions.
// Phase 1: matrix 717 rows 609 cols
[2025-06-08 12:33:39] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:33:39] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-08 12:33:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:33:40] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 716 sub problems to find dead transitions.
[2025-06-08 12:33:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 716 unsolved
At refinement iteration 1 (OVERLAPS) 1/609 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 716 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:02] [INFO ] Deduced a trap composed of 295 places in 246 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:03] [INFO ] Deduced a trap composed of 301 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:05] [INFO ] Deduced a trap composed of 295 places in 283 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:05] [INFO ] Deduced a trap composed of 297 places in 185 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:06] [INFO ] Deduced a trap composed of 300 places in 246 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:07] [INFO ] Deduced a trap composed of 291 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:08] [INFO ] Deduced a trap composed of 290 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:08] [INFO ] Deduced a trap composed of 296 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:09] [INFO ] Deduced a trap composed of 296 places in 204 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:09] [INFO ] Deduced a trap composed of 290 places in 209 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:09] [INFO ] Deduced a trap composed of 303 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:10] [INFO ] Deduced a trap composed of 303 places in 211 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:10] [INFO ] Deduced a trap composed of 306 places in 264 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:10] [INFO ] Deduced a trap composed of 307 places in 173 ms of which 25 ms to minimize.
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 0 solved, 716 unsolved
Search for dead transitions found 0 dead transitions in 30147ms
Starting structural reductions in LTL mode, iteration 1 : 609/778 places, 717/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31253 ms. Remains : 609/778 places, 717/890 transitions.
[2025-06-08 12:34:10] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:34:10] [INFO ] Flatten gal took : 12 ms
[2025-06-08 12:34:10] [INFO ] Input system was already deterministic with 717 transitions.
[2025-06-08 12:34:10] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:34:10] [INFO ] Flatten gal took : 12 ms
[2025-06-08 12:34:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2594429057604664409.gal : 2 ms
[2025-06-08 12:34:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11549743450522016559.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/CTLFireability2594429057604664409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11549743450522016559.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:34:40] [INFO ] Flatten gal took : 12 ms
[2025-06-08 12:34:40] [INFO ] Applying decomposition
[2025-06-08 12:34:40] [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/graph12795164764087924617.txt' '-o' '/tmp/graph12795164764087924617.bin' '-w' '/tmp/graph12795164764087924617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12795164764087924617.bin' '-l' '-1' '-v' '-w' '/tmp/graph12795164764087924617.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:34:40] [INFO ] Decomposing Gal with order
[2025-06-08 12:34:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:34:40] [INFO ] Removed a total of 389 redundant transitions.
[2025-06-08 12:34:40] [INFO ] Flatten gal took : 26 ms
[2025-06-08 12:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 18 ms.
[2025-06-08 12:34:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10804420908291297272.gal : 5 ms
[2025-06-08 12:34:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12925517127034177866.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/CTLFireability10804420908291297272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12925517127034177866.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,6.90414e+07,0.256723,13888,1111,22,18296,457,977,27880,73,850,0


Converting to forward existential form...Done !
original formula: AF((AX((i5.u55.p248==1)) * (!(A(AG((i5.u55.p248==1)) U (((i1.i0.i0.u7.p29!=1)&&(i10.u2.p252==1))&&((i10.u75.p553==1)&&(i10.u214.p854==1))...308
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((i5.u55.p248==1)))) * (!(!((E(!((((i1.i0.i0.u7.p29!=1)&&(i10.u2.p252==1))&&((i10.u75.p553==...637
Reverse transition relation is NOT exact ! Due to transitions t68, t156, t212, t272, t392, t452, t507, t579, t580, t583, t586, t591, t594, t597, t598, t601...500
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 753 transition count 865
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 753 transition count 865
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 72 place count 731 transition count 843
Iterating global reduction 0 with 22 rules applied. Total rules applied 94 place count 731 transition count 843
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 110 place count 715 transition count 827
Iterating global reduction 0 with 16 rules applied. Total rules applied 126 place count 715 transition count 827
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 142 place count 699 transition count 811
Iterating global reduction 0 with 16 rules applied. Total rules applied 158 place count 699 transition count 811
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 174 place count 683 transition count 795
Iterating global reduction 0 with 16 rules applied. Total rules applied 190 place count 683 transition count 795
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 206 place count 667 transition count 779
Iterating global reduction 0 with 16 rules applied. Total rules applied 222 place count 667 transition count 779
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 224 place count 667 transition count 777
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 236 place count 655 transition count 765
Iterating global reduction 1 with 12 rules applied. Total rules applied 248 place count 655 transition count 765
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 259 place count 644 transition count 754
Iterating global reduction 1 with 11 rules applied. Total rules applied 270 place count 644 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 271 place count 644 transition count 753
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 278 place count 637 transition count 746
Iterating global reduction 2 with 7 rules applied. Total rules applied 285 place count 637 transition count 746
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 292 place count 630 transition count 739
Iterating global reduction 2 with 7 rules applied. Total rules applied 299 place count 630 transition count 739
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 304 place count 625 transition count 734
Iterating global reduction 2 with 5 rules applied. Total rules applied 309 place count 625 transition count 734
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 311 place count 623 transition count 732
Iterating global reduction 2 with 2 rules applied. Total rules applied 313 place count 623 transition count 732
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 315 place count 621 transition count 730
Iterating global reduction 2 with 2 rules applied. Total rules applied 317 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 319 place count 619 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 321 place count 619 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 323 place count 617 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 325 place count 617 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 327 place count 615 transition count 724
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 615 transition count 724
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 331 place count 613 transition count 722
Iterating global reduction 2 with 2 rules applied. Total rules applied 333 place count 613 transition count 722
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 335 place count 611 transition count 720
Iterating global reduction 2 with 2 rules applied. Total rules applied 337 place count 611 transition count 720
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 339 place count 609 transition count 718
Iterating global reduction 2 with 2 rules applied. Total rules applied 341 place count 609 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 342 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 343 place count 608 transition count 716
Iterating global reduction 3 with 1 rules applied. Total rules applied 344 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 345 place count 607 transition count 715
Iterating global reduction 3 with 1 rules applied. Total rules applied 346 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 347 place count 606 transition count 714
Iterating global reduction 3 with 1 rules applied. Total rules applied 348 place count 606 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 349 place count 606 transition count 713
Applied a total of 349 rules in 364 ms. Remains 606 /778 variables (removed 172) and now considering 713/890 (removed 177) transitions.
// Phase 1: matrix 713 rows 606 cols
[2025-06-08 12:35:11] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:35:11] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-06-08 12:35:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:35:12] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2025-06-08 12:35: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/605 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/606 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:33] [INFO ] Deduced a trap composed of 296 places in 230 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:34] [INFO ] Deduced a trap composed of 300 places in 219 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:35] [INFO ] Deduced a trap composed of 292 places in 209 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:36] [INFO ] Deduced a trap composed of 290 places in 216 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:37] [INFO ] Deduced a trap composed of 290 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:37] [INFO ] Deduced a trap composed of 296 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:37] [INFO ] Deduced a trap composed of 297 places in 237 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:38] [INFO ] Deduced a trap composed of 300 places in 267 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:40] [INFO ] Deduced a trap composed of 290 places in 257 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:41] [INFO ] Deduced a trap composed of 290 places in 186 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:41] [INFO ] Deduced a trap composed of 297 places in 209 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:42] [INFO ] Deduced a trap composed of 307 places in 177 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1319 variables, and 16 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/606 constraints, PredecessorRefiner: 712/712 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (OVERLAPS) 1/606 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:57] [INFO ] Deduced a trap composed of 292 places in 211 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:59] [INFO ] Deduced a trap composed of 307 places in 185 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:01] [INFO ] Deduced a trap composed of 302 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:04] [INFO ] Deduced a trap composed of 302 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:05] [INFO ] Deduced a trap composed of 291 places in 151 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/1319 variables, and 21 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/606 constraints, PredecessorRefiner: 0/712 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 606/778 places, 713/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61351 ms. Remains : 606/778 places, 713/890 transitions.
[2025-06-08 12:36:12] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:36:12] [INFO ] Flatten gal took : 16 ms
[2025-06-08 12:36:12] [INFO ] Input system was already deterministic with 713 transitions.
[2025-06-08 12:36:12] [INFO ] Flatten gal took : 12 ms
[2025-06-08 12:36:12] [INFO ] Flatten gal took : 12 ms
[2025-06-08 12:36:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1960241879520516937.gal : 2 ms
[2025-06-08 12:36:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11327050504790026107.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/CTLFireability1960241879520516937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11327050504790026107.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:36:42] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:36:42] [INFO ] Applying decomposition
[2025-06-08 12:36:42] [INFO ] Flatten gal took : 11 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/graph1323610042046419592.txt' '-o' '/tmp/graph1323610042046419592.bin' '-w' '/tmp/graph1323610042046419592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1323610042046419592.bin' '-l' '-1' '-v' '-w' '/tmp/graph1323610042046419592.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:36:42] [INFO ] Decomposing Gal with order
[2025-06-08 12:36:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:36:42] [INFO ] Removed a total of 385 redundant transitions.
[2025-06-08 12:36:42] [INFO ] Flatten gal took : 26 ms
[2025-06-08 12:36:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2025-06-08 12:36:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6943985474615811564.gal : 5 ms
[2025-06-08 12:36:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6569239442498779982.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/CTLFireability6943985474615811564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6569239442498779982.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,6.79505e+07,0.23353,12332,1095,24,14785,541,852,18122,68,1028,0


Converting to forward existential form...Done !
original formula: AX(((i2.u27.p90==1) + EG(A(((!((i28.u209.p830==1)&&(i28.u232.p923==1)))||(i24.u202.p850==1)) U AG((i21.u173.p678==1))))))
=> equivalent forward existential formula: [((EY(Init) * !((i2.u27.p90==1))) * !(EG(!((E(!(!(E(TRUE U !((i21.u173.p678==1))))) U (!(((!((i28.u209.p830==1)&...298
Reverse transition relation is NOT exact ! Due to transitions t214, t216, t332, t448, t556, t559, t575, t576, t581, t584, t589, t592, t595, t596, t599, t60...502
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,10.0996,321964,1,0,637024,597,7554,1.04096e+06,337,1602,1265396
FORMULA MedleyB-PT-B01-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Graph (trivial) has 767 edges and 778 vertex of which 52 / 778 are part of one of the 9 SCC in 8 ms
Free SCC test removed 43 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 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 560 place count 734 transition count 281
Reduce places removed 559 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 566 rules applied. Total rules applied 1126 place count 175 transition count 274
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 1131 place count 172 transition count 272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1133 place count 170 transition count 272
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 1133 place count 170 transition count 238
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 1201 place count 136 transition count 238
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1217 place count 120 transition count 221
Iterating global reduction 4 with 16 rules applied. Total rules applied 1233 place count 120 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1233 place count 120 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1237 place count 118 transition count 219
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1246 place count 109 transition count 196
Iterating global reduction 4 with 9 rules applied. Total rules applied 1255 place count 109 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1258 place count 109 transition count 193
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1262 place count 105 transition count 188
Iterating global reduction 5 with 4 rules applied. Total rules applied 1266 place count 105 transition count 188
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1268 place count 103 transition count 186
Iterating global reduction 5 with 2 rules applied. Total rules applied 1270 place count 103 transition count 186
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1300 place count 88 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1304 place count 88 transition count 167
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1319 place count 73 transition count 131
Iterating global reduction 6 with 15 rules applied. Total rules applied 1334 place count 73 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1339 place count 73 transition count 126
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1348 place count 64 transition count 115
Iterating global reduction 7 with 9 rules applied. Total rules applied 1357 place count 64 transition count 115
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1366 place count 55 transition count 104
Iterating global reduction 7 with 9 rules applied. Total rules applied 1375 place count 55 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1381 place count 55 transition count 98
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 8 with 2 rules applied. Total rules applied 1383 place count 54 transition count 97
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1384 place count 53 transition count 94
Iterating global reduction 8 with 1 rules applied. Total rules applied 1385 place count 53 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1386 place count 53 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1389 place count 53 transition count 90
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 9 with 6 rules applied. Total rules applied 1395 place count 50 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1396 place count 49 transition count 86
Applied a total of 1396 rules in 81 ms. Remains 49 /778 variables (removed 729) and now considering 86/890 (removed 804) transitions.
[2025-06-08 12:36:52] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
// Phase 1: matrix 82 rows 49 cols
[2025-06-08 12:36:52] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:36:52] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-08 12:36:52] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2025-06-08 12:36:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:36:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-08 12:36:53] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:36:53] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2025-06-08 12:36:53] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2025-06-08 12:36:53] [INFO ] Invariant cache hit.
[2025-06-08 12:36: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/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:53] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:53] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:53] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:53] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:53] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:36:53] [INFO ] Deduced a trap composed of 23 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-08 12:36:53] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 81/130 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 66 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2820 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 81/130 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 79/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 145 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6133ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 6134ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/778 places, 86/890 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6404 ms. Remains : 49/778 places, 86/890 transitions.
[2025-06-08 12:36:59] [INFO ] Flatten gal took : 7 ms
[2025-06-08 12:36:59] [INFO ] Flatten gal took : 3 ms
[2025-06-08 12:36:59] [INFO ] Input system was already deterministic with 86 transitions.
RANDOM walk for 309 steps (38 resets) in 17 ms. (17 steps per ms) remains 0/1 properties
FORMULA MedleyB-PT-B01-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-08 12:36:59] [INFO ] Flatten gal took : 2 ms
[2025-06-08 12:36:59] [INFO ] Flatten gal took : 2 ms
[2025-06-08 12:36:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2829255594467416363.gal : 0 ms
[2025-06-08 12:36:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5501135763335818784.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2829255594467416363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5501135763335818784.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 753 transition count 865
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 753 transition count 865
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 73 place count 730 transition count 842
Iterating global reduction 0 with 23 rules applied. Total rules applied 96 place count 730 transition count 842
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 113 place count 713 transition count 825
Iterating global reduction 0 with 17 rules applied. Total rules applied 130 place count 713 transition count 825
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 146 place count 697 transition count 809
Iterating global reduction 0 with 16 rules applied. Total rules applied 162 place count 697 transition count 809
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 178 place count 681 transition count 793
Iterating global reduction 0 with 16 rules applied. Total rules applied 194 place count 681 transition count 793
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 209 place count 666 transition count 778
Iterating global reduction 0 with 15 rules applied. Total rules applied 224 place count 666 transition count 778
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 226 place count 666 transition count 776
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 237 place count 655 transition count 765
Iterating global reduction 1 with 11 rules applied. Total rules applied 248 place count 655 transition count 765
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 258 place count 645 transition count 755
Iterating global reduction 1 with 10 rules applied. Total rules applied 268 place count 645 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 269 place count 645 transition count 754
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 276 place count 638 transition count 747
Iterating global reduction 2 with 7 rules applied. Total rules applied 283 place count 638 transition count 747
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 290 place count 631 transition count 740
Iterating global reduction 2 with 7 rules applied. Total rules applied 297 place count 631 transition count 740
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 302 place count 626 transition count 735
Iterating global reduction 2 with 5 rules applied. Total rules applied 307 place count 626 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 309 place count 624 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 311 place count 624 transition count 733
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 312 place count 623 transition count 732
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 623 transition count 732
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 314 place count 622 transition count 731
Iterating global reduction 2 with 1 rules applied. Total rules applied 315 place count 622 transition count 731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 316 place count 621 transition count 730
Iterating global reduction 2 with 1 rules applied. Total rules applied 317 place count 621 transition count 730
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 620 transition count 729
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 620 transition count 729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 320 place count 619 transition count 728
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 619 transition count 728
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 322 place count 618 transition count 727
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 618 transition count 727
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 324 place count 617 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 325 place count 617 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 326 place count 616 transition count 725
Iterating global reduction 2 with 1 rules applied. Total rules applied 327 place count 616 transition count 725
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 328 place count 615 transition count 724
Iterating global reduction 2 with 1 rules applied. Total rules applied 329 place count 615 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 330 place count 615 transition count 723
Applied a total of 330 rules in 331 ms. Remains 615 /778 variables (removed 163) and now considering 723/890 (removed 167) transitions.
// Phase 1: matrix 723 rows 615 cols
[2025-06-08 12:36:59] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:36:59] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-06-08 12:36:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:37:00] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2025-06-08 12:37:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (OVERLAPS) 1/615 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:22] [INFO ] Deduced a trap composed of 292 places in 222 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:22] [INFO ] Deduced a trap composed of 293 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:24] [INFO ] Deduced a trap composed of 301 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:25] [INFO ] Deduced a trap composed of 300 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:28] [INFO ] Deduced a trap composed of 293 places in 232 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:29] [INFO ] Deduced a trap composed of 299 places in 205 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:29] [INFO ] Deduced a trap composed of 299 places in 314 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:29] [INFO ] Deduced a trap composed of 306 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:30] [INFO ] Deduced a trap composed of 300 places in 218 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:37:30] [INFO ] Deduced a trap composed of 307 places in 188 ms of which 24 ms to minimize.
SMT process timed out in 30088ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30089ms
Starting structural reductions in LTL mode, iteration 1 : 615/778 places, 723/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31137 ms. Remains : 615/778 places, 723/890 transitions.
[2025-06-08 12:37:30] [INFO ] Flatten gal took : 12 ms
[2025-06-08 12:37:30] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:37:30] [INFO ] Input system was already deterministic with 723 transitions.
[2025-06-08 12:37:30] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:37:30] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:37:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2580521721809774020.gal : 4 ms
[2025-06-08 12:37:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7441466864889955457.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/CTLFireability2580521721809774020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7441466864889955457.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,7.05065e+07,3.95057,110916,2,13072,5,352170,6,0,3185,475854,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:38:00] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:38:00] [INFO ] Applying decomposition
[2025-06-08 12:38:00] [INFO ] Flatten gal took : 19 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/graph9594390855111574310.txt' '-o' '/tmp/graph9594390855111574310.bin' '-w' '/tmp/graph9594390855111574310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9594390855111574310.bin' '-l' '-1' '-v' '-w' '/tmp/graph9594390855111574310.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:38:00] [INFO ] Decomposing Gal with order
[2025-06-08 12:38:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:38:00] [INFO ] Removed a total of 388 redundant transitions.
[2025-06-08 12:38:00] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:38:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-08 12:38:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17974379697885456549.gal : 5 ms
[2025-06-08 12:38:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10809389345489777661.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/CTLFireability17974379697885456549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10809389345489777661.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.05065e+07,0.287084,15504,1221,20,20892,393,927,37401,68,778,0


Converting to forward existential form...Done !
original formula: A((EF(EG((i10.u84.p325==1))) + (EG((i27.u58.p230==1)) * (!(((((i12.u100.p366==1)||((i15.u136.p497==1)&&(i27.u236.p923==1))) * E((i2.i0.i0...512
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((i10.u83.p323==1) + !((E(!((!(EX(!(((i1.u6.p25==1)&&(i27.u236.p908==1))))) * (i2.i1.i...1526
Reverse transition relation is NOT exact ! Due to transitions t96, t204, t207, t330, t387, t509, t565, t581, t582, t585, t586, t589, t594, t597, t601, t602...512
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an 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 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an 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 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 753 transition count 865
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 753 transition count 865
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 72 place count 731 transition count 843
Iterating global reduction 0 with 22 rules applied. Total rules applied 94 place count 731 transition count 843
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 111 place count 714 transition count 826
Iterating global reduction 0 with 17 rules applied. Total rules applied 128 place count 714 transition count 826
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 144 place count 698 transition count 810
Iterating global reduction 0 with 16 rules applied. Total rules applied 160 place count 698 transition count 810
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 176 place count 682 transition count 794
Iterating global reduction 0 with 16 rules applied. Total rules applied 192 place count 682 transition count 794
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 208 place count 666 transition count 778
Iterating global reduction 0 with 16 rules applied. Total rules applied 224 place count 666 transition count 778
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 226 place count 666 transition count 776
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 238 place count 654 transition count 764
Iterating global reduction 1 with 12 rules applied. Total rules applied 250 place count 654 transition count 764
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 261 place count 643 transition count 753
Iterating global reduction 1 with 11 rules applied. Total rules applied 272 place count 643 transition count 753
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 273 place count 643 transition count 752
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 280 place count 636 transition count 745
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 636 transition count 745
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 294 place count 629 transition count 738
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 629 transition count 738
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 306 place count 624 transition count 733
Iterating global reduction 2 with 5 rules applied. Total rules applied 311 place count 624 transition count 733
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 314 place count 621 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 317 place count 621 transition count 730
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 320 place count 618 transition count 727
Iterating global reduction 2 with 3 rules applied. Total rules applied 323 place count 618 transition count 727
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 326 place count 615 transition count 724
Iterating global reduction 2 with 3 rules applied. Total rules applied 329 place count 615 transition count 724
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 332 place count 612 transition count 721
Iterating global reduction 2 with 3 rules applied. Total rules applied 335 place count 612 transition count 721
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 338 place count 609 transition count 718
Iterating global reduction 2 with 3 rules applied. Total rules applied 341 place count 609 transition count 718
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 344 place count 606 transition count 715
Iterating global reduction 2 with 3 rules applied. Total rules applied 347 place count 606 transition count 715
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 350 place count 603 transition count 712
Iterating global reduction 2 with 3 rules applied. Total rules applied 353 place count 603 transition count 712
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 356 place count 600 transition count 709
Iterating global reduction 2 with 3 rules applied. Total rules applied 359 place count 600 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 360 place count 600 transition count 708
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 362 place count 598 transition count 706
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 598 transition count 706
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 366 place count 596 transition count 704
Iterating global reduction 3 with 2 rules applied. Total rules applied 368 place count 596 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 369 place count 596 transition count 703
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 370 place count 595 transition count 702
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 595 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 595 transition count 701
Applied a total of 372 rules in 323 ms. Remains 595 /778 variables (removed 183) and now considering 701/890 (removed 189) transitions.
// Phase 1: matrix 701 rows 595 cols
[2025-06-08 12:38:31] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:38:31] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-06-08 12:38:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:38:31] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-06-08 12:38: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/594 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (OVERLAPS) 1/595 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:52] [INFO ] Deduced a trap composed of 289 places in 241 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:52] [INFO ] Deduced a trap composed of 289 places in 209 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:53] [INFO ] Deduced a trap composed of 297 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:54] [INFO ] Deduced a trap composed of 291 places in 207 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:55] [INFO ] Deduced a trap composed of 290 places in 193 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:57] [INFO ] Deduced a trap composed of 292 places in 240 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:58] [INFO ] Deduced a trap composed of 290 places in 212 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:58] [INFO ] Deduced a trap composed of 291 places in 297 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:58] [INFO ] Deduced a trap composed of 296 places in 271 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:59] [INFO ] Deduced a trap composed of 297 places in 226 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:38:59] [INFO ] Deduced a trap composed of 297 places in 179 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/1296 variables, and 15 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (OVERLAPS) 1/595 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:10] [INFO ] Deduced a trap composed of 296 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:14] [INFO ] Deduced a trap composed of 292 places in 254 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:15] [INFO ] Deduced a trap composed of 292 places in 214 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:16] [INFO ] Deduced a trap composed of 291 places in 157 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:39:28] [INFO ] Deduced a trap composed of 290 places in 187 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/1296 variables, and 20 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 595/778 places, 701/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61281 ms. Remains : 595/778 places, 701/890 transitions.
[2025-06-08 12:39:32] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:39:32] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:39:32] [INFO ] Input system was already deterministic with 701 transitions.
[2025-06-08 12:39:32] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:39:32] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:39:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16417800256063823867.gal : 3 ms
[2025-06-08 12:39:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1549054309072931621.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/CTLFireability16417800256063823867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1549054309072931621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:40:02] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:40:02] [INFO ] Applying decomposition
[2025-06-08 12:40:02] [INFO ] Flatten gal took : 10 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/graph8774494704369259871.txt' '-o' '/tmp/graph8774494704369259871.bin' '-w' '/tmp/graph8774494704369259871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8774494704369259871.bin' '-l' '-1' '-v' '-w' '/tmp/graph8774494704369259871.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:40:02] [INFO ] Decomposing Gal with order
[2025-06-08 12:40:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:40:02] [INFO ] Removed a total of 385 redundant transitions.
[2025-06-08 12:40:02] [INFO ] Flatten gal took : 34 ms
[2025-06-08 12:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2025-06-08 12:40:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5293193293925807999.gal : 5 ms
[2025-06-08 12:40:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17619875945044630296.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/CTLFireability5293193293925807999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17619875945044630296.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.5532e+07,0.563819,22692,1060,22,35703,479,927,71974,61,845,0


Converting to forward existential form...Done !
original formula: EX(AG(A(EF((i18.u179.p671==1)) U (i18.u219.p854!=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!((E(!((i18.u219.p854!=1)) U (!(E(TRUE U (i18.u179.p671==1))) * !((i18.u219.p854!=1)))...200
Reverse transition relation is NOT exact ! Due to transitions t68, t150, t242, t323, t324, t377, t380, t440, t495, t567, t568, t571, t574, t579, t582, t585...494
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,6.53371,194468,1,0,372991,586,7876,843964,306,1407,980071
FORMULA MedleyB-PT-B01-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 752 transition count 864
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 752 transition count 864
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 75 place count 729 transition count 841
Iterating global reduction 0 with 23 rules applied. Total rules applied 98 place count 729 transition count 841
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 115 place count 712 transition count 824
Iterating global reduction 0 with 17 rules applied. Total rules applied 132 place count 712 transition count 824
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 148 place count 696 transition count 808
Iterating global reduction 0 with 16 rules applied. Total rules applied 164 place count 696 transition count 808
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 180 place count 680 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 196 place count 680 transition count 792
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 212 place count 664 transition count 776
Iterating global reduction 0 with 16 rules applied. Total rules applied 228 place count 664 transition count 776
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 230 place count 664 transition count 774
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 242 place count 652 transition count 762
Iterating global reduction 1 with 12 rules applied. Total rules applied 254 place count 652 transition count 762
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 265 place count 641 transition count 751
Iterating global reduction 1 with 11 rules applied. Total rules applied 276 place count 641 transition count 751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 277 place count 641 transition count 750
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 284 place count 634 transition count 743
Iterating global reduction 2 with 7 rules applied. Total rules applied 291 place count 634 transition count 743
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 298 place count 627 transition count 736
Iterating global reduction 2 with 7 rules applied. Total rules applied 305 place count 627 transition count 736
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 310 place count 622 transition count 731
Iterating global reduction 2 with 5 rules applied. Total rules applied 315 place count 622 transition count 731
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 318 place count 619 transition count 728
Iterating global reduction 2 with 3 rules applied. Total rules applied 321 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 324 place count 616 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 327 place count 616 transition count 725
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 330 place count 613 transition count 722
Iterating global reduction 2 with 3 rules applied. Total rules applied 333 place count 613 transition count 722
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 336 place count 610 transition count 719
Iterating global reduction 2 with 3 rules applied. Total rules applied 339 place count 610 transition count 719
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 342 place count 607 transition count 716
Iterating global reduction 2 with 3 rules applied. Total rules applied 345 place count 607 transition count 716
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 348 place count 604 transition count 713
Iterating global reduction 2 with 3 rules applied. Total rules applied 351 place count 604 transition count 713
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 354 place count 601 transition count 710
Iterating global reduction 2 with 3 rules applied. Total rules applied 357 place count 601 transition count 710
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 360 place count 598 transition count 707
Iterating global reduction 2 with 3 rules applied. Total rules applied 363 place count 598 transition count 707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 364 place count 598 transition count 706
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 366 place count 596 transition count 704
Iterating global reduction 3 with 2 rules applied. Total rules applied 368 place count 596 transition count 704
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 370 place count 594 transition count 702
Iterating global reduction 3 with 2 rules applied. Total rules applied 372 place count 594 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 373 place count 594 transition count 701
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 374 place count 593 transition count 700
Iterating global reduction 4 with 1 rules applied. Total rules applied 375 place count 593 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 376 place count 593 transition count 699
Applied a total of 376 rules in 339 ms. Remains 593 /778 variables (removed 185) and now considering 699/890 (removed 191) transitions.
// Phase 1: matrix 699 rows 593 cols
[2025-06-08 12:40:09] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:09] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-08 12:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:40:10] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2025-06-08 12:40:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:30] [INFO ] Deduced a trap composed of 289 places in 226 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:31] [INFO ] Deduced a trap composed of 289 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:33] [INFO ] Deduced a trap composed of 290 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:35] [INFO ] Deduced a trap composed of 290 places in 228 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:36] [INFO ] Deduced a trap composed of 290 places in 208 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:36] [INFO ] Deduced a trap composed of 291 places in 285 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:36] [INFO ] Deduced a trap composed of 291 places in 299 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:37] [INFO ] Deduced a trap composed of 296 places in 206 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:37] [INFO ] Deduced a trap composed of 296 places in 175 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:37] [INFO ] Deduced a trap composed of 297 places in 208 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:37] [INFO ] Deduced a trap composed of 297 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:38] [INFO ] Deduced a trap composed of 297 places in 208 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:38] [INFO ] Deduced a trap composed of 297 places in 166 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1292 variables, and 17 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:40:55] [INFO ] Deduced a trap composed of 290 places in 348 ms of which 130 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:41:05] [INFO ] Deduced a trap composed of 290 places in 206 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/1292 variables, and 19 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 0/698 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 593/778 places, 699/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61177 ms. Remains : 593/778 places, 699/890 transitions.
[2025-06-08 12:41:10] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:41:10] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:41:10] [INFO ] Input system was already deterministic with 699 transitions.
[2025-06-08 12:41:10] [INFO ] Flatten gal took : 19 ms
[2025-06-08 12:41:10] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:41:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16478625873378705587.gal : 2 ms
[2025-06-08 12:41:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8201967638687872140.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/CTLFireability16478625873378705587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8201967638687872140.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((EG((p16==1)) + EF((p350==1))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !((EG((p16==1)) + E(TRUE U (p350==1)))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t148, t149, t150, t203, t206, t240, t243, t258, t267, t320, t321, t322, t...392
Detected timeout of ITS tools.
[2025-06-08 12:41:40] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:41:40] [INFO ] Applying decomposition
[2025-06-08 12:41:40] [INFO ] Flatten gal took : 10 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/graph3028717122721992180.txt' '-o' '/tmp/graph3028717122721992180.bin' '-w' '/tmp/graph3028717122721992180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3028717122721992180.bin' '-l' '-1' '-v' '-w' '/tmp/graph3028717122721992180.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:41:40] [INFO ] Decomposing Gal with order
[2025-06-08 12:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:41:40] [INFO ] Removed a total of 385 redundant transitions.
[2025-06-08 12:41:40] [INFO ] Flatten gal took : 67 ms
[2025-06-08 12:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2025-06-08 12:41:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14902700242860065298.gal : 8 ms
[2025-06-08 12:41:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2091397884990113463.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/CTLFireability14902700242860065298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2091397884990113463.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.52054e+07,0.261765,13380,1100,22,17266,523,900,25588,71,995,0


Converting to forward existential form...Done !
original formula: ((EG((i5.u4.p16==1)) + EF((i12.i0.i0.u88.p350==1))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !((EG((i5.u4.p16==1)) + E(TRUE U (i12.i0.i0.u88.p350==1)))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t150, t267, t375, t378, t411, t493, t549, t565, t566, t569, t572, t577, t580, t583, t584, t58...502
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,1,2.05204,83908,1,0,155750,523,7759,283979,364,995,609773
FORMULA MedleyB-PT-B01-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 754 transition count 866
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 754 transition count 866
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 69 place count 733 transition count 845
Iterating global reduction 0 with 21 rules applied. Total rules applied 90 place count 733 transition count 845
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 105 place count 718 transition count 830
Iterating global reduction 0 with 15 rules applied. Total rules applied 120 place count 718 transition count 830
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 134 place count 704 transition count 816
Iterating global reduction 0 with 14 rules applied. Total rules applied 148 place count 704 transition count 816
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 162 place count 690 transition count 802
Iterating global reduction 0 with 14 rules applied. Total rules applied 176 place count 690 transition count 802
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 190 place count 676 transition count 788
Iterating global reduction 0 with 14 rules applied. Total rules applied 204 place count 676 transition count 788
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 205 place count 676 transition count 787
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 216 place count 665 transition count 776
Iterating global reduction 1 with 11 rules applied. Total rules applied 227 place count 665 transition count 776
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 237 place count 655 transition count 766
Iterating global reduction 1 with 10 rules applied. Total rules applied 247 place count 655 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 248 place count 655 transition count 765
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 254 place count 649 transition count 759
Iterating global reduction 2 with 6 rules applied. Total rules applied 260 place count 649 transition count 759
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 266 place count 643 transition count 753
Iterating global reduction 2 with 6 rules applied. Total rules applied 272 place count 643 transition count 753
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 277 place count 638 transition count 748
Iterating global reduction 2 with 5 rules applied. Total rules applied 282 place count 638 transition count 748
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 285 place count 635 transition count 745
Iterating global reduction 2 with 3 rules applied. Total rules applied 288 place count 635 transition count 745
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 632 transition count 742
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 632 transition count 742
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 297 place count 629 transition count 739
Iterating global reduction 2 with 3 rules applied. Total rules applied 300 place count 629 transition count 739
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 303 place count 626 transition count 736
Iterating global reduction 2 with 3 rules applied. Total rules applied 306 place count 626 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 309 place count 623 transition count 733
Iterating global reduction 2 with 3 rules applied. Total rules applied 312 place count 623 transition count 733
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 315 place count 620 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 318 place count 620 transition count 730
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 321 place count 617 transition count 727
Iterating global reduction 2 with 3 rules applied. Total rules applied 324 place count 617 transition count 727
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 327 place count 614 transition count 724
Iterating global reduction 2 with 3 rules applied. Total rules applied 330 place count 614 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 331 place count 614 transition count 723
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 333 place count 612 transition count 721
Iterating global reduction 3 with 2 rules applied. Total rules applied 335 place count 612 transition count 721
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 337 place count 610 transition count 719
Iterating global reduction 3 with 2 rules applied. Total rules applied 339 place count 610 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 340 place count 610 transition count 718
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 341 place count 609 transition count 717
Iterating global reduction 4 with 1 rules applied. Total rules applied 342 place count 609 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 343 place count 609 transition count 716
Applied a total of 343 rules in 354 ms. Remains 609 /778 variables (removed 169) and now considering 716/890 (removed 174) transitions.
// Phase 1: matrix 716 rows 609 cols
[2025-06-08 12:41:42] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:41:43] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-08 12:41:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:41:43] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2025-06-08 12:41:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/609 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:02] [INFO ] Deduced a trap composed of 289 places in 268 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:02] [INFO ] Deduced a trap composed of 290 places in 273 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:02] [INFO ] Deduced a trap composed of 290 places in 196 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:03] [INFO ] Deduced a trap composed of 291 places in 191 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:04] [INFO ] Deduced a trap composed of 302 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:06] [INFO ] Deduced a trap composed of 289 places in 281 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:06] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:06] [INFO ] Deduced a trap composed of 297 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:07] [INFO ] Deduced a trap composed of 302 places in 266 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:07] [INFO ] Deduced a trap composed of 303 places in 208 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:08] [INFO ] Deduced a trap composed of 306 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:08] [INFO ] Deduced a trap composed of 297 places in 295 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:08] [INFO ] Deduced a trap composed of 297 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:12] [INFO ] Deduced a trap composed of 307 places in 163 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:13] [INFO ] Deduced a trap composed of 290 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:13] [INFO ] Deduced a trap composed of 306 places in 138 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1325 variables, and 20 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/609 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/609 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:42:30] [INFO ] Deduced a trap composed of 302 places in 238 ms of which 85 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/609 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/1325 variables, and 21 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/609 constraints, PredecessorRefiner: 0/715 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 609/778 places, 716/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61277 ms. Remains : 609/778 places, 716/890 transitions.
[2025-06-08 12:42:43] [INFO ] Flatten gal took : 11 ms
[2025-06-08 12:42:43] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:42:43] [INFO ] Input system was already deterministic with 716 transitions.
[2025-06-08 12:42:43] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:42:43] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:42:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10328787473093730160.gal : 3 ms
[2025-06-08 12:42:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10225759499912490323.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/CTLFireability10328787473093730160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10225759499912490323.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,6.80598e+07,4.63283,118400,2,12870,5,373658,6,0,3154,540010,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:43:14] [INFO ] Flatten gal took : 15 ms
[2025-06-08 12:43:14] [INFO ] Applying decomposition
[2025-06-08 12:43:14] [INFO ] Flatten gal took : 11 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/graph8785213241183379226.txt' '-o' '/tmp/graph8785213241183379226.bin' '-w' '/tmp/graph8785213241183379226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8785213241183379226.bin' '-l' '-1' '-v' '-w' '/tmp/graph8785213241183379226.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:43:14] [INFO ] Decomposing Gal with order
[2025-06-08 12:43:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:43:14] [INFO ] Removed a total of 375 redundant transitions.
[2025-06-08 12:43:14] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:43:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2025-06-08 12:43:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5415800782901952461.gal : 4 ms
[2025-06-08 12:43:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17073226520840145743.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/CTLFireability5415800782901952461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17073226520840145743.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.80598e+07,2.04475,73516,1297,21,141260,543,996,306684,73,1179,0


Converting to forward existential form...Done !
original formula: AF(((AX(((A((i10.u87.p317==1) U (i10.u89.p324==1)) * (i17.u166.p630==0)) * (i3.u62.p242==0))) + EG((i4.i0.i1.u32.p96!=1))) + (AG(AF((i9.i...202
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(((!((E(!((i10.u89.p324==1)) U (!((i10.u87.p317==1)) * !((i10.u89.p324==1)))) + EG(!((i10.u...334
Reverse transition relation is NOT exact ! Due to transitions t151, t241, t323, t379, t419, t507, t560, t563, t579, t580, t583, t586, t601, t604, t607, t60...471
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Graph (trivial) has 769 edges and 778 vertex of which 52 / 778 are part of one of the 9 SCC in 3 ms
Free SCC test removed 43 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 563 transitions
Trivial Post-agglo rules discarded 563 transitions
Performed 563 trivial Post agglomeration. Transition count delta: 563
Iterating post reduction 0 with 563 rules applied. Total rules applied 564 place count 734 transition count 277
Reduce places removed 563 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 570 rules applied. Total rules applied 1134 place count 171 transition count 270
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1137 place count 168 transition count 270
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 1137 place count 168 transition count 236
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1205 place count 134 transition count 236
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1221 place count 118 transition count 219
Iterating global reduction 3 with 16 rules applied. Total rules applied 1237 place count 118 transition count 219
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1237 place count 118 transition count 217
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1241 place count 116 transition count 217
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1250 place count 107 transition count 194
Iterating global reduction 3 with 9 rules applied. Total rules applied 1259 place count 107 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1263 place count 107 transition count 190
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1267 place count 103 transition count 185
Iterating global reduction 4 with 4 rules applied. Total rules applied 1271 place count 103 transition count 185
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1273 place count 101 transition count 183
Iterating global reduction 4 with 2 rules applied. Total rules applied 1275 place count 101 transition count 183
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 1305 place count 86 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1309 place count 86 transition count 164
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1324 place count 71 transition count 128
Iterating global reduction 5 with 15 rules applied. Total rules applied 1339 place count 71 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1344 place count 71 transition count 123
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1353 place count 62 transition count 112
Iterating global reduction 6 with 9 rules applied. Total rules applied 1362 place count 62 transition count 112
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1371 place count 53 transition count 101
Iterating global reduction 6 with 9 rules applied. Total rules applied 1380 place count 53 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1386 place count 53 transition count 95
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 7 with 2 rules applied. Total rules applied 1388 place count 52 transition count 94
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1389 place count 51 transition count 91
Iterating global reduction 7 with 1 rules applied. Total rules applied 1390 place count 51 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1391 place count 51 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1394 place count 51 transition count 87
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 8 with 6 rules applied. Total rules applied 1400 place count 48 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1401 place count 47 transition count 83
Applied a total of 1401 rules in 58 ms. Remains 47 /778 variables (removed 731) and now considering 83/890 (removed 807) transitions.
[2025-06-08 12:43:44] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 47 cols
[2025-06-08 12:43:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:43:44] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-08 12:43:44] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2025-06-08 12:43:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:43:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-08 12:43:44] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:43:44] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-08 12:43:44] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2025-06-08 12:43:44] [INFO ] Invariant cache hit.
[2025-06-08 12:43: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/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:44] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:44] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:44] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:44] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:45] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:45] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:45] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:45] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 78/125 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/126 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 65 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 78/125 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 76/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/126 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:49] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/126 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 142 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7253ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7254ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/778 places, 83/890 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7465 ms. Remains : 47/778 places, 83/890 transitions.
[2025-06-08 12:43:51] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:43:51] [INFO ] Flatten gal took : 3 ms
[2025-06-08 12:43:51] [INFO ] Input system was already deterministic with 83 transitions.
[2025-06-08 12:43:51] [INFO ] Flatten gal took : 2 ms
[2025-06-08 12:43:51] [INFO ] Flatten gal took : 2 ms
[2025-06-08 12:43:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15683418236043195.gal : 1 ms
[2025-06-08 12:43:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13389935418614781552.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/CTLFireability15683418236043195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13389935418614781552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5166,0.040996,5140,2,853,5,5314,6,0,265,5294,0


Converting to forward existential form...Done !
original formula: EG(AG((p509==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((p509==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t12, t13, t14, t16, t17, t18, t32, t33, t34, t35, t36, t51, t52, t53, t54, t55, t...282
(forward)formula 0,0,0.372903,18708,1,0,187,82769,189,79,1919,58022,198
FORMULA MedleyB-PT-B01-CTLFireability-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Graph (trivial) has 767 edges and 778 vertex of which 52 / 778 are part of one of the 9 SCC in 2 ms
Free SCC test removed 43 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 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 562 rules applied. Total rules applied 563 place count 734 transition count 278
Reduce places removed 562 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 570 rules applied. Total rules applied 1133 place count 172 transition count 270
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 1138 place count 169 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1140 place count 167 transition count 268
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 1140 place count 167 transition count 235
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1206 place count 134 transition count 235
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1222 place count 118 transition count 218
Iterating global reduction 4 with 16 rules applied. Total rules applied 1238 place count 118 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1238 place count 118 transition count 216
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1242 place count 116 transition count 216
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1251 place count 107 transition count 193
Iterating global reduction 4 with 9 rules applied. Total rules applied 1260 place count 107 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1264 place count 107 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1268 place count 103 transition count 184
Iterating global reduction 5 with 4 rules applied. Total rules applied 1272 place count 103 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1274 place count 101 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 1276 place count 101 transition count 182
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1306 place count 86 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1310 place count 86 transition count 163
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1325 place count 71 transition count 127
Iterating global reduction 6 with 15 rules applied. Total rules applied 1340 place count 71 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1345 place count 71 transition count 122
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1353 place count 63 transition count 112
Iterating global reduction 7 with 8 rules applied. Total rules applied 1361 place count 63 transition count 112
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1369 place count 55 transition count 102
Iterating global reduction 7 with 8 rules applied. Total rules applied 1377 place count 55 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1382 place count 55 transition count 97
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 8 with 2 rules applied. Total rules applied 1384 place count 54 transition count 96
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1385 place count 53 transition count 93
Iterating global reduction 8 with 1 rules applied. Total rules applied 1386 place count 53 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1387 place count 53 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1390 place count 53 transition count 89
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 9 with 6 rules applied. Total rules applied 1396 place count 50 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1397 place count 49 transition count 85
Applied a total of 1397 rules in 43 ms. Remains 49 /778 variables (removed 729) and now considering 85/890 (removed 805) transitions.
[2025-06-08 12:43:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 49 cols
[2025-06-08 12:43:52] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:43:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-08 12:43:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-08 12:43:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:43:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-08 12:43:52] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:43:52] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-08 12:43:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2025-06-08 12:43:52] [INFO ] Invariant cache hit.
[2025-06-08 12:43:52] [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/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 4/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:52] [INFO ] Deduced a trap composed of 18 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-08 12:43:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:52] [INFO ] Deduced a trap composed of 21 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-08 12:43:52] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:52] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:52] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:52] [INFO ] Deduced a trap composed of 21 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-08 12:43:52] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 68 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 4/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 78/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 146 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6235ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 6235ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/778 places, 85/890 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6390 ms. Remains : 49/778 places, 85/890 transitions.
[2025-06-08 12:43:58] [INFO ] Flatten gal took : 3 ms
[2025-06-08 12:43:58] [INFO ] Flatten gal took : 2 ms
[2025-06-08 12:43:58] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-08 12:43:58] [INFO ] Flatten gal took : 2 ms
[2025-06-08 12:43:58] [INFO ] Flatten gal took : 2 ms
[2025-06-08 12:43:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13649045700123965327.gal : 1 ms
[2025-06-08 12:43:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15461986515107316026.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/CTLFireability13649045700123965327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15461986515107316026.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,8181,0.041097,5304,2,914,5,5295,6,0,275,5446,0


Converting to forward existential form...Done !
original formula: AG(AF(((p228==1)&&(p923==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p228==1)&&(p923==1))))] = FALSE
Hit Full ! (commute/partial/dont) 71/0/14
(forward)formula 0,0,0.166566,10552,1,0,28,31750,20,3,1519,27741,27
FORMULA MedleyB-PT-B01-CTLFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Graph (trivial) has 762 edges and 778 vertex of which 52 / 778 are part of one of the 9 SCC in 2 ms
Free SCC test removed 43 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 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 558 place count 734 transition count 283
Reduce places removed 557 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 565 rules applied. Total rules applied 1123 place count 177 transition count 275
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 1129 place count 174 transition count 272
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1132 place count 171 transition count 272
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 1132 place count 171 transition count 239
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1198 place count 138 transition count 239
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1214 place count 122 transition count 222
Iterating global reduction 4 with 16 rules applied. Total rules applied 1230 place count 122 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1230 place count 122 transition count 220
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1234 place count 120 transition count 220
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1243 place count 111 transition count 197
Iterating global reduction 4 with 9 rules applied. Total rules applied 1252 place count 111 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1255 place count 111 transition count 194
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1259 place count 107 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 1263 place count 107 transition count 189
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1265 place count 105 transition count 187
Iterating global reduction 5 with 2 rules applied. Total rules applied 1267 place count 105 transition count 187
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1297 place count 90 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1301 place count 90 transition count 168
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1316 place count 75 transition count 132
Iterating global reduction 6 with 15 rules applied. Total rules applied 1331 place count 75 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1336 place count 75 transition count 127
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1344 place count 67 transition count 118
Iterating global reduction 7 with 8 rules applied. Total rules applied 1352 place count 67 transition count 118
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1360 place count 59 transition count 109
Iterating global reduction 7 with 8 rules applied. Total rules applied 1368 place count 59 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1373 place count 59 transition count 104
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 8 with 2 rules applied. Total rules applied 1375 place count 58 transition count 103
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1376 place count 57 transition count 99
Iterating global reduction 8 with 1 rules applied. Total rules applied 1377 place count 57 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1378 place count 57 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1382 place count 57 transition count 94
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 9 with 6 rules applied. Total rules applied 1388 place count 54 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1389 place count 53 transition count 90
Applied a total of 1389 rules in 36 ms. Remains 53 /778 variables (removed 725) and now considering 90/890 (removed 800) transitions.
[2025-06-08 12:43:58] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
// Phase 1: matrix 86 rows 53 cols
[2025-06-08 12:43:58] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:43:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-08 12:43:58] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2025-06-08 12:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:43:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-08 12:43:58] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:43:58] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-08 12:43:58] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2025-06-08 12:43:58] [INFO ] Invariant cache hit.
[2025-06-08 12:43:58] [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/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:59] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:59] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:59] [INFO ] Deduced a trap composed of 24 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-08 12:43:59] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:59] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:59] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:59] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:43:59] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 85/138 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:00] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 72 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 85/138 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 82/153 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 154 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7133ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 7133ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/778 places, 90/890 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7278 ms. Remains : 53/778 places, 90/890 transitions.
[2025-06-08 12:44:05] [INFO ] Flatten gal took : 4 ms
[2025-06-08 12:44:05] [INFO ] Flatten gal took : 3 ms
[2025-06-08 12:44:05] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-08 12:44:05] [INFO ] Flatten gal took : 1 ms
[2025-06-08 12:44:05] [INFO ] Flatten gal took : 1 ms
[2025-06-08 12:44:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9648819947832987265.gal : 0 ms
[2025-06-08 12:44:05] [INFO ] Time to serialize properties into /tmp/CTLFireability18001074755049072832.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/CTLFireability9648819947832987265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18001074755049072832.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,6420,0.038749,5316,2,856,5,5346,6,0,296,5383,0


Converting to forward existential form...Done !
original formula: (AF((p113==0)) * EG(EF((AF((p594==0)) * !(A((p181==1) U (p391==1)))))))
=> equivalent forward existential formula: ([FwdG(Init,!((p113==0)))] = FALSE * [(Init * !(EG(E(TRUE U (!(EG(!((p594==0)))) * !(!((E(!((p391==1)) U (!((p18...215
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t11, t12, t13, t17, t20, t21, t37, t38, t39, t40, t42, t43, t44, t59, t60, t61, t...287
(forward)formula 0,1,0.930239,40020,1,0,426,213185,222,197,2153,183991,510
FORMULA MedleyB-PT-B01-CTLFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 890/890 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 753 transition count 865
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 753 transition count 865
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 72 place count 731 transition count 843
Iterating global reduction 0 with 22 rules applied. Total rules applied 94 place count 731 transition count 843
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 110 place count 715 transition count 827
Iterating global reduction 0 with 16 rules applied. Total rules applied 126 place count 715 transition count 827
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 141 place count 700 transition count 812
Iterating global reduction 0 with 15 rules applied. Total rules applied 156 place count 700 transition count 812
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 171 place count 685 transition count 797
Iterating global reduction 0 with 15 rules applied. Total rules applied 186 place count 685 transition count 797
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 201 place count 670 transition count 782
Iterating global reduction 0 with 15 rules applied. Total rules applied 216 place count 670 transition count 782
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 218 place count 670 transition count 780
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 229 place count 659 transition count 769
Iterating global reduction 1 with 11 rules applied. Total rules applied 240 place count 659 transition count 769
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 250 place count 649 transition count 759
Iterating global reduction 1 with 10 rules applied. Total rules applied 260 place count 649 transition count 759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 261 place count 649 transition count 758
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 267 place count 643 transition count 752
Iterating global reduction 2 with 6 rules applied. Total rules applied 273 place count 643 transition count 752
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 279 place count 637 transition count 746
Iterating global reduction 2 with 6 rules applied. Total rules applied 285 place count 637 transition count 746
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 289 place count 633 transition count 742
Iterating global reduction 2 with 4 rules applied. Total rules applied 293 place count 633 transition count 742
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 296 place count 630 transition count 739
Iterating global reduction 2 with 3 rules applied. Total rules applied 299 place count 630 transition count 739
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 302 place count 627 transition count 736
Iterating global reduction 2 with 3 rules applied. Total rules applied 305 place count 627 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 308 place count 624 transition count 733
Iterating global reduction 2 with 3 rules applied. Total rules applied 311 place count 624 transition count 733
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 314 place count 621 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 317 place count 621 transition count 730
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 320 place count 618 transition count 727
Iterating global reduction 2 with 3 rules applied. Total rules applied 323 place count 618 transition count 727
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 326 place count 615 transition count 724
Iterating global reduction 2 with 3 rules applied. Total rules applied 329 place count 615 transition count 724
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 332 place count 612 transition count 721
Iterating global reduction 2 with 3 rules applied. Total rules applied 335 place count 612 transition count 721
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 338 place count 609 transition count 718
Iterating global reduction 2 with 3 rules applied. Total rules applied 341 place count 609 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 342 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 344 place count 607 transition count 715
Iterating global reduction 3 with 2 rules applied. Total rules applied 346 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 348 place count 605 transition count 713
Iterating global reduction 3 with 2 rules applied. Total rules applied 350 place count 605 transition count 713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 351 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 352 place count 604 transition count 711
Iterating global reduction 4 with 1 rules applied. Total rules applied 353 place count 604 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 354 place count 604 transition count 710
Applied a total of 354 rules in 328 ms. Remains 604 /778 variables (removed 174) and now considering 710/890 (removed 180) transitions.
// Phase 1: matrix 710 rows 604 cols
[2025-06-08 12:44:07] [INFO ] Computed 4 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:07] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-08 12:44:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:44:08] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 709 sub problems to find dead transitions.
[2025-06-08 12:44: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/603 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/604 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:26] [INFO ] Deduced a trap composed of 289 places in 279 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:26] [INFO ] Deduced a trap composed of 290 places in 298 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:26] [INFO ] Deduced a trap composed of 290 places in 203 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:27] [INFO ] Deduced a trap composed of 290 places in 291 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:27] [INFO ] Deduced a trap composed of 291 places in 286 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:27] [INFO ] Deduced a trap composed of 297 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:28] [INFO ] Deduced a trap composed of 291 places in 194 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:30] [INFO ] Deduced a trap composed of 297 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:31] [INFO ] Deduced a trap composed of 289 places in 306 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:31] [INFO ] Deduced a trap composed of 297 places in 221 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:31] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:32] [INFO ] Deduced a trap composed of 297 places in 193 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:33] [INFO ] Deduced a trap composed of 291 places in 245 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:34] [INFO ] Deduced a trap composed of 307 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:36] [INFO ] Deduced a trap composed of 302 places in 196 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:37] [INFO ] Deduced a trap composed of 301 places in 209 ms of which 64 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 604/1314 variables, and 20 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/604 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/604 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:51] [INFO ] Deduced a trap composed of 308 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:53] [INFO ] Deduced a trap composed of 290 places in 252 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:44:53] [INFO ] Deduced a trap composed of 301 places in 134 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/1314 variables, and 23 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/604 constraints, PredecessorRefiner: 0/709 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 604/778 places, 710/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61182 ms. Remains : 604/778 places, 710/890 transitions.
[2025-06-08 12:45:08] [INFO ] Flatten gal took : 12 ms
[2025-06-08 12:45:08] [INFO ] Flatten gal took : 14 ms
[2025-06-08 12:45:08] [INFO ] Input system was already deterministic with 710 transitions.
[2025-06-08 12:45:08] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:45:08] [INFO ] Flatten gal took : 10 ms
[2025-06-08 12:45:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16114959942359260783.gal : 3 ms
[2025-06-08 12:45:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2639343472418320972.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/CTLFireability16114959942359260783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2639343472418320972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-08 12:45:38] [INFO ] Flatten gal took : 15 ms
[2025-06-08 12:45:38] [INFO ] Applying decomposition
[2025-06-08 12:45:38] [INFO ] Flatten gal took : 10 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/graph8977555335765943236.txt' '-o' '/tmp/graph8977555335765943236.bin' '-w' '/tmp/graph8977555335765943236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8977555335765943236.bin' '-l' '-1' '-v' '-w' '/tmp/graph8977555335765943236.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:45:38] [INFO ] Decomposing Gal with order
[2025-06-08 12:45:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:45:38] [INFO ] Removed a total of 388 redundant transitions.
[2025-06-08 12:45:38] [INFO ] Flatten gal took : 26 ms
[2025-06-08 12:45:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-08 12:45:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1664984519980419082.gal : 12 ms
[2025-06-08 12:45:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13571836114351081495.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/CTLFireability1664984519980419082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13571836114351081495.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.77681e+07,0.416214,17952,1089,23,25659,412,928,47860,59,707,0


Converting to forward existential form...Done !
original formula: EX(AX((E((i21.u70.p297!=1) U E((i10.u160.p619==1) U (i5.u53.p171==1))) * EF((i13.i0.i1.u112.p401==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((E((i21.u70.p297!=1) U E((i10.u160.p619==1) U (i5.u53.p171==1))) * E(TRUE U (i13.i0.i1.u112....179
Reverse transition relation is NOT exact ! Due to transitions t8, t69, t150, t151, t204, t207, t241, t379, t557, t573, t574, t577, t580, t585, t588, t589, ...478
(forward)formula 0,0,4.85801,191008,1,0,275075,412,7621,1.16604e+06,269,963,954751
FORMULA MedleyB-PT-B01-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2025-06-08 12:45:43] [INFO ] Flatten gal took : 16 ms
[2025-06-08 12:45:43] [INFO ] Flatten gal took : 13 ms
[2025-06-08 12:45:43] [INFO ] Applying decomposition
[2025-06-08 12:45:43] [INFO ] Flatten gal took : 13 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/graph15149453632401972278.txt' '-o' '/tmp/graph15149453632401972278.bin' '-w' '/tmp/graph15149453632401972278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15149453632401972278.bin' '-l' '-1' '-v' '-w' '/tmp/graph15149453632401972278.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:45:43] [INFO ] Decomposing Gal with order
[2025-06-08 12:45:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:45:43] [INFO ] Removed a total of 406 redundant transitions.
[2025-06-08 12:45:43] [INFO ] Flatten gal took : 26 ms
[2025-06-08 12:45:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2025-06-08 12:45:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14955355743910264737.gal : 5 ms
[2025-06-08 12:45:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9424057883221090464.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/CTLFireability14955355743910264737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9424057883221090464.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 6 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.22715e+08,0.426392,20868,1517,22,32618,509,1115,58091,62,1016,0


Converting to forward existential form...Done !
original formula: A((i17.u163.p472==1) U ((EG(EF(AX((i0.u77.p219==1)))) + AG(!(E((i25.u229.p655==1) U (i4.u32.p83==1))))) + EF(AG((i3.u28.p69==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(((EG(E(TRUE U !(EX(!((i0.u77.p219==1)))))) + !(E(TRUE U !(!(E((i25.u229.p655==1) U (i4.u32.p83=...566
Reverse transition relation is NOT exact ! Due to transitions t9, t19, t20, t22, t77, t129, t255, t315, t418, t475, t515, t633, t634, t635, t693, t709, t71...587
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an 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 a local 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
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an 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 a local 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
(forward)formula 0,1,28.145,742168,1,0,1.27259e+06,608,10303,3.57893e+06,321,2237,2559150
FORMULA MedleyB-PT-B01-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AF(((i9.i0.i1.u90.p263==1) + (!(A((i27.i1.i1.u262.p736==1) U (i28.u243.p693==1))) * (EF((i11.i0.i0.u114.p328==1)) + (i34.u307.p910==1))...455
=> equivalent forward existential formula: ([(EY(((EY((FwdU(Init,!(EG(!(((i9.i0.i1.u90.p263==1) + (!(!((E(!((i28.u243.p693==1)) U (!((i27.i1.i1.u262.p736==...972
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
(forward)formula 1,1,82.9834,2008164,1,0,3.22043e+06,640,10538,1.07233e+07,325,2841,5650942
FORMULA MedleyB-PT-B01-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AX((!(E(((i28.u277.p787==1)||(i27.i1.i1.u261.p734==1)) U ((i33.u304.p898==1)||(i16.u178.p515==1)))) + ((EG((i29.u269.p759==0)) * ((i3....233
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(E(((i28.u277.p787==1)||(i27.i1.i1.u261.p734==1)) U ((i33.u304.p898==1)||(i16.u178.p515==1))...282
(forward)formula 2,1,93.5718,2195556,1,0,3.54753e+06,640,10651,1.1505e+07,328,2850,6167807
FORMULA MedleyB-PT-B01-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((AX((i8.u76.p248==1)) * (!(A(AG((i8.u76.p248==1)) U (((i1.u11.p29!=1)&&(i3.u3.p252==1))&&((i3.u190.p553==1)&&(i28.u292.p854==1))))) + ...309
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((i8.u76.p248==1)))) * (!(!((E(!((((i1.u11.p29!=1)&&(i3.u3.p252==1))&&((i3.u190.p553==1)&&(i...624
(forward)formula 3,0,135.367,2264292,1,0,3.6759e+06,640,4927,1.17745e+07,166,2850,2797459
FORMULA MedleyB-PT-B01-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A((EF(EG((i13.i0.i1.u112.p325==1))) + (EG((i34.u81.p230==1)) * (!(((((i12.i1.i1.u129.p366==1)||((i34.u173.p497==1)&&(i34.u306.p923==1))) ...532
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((i13.i0.i1.u112.p323==1) + !((E(!((!(EX(!(((i1.u9.p25==1)&&(i34.u306.p908==1))))) * (...1572
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an 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 a local 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
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
(forward)formula 4,1,152.084,2264292,1,0,3.6759e+06,640,5688,1.17745e+07,188,2850,4200180
FORMULA MedleyB-PT-B01-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((AX(((A((i13.i0.i0.u109.p317==1) U (i13.i0.i1.u112.p324==1)) * (i3.u219.p630==0)) * (i8.u85.p242==0))) + EG((i5.u37.p96!=1))) + (AG(A...210
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(((!((E(!((i13.i0.i1.u112.p324==1)) U (!((i13.i0.i0.u109.p317==1)) * !((i13.i0.i1.u112.p324...356
(forward)formula 5,1,158.867,2264292,1,0,3.6759e+06,640,5790,1.17745e+07,192,2850,4879260
FORMULA MedleyB-PT-B01-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1362983 ms.

BK_STOP 1749386902989

--------------------
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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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 r254-tall-174931339900426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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