Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200225.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 MedleyA-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 175K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748871429956

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 13:37:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 13:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:37:13] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2025-06-02 13:37:13] [INFO ] Transformed 248 places.
[2025-06-02 13:37:13] [INFO ] Transformed 591 transitions.
[2025-06-02 13:37:13] [INFO ] Found NUPN structural information;
[2025-06-02 13:37:13] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 227 transition count 557
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 227 transition count 557
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 75 place count 227 transition count 524
Applied a total of 75 rules in 91 ms. Remains 227 /248 variables (removed 21) and now considering 524/589 (removed 65) transitions.
// Phase 1: matrix 524 rows 227 cols
[2025-06-02 13:37:13] [INFO ] Computed 7 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:14] [INFO ] Implicit Places using invariants in 639 ms returned []
[2025-06-02 13:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:14] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
Running 523 sub problems to find dead transitions.
[2025-06-02 13:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:28] [INFO ] Deduced a trap composed of 17 places in 528 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:28] [INFO ] Deduced a trap composed of 17 places in 332 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:29] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:29] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:29] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:30] [INFO ] Deduced a trap composed of 18 places in 396 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:30] [INFO ] Deduced a trap composed of 18 places in 378 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 19 places in 392 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 19 places in 413 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:32] [INFO ] Deduced a trap composed of 21 places in 341 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:32] [INFO ] Deduced a trap composed of 22 places in 387 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:33] [INFO ] Deduced a trap composed of 40 places in 276 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:33] [INFO ] Deduced a trap composed of 123 places in 230 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:33] [INFO ] Deduced a trap composed of 125 places in 256 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:33] [INFO ] Deduced a trap composed of 126 places in 253 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:34] [INFO ] Deduced a trap composed of 102 places in 221 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:34] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:34] [INFO ] Deduced a trap composed of 28 places in 326 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:35] [INFO ] Deduced a trap composed of 43 places in 274 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:35] [INFO ] Deduced a trap composed of 125 places in 258 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:36] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:36] [INFO ] Deduced a trap composed of 28 places in 349 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:36] [INFO ] Deduced a trap composed of 44 places in 358 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:37] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:37] [INFO ] Deduced a trap composed of 26 places in 351 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:38] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:39] [INFO ] Deduced a trap composed of 27 places in 369 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:39] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:39] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:40] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:41] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:41] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:41] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:42] [INFO ] Deduced a trap composed of 21 places in 331 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:42] [INFO ] Deduced a trap composed of 37 places in 369 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:43] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:43] [INFO ] Deduced a trap composed of 21 places in 350 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:43] [INFO ] Deduced a trap composed of 42 places in 346 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 22 places in 336 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/751 variables, and 47 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/227 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:51] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:51] [INFO ] Deduced a trap composed of 28 places in 346 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:51] [INFO ] Deduced a trap composed of 25 places in 315 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:52] [INFO ] Deduced a trap composed of 27 places in 317 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:52] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:52] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:53] [INFO ] Deduced a trap composed of 97 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:53] [INFO ] Deduced a trap composed of 88 places in 396 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:54] [INFO ] Deduced a trap composed of 103 places in 374 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:54] [INFO ] Deduced a trap composed of 103 places in 330 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:56] [INFO ] Deduced a trap composed of 29 places in 336 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:56] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:57] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:57] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:57] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:58] [INFO ] Deduced a trap composed of 29 places in 336 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:00] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:00] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:00] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 19/66 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 5 (OVERLAPS) 524/751 variables, 227/293 constraints. Problems are: Problem set: 31 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 785 constraints, problems are : Problem set: 31 solved, 492 unsolved in 30305 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 492/523 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61123ms problems are : Problem set: 31 solved, 492 unsolved
Search for dead transitions found 31 dead transitions in 61160ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 227/248 places, 493/589 transitions.
Applied a total of 0 rules in 10 ms. Remains 227 /227 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62853 ms. Remains : 227/248 places, 493/589 transitions.
Support contains 102 out of 227 places after structural reductions.
[2025-06-02 13:38:16] [INFO ] Flatten gal took : 162 ms
[2025-06-02 13:38:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-17-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 13:38:16] [INFO ] Flatten gal took : 87 ms
[2025-06-02 13:38:16] [INFO ] Input system was already deterministic with 493 transitions.
Support contains 97 out of 227 places (down from 102) after GAL structural reductions.
RANDOM walk for 40000 steps (1376 resets) in 3042 ms. (13 steps per ms) remains 59/72 properties
BEST_FIRST walk for 4004 steps (28 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (27 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (27 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (29 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (29 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (29 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (29 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (27 resets) in 54 ms. (72 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (29 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (27 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
// Phase 1: matrix 493 rows 227 cols
[2025-06-02 13:38:18] [INFO ] Computed 7 invariants in 12 ms
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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 150/227 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 493/720 variables, 227/234 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 0/720 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 234 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3436 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 150/227 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:22] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:22] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:23] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:23] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:23] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:24] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:24] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:24] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:24] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:25] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:25] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:25] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:25] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:26] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:26] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:26] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 33 ms to minimize.
SMT process timed out in 8525ms, After SMT, problems are : Problem set: 0 solved, 59 unsolved
Fused 59 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 77 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 493/493 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 227 transition count 480
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 214 transition count 477
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 211 transition count 477
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 32 place count 211 transition count 469
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 48 place count 203 transition count 469
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 198 transition count 461
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 198 transition count 461
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 94 place count 180 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 180 transition count 442
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 127 place count 164 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 164 transition count 504
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 163 transition count 496
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 163 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 154 place count 163 transition count 472
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 158 place count 161 transition count 470
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 178 place count 161 transition count 450
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 198 place count 141 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 202 place count 141 transition count 446
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 204 place count 141 transition count 446
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 141 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 206 place count 140 transition count 444
Applied a total of 206 rules in 370 ms. Remains 140 /227 variables (removed 87) and now considering 444/493 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 140/227 places, 444/493 transitions.
RANDOM walk for 40000 steps (10 resets) in 2524 ms. (15 steps per ms) remains 35/59 properties
BEST_FIRST walk for 4001 steps (13 resets) in 33 ms. (117 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4000 steps (9 resets) in 45 ms. (86 steps per ms) remains 29/33 properties
BEST_FIRST walk for 4001 steps (13 resets) in 61 ms. (64 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 35 ms. (111 steps per ms) remains 18/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (9 resets) in 38 ms. (102 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4000 steps (10 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (13 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (10 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (10 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (13 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (12 resets) in 84 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (9 resets) in 135 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (12 resets) in 22 ms. (173 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4000 steps (10 resets) in 46 ms. (85 steps per ms) remains 13/14 properties
[2025-06-02 13:38:28] [INFO ] Flow matrix only has 442 transitions (discarded 2 similar events)
// Phase 1: matrix 442 rows 140 cols
[2025-06-02 13:38:28] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 13:38:28] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 118/136 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 439/575 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 6/581 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 64/217 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/582 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/582 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 219 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 118/136 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:29] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:30] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:30] [INFO ] Deduced a trap composed of 74 places in 238 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:30] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:30] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:30] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:31] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:31] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:31] [INFO ] Deduced a trap composed of 78 places in 252 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 439/575 variables, 136/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:32] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:32] [INFO ] Deduced a trap composed of 18 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-02 13:38:33] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:33] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:33] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:33] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:33] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:34] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:34] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:34] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 6/581 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 64/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 1/582 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:39] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:39] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:40] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 15 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/582 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:41] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:41] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:41] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 27 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/582 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/582 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:43] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:43] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:43] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:44] [INFO ] Deduced a trap composed of 57 places in 239 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:44] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 11 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/582 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/582 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 0/582 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 262 constraints, problems are : Problem set: 0 solved, 13 unsolved in 18737 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19793ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 9 properties in 29882 ms.
Support contains 6 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 444/444 transitions.
Graph (trivial) has 142 edges and 140 vertex of which 6 / 140 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 137 transition count 431
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 130 transition count 431
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 15 place count 130 transition count 420
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 37 place count 119 transition count 420
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 51 place count 105 transition count 394
Iterating global reduction 2 with 14 rules applied. Total rules applied 65 place count 105 transition count 394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 65 place count 105 transition count 393
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 104 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 101 transition count 373
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 101 transition count 373
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 94 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 94 transition count 365
Performed 22 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 132 place count 72 transition count 450
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 144 place count 72 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 151 place count 72 transition count 431
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 162 place count 72 transition count 420
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 187 place count 61 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 196 place count 61 transition count 397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 60 transition count 396
Applied a total of 197 rules in 117 ms. Remains 60 /140 variables (removed 80) and now considering 396/444 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 60/140 places, 396/444 transitions.
RANDOM walk for 33444 steps (3691 resets) in 1129 ms. (29 steps per ms) remains 0/4 properties
[2025-06-02 13:39:18] [INFO ] Flatten gal took : 68 ms
[2025-06-02 13:39:18] [INFO ] Flatten gal took : 62 ms
[2025-06-02 13:39:18] [INFO ] Input system was already deterministic with 493 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Graph (trivial) has 252 edges and 227 vertex of which 9 / 227 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 220 transition count 457
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 191 transition count 457
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 59 place count 191 transition count 442
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 89 place count 176 transition count 442
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 121 place count 144 transition count 384
Iterating global reduction 2 with 32 rules applied. Total rules applied 153 place count 144 transition count 384
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 153 place count 144 transition count 381
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 141 transition count 381
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 138 transition count 365
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 138 transition count 365
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 197 place count 122 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 122 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 199 place count 121 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 121 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 208 place count 121 transition count 338
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 216 place count 117 transition count 334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 116 transition count 333
Applied a total of 217 rules in 99 ms. Remains 116 /227 variables (removed 111) and now considering 333/493 (removed 160) transitions.
[2025-06-02 13:39:18] [INFO ] Flow matrix only has 331 transitions (discarded 2 similar events)
// Phase 1: matrix 331 rows 116 cols
[2025-06-02 13:39:18] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:39:19] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 13:39:19] [INFO ] Flow matrix only has 331 transitions (discarded 2 similar events)
[2025-06-02 13:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:39:19] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 13:39:19] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:39:19] [INFO ] Redundant transitions in 42 ms returned []
Running 324 sub problems to find dead transitions.
[2025-06-02 13:39:19] [INFO ] Flow matrix only has 331 transitions (discarded 2 similar events)
[2025-06-02 13:39:19] [INFO ] Invariant cache hit.
[2025-06-02 13:39:19] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:21] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:21] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:22] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:22] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:22] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:22] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:22] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:23] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:23] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:23] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:23] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:24] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:24] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:24] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:24] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:24] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:24] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:24] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:25] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 6 ms to minimize.
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:26] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 14 ms to minimize.
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 20/27 constraints. Problems are: Problem set: 15 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:27] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:28] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 13 ms to minimize.
Problem TDEAD326 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:28] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 13 ms to minimize.
Problem TDEAD329 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:28] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 13 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 4/31 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/31 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 330/446 variables, 116/147 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 64/211 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/211 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/447 variables, 1/212 constraints. Problems are: Problem set: 19 solved, 305 unsolved
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 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 1.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 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 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 1.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 212 constraints, problems are : Problem set: 19 solved, 305 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 24/31 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/31 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 330/446 variables, 116/147 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 64/211 constraints. Problems are: Problem set: 19 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 305/516 constraints. Problems are: Problem set: 19 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/447 variables, and 516 constraints, problems are : Problem set: 19 solved, 305 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 305/324 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60337ms problems are : Problem set: 19 solved, 305 unsolved
Search for dead transitions found 19 dead transitions in 60341ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 116/227 places, 314/493 transitions.
Applied a total of 0 rules in 16 ms. Remains 116 /116 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:40:19] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61012 ms. Remains : 116/227 places, 314/493 transitions.
[2025-06-02 13:40:19] [INFO ] Flatten gal took : 34 ms
[2025-06-02 13:40:19] [INFO ] Flatten gal took : 34 ms
[2025-06-02 13:40:20] [INFO ] Input system was already deterministic with 314 transitions.
[2025-06-02 13:40:20] [INFO ] Flatten gal took : 31 ms
[2025-06-02 13:40:20] [INFO ] Flatten gal took : 30 ms
[2025-06-02 13:40:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality16764300182644816233.gal : 26 ms
[2025-06-02 13:40:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality8915042319477220596.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16764300182644816233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8915042319477220596.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,2.45249e+06,8.81371,172800,2,30811,5,437537,6,0,778,445307,0


Converting to forward existential form...Done !
original formula: AG(EF((p86==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p86==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t9, t11, t12, t13, t18, t19, t21, t23, t29, t32, t37, t39, t41, t43, t44, t45, t50, t...625
Detected timeout of ITS tools.
[2025-06-02 13:40:50] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:40:50] [INFO ] Applying decomposition
[2025-06-02 13:40:50] [INFO ] Flatten gal took : 16 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/graph6099158235975568885.txt' '-o' '/tmp/graph6099158235975568885.bin' '-w' '/tmp/graph6099158235975568885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6099158235975568885.bin' '-l' '-1' '-v' '-w' '/tmp/graph6099158235975568885.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:40:50] [INFO ] Decomposing Gal with order
[2025-06-02 13:40:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:40:50] [INFO ] Removed a total of 464 redundant transitions.
[2025-06-02 13:40:50] [INFO ] Flatten gal took : 150 ms
[2025-06-02 13:40:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 32 ms.
[2025-06-02 13:40:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality17679174865775050829.gal : 16 ms
[2025-06-02 13:40:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1716698051896914633.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/CTLCardinality17679174865775050829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1716698051896914633.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,2.45249e+06,1.3572,37156,1172,1572,48922,27076,651,90964,212,68639,0


Converting to forward existential form...Done !
original formula: AG(EF((i2.u11.p86==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (i2.u11.p86==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t32, t64, t69, t86, t96, t98, t106, t108, t110, t111, t112, t114, t115, t116, t117, t146, t14...663
(forward)formula 0,1,2.14296,41124,1,0,53017,40477,3552,125360,1373,88551,154820
FORMULA MedleyA-PT-17-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Graph (trivial) has 250 edges and 227 vertex of which 9 / 227 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 220 transition count 457
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 191 transition count 457
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 59 place count 191 transition count 442
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 89 place count 176 transition count 442
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 120 place count 145 transition count 386
Iterating global reduction 2 with 31 rules applied. Total rules applied 151 place count 145 transition count 386
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 151 place count 145 transition count 383
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 142 transition count 383
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 139 transition count 367
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 139 transition count 367
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 195 place count 123 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 123 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 122 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 122 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 206 place count 122 transition count 340
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 214 place count 118 transition count 336
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 117 transition count 335
Applied a total of 215 rules in 65 ms. Remains 117 /227 variables (removed 110) and now considering 335/493 (removed 158) transitions.
[2025-06-02 13:40:52] [INFO ] Flow matrix only has 333 transitions (discarded 2 similar events)
// Phase 1: matrix 333 rows 117 cols
[2025-06-02 13:40:53] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:40:53] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-02 13:40:53] [INFO ] Flow matrix only has 333 transitions (discarded 2 similar events)
[2025-06-02 13:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:40:53] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 13:40:53] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:40:53] [INFO ] Redundant transitions in 9 ms returned []
Running 326 sub problems to find dead transitions.
[2025-06-02 13:40:53] [INFO ] Flow matrix only has 333 transitions (discarded 2 similar events)
[2025-06-02 13:40:53] [INFO ] Invariant cache hit.
[2025-06-02 13:40:53] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:56] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:56] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:56] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:56] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:57] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:57] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:57] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:57] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:57] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:58] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:58] [INFO ] Deduced a trap composed of 9 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-02 13:40:58] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:58] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:58] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:59] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 4 ms to minimize.
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:59] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 9 ms to minimize.
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:41:00] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 7 ms to minimize.
Problem TDEAD331 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:41:00] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 12 ms to minimize.
Problem TDEAD332 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 18/25 constraints. Problems are: Problem set: 19 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:41:00] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:41:01] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/27 constraints. Problems are: Problem set: 19 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/27 constraints. Problems are: Problem set: 19 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 332/449 variables, 117/144 constraints. Problems are: Problem set: 19 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 64/208 constraints. Problems are: Problem set: 19 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/208 constraints. Problems are: Problem set: 19 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/450 variables, 1/209 constraints. Problems are: Problem set: 19 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:41:19] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 1/210 constraints. Problems are: Problem set: 19 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:41:24] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 24 ms to minimize.
SMT process timed out in 30384ms, After SMT, problems are : Problem set: 19 solved, 307 unsolved
Search for dead transitions found 19 dead transitions in 30385ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/227 places, 316/493 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:41:24] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 31091 ms. Remains : 117/227 places, 316/493 transitions.
[2025-06-02 13:41:24] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:41:24] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:41:24] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-02 13:41:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:41:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:41:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality16506049165144250634.gal : 4 ms
[2025-06-02 13:41:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12765355121171121947.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/CTLCardinality16506049165144250634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12765355121171121947.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,2.55487e+06,10.5198,237448,2,41892,5,562948,6,0,784,571386,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(((p35==0)&&(p10==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((p35==0)&&(p10==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t9, t11, t12, t13, t18, t19, t21, t23, t29, t32, t37, t39, t41, t43, t44, t45, t50, t...577
Detected timeout of ITS tools.
[2025-06-02 13:41:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:41:54] [INFO ] Applying decomposition
[2025-06-02 13:41:54] [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/graph13501921987136560508.txt' '-o' '/tmp/graph13501921987136560508.bin' '-w' '/tmp/graph13501921987136560508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13501921987136560508.bin' '-l' '-1' '-v' '-w' '/tmp/graph13501921987136560508.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:41:54] [INFO ] Decomposing Gal with order
[2025-06-02 13:41:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:41:54] [INFO ] Removed a total of 401 redundant transitions.
[2025-06-02 13:41:54] [INFO ] Flatten gal took : 49 ms
[2025-06-02 13:41:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 14 ms.
[2025-06-02 13:41:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality848575208736039377.gal : 5 ms
[2025-06-02 13:41:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13002872304038381893.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/CTLCardinality848575208736039377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13002872304038381893.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,2.55487e+06,7.50869,161228,767,3585,38763,134826,560,550361,258,1.71881e+06,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(((u2.p35==0)&&(u1.p10==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((u2.p35==0)&&(u1.p10==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t32, t55, t73, t80, t93, t98, t105, t110, t112, t113, t114, t116, t118, t148, t150, t233, t23...648
(forward)formula 0,0,11.1463,185420,1,0,46189,190704,3163,585460,2073,2.26918e+06,137002
FORMULA MedleyA-PT-17-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 196 transition count 439
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 196 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 196 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 195 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 195 transition count 436
Applied a total of 65 rules in 9 ms. Remains 195 /227 variables (removed 32) and now considering 436/493 (removed 57) transitions.
// Phase 1: matrix 436 rows 195 cols
[2025-06-02 13:42:05] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:42:05] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-02 13:42:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:42:06] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2025-06-02 13:42:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:16] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:16] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:16] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:16] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:17] [INFO ] Deduced a trap composed of 40 places in 272 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:17] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:17] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:17] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:18] [INFO ] Deduced a trap composed of 40 places in 305 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:19] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:19] [INFO ] Deduced a trap composed of 55 places in 300 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:20] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:20] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:20] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:21] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:21] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:21] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:21] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:22] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:22] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 40 ms to minimize.
Problem TDEAD296 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 20/27 constraints. Problems are: Problem set: 1 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:23] [INFO ] Deduced a trap composed of 115 places in 212 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:23] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:23] [INFO ] Deduced a trap composed of 96 places in 215 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:23] [INFO ] Deduced a trap composed of 115 places in 233 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:24] [INFO ] Deduced a trap composed of 96 places in 252 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:24] [INFO ] Deduced a trap composed of 115 places in 225 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:24] [INFO ] Deduced a trap composed of 34 places in 289 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:24] [INFO ] Deduced a trap composed of 118 places in 278 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:26] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:26] [INFO ] Deduced a trap composed of 40 places in 277 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:27] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:27] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:27] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:28] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:28] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:28] [INFO ] Deduced a trap composed of 113 places in 293 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:30] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:30] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:30] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:30] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 27 ms to minimize.
Problem TDEAD293 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 20/47 constraints. Problems are: Problem set: 10 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:34] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:35] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:35] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:35] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:36] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:36] [INFO ] Deduced a trap composed of 113 places in 285 ms of which 47 ms to minimize.
SMT process timed out in 30432ms, After SMT, problems are : Problem set: 10 solved, 425 unsolved
Search for dead transitions found 10 dead transitions in 30438ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 195/227 places, 426/493 transitions.
Applied a total of 0 rules in 5 ms. Remains 195 /195 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31195 ms. Remains : 195/227 places, 426/493 transitions.
[2025-06-02 13:42:36] [INFO ] Flatten gal took : 33 ms
[2025-06-02 13:42:36] [INFO ] Flatten gal took : 46 ms
[2025-06-02 13:42:37] [INFO ] Input system was already deterministic with 426 transitions.
[2025-06-02 13:42:37] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:42:37] [INFO ] Flatten gal took : 33 ms
[2025-06-02 13:42:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality3271907327863514135.gal : 7 ms
[2025-06-02 13:42:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality3560601891023014886.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/CTLCardinality3271907327863514135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3560601891023014886.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.
Detected timeout of ITS tools.
[2025-06-02 13:43:07] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:43:07] [INFO ] Applying decomposition
[2025-06-02 13:43:07] [INFO ] Flatten gal took : 31 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/graph5338999435796151490.txt' '-o' '/tmp/graph5338999435796151490.bin' '-w' '/tmp/graph5338999435796151490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5338999435796151490.bin' '-l' '-1' '-v' '-w' '/tmp/graph5338999435796151490.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:43:07] [INFO ] Decomposing Gal with order
[2025-06-02 13:43:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:43:07] [INFO ] Removed a total of 1024 redundant transitions.
[2025-06-02 13:43:07] [INFO ] Flatten gal took : 87 ms
[2025-06-02 13:43:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 28 ms.
[2025-06-02 13:43:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality11852790085114211241.gal : 7 ms
[2025-06-02 13:43:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality9679229410100532116.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/CTLCardinality11852790085114211241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9679229410100532116.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,3.05438e+07,2.58943,61004,2776,72,105546,890,924,264187,94,2639,0


Converting to forward existential form...Done !
original formula: (AF(((i3.u4.p19==1) + AX((i0.u9.p49==1)))) + EG((((i5.i0.u44.p187==1) + ((AG((i3.u3.p9==1)) * (i4.i2.u35.p148==0)) * (i7.i1.u58.p234==1))...185
=> equivalent forward existential formula: [FwdG((Init * !(EG((((i5.i0.u44.p187==1) + ((!(E(TRUE U !((i3.u3.p9==1)))) * (i4.i2.u35.p148==0)) * (i7.i1.u58.p...257
Reverse transition relation is NOT exact ! Due to transitions t13, t40, t44, t49, t106, t107, t120, t169, t175, t177, t185, t216, t217, t218, t220, t221, t...1171
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 193 transition count 433
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 193 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 193 transition count 432
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 191 transition count 428
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 191 transition count 428
Applied a total of 73 rules in 15 ms. Remains 191 /227 variables (removed 36) and now considering 428/493 (removed 65) transitions.
// Phase 1: matrix 428 rows 191 cols
[2025-06-02 13:43:37] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:43:37] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-02 13:43:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:43:38] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-02 13:43:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:47] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:47] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:48] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:48] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:48] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:48] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:49] [INFO ] Deduced a trap composed of 37 places in 292 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:49] [INFO ] Deduced a trap composed of 112 places in 233 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:49] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:50] [INFO ] Deduced a trap composed of 92 places in 262 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:50] [INFO ] Deduced a trap composed of 112 places in 264 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:50] [INFO ] Deduced a trap composed of 112 places in 293 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:50] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:51] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:51] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:52] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:53] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:53] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:53] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:53] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 23 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 6 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:54] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:54] [INFO ] Deduced a trap composed of 95 places in 252 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:56] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:56] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:56] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:57] [INFO ] Deduced a trap composed of 40 places in 277 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:57] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:58] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:58] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:58] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:58] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:43:59] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:00] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 29 ms to minimize.
Problem TDEAD287 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:00] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 14 ms to minimize.
Problem TDEAD290 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:00] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 15 ms to minimize.
Problem TDEAD291 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:00] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 15 ms to minimize.
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:01] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 16 ms to minimize.
Problem TDEAD301 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:01] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 25 ms to minimize.
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:01] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 19/46 constraints. Problems are: Problem set: 19 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:06] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:06] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:06] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:07] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:07] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:08] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/619 variables, and 52 constraints, problems are : Problem set: 19 solved, 408 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 408 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 19 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 45/52 constraints. Problems are: Problem set: 19 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:12] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:13] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:14] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 3/55 constraints. Problems are: Problem set: 19 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:19] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/56 constraints. Problems are: Problem set: 19 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:24] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/57 constraints. Problems are: Problem set: 19 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/57 constraints. Problems are: Problem set: 19 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 428/619 variables, 191/248 constraints. Problems are: Problem set: 19 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/619 variables, and 656 constraints, problems are : Problem set: 19 solved, 408 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 408/427 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 19 solved, 408 unsolved
Search for dead transitions found 19 dead transitions in 60293ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/227 places, 409/493 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61010 ms. Remains : 191/227 places, 409/493 transitions.
[2025-06-02 13:44:38] [INFO ] Flatten gal took : 16 ms
[2025-06-02 13:44:38] [INFO ] Flatten gal took : 18 ms
[2025-06-02 13:44:38] [INFO ] Input system was already deterministic with 409 transitions.
[2025-06-02 13:44:38] [INFO ] Flatten gal took : 17 ms
[2025-06-02 13:44:38] [INFO ] Flatten gal took : 17 ms
[2025-06-02 13:44:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality10637172380553875354.gal : 3 ms
[2025-06-02 13:44:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality2188075679167638891.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/CTLCardinality10637172380553875354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2188075679167638891.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.
Detected timeout of ITS tools.
[2025-06-02 13:45:08] [INFO ] Flatten gal took : 16 ms
[2025-06-02 13:45:08] [INFO ] Applying decomposition
[2025-06-02 13:45:08] [INFO ] Flatten gal took : 16 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/graph11456381635542693845.txt' '-o' '/tmp/graph11456381635542693845.bin' '-w' '/tmp/graph11456381635542693845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11456381635542693845.bin' '-l' '-1' '-v' '-w' '/tmp/graph11456381635542693845.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:45:08] [INFO ] Decomposing Gal with order
[2025-06-02 13:45:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:45:09] [INFO ] Removed a total of 927 redundant transitions.
[2025-06-02 13:45:09] [INFO ] Flatten gal took : 36 ms
[2025-06-02 13:45:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 15 ms.
[2025-06-02 13:45:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality12553016424809866132.gal : 5 ms
[2025-06-02 13:45:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality2602243433939769807.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/CTLCardinality12553016424809866132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2602243433939769807.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,2.81198e+07,1.47436,39616,2291,43,77525,646,838,129190,87,1520,0


Converting to forward existential form...Done !
original formula: AG(((!(E(AF((i0.u23.p103==1)) U !(((i6.u39.p151==0)||(i0.u22.p100==1))))) + ((i6.u40.p152==0)&&(i2.u13.p66==1))) + (AG(!(E((i5.u34.p136==...271
=> equivalent forward existential formula: ([(FwdU(FwdU((FwdU(Init,TRUE) * !((!(E(!(EG(!((i0.u23.p103==1)))) U !(((i6.u39.p151==0)||(i0.u22.p100==1))))) + ...494
Reverse transition relation is NOT exact ! Due to transitions t51, t54, t76, t95, t141, t165, t171, t173, t181, t189, t213, t215, t221, t223, t245, t247, t...966
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 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
(forward)formula 0,0,19.8456,596820,1,0,1.13198e+06,1098,6101,3.16629e+06,430,3072,1613510
FORMULA MedleyA-PT-17-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Graph (trivial) has 241 edges and 227 vertex of which 9 / 227 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 220 transition count 462
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 196 transition count 460
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 194 transition count 460
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 53 place count 194 transition count 446
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 81 place count 180 transition count 446
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 111 place count 150 transition count 390
Iterating global reduction 3 with 30 rules applied. Total rules applied 141 place count 150 transition count 390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 141 place count 150 transition count 388
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 145 place count 148 transition count 388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 146 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 146 transition count 378
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 175 place count 133 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 133 transition count 364
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 132 transition count 362
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 132 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 186 place count 132 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 194 place count 128 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 127 transition count 349
Applied a total of 195 rules in 57 ms. Remains 127 /227 variables (removed 100) and now considering 349/493 (removed 144) transitions.
[2025-06-02 13:45:29] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
// Phase 1: matrix 347 rows 127 cols
[2025-06-02 13:45:29] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:45:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 13:45:29] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2025-06-02 13:45:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:45:29] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-02 13:45:29] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:45:29] [INFO ] Redundant transitions in 3 ms returned []
Running 346 sub problems to find dead transitions.
[2025-06-02 13:45:29] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2025-06-02 13:45:29] [INFO ] Invariant cache hit.
[2025-06-02 13:45:29] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 3/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:35] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:38] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:38] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:38] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:38] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:39] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:39] [INFO ] Deduced a trap composed of 14 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-02 13:45:39] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:40] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 8 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:40] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 9 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 20/27 constraints. Problems are: Problem set: 16 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:43] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:43] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:43] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:43] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:44] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:45] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 10 ms to minimize.
Problem TDEAD341 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:45] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 10 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 7/34 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/34 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 346/473 variables, 127/161 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 94/255 constraints. Problems are: Problem set: 19 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:55] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:55] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/257 constraints. Problems are: Problem set: 19 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/474 variables, and 257 constraints, problems are : Problem set: 19 solved, 327 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 94/95 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 327 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 9/10 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/10 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 3/127 variables, 6/16 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 20/36 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/36 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 346/473 variables, 127/163 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 94/257 constraints. Problems are: Problem set: 19 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 327/584 constraints. Problems are: Problem set: 19 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/474 variables, and 584 constraints, problems are : Problem set: 19 solved, 327 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 94/95 constraints, PredecessorRefiner: 327/346 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 19 solved, 327 unsolved
Search for dead transitions found 19 dead transitions in 60213ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 127/227 places, 330/493 transitions.
Applied a total of 0 rules in 8 ms. Remains 127 /127 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:46:29] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60918 ms. Remains : 127/227 places, 330/493 transitions.
[2025-06-02 13:46:29] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:46:29] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:46:30] [INFO ] Input system was already deterministic with 330 transitions.
[2025-06-02 13:46:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:46:30] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:46:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality15236664614525525839.gal : 5 ms
[2025-06-02 13:46:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality8506457633220001999.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/CTLCardinality15236664614525525839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8506457633220001999.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,2.86347e+06,5.05608,120060,2,28487,5,310753,6,0,835,347210,0


Converting to forward existential form...Done !
original formula: (AF((EG(AF((p12==0))) * !(E((p147==1) U ((((p78==0)||(p187==1))&&(p174==1))&&((p65==0)||(p5==1))))))) + AF(EG((p82==1))))
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!((EG(!(EG(!((p12==0))))) * !(E((p147==1) U ((((p78==0)||(p187==1))&&(p174==1))&&((p65==0)|...199
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t9, t11, t12, t13, t18, t19, t21, t23, t28, t30, t33, t38, t40, t42, t45, t46, t47, t...669
Detected timeout of ITS tools.
[2025-06-02 13:47:00] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:47:00] [INFO ] Applying decomposition
[2025-06-02 13:47:00] [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/graph16918274768943297842.txt' '-o' '/tmp/graph16918274768943297842.bin' '-w' '/tmp/graph16918274768943297842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16918274768943297842.bin' '-l' '-1' '-v' '-w' '/tmp/graph16918274768943297842.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:47:00] [INFO ] Decomposing Gal with order
[2025-06-02 13:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:47:00] [INFO ] Removed a total of 651 redundant transitions.
[2025-06-02 13:47:00] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:47:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 10 ms.
[2025-06-02 13:47:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12594605341349622206.gal : 3 ms
[2025-06-02 13:47:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17845761138402322449.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/CTLCardinality12594605341349622206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17845761138402322449.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,2.86347e+06,0.438386,15268,688,111,19768,1155,662,40418,94,3938,0


Converting to forward existential form...Done !
original formula: (AF((EG(AF((u1.p12==0))) * !(E((i4.i0.u22.p147==1) U ((((i0.u9.p78==0)||(i6.i0.u29.p187==1))&&(i6.i1.u37.p174==1))&&((i0.u6.p65==0)||(i0....197
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!((EG(!(EG(!((u1.p12==0))))) * !(E((i4.i0.u22.p147==1) U ((((i0.u9.p78==0)||(i6.i0.u29.p187...257
Reverse transition relation is NOT exact ! Due to transitions t21, t58, t64, t98, t100, t109, t111, t113, t114, t115, t118, t119, t120, t121, t154, t155, t...751
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found 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
(forward)formula 0,1,16.0049,323364,1,0,482166,5845,4358,1.49463e+06,476,23606,964824
FORMULA MedleyA-PT-17-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Graph (trivial) has 243 edges and 227 vertex of which 9 / 227 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 220 transition count 459
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 193 transition count 459
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 55 place count 193 transition count 447
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 79 place count 181 transition count 447
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 111 place count 149 transition count 388
Iterating global reduction 2 with 32 rules applied. Total rules applied 143 place count 149 transition count 388
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 143 place count 149 transition count 386
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 147 transition count 386
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 146 transition count 384
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 146 transition count 384
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 181 place count 130 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 130 transition count 367
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 129 transition count 365
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 129 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 192 place count 129 transition count 357
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 200 place count 125 transition count 353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 124 transition count 352
Applied a total of 201 rules in 49 ms. Remains 124 /227 variables (removed 103) and now considering 352/493 (removed 141) transitions.
[2025-06-02 13:47:16] [INFO ] Flow matrix only has 350 transitions (discarded 2 similar events)
// Phase 1: matrix 350 rows 124 cols
[2025-06-02 13:47:16] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:47:16] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 13:47:16] [INFO ] Flow matrix only has 350 transitions (discarded 2 similar events)
[2025-06-02 13:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:47:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 13:47:16] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:47:16] [INFO ] Redundant transitions in 4 ms returned []
Running 342 sub problems to find dead transitions.
[2025-06-02 13:47:16] [INFO ] Flow matrix only has 350 transitions (discarded 2 similar events)
[2025-06-02 13:47:16] [INFO ] Invariant cache hit.
[2025-06-02 13:47:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:19] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:19] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:20] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:20] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:20] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:20] [INFO ] Deduced a trap composed of 18 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-02 13:47:20] [INFO ] Deduced a trap composed of 20 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-02 13:47:20] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:21] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:21] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:21] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:21] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:21] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:21] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:22] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:22] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 6 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:23] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 5 ms to minimize.
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 17/22 constraints. Problems are: Problem set: 13 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 13 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 2/124 variables, 2/24 constraints. Problems are: Problem set: 13 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:29] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:29] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:29] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:29] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:30] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:30] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:30] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:30] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:31] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:31] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:31] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:31] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:31] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:32] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:32] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:32] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:32] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:32] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:32] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:33] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 8 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 20/44 constraints. Problems are: Problem set: 17 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:35] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:35] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 12 ms to minimize.
Problem TDEAD348 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:36] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 11 ms to minimize.
Problem TDEAD349 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 3/47 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/47 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 349/473 variables, 124/171 constraints. Problems are: Problem set: 19 solved, 323 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/474 variables, and 171 constraints, problems are : Problem set: 19 solved, 323 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 323 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 5/5 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 31/36 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/36 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 3 (OVERLAPS) 2/124 variables, 2/38 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 9/47 constraints. Problems are: Problem set: 19 solved, 323 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:50] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/48 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/48 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 349/473 variables, 124/172 constraints. Problems are: Problem set: 19 solved, 323 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 323/495 constraints. Problems are: Problem set: 19 solved, 323 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/474 variables, and 495 constraints, problems are : Problem set: 19 solved, 323 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 323/342 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 19 solved, 323 unsolved
Search for dead transitions found 19 dead transitions in 60264ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 124/227 places, 333/493 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:48:17] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60924 ms. Remains : 124/227 places, 333/493 transitions.
[2025-06-02 13:48:17] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:48:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:48:17] [INFO ] Input system was already deterministic with 333 transitions.
[2025-06-02 13:48:17] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:48:17] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:48:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality8798202750680219554.gal : 2 ms
[2025-06-02 13:48:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality8076962657684376320.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/CTLCardinality8798202750680219554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8076962657684376320.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.
Detected timeout of ITS tools.
[2025-06-02 13:48:47] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:48:47] [INFO ] Applying decomposition
[2025-06-02 13:48:47] [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/graph14306467076333157297.txt' '-o' '/tmp/graph14306467076333157297.bin' '-w' '/tmp/graph14306467076333157297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14306467076333157297.bin' '-l' '-1' '-v' '-w' '/tmp/graph14306467076333157297.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:48:47] [INFO ] Decomposing Gal with order
[2025-06-02 13:48:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:48:47] [INFO ] Removed a total of 524 redundant transitions.
[2025-06-02 13:48:47] [INFO ] Flatten gal took : 45 ms
[2025-06-02 13:48:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 11 ms.
[2025-06-02 13:48:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality17680263824017346870.gal : 5 ms
[2025-06-02 13:48:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality6539618697465890537.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/CTLCardinality17680263824017346870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6539618697465890537.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,4.56629e+06,9.39131,206076,878,5432,36981,230938,577,412681,247,2.5813e+06,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A(((i2.u13.p120==1) + AF(((i3.u20.p131==0)||(i10.u30.p247==1)))) U ((i0.u4.p73!=1) + A((i1.u11.p99==1) U ((i10.u31.p170==0)||(i10...175
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(((i0.u4.p73!=1) + !((E(!(((i10.u31.p170==0)||(i10.u31.p241==1))) U (!((i1.u11.p99==1)...730
Reverse transition relation is NOT exact ! Due to transitions t31, t54, t76, t90, t100, t102, t110, t112, t114, t115, t116, t118, t119, t120, t121, t154, t...704
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Graph (trivial) has 236 edges and 227 vertex of which 9 / 227 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 220 transition count 459
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 193 transition count 459
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 55 place count 193 transition count 445
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 83 place count 179 transition count 445
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 111 place count 151 transition count 394
Iterating global reduction 2 with 28 rules applied. Total rules applied 139 place count 151 transition count 394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 139 place count 151 transition count 392
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 149 transition count 392
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 146 transition count 376
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 146 transition count 376
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 183 place count 129 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 184 place count 129 transition count 358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 128 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 128 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 195 place count 128 transition count 347
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 203 place count 124 transition count 343
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 123 transition count 342
Applied a total of 204 rules in 52 ms. Remains 123 /227 variables (removed 104) and now considering 342/493 (removed 151) transitions.
[2025-06-02 13:49:17] [INFO ] Flow matrix only has 340 transitions (discarded 2 similar events)
// Phase 1: matrix 340 rows 123 cols
[2025-06-02 13:49:17] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:17] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 13:49:17] [INFO ] Flow matrix only has 340 transitions (discarded 2 similar events)
[2025-06-02 13:49:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:18] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 13:49:18] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:49:18] [INFO ] Redundant transitions in 2 ms returned []
Running 333 sub problems to find dead transitions.
[2025-06-02 13:49:18] [INFO ] Flow matrix only has 340 transitions (discarded 2 similar events)
[2025-06-02 13:49:18] [INFO ] Invariant cache hit.
[2025-06-02 13:49:18] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:20] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:21] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:21] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:21] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:21] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:22] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:22] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:22] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:22] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:22] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:22] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:22] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:23] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:23] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:23] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 13 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:24] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 5 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:24] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 15 ms to minimize.
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:25] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 13 ms to minimize.
Problem TDEAD329 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:25] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 14 ms to minimize.
Problem TDEAD334 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:25] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 14 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 20/27 constraints. Problems are: Problem set: 19 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:26] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:26] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 2/29 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/29 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 339/462 variables, 123/152 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 64/216 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/216 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 1/463 variables, 1/217 constraints. Problems are: Problem set: 19 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 217 constraints, problems are : Problem set: 19 solved, 314 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 314 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 22/29 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/29 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 339/462 variables, 123/152 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/216 constraints. Problems are: Problem set: 19 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 314/530 constraints. Problems are: Problem set: 19 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/463 variables, and 530 constraints, problems are : Problem set: 19 solved, 314 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 314/333 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 19 solved, 314 unsolved
Search for dead transitions found 19 dead transitions in 60174ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 123/227 places, 323/493 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:50:18] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61132 ms. Remains : 123/227 places, 323/493 transitions.
[2025-06-02 13:50:18] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:50:18] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:50:18] [INFO ] Input system was already deterministic with 323 transitions.
[2025-06-02 13:50:18] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:50:18] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:50:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality13342460345285282010.gal : 3 ms
[2025-06-02 13:50:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5805931413614637690.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/CTLCardinality13342460345285282010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5805931413614637690.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.
Detected timeout of ITS tools.
[2025-06-02 13:50:48] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:50:48] [INFO ] Applying decomposition
[2025-06-02 13:50:48] [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/graph12130309025261726321.txt' '-o' '/tmp/graph12130309025261726321.bin' '-w' '/tmp/graph12130309025261726321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12130309025261726321.bin' '-l' '-1' '-v' '-w' '/tmp/graph12130309025261726321.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:50:49] [INFO ] Decomposing Gal with order
[2025-06-02 13:50:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:50:49] [INFO ] Removed a total of 363 redundant transitions.
[2025-06-02 13:50:49] [INFO ] Flatten gal took : 39 ms
[2025-06-02 13:50:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 9 ms.
[2025-06-02 13:50:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality4280382146524966053.gal : 4 ms
[2025-06-02 13:50:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality18415132054523363366.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/CTLCardinality4280382146524966053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18415132054523363366.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,3.05001e+06,3.096,63400,1040,5369,47529,112222,541,104131,283,395582,0


Converting to forward existential form...Done !
original formula: EG(E(!((((AG((i2.u12.p118==1)) + (i7.u27.p207==1)) + (i1.u20.p177==1)) * ((u3.p42==0)||(i9.u24.p190==1)))) U AG((((i7.u27.p212==0)||(i0.u...206
=> equivalent forward existential formula: [FwdG(Init,E(!((((!(E(TRUE U !((i2.u12.p118==1)))) + (i7.u27.p207==1)) + (i1.u20.p177==1)) * ((u3.p42==0)||(i9.u...273
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t27, t38, t40, t59, t81, t93, t102, t107, t117, t119, t121, t122, t123, t125, t126, t...844
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 193 transition count 432
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 193 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 193 transition count 431
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 192 transition count 429
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 192 transition count 429
Applied a total of 71 rules in 9 ms. Remains 192 /227 variables (removed 35) and now considering 429/493 (removed 64) transitions.
// Phase 1: matrix 429 rows 192 cols
[2025-06-02 13:51:19] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:51:19] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 13:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:51:19] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2025-06-02 13:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:29] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:29] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:29] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:29] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:30] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:30] [INFO ] Deduced a trap composed of 96 places in 245 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:30] [INFO ] Deduced a trap composed of 113 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:30] [INFO ] Deduced a trap composed of 113 places in 215 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:31] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:32] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:32] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:33] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:33] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:33] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:34] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:34] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:34] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:35] [INFO ] Deduced a trap composed of 92 places in 300 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:35] [INFO ] Deduced a trap composed of 113 places in 283 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:35] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 14 ms to minimize.
Problem TDEAD286 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 10 solved, 418 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:36] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:36] [INFO ] Deduced a trap composed of 113 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:37] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:38] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:38] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:39] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:39] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:39] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:40] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:40] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:40] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:40] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:41] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:41] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:41] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:42] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:42] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:43] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:43] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:44] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 15 ms to minimize.
Problem TDEAD289 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 20/47 constraints. Problems are: Problem set: 13 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:48] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:48] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:49] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:49] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:49] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/621 variables, and 52 constraints, problems are : Problem set: 13 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 13 solved, 415 unsolved
Problem TDEAD303 is UNSAT
Problem TDEAD315 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 45/52 constraints. Problems are: Problem set: 15 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:55] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:55] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:56] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:57] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 18 ms to minimize.
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:57] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 18 ms to minimize.
Problem TDEAD300 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 5/57 constraints. Problems are: Problem set: 19 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:00] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 1/58 constraints. Problems are: Problem set: 19 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:04] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/59 constraints. Problems are: Problem set: 19 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/59 constraints. Problems are: Problem set: 19 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 429/621 variables, 192/251 constraints. Problems are: Problem set: 19 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 409/660 constraints. Problems are: Problem set: 19 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/621 variables, and 660 constraints, problems are : Problem set: 19 solved, 409 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 409/428 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60240ms problems are : Problem set: 19 solved, 409 unsolved
Search for dead transitions found 19 dead transitions in 60242ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/227 places, 410/493 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60915 ms. Remains : 192/227 places, 410/493 transitions.
[2025-06-02 13:52:20] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:52:20] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:52:20] [INFO ] Input system was already deterministic with 410 transitions.
[2025-06-02 13:52:20] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:52:20] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:52:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality14278016437391454238.gal : 2 ms
[2025-06-02 13:52:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality4239820964292824994.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/CTLCardinality14278016437391454238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4239820964292824994.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.
Detected timeout of ITS tools.
[2025-06-02 13:52:50] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:52:50] [INFO ] Applying decomposition
[2025-06-02 13:52:50] [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/graph3545473778240597451.txt' '-o' '/tmp/graph3545473778240597451.bin' '-w' '/tmp/graph3545473778240597451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3545473778240597451.bin' '-l' '-1' '-v' '-w' '/tmp/graph3545473778240597451.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:52:50] [INFO ] Decomposing Gal with order
[2025-06-02 13:52:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:52:50] [INFO ] Removed a total of 944 redundant transitions.
[2025-06-02 13:52:50] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:52:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 11 ms.
[2025-06-02 13:52:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7358322892228046736.gal : 5 ms
[2025-06-02 13:52:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality2876332498758778156.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/CTLCardinality7358322892228046736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2876332498758778156.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,2.91258e+07,6.45004,170068,1995,42,267353,1208,783,1.23259e+06,88,3173,0


Converting to forward existential form...Done !
original formula: EX(EG((EX(((i4.i1.u37.p149==0)||(i5.u28.p120==1))) * ((AG((i10.u6.p28==1)) + AG(((i4.i1.u32.p140==0)||(i1.u13.p63==1)))) + ((i7.i3.u60.p2...184
=> equivalent forward existential formula: [FwdG(EY(Init),(EX(((i4.i1.u37.p149==0)||(i5.u28.p120==1))) * ((!(E(TRUE U !((i10.u6.p28==1)))) + !(E(TRUE U !((...251
Reverse transition relation is NOT exact ! Due to transitions t9, t47, t52, t86, t95, t164, t170, t172, t180, t186, t188, t211, t219, t243, t251, t259, t26...923
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 193 transition count 433
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 193 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 193 transition count 432
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 191 transition count 428
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 191 transition count 428
Applied a total of 73 rules in 10 ms. Remains 191 /227 variables (removed 36) and now considering 428/493 (removed 65) transitions.
// Phase 1: matrix 428 rows 191 cols
[2025-06-02 13:53:20] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:20] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-02 13:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:21] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-06-02 13:53:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:30] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:30] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:31] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:31] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:31] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:31] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:32] [INFO ] Deduced a trap composed of 111 places in 251 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:32] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:32] [INFO ] Deduced a trap composed of 111 places in 251 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:32] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:33] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:33] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:33] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:33] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:34] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:34] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:34] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:35] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:35] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:35] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:36] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:36] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:37] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:37] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:37] [INFO ] Deduced a trap composed of 90 places in 205 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:38] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:38] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:39] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:39] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:39] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:39] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:40] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:40] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:40] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:41] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 28 ms to minimize.
Problem TDEAD287 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:43] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 18 ms to minimize.
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 20/47 constraints. Problems are: Problem set: 10 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:46] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:47] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:48] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:49] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:49] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:50] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:51] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 18 ms to minimize.
Problem TDEAD291 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:51] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 18 ms to minimize.
Problem TDEAD293 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:51] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 23 ms to minimize.
SMT process timed out in 30434ms, After SMT, problems are : Problem set: 12 solved, 415 unsolved
Search for dead transitions found 12 dead transitions in 30436ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/227 places, 416/493 transitions.
Applied a total of 0 rules in 3 ms. Remains 191 /191 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31284 ms. Remains : 191/227 places, 416/493 transitions.
[2025-06-02 13:53:51] [INFO ] Flatten gal took : 21 ms
[2025-06-02 13:53:51] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:53:51] [INFO ] Input system was already deterministic with 416 transitions.
[2025-06-02 13:53:51] [INFO ] Flatten gal took : 21 ms
[2025-06-02 13:53:51] [INFO ] Flatten gal took : 27 ms
[2025-06-02 13:53:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11864029922591610107.gal : 4 ms
[2025-06-02 13:53:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8033991882948308683.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/CTLCardinality11864029922591610107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8033991882948308683.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.
Detected timeout of ITS tools.
[2025-06-02 13:54:21] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:54:21] [INFO ] Applying decomposition
[2025-06-02 13:54:21] [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/graph16967705246098368716.txt' '-o' '/tmp/graph16967705246098368716.bin' '-w' '/tmp/graph16967705246098368716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16967705246098368716.bin' '-l' '-1' '-v' '-w' '/tmp/graph16967705246098368716.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:54:22] [INFO ] Decomposing Gal with order
[2025-06-02 13:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:54:22] [INFO ] Removed a total of 982 redundant transitions.
[2025-06-02 13:54:22] [INFO ] Flatten gal took : 30 ms
[2025-06-02 13:54:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 6 ms.
[2025-06-02 13:54:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality1581999752204839852.gal : 4 ms
[2025-06-02 13:54:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality8318883516951027114.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/CTLCardinality1581999752204839852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8318883516951027114.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,2.77138e+07,3.34515,87992,2585,49,211454,1107,866,297052,86,3042,0


Converting to forward existential form...Done !
original formula: E(!((AX(!((AG(((i6.i1.u33.p135==0)||(u9.p41==1))) + (i8.u25.p107==0)))) * EX(((i7.i1.u32.p165==0)||(i0.i0.u10.p51==1))))) U (i0.i0.u6.p23...160
=> equivalent forward existential formula: [(FwdU(Init,!((!(EX(!(!((!(E(TRUE U !(((i6.i1.u33.p135==0)||(u9.p41==1))))) + (i8.u25.p107==0)))))) * EX(((i7.i1...224
Reverse transition relation is NOT exact ! Due to transitions t41, t54, t93, t97, t110, t123, t139, t165, t171, t173, t181, t187, t189, t213, t221, t245, t...1009
(forward)formula 0,1,18.7635,470820,1,0,842107,2052,6717,2.8491e+06,468,7517,1677796
FORMULA MedleyA-PT-17-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 204 transition count 452
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 204 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 203 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 203 transition count 450
Applied a total of 48 rules in 5 ms. Remains 203 /227 variables (removed 24) and now considering 450/493 (removed 43) transitions.
// Phase 1: matrix 450 rows 203 cols
[2025-06-02 13:54:40] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:54:41] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 13:54:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:54:41] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2025-06-02 13:54: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/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:51] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:51] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:52] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:52] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:52] [INFO ] Deduced a trap composed of 119 places in 211 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:52] [INFO ] Deduced a trap composed of 96 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:53] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:53] [INFO ] Deduced a trap composed of 119 places in 231 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:53] [INFO ] Deduced a trap composed of 119 places in 227 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:53] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:54] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:55] [INFO ] Deduced a trap composed of 39 places in 304 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:55] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:56] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:56] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:56] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:57] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:57] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:57] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:58] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 31 ms to minimize.
Problem TDEAD307 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 5 solved, 444 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:59] [INFO ] Deduced a trap composed of 117 places in 289 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:00] [INFO ] Deduced a trap composed of 25 places in 318 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:00] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:01] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:01] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:01] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:01] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:02] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:02] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:02] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:03] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:03] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:03] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:04] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:04] [INFO ] Deduced a trap composed of 117 places in 287 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:05] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 15 ms to minimize.
Problem TDEAD310 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:05] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 16 ms to minimize.
Problem TDEAD311 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:06] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 17 ms to minimize.
Problem TDEAD313 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:06] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 22 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:06] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 17 ms to minimize.
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 19 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:10] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:11] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/653 variables, and 50 constraints, problems are : Problem set: 19 solved, 430 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 430 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 19 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 43/50 constraints. Problems are: Problem set: 19 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:16] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:16] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:18] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:18] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:18] [INFO ] Deduced a trap composed of 108 places in 266 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:19] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:19] [INFO ] Deduced a trap composed of 126 places in 302 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:19] [INFO ] Deduced a trap composed of 118 places in 282 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:21] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 9/59 constraints. Problems are: Problem set: 19 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:23] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:23] [INFO ] Deduced a trap composed of 26 places in 277 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:24] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:24] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:25] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:26] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:26] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 7/66 constraints. Problems are: Problem set: 19 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:30] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:31] [INFO ] Deduced a trap composed of 54 places in 284 ms of which 39 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 2/68 constraints. Problems are: Problem set: 19 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:36] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 32 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 1/69 constraints. Problems are: Problem set: 19 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:41] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/653 variables, and 70 constraints, problems are : Problem set: 19 solved, 430 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 0/449 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60212ms problems are : Problem set: 19 solved, 430 unsolved
Search for dead transitions found 19 dead transitions in 60215ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/227 places, 431/493 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60763 ms. Remains : 203/227 places, 431/493 transitions.
[2025-06-02 13:55:41] [INFO ] Flatten gal took : 21 ms
[2025-06-02 13:55:41] [INFO ] Flatten gal took : 21 ms
[2025-06-02 13:55:41] [INFO ] Input system was already deterministic with 431 transitions.
[2025-06-02 13:55:41] [INFO ] Flatten gal took : 21 ms
[2025-06-02 13:55:41] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:55:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality10097710511180213534.gal : 4 ms
[2025-06-02 13:55:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality17315439144584538853.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/CTLCardinality10097710511180213534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17315439144584538853.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.
Detected timeout of ITS tools.
[2025-06-02 13:56:11] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:56:11] [INFO ] Applying decomposition
[2025-06-02 13:56:11] [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/graph16639085031108041417.txt' '-o' '/tmp/graph16639085031108041417.bin' '-w' '/tmp/graph16639085031108041417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16639085031108041417.bin' '-l' '-1' '-v' '-w' '/tmp/graph16639085031108041417.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:56:12] [INFO ] Decomposing Gal with order
[2025-06-02 13:56:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:56:12] [INFO ] Removed a total of 926 redundant transitions.
[2025-06-02 13:56:12] [INFO ] Flatten gal took : 29 ms
[2025-06-02 13:56:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 6 ms.
[2025-06-02 13:56:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality17393046524993501694.gal : 6 ms
[2025-06-02 13:56:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality3413359627279630892.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/CTLCardinality17393046524993501694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3413359627279630892.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,4.26859e+07,4.30701,115588,3350,71,254576,1328,934,428494,100,4709,0


Converting to forward existential form...Done !
original formula: ((AX(((!(A(((i3.u17.p57==0)||(i6.i0.u41.p145==1)) U (i10.u55.p209==0))) + (i1.u10.p32==0)) + ((i6.i2.u32.p126==1) + E(((i3.u25.p101==0)||...806
=> equivalent forward existential formula: (([((((EY(Init) * !(((i6.i2.u32.p126==1) + E(((i3.u25.p101==0)||(i7.i0.u33.p134==1)) U ((i3.u6.p27==0)||(i8.i1.u...1234
Reverse transition relation is NOT exact ! Due to transitions t11, t26, t32, t34, t81, t105, t124, t156, t183, t201, t207, t209, t229, t231, t232, t233, t2...1335
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 195 transition count 438
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 195 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 195 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 193 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 193 transition count 433
Applied a total of 69 rules in 6 ms. Remains 193 /227 variables (removed 34) and now considering 433/493 (removed 60) transitions.
// Phase 1: matrix 433 rows 193 cols
[2025-06-02 13:56:42] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:56:42] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 13:56:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:56:42] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2025-06-02 13:56:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:51] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:51] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:51] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:52] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:52] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:52] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:53] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:53] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:53] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:54] [INFO ] Deduced a trap composed of 113 places in 209 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:54] [INFO ] Deduced a trap composed of 95 places in 246 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:54] [INFO ] Deduced a trap composed of 113 places in 216 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:56] [INFO ] Deduced a trap composed of 92 places in 288 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:56] [INFO ] Deduced a trap composed of 95 places in 280 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:56] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:56] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:57] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:57] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:57] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:58] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 20 ms to minimize.
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 20/27 constraints. Problems are: Problem set: 4 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:58] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:56:59] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:00] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:00] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:00] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:00] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:01] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:01] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:01] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:01] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:02] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:02] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:02] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:03] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:03] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:03] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:04] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:04] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:05] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:05] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 28 ms to minimize.
Problem TDEAD292 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 20/47 constraints. Problems are: Problem set: 9 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:08] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:09] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:10] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:10] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:12] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 19 ms to minimize.
Problem TDEAD295 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:12] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 18 ms to minimize.
Problem TDEAD296 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:12] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 18 ms to minimize.
Problem TDEAD298 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:13] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 30 ms to minimize.
SMT process timed out in 30287ms, After SMT, problems are : Problem set: 12 solved, 420 unsolved
Search for dead transitions found 12 dead transitions in 30290ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 193/227 places, 421/493 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30989 ms. Remains : 193/227 places, 421/493 transitions.
[2025-06-02 13:57:13] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:57:13] [INFO ] Flatten gal took : 21 ms
[2025-06-02 13:57:13] [INFO ] Input system was already deterministic with 421 transitions.
[2025-06-02 13:57:13] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:57:13] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:57:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality13575132769734569507.gal : 4 ms
[2025-06-02 13:57:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality1701813933635939800.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/CTLCardinality13575132769734569507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1701813933635939800.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.
Detected timeout of ITS tools.
[2025-06-02 13:57:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:57:43] [INFO ] Applying decomposition
[2025-06-02 13:57: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/graph1097038912545332269.txt' '-o' '/tmp/graph1097038912545332269.bin' '-w' '/tmp/graph1097038912545332269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1097038912545332269.bin' '-l' '-1' '-v' '-w' '/tmp/graph1097038912545332269.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:57:43] [INFO ] Decomposing Gal with order
[2025-06-02 13:57:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:57:43] [INFO ] Removed a total of 996 redundant transitions.
[2025-06-02 13:57:43] [INFO ] Flatten gal took : 44 ms
[2025-06-02 13:57:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 7 ms.
[2025-06-02 13:57:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15134686807304424674.gal : 6 ms
[2025-06-02 13:57:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4771789314977370260.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/CTLCardinality15134686807304424674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4771789314977370260.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,3.18924e+07,2.67379,72168,2311,50,124846,677,880,374454,94,1440,0


Converting to forward existential form...Done !
original formula: EG(EX(E(EF(((i1.u21.p90==0)||(i3.u8.p39==1))) U ((AG((i7.u57.p221==0)) * E((i1.u20.p94==1) U (i9.u2.p5==1))) * ((i9.u10.p56==0)||(i4.i0.i...174
=> equivalent forward existential formula: [FwdG(Init,EX(E(E(TRUE U ((i1.u21.p90==0)||(i3.u8.p39==1))) U ((!(E(TRUE U !((i7.u57.p221==0)))) * E((i1.u20.p94...235
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t61, t106, t119, t170, t176, t178, t186, t192, t194, t218, t219, t226, t227, t250, ...1009
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
(forward)formula 0,0,27.5175,773944,1,0,848984,1290,6467,7.07145e+06,469,3739,1626842
FORMULA MedleyA-PT-17-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 197 transition count 442
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 197 transition count 442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 197 transition count 441
Applied a total of 61 rules in 5 ms. Remains 197 /227 variables (removed 30) and now considering 441/493 (removed 52) transitions.
// Phase 1: matrix 441 rows 197 cols
[2025-06-02 13:58:11] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:58:11] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 13:58:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:58:11] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2025-06-02 13:58:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:21] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:21] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:22] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:22] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:22] [INFO ] Deduced a trap composed of 114 places in 230 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:23] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:23] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:23] [INFO ] Deduced a trap composed of 114 places in 222 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:23] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:24] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:24] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:24] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:24] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:24] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:25] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:25] [INFO ] Deduced a trap composed of 91 places in 227 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:26] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:27] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 23 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/27 constraints. Problems are: Problem set: 6 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:28] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:29] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:30] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:30] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:30] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:30] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:31] [INFO ] Deduced a trap composed of 41 places in 270 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:31] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:32] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:32] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:32] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:33] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:34] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:35] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:35] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:35] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 31 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 20/47 constraints. Problems are: Problem set: 13 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:39] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:41] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:41] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:41] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/638 variables, and 51 constraints, problems are : Problem set: 13 solved, 427 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 13 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 44/51 constraints. Problems are: Problem set: 13 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:47] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:47] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:49] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 20 ms to minimize.
Problem TDEAD301 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:49] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 19 ms to minimize.
Problem TDEAD302 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:49] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 18 ms to minimize.
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:49] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 26 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 6/57 constraints. Problems are: Problem set: 19 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:52] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:53] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:53] [INFO ] Deduced a trap composed of 117 places in 302 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:53] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:54] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 5/62 constraints. Problems are: Problem set: 19 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:57] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:57] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:58] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:59] [INFO ] Deduced a trap composed of 127 places in 254 ms of which 29 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 4/66 constraints. Problems are: Problem set: 19 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/66 constraints. Problems are: Problem set: 19 solved, 421 unsolved
At refinement iteration 7 (OVERLAPS) 441/638 variables, 197/263 constraints. Problems are: Problem set: 19 solved, 421 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 421/684 constraints. Problems are: Problem set: 19 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/638 variables, and 684 constraints, problems are : Problem set: 19 solved, 421 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 421/440 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 19 solved, 421 unsolved
Search for dead transitions found 19 dead transitions in 60265ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 197/227 places, 422/493 transitions.
Applied a total of 0 rules in 2 ms. Remains 197 /197 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60952 ms. Remains : 197/227 places, 422/493 transitions.
[2025-06-02 13:59:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:59:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:59:12] [INFO ] Input system was already deterministic with 422 transitions.
[2025-06-02 13:59:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:59:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:59:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality5306790011764700665.gal : 2 ms
[2025-06-02 13:59:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality14208978844083438468.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/CTLCardinality5306790011764700665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14208978844083438468.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.
Detected timeout of ITS tools.
[2025-06-02 13:59:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:59:42] [INFO ] Applying decomposition
[2025-06-02 13:59:42] [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/graph13542915250239825737.txt' '-o' '/tmp/graph13542915250239825737.bin' '-w' '/tmp/graph13542915250239825737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13542915250239825737.bin' '-l' '-1' '-v' '-w' '/tmp/graph13542915250239825737.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:59:42] [INFO ] Decomposing Gal with order
[2025-06-02 13:59:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:59:42] [INFO ] Removed a total of 942 redundant transitions.
[2025-06-02 13:59:42] [INFO ] Flatten gal took : 43 ms
[2025-06-02 13:59:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 10 ms.
[2025-06-02 13:59:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16195210023473507979.gal : 5 ms
[2025-06-02 13:59:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12496099169334634462.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/CTLCardinality16195210023473507979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12496099169334634462.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,3.59514e+07,3.19844,80992,2903,84,138871,1074,891,437685,114,2931,0


Converting to forward existential form...Done !
original formula: EX(E(!(EG(!(((i3.u23.p98==1)&&(i2.u15.p69==0))))) U ((AX(E(((i2.u14.p67==0)||(i6.u34.p148==1)) U ((i7.i0.u51.p206==0)||(i3.u22.p91==1))))...281
=> equivalent forward existential formula: [(((FwdU(EY(Init),!(EG(!(((i3.u23.p98==1)&&(i2.u15.p69==0)))))) * (!(EX(!(E(((i2.u14.p67==0)||(i6.u34.p148==1)) ...509
Reverse transition relation is NOT exact ! Due to transitions t22, t39, t78, t88, t174, t180, t182, t190, t223, t226, t231, t234, t255, t258, t263, t266, t...1209
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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Graph (trivial) has 250 edges and 227 vertex of which 9 / 227 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 220 transition count 457
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 191 transition count 457
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 59 place count 191 transition count 442
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 89 place count 176 transition count 442
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 120 place count 145 transition count 386
Iterating global reduction 2 with 31 rules applied. Total rules applied 151 place count 145 transition count 386
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 151 place count 145 transition count 383
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 142 transition count 383
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 139 transition count 367
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 139 transition count 367
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 191 place count 125 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 125 transition count 352
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 193 place count 124 transition count 350
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 124 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 202 place count 124 transition count 342
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 210 place count 120 transition count 338
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 211 place count 119 transition count 337
Applied a total of 211 rules in 48 ms. Remains 119 /227 variables (removed 108) and now considering 337/493 (removed 156) transitions.
[2025-06-02 14:00:12] [INFO ] Flow matrix only has 335 transitions (discarded 2 similar events)
// Phase 1: matrix 335 rows 119 cols
[2025-06-02 14:00:12] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:00:12] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-02 14:00:12] [INFO ] Flow matrix only has 335 transitions (discarded 2 similar events)
[2025-06-02 14:00:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:00:13] [INFO ] State equation strengthened by 97 read => feed constraints.
[2025-06-02 14:00:13] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:00:13] [INFO ] Redundant transitions in 2 ms returned []
Running 336 sub problems to find dead transitions.
[2025-06-02 14:00:13] [INFO ] Flow matrix only has 335 transitions (discarded 2 similar events)
[2025-06-02 14:00:13] [INFO ] Invariant cache hit.
[2025-06-02 14:00:13] [INFO ] State equation strengthened by 97 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:18] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:18] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:18] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:18] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:18] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:18] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:19] [INFO ] Deduced a trap composed of 9 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-02 14:00:19] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:19] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:19] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:19] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:19] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:20] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:20] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:20] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:20] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:20] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:21] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 8 ms to minimize.
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:21] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 17 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:21] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 13 ms to minimize.
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 20/27 constraints. Problems are: Problem set: 17 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:24] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:24] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:24] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:24] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:25] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:25] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:26] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 12 ms to minimize.
Problem TDEAD333 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:26] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 8 ms to minimize.
Problem TDEAD334 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 8/35 constraints. Problems are: Problem set: 19 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/35 constraints. Problems are: Problem set: 19 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 334/453 variables, 119/154 constraints. Problems are: Problem set: 19 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 96/250 constraints. Problems are: Problem set: 19 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/250 constraints. Problems are: Problem set: 19 solved, 317 unsolved
SMT process timed out in 30151ms, After SMT, problems are : Problem set: 19 solved, 317 unsolved
Search for dead transitions found 19 dead transitions in 30153ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 119/227 places, 318/493 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:00:43] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 31015 ms. Remains : 119/227 places, 318/493 transitions.
[2025-06-02 14:00:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 14:00:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 14:00:43] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 14:00:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 14:00:43] [INFO ] Flatten gal took : 14 ms
[2025-06-02 14:00:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality11800753448855389393.gal : 3 ms
[2025-06-02 14:00:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14041503560722130503.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/CTLCardinality11800753448855389393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14041503560722130503.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,2.56263e+06,16.4113,331156,2,54074,5,859810,6,0,793,870890,0


Converting to forward existential form...Done !
original formula: !(A(!(EF((p108==1))) U !(((p36==0)||(p11==1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(((p36==0)||(p11==1))))) * !(!(((p36==0)||(p11==1))))),TRUE) * (p108==1))] != FALSE + [Fwd...200
Hit Full ! (commute/partial/dont) 298/0/20
(forward)formula 0,1,24.9845,342164,1,0,10,869120,16,2,1843,888224,6
FORMULA MedleyA-PT-17-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 493/493 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 191 transition count 430
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 191 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 191 transition count 429
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 189 transition count 425
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 189 transition count 425
Applied a total of 77 rules in 12 ms. Remains 189 /227 variables (removed 38) and now considering 425/493 (removed 68) transitions.
// Phase 1: matrix 425 rows 189 cols
[2025-06-02 14:01:08] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:01:09] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-02 14:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:01:09] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-06-02 14:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:17] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:17] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:17] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:18] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:18] [INFO ] Deduced a trap composed of 111 places in 262 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:18] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:18] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:19] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:19] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:19] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:19] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:20] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:20] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:21] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:21] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:21] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:22] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:22] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:22] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:23] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:24] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:25] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:25] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:25] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:26] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:26] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:26] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:27] [INFO ] Deduced a trap composed of 24 places in 310 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:27] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:27] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:27] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:28] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:28] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:29] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:29] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:29] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 28 ms to minimize.
Problem TDEAD284 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:29] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 14 ms to minimize.
Problem TDEAD287 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:29] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 14 ms to minimize.
Problem TDEAD288 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:30] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 15 ms to minimize.
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:30] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 15 ms to minimize.
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 20/47 constraints. Problems are: Problem set: 19 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:33] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:34] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:35] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:35] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:36] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 5/52 constraints. Problems are: Problem set: 19 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:39] [INFO ] Deduced a trap composed of 90 places in 247 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/614 variables, and 53 constraints, problems are : Problem set: 19 solved, 405 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 405 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 19 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 46/53 constraints. Problems are: Problem set: 19 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:43] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:44] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/55 constraints. Problems are: Problem set: 19 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:46] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:47] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/57 constraints. Problems are: Problem set: 19 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:52] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:53] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/59 constraints. Problems are: Problem set: 19 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:56] [INFO ] Deduced a trap composed of 90 places in 266 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:58] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:58] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 3/62 constraints. Problems are: Problem set: 19 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:02:07] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/614 variables, and 63 constraints, problems are : Problem set: 19 solved, 405 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 0/424 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 19 solved, 405 unsolved
Search for dead transitions found 19 dead transitions in 60236ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/227 places, 406/493 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60798 ms. Remains : 189/227 places, 406/493 transitions.
[2025-06-02 14:02:09] [INFO ] Flatten gal took : 20 ms
[2025-06-02 14:02:09] [INFO ] Flatten gal took : 21 ms
[2025-06-02 14:02:09] [INFO ] Input system was already deterministic with 406 transitions.
[2025-06-02 14:02:09] [INFO ] Flatten gal took : 21 ms
[2025-06-02 14:02:09] [INFO ] Flatten gal took : 21 ms
[2025-06-02 14:02:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality10690125129137189490.gal : 4 ms
[2025-06-02 14:02:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality6470907111709799632.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/CTLCardinality10690125129137189490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6470907111709799632.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.
Detected timeout of ITS tools.
[2025-06-02 14:02:39] [INFO ] Flatten gal took : 13 ms
[2025-06-02 14:02:39] [INFO ] Applying decomposition
[2025-06-02 14:02:39] [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/graph11625891856624383097.txt' '-o' '/tmp/graph11625891856624383097.bin' '-w' '/tmp/graph11625891856624383097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11625891856624383097.bin' '-l' '-1' '-v' '-w' '/tmp/graph11625891856624383097.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:02:39] [INFO ] Decomposing Gal with order
[2025-06-02 14:02:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:02:40] [INFO ] Removed a total of 936 redundant transitions.
[2025-06-02 14:02:40] [INFO ] Flatten gal took : 53 ms
[2025-06-02 14:02:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 21 ms.
[2025-06-02 14:02:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality597872429869392160.gal : 5 ms
[2025-06-02 14:02:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality884911711416444944.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/CTLCardinality597872429869392160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality884911711416444944.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 -...260
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,2.77138e+07,5.06865,137928,1970,41,247484,1196,851,836216,90,3183,0


Converting to forward existential form...Done !
original formula: AF(AX(A((AF(((i10.u23.p105==0)||(i5.u3.p9==1))) * (i6.u34.p147==1)) U EX(EX((i7.i2.u36.p155==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!((E(!(EX(EX((i7.i2.u36.p155==1)))) U (!((!(EG(!(((i10.u23.p105==0)||(i5.u3.p9==1))))) * (i6...258
Reverse transition relation is NOT exact ! Due to transitions t37, t82, t102, t107, t162, t168, t170, t178, t184, t186, t209, t212, t217, t220, t241, t244,...976
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 14
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
Detected timeout of ITS tools.
[2025-06-02 14:03:10] [INFO ] Flatten gal took : 15 ms
[2025-06-02 14:03:10] [INFO ] Flatten gal took : 15 ms
[2025-06-02 14:03:10] [INFO ] Applying decomposition
[2025-06-02 14:03:10] [INFO ] Flatten gal took : 15 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/graph14641245794255916180.txt' '-o' '/tmp/graph14641245794255916180.bin' '-w' '/tmp/graph14641245794255916180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14641245794255916180.bin' '-l' '-1' '-v' '-w' '/tmp/graph14641245794255916180.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:03:10] [INFO ] Decomposing Gal with order
[2025-06-02 14:03:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:03:10] [INFO ] Removed a total of 1089 redundant transitions.
[2025-06-02 14:03:10] [INFO ] Flatten gal took : 28 ms
[2025-06-02 14:03:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 7 ms.
[2025-06-02 14:03:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality16931384351741213539.gal : 4 ms
[2025-06-02 14:03:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality14493039129141738793.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/CTLCardinality16931384351741213539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14493039129141738793.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 7 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.94013e+07,13.0871,255244,4890,169,190554,1490,1140,2.29908e+06,113,6027,0


Converting to forward existential form...Done !
original formula: (AF(((i0.u7.p19==1) + AX((i1.i0.u16.p49==1)))) + EG((((i6.i1.u55.p187==1) + ((AG((i0.u4.p9==1)) * (i5.i1.u42.p148==0)) * (i8.i1.u71.p234=...189
=> equivalent forward existential formula: [FwdG((Init * !(EG((((i6.i1.u55.p187==1) + ((!(E(TRUE U !((i0.u4.p9==1)))) * (i5.i1.u42.p148==0)) * (i8.i1.u71.p...261
Reverse transition relation is NOT exact ! Due to transitions t3, t14, t20, t24, t29, t86, t91, t96, t228, t252, t270, t272, t273, t274, t275, t276, t278, ...1925
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using 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
(forward)formula 0,0,468.372,2822212,1,0,1.66498e+06,2984,2699,2.95424e+07,231,11949,1500579
FORMULA MedleyA-PT-17-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AF(!(A(((i5.i0.u34.p120==1) + AF(((i5.i1.u47.p131==0)||(i1.i0.u75.p247==1)))) U ((i3.u20.p73!=1) + A((i1.i1.u28.p99==1) U ((i8.i1.u50....191
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(((i3.u20.p73!=1) + !((E(!(((i8.i1.u50.p170==0)||(i8.i1.u73.p241==1))) U (!((i1.i1.u28...786
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 8
ITS-tools command line returned an error code 139
[2025-06-02 14:17:15] [INFO ] Applying decomposition
[2025-06-02 14:17:15] [INFO ] Flatten gal took : 16 ms
[2025-06-02 14:17:15] [INFO ] Decomposing Gal with order
[2025-06-02 14:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:17:15] [INFO ] Removed a total of 716 redundant transitions.
[2025-06-02 14:17:15] [INFO ] Flatten gal took : 23 ms
[2025-06-02 14:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 9 ms.
[2025-06-02 14:17:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality17743442987142221099.gal : 3 ms
[2025-06-02 14:17:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality10500100477508450482.ctl : 2 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/CTLCardinality17743442987142221099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10500100477508450482.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 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,7.94013e+07,6.61985,166172,1826,3638,138409,115264,355,749317,545,1.22509e+06,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A(((i0.i1.u10.p120==1) + AF(((i0.i1.u10.p131==0)||(u12.p247==1)))) U ((i0.i0.i1.u7.p73!=1) + A((i0.i0.i1.u8.p99==1) U ((i0.i1.u10...186
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(((i0.i0.i1.u7.p73!=1) + !((E(!(((i0.i1.u10.p170==0)||(u12.p241==1))) U (!((i0.i0.i1.u...747
Reverse transition relation is NOT exact ! Due to transitions t253, t339, t340, u12.t2, u12.t3, u12.t5, u12.t7, i0.t488, i0.t443, i0.t396, i0.i0.i0.u4.t229...2499
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 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-02 14:21:24] [INFO ] Flatten gal took : 15 ms
[2025-06-02 14:21:24] [INFO ] Input system was already deterministic with 493 transitions.
[2025-06-02 14:21:24] [INFO ] Transformed 227 places.
[2025-06-02 14:21:24] [INFO ] Transformed 493 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 14:21:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8578121366313968182.gal : 4 ms
[2025-06-02 14:21:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12187838820182650445.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/CTLCardinality8578121366313968182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12187838820182650445.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
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,7.94013e+07,329.325,5441848,2,340561,5,1.32931e+07,6,0,1403,2.02705e+07,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A(((p120==1) + AF(((p131==0)||(p247==1)))) U ((p73!=1) + A((p99==1) U ((p170==0)||(p241==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(((p73!=1) + !((E(!(((p170==0)||(p241==1))) U (!((p99==1)) * !(((p170==0)||(p241==1)))...525
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t12, t14, t15, t17, t19, t20, t21, t24, t27, t29, t30, t32, t35, t37, t38, t4...1121

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="MedleyA-PT-17"
export BK_EXAMINATION="CTLCardinality"
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 MedleyA-PT-17, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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