fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r058-smll-174854064700745
Last Updated
June 24, 2025

About the Execution of ITS-Tools for DiscoveryGPU-PT-14b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ??T??????TTT?FF? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 104K 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 DiscoveryGPU-PT-14b-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2023-15
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-00
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-01
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-02
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-03
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-04
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-05
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-06
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-07
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-08
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-09
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-10
FORMULA_NAME DiscoveryGPU-PT-14b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748950212942

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 11:30:14] [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-03 11:30:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 11:30:15] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2025-06-03 11:30:15] [INFO ] Transformed 408 places.
[2025-06-03 11:30:15] [INFO ] Transformed 434 transitions.
[2025-06-03 11:30:15] [INFO ] Found NUPN structural information;
[2025-06-03 11:30:15] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Support contains 98 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 390 transition count 434
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 57 place count 351 transition count 395
Iterating global reduction 1 with 39 rules applied. Total rules applied 96 place count 351 transition count 395
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 345 transition count 389
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 345 transition count 389
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 339 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 339 transition count 383
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 336 transition count 380
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 336 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 334 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 334 transition count 376
Applied a total of 130 rules in 169 ms. Remains 334 /408 variables (removed 74) and now considering 376/434 (removed 58) transitions.
// Phase 1: matrix 376 rows 334 cols
[2025-06-03 11:30:15] [INFO ] Computed 4 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:30:16] [INFO ] Implicit Places using invariants in 633 ms returned []
[2025-06-03 11:30:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:30:16] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2025-06-03 11:30:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 5/328 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:24] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:25] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:25] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 376/704 variables, 328/336 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:36] [INFO ] Deduced a trap composed of 9 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-03 11:30:36] [INFO ] Deduced a trap composed of 10 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-03 11:30:36] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:36] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:37] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:37] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:37] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:37] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:37] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:38] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:38] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:38] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:38] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:38] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:38] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:39] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:39] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:39] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:39] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:39] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:40] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:40] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:40] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:40] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:30:41] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 39 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/710 variables, and 361 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 328/334 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 5/328 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 376/704 variables, 328/361 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 369/730 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:02] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 25 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/710 variables, and 731 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 328/334 constraints, PredecessorRefiner: 369/375 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60377ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in LTL mode, iteration 1 : 334/408 places, 376/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61903 ms. Remains : 334/408 places, 376/434 transitions.
Support contains 98 out of 334 places after structural reductions.
[2025-06-03 11:31:17] [INFO ] Flatten gal took : 75 ms
[2025-06-03 11:31:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 11:31:17] [INFO ] Flatten gal took : 36 ms
[2025-06-03 11:31:17] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 93 out of 334 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (86 resets) in 2336 ms. (17 steps per ms) remains 1/64 properties
BEST_FIRST walk for 15981 steps (3 resets) in 72 ms. (218 steps per ms) remains 0/1 properties
[2025-06-03 11:31:18] [INFO ] Flatten gal took : 25 ms
[2025-06-03 11:31:18] [INFO ] Flatten gal took : 27 ms
[2025-06-03 11:31:18] [INFO ] Input system was already deterministic with 376 transitions.
Computed a total of 52 stabilizing places and 52 stable transitions
Graph (complete) has 620 edges and 334 vertex of which 308 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 326 transition count 376
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 42 place count 292 transition count 342
Iterating global reduction 1 with 34 rules applied. Total rules applied 76 place count 292 transition count 342
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 88 place count 280 transition count 328
Iterating global reduction 1 with 12 rules applied. Total rules applied 100 place count 280 transition count 328
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 108 place count 272 transition count 319
Iterating global reduction 1 with 8 rules applied. Total rules applied 116 place count 272 transition count 319
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 124 place count 264 transition count 310
Iterating global reduction 1 with 8 rules applied. Total rules applied 132 place count 264 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 138 place count 258 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 144 place count 258 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 149 place count 253 transition count 295
Iterating global reduction 1 with 5 rules applied. Total rules applied 154 place count 253 transition count 295
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 158 place count 249 transition count 291
Iterating global reduction 1 with 4 rules applied. Total rules applied 162 place count 249 transition count 291
Applied a total of 162 rules in 63 ms. Remains 249 /334 variables (removed 85) and now considering 291/376 (removed 85) transitions.
// Phase 1: matrix 291 rows 249 cols
[2025-06-03 11:31:18] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:31:18] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-03 11:31:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:31:19] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2025-06-03 11:31: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/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 291/538 variables, 247/249 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:29] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:29] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:29] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:30] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:30] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:30] [INFO ] Deduced a trap composed of 12 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-03 11:31:30] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:30] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:30] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:30] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:31] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:31] [INFO ] Deduced a trap composed of 18 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-03 11:31:31] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:31:31] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 14/263 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 2/540 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 265 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 291/538 variables, 247/263 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 288/551 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 2/540 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 555 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 249/334 places, 291/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60675 ms. Remains : 249/334 places, 291/376 transitions.
[2025-06-03 11:32:19] [INFO ] Flatten gal took : 19 ms
[2025-06-03 11:32:19] [INFO ] Flatten gal took : 17 ms
[2025-06-03 11:32:19] [INFO ] Input system was already deterministic with 291 transitions.
[2025-06-03 11:32:19] [INFO ] Flatten gal took : 20 ms
[2025-06-03 11:32:19] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:32:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality6195704482526262668.gal : 11 ms
[2025-06-03 11:32:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17417315107074279800.ctl : 6 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/CTLCardinality6195704482526262668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17417315107074279800.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-03 11:32:49] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:32:49] [INFO ] Applying decomposition
[2025-06-03 11:32:49] [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/graph378686731509534066.txt' '-o' '/tmp/graph378686731509534066.bin' '-w' '/tmp/graph378686731509534066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph378686731509534066.bin' '-l' '-1' '-v' '-w' '/tmp/graph378686731509534066.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:32:49] [INFO ] Decomposing Gal with order
[2025-06-03 11:32:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:32:49] [INFO ] Removed a total of 114 redundant transitions.
[2025-06-03 11:32:50] [INFO ] Flatten gal took : 132 ms
[2025-06-03 11:32:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 19 ms.
[2025-06-03 11:32:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7448596036002719347.gal : 11 ms
[2025-06-03 11:32:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality8765985047899833571.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/CTLCardinality7448596036002719347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8765985047899833571.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 324 transition count 376
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 47 place count 287 transition count 339
Iterating global reduction 1 with 37 rules applied. Total rules applied 84 place count 287 transition count 339
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 99 place count 272 transition count 322
Iterating global reduction 1 with 15 rules applied. Total rules applied 114 place count 272 transition count 322
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 124 place count 262 transition count 310
Iterating global reduction 1 with 10 rules applied. Total rules applied 134 place count 262 transition count 310
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 144 place count 252 transition count 299
Iterating global reduction 1 with 10 rules applied. Total rules applied 154 place count 252 transition count 299
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 162 place count 244 transition count 286
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 244 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 176 place count 238 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 182 place count 238 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 187 place count 233 transition count 275
Iterating global reduction 1 with 5 rules applied. Total rules applied 192 place count 233 transition count 275
Applied a total of 192 rules in 46 ms. Remains 233 /334 variables (removed 101) and now considering 275/376 (removed 101) transitions.
// Phase 1: matrix 275 rows 233 cols
[2025-06-03 11:33:20] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:33:20] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-03 11:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:33:20] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-03 11:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 275/508 variables, 233/235 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:30] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:30] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:30] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:30] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:30] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:30] [INFO ] Deduced a trap composed of 12 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-03 11:33:30] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:31] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:31] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:31] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:31] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:31] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:31] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:33:31] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 14/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 0/508 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 249 constraints, problems are : Problem set: 0 solved, 274 unsolved in 27613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/508 variables, 233/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 274/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/508 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 523 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57701ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 57702ms
Starting structural reductions in LTL mode, iteration 1 : 233/334 places, 275/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58197 ms. Remains : 233/334 places, 275/376 transitions.
[2025-06-03 11:34:18] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:34:18] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:34:18] [INFO ] Input system was already deterministic with 275 transitions.
[2025-06-03 11:34:18] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:34:18] [INFO ] Flatten gal took : 11 ms
[2025-06-03 11:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8622568210265646752.gal : 3 ms
[2025-06-03 11:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1501780826407738859.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/CTLCardinality8622568210265646752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1501780826407738859.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-03 11:34:48] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:34:48] [INFO ] Applying decomposition
[2025-06-03 11:34:48] [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/graph13669575561360468735.txt' '-o' '/tmp/graph13669575561360468735.bin' '-w' '/tmp/graph13669575561360468735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13669575561360468735.bin' '-l' '-1' '-v' '-w' '/tmp/graph13669575561360468735.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:34:48] [INFO ] Decomposing Gal with order
[2025-06-03 11:34:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:34:48] [INFO ] Removed a total of 111 redundant transitions.
[2025-06-03 11:34:48] [INFO ] Flatten gal took : 28 ms
[2025-06-03 11:34:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 6 ms.
[2025-06-03 11:34:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality12909975127401205094.gal : 9 ms
[2025-06-03 11:34:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10000971836999880736.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/CTLCardinality12909975127401205094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10000971836999880736.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 324 transition count 376
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 47 place count 287 transition count 339
Iterating global reduction 1 with 37 rules applied. Total rules applied 84 place count 287 transition count 339
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 100 place count 271 transition count 321
Iterating global reduction 1 with 16 rules applied. Total rules applied 116 place count 271 transition count 321
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 127 place count 260 transition count 308
Iterating global reduction 1 with 11 rules applied. Total rules applied 138 place count 260 transition count 308
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 149 place count 249 transition count 296
Iterating global reduction 1 with 11 rules applied. Total rules applied 160 place count 249 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 169 place count 240 transition count 281
Iterating global reduction 1 with 9 rules applied. Total rules applied 178 place count 240 transition count 281
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 185 place count 233 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 192 place count 233 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 198 place count 227 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 204 place count 227 transition count 268
Applied a total of 204 rules in 36 ms. Remains 227 /334 variables (removed 107) and now considering 268/376 (removed 108) transitions.
// Phase 1: matrix 268 rows 227 cols
[2025-06-03 11:35:18] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:35:19] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-06-03 11:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:35:19] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-06-03 11:35: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/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/495 variables, 227/229 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:28] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:28] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:28] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:28] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:28] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:28] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:29] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:29] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:29] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:29] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:29] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:29] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:29] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:35:29] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 14/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/495 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 243 constraints, problems are : Problem set: 0 solved, 267 unsolved in 27359 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 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, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/495 variables, 227/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 267/510 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 510 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57446ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 57448ms
Starting structural reductions in LTL mode, iteration 1 : 227/334 places, 268/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57971 ms. Remains : 227/334 places, 268/376 transitions.
[2025-06-03 11:36:16] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:36:16] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:36:16] [INFO ] Input system was already deterministic with 268 transitions.
[2025-06-03 11:36:16] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:36:16] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:36:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality18391264368469415785.gal : 3 ms
[2025-06-03 11:36:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality2918769307561398536.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/CTLCardinality18391264368469415785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2918769307561398536.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-03 11:36:46] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:36:46] [INFO ] Applying decomposition
[2025-06-03 11:36:46] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11466400159409401030.txt' '-o' '/tmp/graph11466400159409401030.bin' '-w' '/tmp/graph11466400159409401030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11466400159409401030.bin' '-l' '-1' '-v' '-w' '/tmp/graph11466400159409401030.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:36:47] [INFO ] Decomposing Gal with order
[2025-06-03 11:36:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:36:47] [INFO ] Removed a total of 108 redundant transitions.
[2025-06-03 11:36:47] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:36:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2025-06-03 11:36:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality7512316051422901000.gal : 3 ms
[2025-06-03 11:36:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality2709047599813947949.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/CTLCardinality7512316051422901000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2709047599813947949.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 325 transition count 376
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 41 place count 293 transition count 344
Iterating global reduction 1 with 32 rules applied. Total rules applied 73 place count 293 transition count 344
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 86 place count 280 transition count 330
Iterating global reduction 1 with 13 rules applied. Total rules applied 99 place count 280 transition count 330
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 109 place count 270 transition count 318
Iterating global reduction 1 with 10 rules applied. Total rules applied 119 place count 270 transition count 318
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 128 place count 261 transition count 308
Iterating global reduction 1 with 9 rules applied. Total rules applied 137 place count 261 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 144 place count 254 transition count 297
Iterating global reduction 1 with 7 rules applied. Total rules applied 151 place count 254 transition count 297
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 156 place count 249 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 161 place count 249 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 165 place count 245 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 169 place count 245 transition count 288
Applied a total of 169 rules in 35 ms. Remains 245 /334 variables (removed 89) and now considering 288/376 (removed 88) transitions.
// Phase 1: matrix 288 rows 245 cols
[2025-06-03 11:37:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:37:17] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-03 11:37:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:37:17] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-03 11:37:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/532 variables, 244/246 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:32] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:32] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:33] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:33] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:33] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:33] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:33] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:34] [INFO ] Deduced a trap composed of 14 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-03 11:37:34] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:34] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:34] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:35] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:35] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:35] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:35] [INFO ] Deduced a trap composed of 13 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-03 11:37:35] [INFO ] Deduced a trap composed of 14 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-03 11:37:36] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:36] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:36] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:36] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:37] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:37] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:37] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:37] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:37] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:38] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:38] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:37:38] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 11.0)
(t4 1.0)
(t5 0.0)
(t6 1.0)
(t7 20.0)
(t8 29.0)
(t9 1.0)
(t10 1.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 1.0)
(t22 1.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 1.0)
(t34 1.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 1.0)
(t46 1.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 1.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 1.0)
(t75 1.0)
(t76 1.0)
(t77 1.0)
(t78 1.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 1.0)
(t86 1.0)
(t87 1.0)
(t88 1.0)
(t89 1.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 1.0)
(t98 1.0)
(t99 1.0)
(t100 1.0)
(t101 1.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 1.0)
(t110 1.0)
(t111 1.0)
(t112 1.0)
(t113 1.0)
(t114 1.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 1.0)
(t125 1.0)
(t126 1.0)
(t127 1.0)
(t128 1.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 1.0)
(t137 1.0)
(t138 1.0)
(t139 1.0)
(t140 1.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 1.0)
(t149 1.0)
(t150 1.0)
(t151 1.0)
(t152 1.0)
(t153 0.0)
(t154 1.0)
(t155 1.0)
(t156 1.0)
(t157 1.0)
(t158 1.0)
(t159 0.0)
(t160 0.0)
(t161 1.0)
(t162 0.0)
(t163 1.0)
(t164 1.0)
(t165 1.0)
(t166 1.0)
(t167 1.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 1.0)
(t177 1.0)
(t178 1.0)
(t179 1.0)
(t180 1.0)
(t181 0.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 1.0)
(t188 0.0)
(t189 0.0)
(t190 0.0)
(t191 1.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 1.0)
(t197 1.0)
(t198 0.0)
(t199 1.0)
(t200 1.0)
(t201 0.0)
(t202 1.0)
(t203 0.0)
(t204 1.0)
(t205 1.0)
(t206 1.0)
(t207 1.0)
(t208 1.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 1.0)
(t214 1.0)
(t215 0.0)
(t216 1.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 1.0)
(t221 0.0)
(t222 1.0)
(t223 0.0)
(t224 1.0)
(t225 0.0)
(t226 1.0)
(t227 0.0)
(t228 1.0)
(t229 0.0)
(t230 1.0)
(t231 1.0)
(t232 0.0)
(t233 1.0)
(t234 0.0)
(t235 1.0)
(t236 0.0)
(t237 1.0)
(t238 0.0)
(t239 1.0)
(t240 0.0)
(t241 1.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 1.0)
(t249 0.0)
(t250 1.0)
(t251 0.0)
(t252 1.0)
(t253 0.0)
(t254 1.0)
(t255 0.0)
(t256 1.0)
(t257 0.0)
(t258 1.0)
(t259 1.0)
(t260 0.0)
(t261 1.0)
(t262 0.0)
(t263 1.0)
(t264 0.0)
(t265 1.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 0.0)
(t273 0.0)
(t274 1.0)
(t275 0.0)
(t276 0.0)
(t277 1.0)
(t278 1.0)
(t279 1.0)
(t280 0.0)
(t281 0.0)
(t282 1.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/533 variables, and 274 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 244/245 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/532 variables, 244/274 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 286/560 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 287 unsolved
SMT process timed out in 60111ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 245/334 places, 288/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 245/334 places, 288/376 transitions.
[2025-06-03 11:38:17] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:38:17] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:38:17] [INFO ] Input system was already deterministic with 288 transitions.
[2025-06-03 11:38:17] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:38:17] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:38:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality4971569207512963004.gal : 3 ms
[2025-06-03 11:38:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5928794245287549156.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/CTLCardinality4971569207512963004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5928794245287549156.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-03 11:38:47] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:38:48] [INFO ] Applying decomposition
[2025-06-03 11:38:48] [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/graph14301740390321064790.txt' '-o' '/tmp/graph14301740390321064790.bin' '-w' '/tmp/graph14301740390321064790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14301740390321064790.bin' '-l' '-1' '-v' '-w' '/tmp/graph14301740390321064790.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:38:48] [INFO ] Decomposing Gal with order
[2025-06-03 11:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:38:48] [INFO ] Removed a total of 114 redundant transitions.
[2025-06-03 11:38:48] [INFO ] Flatten gal took : 34 ms
[2025-06-03 11:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2025-06-03 11:38:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality12658937387035947222.gal : 6 ms
[2025-06-03 11:38:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality938954753279554647.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/CTLCardinality12658937387035947222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality938954753279554647.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 324 transition count 376
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 47 place count 287 transition count 339
Iterating global reduction 1 with 37 rules applied. Total rules applied 84 place count 287 transition count 339
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 98 place count 273 transition count 324
Iterating global reduction 1 with 14 rules applied. Total rules applied 112 place count 273 transition count 324
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 121 place count 264 transition count 313
Iterating global reduction 1 with 9 rules applied. Total rules applied 130 place count 264 transition count 313
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 139 place count 255 transition count 304
Iterating global reduction 1 with 9 rules applied. Total rules applied 148 place count 255 transition count 304
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 247 transition count 290
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 247 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 169 place count 242 transition count 285
Iterating global reduction 1 with 5 rules applied. Total rules applied 174 place count 242 transition count 285
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 179 place count 237 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 184 place count 237 transition count 280
Applied a total of 184 rules in 58 ms. Remains 237 /334 variables (removed 97) and now considering 280/376 (removed 96) transitions.
// Phase 1: matrix 280 rows 237 cols
[2025-06-03 11:39:18] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:39:18] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-03 11:39:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:39:18] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2025-06-03 11:39:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/517 variables, 237/239 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:34] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:34] [INFO ] Deduced a trap composed of 8 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-03 11:39:35] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:35] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:35] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:35] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:35] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:35] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:36] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:36] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:36] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:36] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:36] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:39:36] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 14/253 constraints. Problems are: Problem set: 0 solved, 279 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: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/517 variables, and 253 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/517 variables, 237/253 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 279/532 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 532 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 237/334 places, 280/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60893 ms. Remains : 237/334 places, 280/376 transitions.
[2025-06-03 11:40:19] [INFO ] Flatten gal took : 7 ms
[2025-06-03 11:40:19] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:40:19] [INFO ] Input system was already deterministic with 280 transitions.
[2025-06-03 11:40:19] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:40:19] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:40:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality2605879898250129169.gal : 2 ms
[2025-06-03 11:40:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality808041251942337026.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/CTLCardinality2605879898250129169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality808041251942337026.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 11:40:49] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:40:49] [INFO ] Applying decomposition
[2025-06-03 11:40:49] [INFO ] Flatten gal took : 35 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/graph3575941424209648137.txt' '-o' '/tmp/graph3575941424209648137.bin' '-w' '/tmp/graph3575941424209648137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3575941424209648137.bin' '-l' '-1' '-v' '-w' '/tmp/graph3575941424209648137.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:40:49] [INFO ] Decomposing Gal with order
[2025-06-03 11:40:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:40:49] [INFO ] Removed a total of 113 redundant transitions.
[2025-06-03 11:40:49] [INFO ] Flatten gal took : 18 ms
[2025-06-03 11:40:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2025-06-03 11:40:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality15279374009041575534.gal : 4 ms
[2025-06-03 11:40:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality14274605506288836407.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/CTLCardinality15279374009041575534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14274605506288836407.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Graph (complete) has 620 edges and 334 vertex of which 308 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 307 transition count 299
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 247 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 246 transition count 298
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 123 place count 246 transition count 262
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 195 place count 210 transition count 262
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 211 place count 194 transition count 246
Iterating global reduction 3 with 16 rules applied. Total rules applied 227 place count 194 transition count 246
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 227 place count 194 transition count 244
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 231 place count 192 transition count 244
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 240 place count 183 transition count 234
Iterating global reduction 3 with 9 rules applied. Total rules applied 249 place count 183 transition count 234
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 258 place count 174 transition count 221
Iterating global reduction 3 with 9 rules applied. Total rules applied 267 place count 174 transition count 221
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 275 place count 166 transition count 209
Iterating global reduction 3 with 8 rules applied. Total rules applied 283 place count 166 transition count 209
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 287 place count 162 transition count 205
Iterating global reduction 3 with 4 rules applied. Total rules applied 291 place count 162 transition count 205
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 337 place count 139 transition count 182
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 339 place count 137 transition count 179
Iterating global reduction 3 with 2 rules applied. Total rules applied 341 place count 137 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 343 place count 135 transition count 176
Iterating global reduction 3 with 2 rules applied. Total rules applied 345 place count 135 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 346 place count 134 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 347 place count 134 transition count 175
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 349 place count 132 transition count 173
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 158 edges and 130 vertex of which 126 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 137 edges and 126 vertex of which 54 / 126 are part of one of the 27 SCC in 2 ms
Free SCC test removed 27 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 3 with 45 rules applied. Total rules applied 394 place count 99 transition count 127
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 69 rules applied. Total rules applied 463 place count 58 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 464 place count 57 transition count 99
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 477 place count 44 transition count 73
Iterating global reduction 6 with 13 rules applied. Total rules applied 490 place count 44 transition count 73
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 503 place count 31 transition count 47
Iterating global reduction 6 with 13 rules applied. Total rules applied 516 place count 31 transition count 47
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 528 place count 19 transition count 23
Iterating global reduction 6 with 12 rules applied. Total rules applied 540 place count 19 transition count 23
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 552 place count 7 transition count 11
Iterating global reduction 6 with 12 rules applied. Total rules applied 564 place count 7 transition count 11
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 565 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 567 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 569 place count 4 transition count 7
Applied a total of 569 rules in 158 ms. Remains 4 /334 variables (removed 330) and now considering 7/376 (removed 369) transitions.
[2025-06-03 11:41:19] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2025-06-03 11:41:19] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:41:19] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-03 11:41:19] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2025-06-03 11:41:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:41:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:41:19] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 11:41:19] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2025-06-03 11:41: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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 57 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 70 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/334 places, 7/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 377 ms. Remains : 4/334 places, 7/376 transitions.
[2025-06-03 11:41:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:41:19] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:41:19] [INFO ] Input system was already deterministic with 7 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 11:41:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:41:19] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:41:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5228465931583602569.gal : 1 ms
[2025-06-03 11:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1715707445991603131.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5228465931583602569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1715707445991603131.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Graph (complete) has 620 edges and 334 vertex of which 308 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 307 transition count 301
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 249 transition count 301
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 117 place count 249 transition count 266
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 187 place count 214 transition count 266
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 203 place count 198 transition count 250
Iterating global reduction 2 with 16 rules applied. Total rules applied 219 place count 198 transition count 250
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 219 place count 198 transition count 248
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 196 transition count 248
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 231 place count 188 transition count 239
Iterating global reduction 2 with 8 rules applied. Total rules applied 239 place count 188 transition count 239
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 247 place count 180 transition count 228
Iterating global reduction 2 with 8 rules applied. Total rules applied 255 place count 180 transition count 228
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 262 place count 173 transition count 217
Iterating global reduction 2 with 7 rules applied. Total rules applied 269 place count 173 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 273 place count 169 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 277 place count 169 transition count 213
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 321 place count 147 transition count 191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 323 place count 145 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 325 place count 145 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 327 place count 143 transition count 185
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 143 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 330 place count 142 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 331 place count 142 transition count 184
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 332 place count 142 transition count 184
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 140 transition count 182
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 167 edges and 138 vertex of which 134 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 139 edges and 134 vertex of which 52 / 134 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 2 with 45 rules applied. Total rules applied 379 place count 108 transition count 136
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 68 rules applied. Total rules applied 447 place count 67 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 448 place count 66 transition count 109
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 459 place count 55 transition count 87
Iterating global reduction 5 with 11 rules applied. Total rules applied 470 place count 55 transition count 87
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 481 place count 44 transition count 65
Iterating global reduction 5 with 11 rules applied. Total rules applied 492 place count 44 transition count 65
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 501 place count 35 transition count 47
Iterating global reduction 5 with 9 rules applied. Total rules applied 510 place count 35 transition count 47
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 518 place count 27 transition count 39
Iterating global reduction 5 with 8 rules applied. Total rules applied 526 place count 27 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 528 place count 27 transition count 37
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 529 place count 27 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 530 place count 26 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 532 place count 25 transition count 35
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 537 place count 20 transition count 30
Applied a total of 537 rules in 93 ms. Remains 20 /334 variables (removed 314) and now considering 30/376 (removed 346) transitions.
[2025-06-03 11:41:19] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 20 cols
[2025-06-03 11:41:19] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:41:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 11:41:20] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2025-06-03 11:41:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:41:20] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:41:20] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 11:41:20] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2025-06-03 11:41:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 24/38 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 6/44 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/45 variables, and 20 constraints, problems are : Problem set: 0 solved, 20 unsolved in 341 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 24/38 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 6/44 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/45 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 534 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 882ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 883ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/334 places, 30/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1112 ms. Remains : 20/334 places, 30/376 transitions.
[2025-06-03 11:41:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:41:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:41:21] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-03 11:41:21] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:41:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:41:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1335528273504629243.gal : 0 ms
[2025-06-03 11:41:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality5849426959774211157.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/CTLCardinality1335528273504629243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5849426959774211157.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,107240,0.018319,3812,2,76,5,535,6,0,98,535,0


Converting to forward existential form...Done !
original formula: E((((p340==0)||(p62==1))&&((p175==0)||(p254==1))) U (p291==1))
=> equivalent forward existential formula: [(FwdU(Init,(((p340==0)||(p62==1))&&((p175==0)||(p254==1)))) * (p291==1))] != FALSE
Hit Full ! (commute/partial/dont) 22/5/8
(forward)formula 0,1,0.028378,4068,1,0,10,1171,15,1,216,1311,4
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Graph (complete) has 620 edges and 334 vertex of which 308 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 307 transition count 298
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 246 transition count 298
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 123 place count 246 transition count 262
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 195 place count 210 transition count 262
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 210 place count 195 transition count 247
Iterating global reduction 2 with 15 rules applied. Total rules applied 225 place count 195 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 225 place count 195 transition count 246
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 227 place count 194 transition count 246
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 236 place count 185 transition count 236
Iterating global reduction 2 with 9 rules applied. Total rules applied 245 place count 185 transition count 236
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 254 place count 176 transition count 223
Iterating global reduction 2 with 9 rules applied. Total rules applied 263 place count 176 transition count 223
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 271 place count 168 transition count 211
Iterating global reduction 2 with 8 rules applied. Total rules applied 279 place count 168 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 283 place count 164 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 287 place count 164 transition count 207
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 335 place count 140 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 337 place count 138 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 138 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 341 place count 136 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 343 place count 136 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 344 place count 135 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 345 place count 135 transition count 176
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 347 place count 133 transition count 174
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 193 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 141 edges and 131 vertex of which 56 / 131 are part of one of the 28 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 17 rules applied. Total rules applied 364 place count 103 transition count 159
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 406 place count 89 transition count 131
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 406 place count 89 transition count 117
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 434 place count 75 transition count 117
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 447 place count 62 transition count 91
Iterating global reduction 4 with 13 rules applied. Total rules applied 460 place count 62 transition count 91
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 473 place count 49 transition count 65
Iterating global reduction 4 with 13 rules applied. Total rules applied 486 place count 49 transition count 65
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 499 place count 36 transition count 52
Iterating global reduction 4 with 13 rules applied. Total rules applied 512 place count 36 transition count 52
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 525 place count 23 transition count 26
Iterating global reduction 4 with 13 rules applied. Total rules applied 538 place count 23 transition count 26
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 551 place count 10 transition count 13
Iterating global reduction 4 with 13 rules applied. Total rules applied 564 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 565 place count 9 transition count 12
Applied a total of 565 rules in 133 ms. Remains 9 /334 variables (removed 325) and now considering 12/376 (removed 364) transitions.
[2025-06-03 11:41:21] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 9 cols
[2025-06-03 11:41:21] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:41:21] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-03 11:41:21] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2025-06-03 11:41:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:41:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:41:21] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2025-06-03 11:41:21] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2025-06-03 11:41: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/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 10/18 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/19 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 10/18 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 456ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/334 places, 12/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 691 ms. Remains : 9/334 places, 12/376 transitions.
[2025-06-03 11:41:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:41:21] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:41:21] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 11:41:21] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:41:21] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:41:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16569006508027647013.gal : 0 ms
[2025-06-03 11:41:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality656440481068321919.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/CTLCardinality16569006508027647013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality656440481068321919.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,232545,0.116257,5452,2,110,5,9846,6,0,46,11298,0


Converting to forward existential form...Done !
original formula: EG(AF((p405==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p405==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t9, t10, Intersection with reachable at each step enabled. (destroyed/reverse/inters...175
(forward)formula 0,1,0.218156,5708,1,0,121,9846,49,76,341,11741,156
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 326 transition count 376
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 42 place count 292 transition count 342
Iterating global reduction 1 with 34 rules applied. Total rules applied 76 place count 292 transition count 342
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 91 place count 277 transition count 325
Iterating global reduction 1 with 15 rules applied. Total rules applied 106 place count 277 transition count 325
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 117 place count 266 transition count 312
Iterating global reduction 1 with 11 rules applied. Total rules applied 128 place count 266 transition count 312
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 138 place count 256 transition count 301
Iterating global reduction 1 with 10 rules applied. Total rules applied 148 place count 256 transition count 301
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 248 transition count 287
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 248 transition count 287
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 170 place count 242 transition count 281
Iterating global reduction 1 with 6 rules applied. Total rules applied 176 place count 242 transition count 281
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 181 place count 237 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 186 place count 237 transition count 276
Applied a total of 186 rules in 31 ms. Remains 237 /334 variables (removed 97) and now considering 276/376 (removed 100) transitions.
// Phase 1: matrix 276 rows 237 cols
[2025-06-03 11:41:22] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:41:22] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-03 11:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:41:22] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2025-06-03 11:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 276/511 variables, 235/237 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:35] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:35] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:35] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:35] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:36] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:36] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:36] [INFO ] Deduced a trap composed of 13 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-03 11:41:36] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:37] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:37] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:37] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:37] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:37] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:41:37] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 14/251 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 2/513 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/513 variables, and 253 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/251 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 273/524 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 2/513 variables, 2/526 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 528 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 237/334 places, 276/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60633 ms. Remains : 237/334 places, 276/376 transitions.
[2025-06-03 11:42:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:42:22] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:42:22] [INFO ] Input system was already deterministic with 276 transitions.
[2025-06-03 11:42:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:42:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:42:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality7426612761306264681.gal : 2 ms
[2025-06-03 11:42:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality423429301895323936.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/CTLCardinality7426612761306264681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality423429301895323936.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 11:42:52] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:42:52] [INFO ] Applying decomposition
[2025-06-03 11:42:52] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3983337886750091992.txt' '-o' '/tmp/graph3983337886750091992.bin' '-w' '/tmp/graph3983337886750091992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3983337886750091992.bin' '-l' '-1' '-v' '-w' '/tmp/graph3983337886750091992.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:42:52] [INFO ] Decomposing Gal with order
[2025-06-03 11:42:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:42:52] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-03 11:42:52] [INFO ] Flatten gal took : 41 ms
[2025-06-03 11:42:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2025-06-03 11:42:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality11319927036900054885.gal : 4 ms
[2025-06-03 11:42:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality4382002712911923726.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/CTLCardinality11319927036900054885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4382002712911923726.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Graph (complete) has 620 edges and 334 vertex of which 308 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 307 transition count 298
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 246 transition count 298
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 123 place count 246 transition count 263
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 193 place count 211 transition count 263
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 208 place count 196 transition count 248
Iterating global reduction 2 with 15 rules applied. Total rules applied 223 place count 196 transition count 248
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 223 place count 196 transition count 246
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 227 place count 194 transition count 246
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 235 place count 186 transition count 237
Iterating global reduction 2 with 8 rules applied. Total rules applied 243 place count 186 transition count 237
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 251 place count 178 transition count 226
Iterating global reduction 2 with 8 rules applied. Total rules applied 259 place count 178 transition count 226
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 266 place count 171 transition count 215
Iterating global reduction 2 with 7 rules applied. Total rules applied 273 place count 171 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 277 place count 167 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 281 place count 167 transition count 211
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 327 place count 144 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 329 place count 142 transition count 185
Iterating global reduction 2 with 2 rules applied. Total rules applied 331 place count 142 transition count 185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 333 place count 140 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 335 place count 140 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 336 place count 139 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 337 place count 139 transition count 181
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 137 transition count 179
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 163 edges and 135 vertex of which 131 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 145 edges and 131 vertex of which 56 / 131 are part of one of the 28 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 48 rules applied. Total rules applied 387 place count 103 transition count 130
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 74 rules applied. Total rules applied 461 place count 59 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 462 place count 58 transition count 100
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 474 place count 46 transition count 76
Iterating global reduction 5 with 12 rules applied. Total rules applied 486 place count 46 transition count 76
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 498 place count 34 transition count 52
Iterating global reduction 5 with 12 rules applied. Total rules applied 510 place count 34 transition count 52
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 522 place count 22 transition count 28
Iterating global reduction 5 with 12 rules applied. Total rules applied 534 place count 22 transition count 28
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 546 place count 10 transition count 16
Iterating global reduction 5 with 12 rules applied. Total rules applied 558 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 559 place count 10 transition count 15
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 560 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 561 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 563 place count 7 transition count 12
Applied a total of 563 rules in 81 ms. Remains 7 /334 variables (removed 327) and now considering 12/376 (removed 364) transitions.
[2025-06-03 11:43:23] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 11:43:23] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:43:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 11:43:23] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 11:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:43:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:43:23] [INFO ] Redundant transitions in 1 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 11:43:23] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 11:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 183 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 146 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 332ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/334 places, 12/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 489 ms. Remains : 7/334 places, 12/376 transitions.
[2025-06-03 11:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:43:23] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:43:23] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 11:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:43:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:43:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality18275112200499167295.gal : 1 ms
[2025-06-03 11:43:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality6935760377001490968.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/CTLCardinality18275112200499167295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6935760377001490968.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,630,0.004583,3788,2,25,5,175,6,0,34,173,0


Converting to forward existential form...Done !
original formula: AF((p317==1))
=> equivalent forward existential formula: [FwdG(Init,!((p317==1)))] = FALSE
Hit Full ! (commute/partial/dont) 10/0/2
(forward)formula 0,0,0.006887,3916,1,0,8,296,20,4,183,336,8
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 324 transition count 376
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 46 place count 288 transition count 340
Iterating global reduction 1 with 36 rules applied. Total rules applied 82 place count 288 transition count 340
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 97 place count 273 transition count 323
Iterating global reduction 1 with 15 rules applied. Total rules applied 112 place count 273 transition count 323
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 263 transition count 311
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 263 transition count 311
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 255 transition count 303
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 255 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 154 place count 249 transition count 293
Iterating global reduction 1 with 6 rules applied. Total rules applied 160 place count 249 transition count 293
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 164 place count 245 transition count 289
Iterating global reduction 1 with 4 rules applied. Total rules applied 168 place count 245 transition count 289
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 242 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 242 transition count 286
Applied a total of 174 rules in 29 ms. Remains 242 /334 variables (removed 92) and now considering 286/376 (removed 90) transitions.
// Phase 1: matrix 286 rows 242 cols
[2025-06-03 11:43:23] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:43:23] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-03 11:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:43:24] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2025-06-03 11:43:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/528 variables, 242/244 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:36] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:36] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:36] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:36] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 14 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-03 11:43:37] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:37] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:38] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:38] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:38] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:43:38] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 14/258 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 258 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/528 variables, 242/258 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 285/543 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/528 variables, and 543 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 242/334 places, 286/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60658 ms. Remains : 242/334 places, 286/376 transitions.
[2025-06-03 11:44:24] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:44:24] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:44:24] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-03 11:44:24] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:44:24] [INFO ] Flatten gal took : 5 ms
[2025-06-03 11:44:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8809518784245175882.gal : 2 ms
[2025-06-03 11:44:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12625059805034639638.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/CTLCardinality8809518784245175882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12625059805034639638.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-03 11:44:54] [INFO ] Flatten gal took : 7 ms
[2025-06-03 11:44:54] [INFO ] Applying decomposition
[2025-06-03 11:44:54] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5808397453449772157.txt' '-o' '/tmp/graph5808397453449772157.bin' '-w' '/tmp/graph5808397453449772157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5808397453449772157.bin' '-l' '-1' '-v' '-w' '/tmp/graph5808397453449772157.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:44:54] [INFO ] Decomposing Gal with order
[2025-06-03 11:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:44:54] [INFO ] Removed a total of 113 redundant transitions.
[2025-06-03 11:44:54] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2025-06-03 11:44:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7110107925423258916.gal : 3 ms
[2025-06-03 11:44:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality4653552183317438394.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/CTLCardinality7110107925423258916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4653552183317438394.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 327 transition count 376
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 35 place count 299 transition count 348
Iterating global reduction 1 with 28 rules applied. Total rules applied 63 place count 299 transition count 348
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 288 transition count 336
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 288 transition count 336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 92 place count 281 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 99 place count 281 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 275 transition count 321
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 275 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 272 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 272 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 270 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 270 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 269 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 269 transition count 314
Applied a total of 123 rules in 59 ms. Remains 269 /334 variables (removed 65) and now considering 314/376 (removed 62) transitions.
// Phase 1: matrix 314 rows 269 cols
[2025-06-03 11:45:24] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:45:24] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-03 11:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:45:25] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-03 11:45:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 3/268 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:30] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 314/582 variables, 268/272 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:39] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:39] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:39] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:40] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:40] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:40] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:40] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:40] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:41] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:41] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:41] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:41] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:41] [INFO ] Deduced a trap composed of 21 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-03 11:45:42] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:45:47] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/583 variables, and 287 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 268/269 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 3/268 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 314/582 variables, 268/287 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 312/599 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/583 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 601 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 269/334 places, 314/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60735 ms. Remains : 269/334 places, 314/376 transitions.
[2025-06-03 11:46:25] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:46:25] [INFO ] Flatten gal took : 7 ms
[2025-06-03 11:46:25] [INFO ] Input system was already deterministic with 314 transitions.
[2025-06-03 11:46:25] [INFO ] Flatten gal took : 7 ms
[2025-06-03 11:46:25] [INFO ] Flatten gal took : 7 ms
[2025-06-03 11:46:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality3948094986467126996.gal : 2 ms
[2025-06-03 11:46:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17530856657716413850.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/CTLCardinality3948094986467126996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17530856657716413850.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-03 11:46:55] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:46:55] [INFO ] Applying decomposition
[2025-06-03 11:46:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12071637621021214299.txt' '-o' '/tmp/graph12071637621021214299.bin' '-w' '/tmp/graph12071637621021214299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12071637621021214299.bin' '-l' '-1' '-v' '-w' '/tmp/graph12071637621021214299.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:46:55] [INFO ] Decomposing Gal with order
[2025-06-03 11:46:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:46:55] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-03 11:46:55] [INFO ] Flatten gal took : 25 ms
[2025-06-03 11:46:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 3 ms.
[2025-06-03 11:46:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality710962777356489336.gal : 16 ms
[2025-06-03 11:46:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality7161837212986205683.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/CTLCardinality710962777356489336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7161837212986205683.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 325 transition count 376
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 47 place count 287 transition count 338
Iterating global reduction 1 with 38 rules applied. Total rules applied 85 place count 287 transition count 338
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 100 place count 272 transition count 321
Iterating global reduction 1 with 15 rules applied. Total rules applied 115 place count 272 transition count 321
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 126 place count 261 transition count 308
Iterating global reduction 1 with 11 rules applied. Total rules applied 137 place count 261 transition count 308
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 148 place count 250 transition count 296
Iterating global reduction 1 with 11 rules applied. Total rules applied 159 place count 250 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 168 place count 241 transition count 281
Iterating global reduction 1 with 9 rules applied. Total rules applied 177 place count 241 transition count 281
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 184 place count 234 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 191 place count 234 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 197 place count 228 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 203 place count 228 transition count 268
Applied a total of 203 rules in 41 ms. Remains 228 /334 variables (removed 106) and now considering 268/376 (removed 108) transitions.
// Phase 1: matrix 268 rows 228 cols
[2025-06-03 11:47:25] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:47:25] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-03 11:47:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:47:26] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-06-03 11:47:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/495 variables, 227/229 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:37] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:37] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:38] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:38] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:38] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:38] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:38] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:39] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:39] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:39] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:39] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:39] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:40] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:47:40] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 14/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 1/496 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 244 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 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, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/495 variables, 227/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 266/509 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/496 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 511 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 228/334 places, 268/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60524 ms. Remains : 228/334 places, 268/376 transitions.
[2025-06-03 11:48:26] [INFO ] Flatten gal took : 11 ms
[2025-06-03 11:48:26] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:48:26] [INFO ] Input system was already deterministic with 268 transitions.
[2025-06-03 11:48:26] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:48:26] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:48:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality13489975043129237136.gal : 3 ms
[2025-06-03 11:48:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality18302240008614384388.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/CTLCardinality13489975043129237136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18302240008614384388.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-03 11:48:56] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:48:56] [INFO ] Applying decomposition
[2025-06-03 11:48:56] [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/graph11823369389731822911.txt' '-o' '/tmp/graph11823369389731822911.bin' '-w' '/tmp/graph11823369389731822911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11823369389731822911.bin' '-l' '-1' '-v' '-w' '/tmp/graph11823369389731822911.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:48:56] [INFO ] Decomposing Gal with order
[2025-06-03 11:48:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:48:56] [INFO ] Removed a total of 106 redundant transitions.
[2025-06-03 11:48:56] [INFO ] Flatten gal took : 26 ms
[2025-06-03 11:48:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2025-06-03 11:48:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality12904223620192795354.gal : 3 ms
[2025-06-03 11:48:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality8957185267254610988.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/CTLCardinality12904223620192795354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8957185267254610988.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Graph (complete) has 620 edges and 334 vertex of which 310 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 309 transition count 301
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 250 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 249 transition count 300
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 121 place count 249 transition count 264
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 193 place count 213 transition count 264
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 208 place count 198 transition count 249
Iterating global reduction 3 with 15 rules applied. Total rules applied 223 place count 198 transition count 249
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 223 place count 198 transition count 247
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 196 transition count 247
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 235 place count 188 transition count 238
Iterating global reduction 3 with 8 rules applied. Total rules applied 243 place count 188 transition count 238
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 251 place count 180 transition count 226
Iterating global reduction 3 with 8 rules applied. Total rules applied 259 place count 180 transition count 226
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 266 place count 173 transition count 216
Iterating global reduction 3 with 7 rules applied. Total rules applied 273 place count 173 transition count 216
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 276 place count 170 transition count 213
Iterating global reduction 3 with 3 rules applied. Total rules applied 279 place count 170 transition count 213
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 325 place count 147 transition count 190
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 327 place count 145 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 145 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 331 place count 143 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 333 place count 143 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 334 place count 142 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 335 place count 142 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 142 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 place count 140 transition count 181
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 166 edges and 138 vertex of which 134 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 142 edges and 134 vertex of which 54 / 134 are part of one of the 27 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 44 rules applied. Total rules applied 382 place count 107 transition count 136
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 70 rules applied. Total rules applied 452 place count 67 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 456 place count 65 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 458 place count 63 transition count 104
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 470 place count 51 transition count 80
Iterating global reduction 7 with 12 rules applied. Total rules applied 482 place count 51 transition count 80
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 492 place count 41 transition count 60
Iterating global reduction 7 with 10 rules applied. Total rules applied 502 place count 41 transition count 60
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 512 place count 31 transition count 40
Iterating global reduction 7 with 10 rules applied. Total rules applied 522 place count 31 transition count 40
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 532 place count 21 transition count 30
Iterating global reduction 7 with 10 rules applied. Total rules applied 542 place count 21 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 544 place count 21 transition count 28
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 545 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 546 place count 20 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 550 place count 16 transition count 23
Applied a total of 550 rules in 59 ms. Remains 16 /334 variables (removed 318) and now considering 23/376 (removed 353) transitions.
[2025-06-03 11:49:26] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 16 cols
[2025-06-03 11:49:26] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:49:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 11:49:26] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2025-06-03 11:49:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:49:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:49:26] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-03 11:49:26] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2025-06-03 11:49:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 5/33 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/34 variables, and 16 constraints, problems are : Problem set: 0 solved, 15 unsolved in 239 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/33 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/34 variables, and 31 constraints, problems are : Problem set: 0 solved, 15 unsolved in 288 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 532ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/334 places, 23/376 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 661 ms. Remains : 16/334 places, 23/376 transitions.
[2025-06-03 11:49:27] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:49:27] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:49:27] [INFO ] Input system was already deterministic with 23 transitions.
[2025-06-03 11:49:27] [INFO ] Flatten gal took : 1 ms
[2025-06-03 11:49:27] [INFO ] Flatten gal took : 0 ms
[2025-06-03 11:49:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality14885225196655564388.gal : 0 ms
[2025-06-03 11:49:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1410342858053467550.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/CTLCardinality14885225196655564388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1410342858053467550.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,13344,0.01052,3772,2,46,5,488,6,0,74,575,0


Converting to forward existential form...Done !
original formula: AF((EG(E(AG((p168==1)) U (p25==0))) * (EF((p18==1)) + (p325==1))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(E(!(E(TRUE U !((p168==1)))) U (p25==0))) * (E(TRUE U (p18==1)) + (p325==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t8, t22, Intersection with reachable at each step enabled. (destroyed/reverse/in...180
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.101818,5692,1,0,254,10991,80,167,459,15275,244
FORMULA DiscoveryGPU-PT-14b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 376/376 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 326 transition count 376
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 39 place count 295 transition count 345
Iterating global reduction 1 with 31 rules applied. Total rules applied 70 place count 295 transition count 345
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 83 place count 282 transition count 330
Iterating global reduction 1 with 13 rules applied. Total rules applied 96 place count 282 transition count 330
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 273 transition count 319
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 273 transition count 319
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 264 transition count 309
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 264 transition count 309
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 139 place count 257 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 146 place count 257 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 151 place count 252 transition count 293
Iterating global reduction 1 with 5 rules applied. Total rules applied 156 place count 252 transition count 293
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 160 place count 248 transition count 289
Iterating global reduction 1 with 4 rules applied. Total rules applied 164 place count 248 transition count 289
Applied a total of 164 rules in 28 ms. Remains 248 /334 variables (removed 86) and now considering 289/376 (removed 87) transitions.
// Phase 1: matrix 289 rows 248 cols
[2025-06-03 11:49:27] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:49:27] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-03 11:49:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:49:27] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2025-06-03 11:49:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/535 variables, 246/248 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:41] [INFO ] Deduced a trap composed of 7 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-03 11:49:42] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:42] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:42] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:42] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:42] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:43] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:43] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:43] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:43] [INFO ] Deduced a trap composed of 16 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-03 11:49:43] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:43] [INFO ] Deduced a trap composed of 18 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-03 11:49:43] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:44] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:44] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:44] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:44] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:44] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:44] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:44] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:45] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:45] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:45] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:45] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:45] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:45] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:45] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:49:45] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 288 unsolved
SMT process timed out in 30058ms, After SMT, problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 30059ms
Starting structural reductions in LTL mode, iteration 1 : 248/334 places, 289/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30694 ms. Remains : 248/334 places, 289/376 transitions.
[2025-06-03 11:49:57] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:49:57] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:49:57] [INFO ] Input system was already deterministic with 289 transitions.
[2025-06-03 11:49:57] [INFO ] Flatten gal took : 6 ms
[2025-06-03 11:49:57] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:49:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17439663178727934994.gal : 2 ms
[2025-06-03 11:49:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality11065293676708330237.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/CTLCardinality17439663178727934994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11065293676708330237.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-03 11:50:28] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:50:28] [INFO ] Applying decomposition
[2025-06-03 11:50:28] [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/graph14564008204829030709.txt' '-o' '/tmp/graph14564008204829030709.bin' '-w' '/tmp/graph14564008204829030709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14564008204829030709.bin' '-l' '-1' '-v' '-w' '/tmp/graph14564008204829030709.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:50:28] [INFO ] Decomposing Gal with order
[2025-06-03 11:50:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:50:28] [INFO ] Removed a total of 114 redundant transitions.
[2025-06-03 11:50:28] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:50:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2025-06-03 11:50:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2779819048353414877.gal : 5 ms
[2025-06-03 11:50:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality6358250684455793413.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/CTLCardinality2779819048353414877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6358250684455793413.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.
Detected timeout of ITS tools.
[2025-06-03 11:50:58] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:50:58] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:50:58] [INFO ] Applying decomposition
[2025-06-03 11:50:58] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12993744318941035409.txt' '-o' '/tmp/graph12993744318941035409.bin' '-w' '/tmp/graph12993744318941035409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12993744318941035409.bin' '-l' '-1' '-v' '-w' '/tmp/graph12993744318941035409.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:50:58] [INFO ] Decomposing Gal with order
[2025-06-03 11:50:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:50:58] [INFO ] Removed a total of 123 redundant transitions.
[2025-06-03 11:50:58] [INFO ] Flatten gal took : 32 ms
[2025-06-03 11:50:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-06-03 11:50:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2000308667951101239.gal : 8 ms
[2025-06-03 11:50:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality1136948145491225282.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/CTLCardinality2000308667951101239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1136948145491225282.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 10 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.93461e+20,1066.85,7628996,76592,158,1.12108e+07,39913,738,4.25455e+07,61,287715,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 12:17:52] [INFO ] Applying decomposition
[2025-06-03 12:17:52] [INFO ] Flatten gal took : 9 ms
[2025-06-03 12:17:52] [INFO ] Decomposing Gal with order
[2025-06-03 12:17:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:17:52] [INFO ] Removed a total of 123 redundant transitions.
[2025-06-03 12:17:52] [INFO ] Flatten gal took : 25 ms
[2025-06-03 12:17:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 936 labels/synchronizations in 31 ms.
[2025-06-03 12:17:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14676391358175423578.gal : 3 ms
[2025-06-03 12:17:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality351855855938631689.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/CTLCardinality14676391358175423578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality351855855938631689.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 10 CTL formulae.

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="DiscoveryGPU-PT-14b"
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 DiscoveryGPU-PT-14b, 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 r058-smll-174854064700745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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