Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200265.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-22, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 238K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748893713061

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 19:48:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:48:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:48:36] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2025-06-02 19:48:36] [INFO ] Transformed 307 places.
[2025-06-02 19:48:36] [INFO ] Transformed 740 transitions.
[2025-06-02 19:48:36] [INFO ] Found NUPN structural information;
[2025-06-02 19:48:36] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 489 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-22-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 105 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 304 transition count 740
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 64 place count 243 transition count 666
Iterating global reduction 1 with 61 rules applied. Total rules applied 125 place count 243 transition count 666
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 243 transition count 660
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 239 transition count 646
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 239 transition count 646
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 238 transition count 643
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 238 transition count 643
Applied a total of 141 rules in 111 ms. Remains 238 /307 variables (removed 69) and now considering 643/740 (removed 97) transitions.
// Phase 1: matrix 643 rows 238 cols
[2025-06-02 19:48:36] [INFO ] Computed 22 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:48:36] [INFO ] Implicit Places using invariants in 470 ms returned []
[2025-06-02 19:48:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:48:37] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2025-06-02 19:48:37] [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, 16/16 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/237 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:56] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:56] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:56] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:57] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:58] [INFO ] Deduced a trap composed of 48 places in 253 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:58] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:58] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:58] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:59] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:59] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:00] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:00] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:01] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:01] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/36 constraints. Problems are: Problem set: 144 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:09] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 237/881 variables, and 37 constraints, problems are : Problem set: 144 solved, 498 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 144 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 16/16 constraints. Problems are: Problem set: 144 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 144 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 15/37 constraints. Problems are: Problem set: 144 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:17] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:17] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 2/39 constraints. Problems are: Problem set: 144 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/39 constraints. Problems are: Problem set: 144 solved, 498 unsolved
At refinement iteration 6 (OVERLAPS) 643/880 variables, 237/276 constraints. Problems are: Problem set: 144 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/880 variables, 497/773 constraints. Problems are: Problem set: 144 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 880/881 variables, and 773 constraints, problems are : Problem set: 144 solved, 498 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 237/238 constraints, PredecessorRefiner: 497/642 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61962ms problems are : Problem set: 144 solved, 498 unsolved
Search for dead transitions found 144 dead transitions in 61996ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 238/307 places, 499/740 transitions.
Applied a total of 0 rules in 8 ms. Remains 238 /238 variables (removed 0) and now considering 499/499 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63321 ms. Remains : 238/307 places, 499/740 transitions.
Support contains 105 out of 238 places after structural reductions.
[2025-06-02 19:49:39] [INFO ] Flatten gal took : 106 ms
[2025-06-02 19:49:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-22-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 19:49:40] [INFO ] Flatten gal took : 59 ms
[2025-06-02 19:49:40] [INFO ] Input system was already deterministic with 499 transitions.
Support contains 88 out of 238 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (1163 resets) in 2100 ms. (19 steps per ms) remains 33/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (22 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (22 resets) in 45 ms. (87 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (23 resets) in 61 ms. (64 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (22 resets) in 50 ms. (78 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (24 resets) in 46 ms. (85 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (22 resets) in 43 ms. (91 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 42 ms. (93 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (21 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (22 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (25 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (24 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (21 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (23 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (21 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (23 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (21 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
// Phase 1: matrix 499 rows 238 cols
[2025-06-02 19:49:41] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 77/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 84/215 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 3/218 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 486/704 variables, 218/238 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/704 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 25/729 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/729 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 1/730 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/730 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/730 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 6/736 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/736 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 1/737 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 18 (OVERLAPS) 0/737 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 737/737 variables, and 260 constraints, problems are : Problem set: 0 solved, 33 unsolved in 4737 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 77/131 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:46] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 84/215 variables, 13/20 constraints. Problems are: Problem set: 1 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:47] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:47] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:47] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:47] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:48] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:48] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:48] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:48] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:49] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:49] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:49] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:50] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:50] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 40 ms to minimize.
Problem AtomicPropp5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:50] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:50] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:51] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 31 ms to minimize.
SMT process timed out in 10051ms, After SMT, problems are : Problem set: 2 solved, 31 unsolved
Fused 31 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 43 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 499/499 transitions.
Graph (complete) has 943 edges and 238 vertex of which 236 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 236 transition count 475
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 215 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 214 transition count 474
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 214 transition count 471
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 211 transition count 471
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 70 place count 193 transition count 444
Iterating global reduction 3 with 18 rules applied. Total rules applied 88 place count 193 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 193 transition count 443
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 192 transition count 443
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 94 place count 188 transition count 437
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 188 transition count 437
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 142 place count 166 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 166 transition count 414
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 147 place count 162 transition count 408
Iterating global reduction 4 with 4 rules applied. Total rules applied 151 place count 162 transition count 408
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 171 place count 152 transition count 522
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 187 place count 152 transition count 506
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 5 with 102 rules applied. Total rules applied 289 place count 152 transition count 404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 291 place count 151 transition count 403
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 293 place count 151 transition count 401
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 295 place count 149 transition count 401
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 308 place count 149 transition count 475
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 335 place count 136 transition count 461
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 340 place count 136 transition count 461
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 341 place count 135 transition count 460
Applied a total of 341 rules in 393 ms. Remains 135 /238 variables (removed 103) and now considering 460/499 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 135/238 places, 460/499 transitions.
RANDOM walk for 40000 steps (2444 resets) in 819 ms. (48 steps per ms) remains 16/31 properties
BEST_FIRST walk for 4004 steps (54 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (51 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (48 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (52 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (49 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (53 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (46 resets) in 107 ms. (37 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (51 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (50 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (47 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (48 resets) in 28 ms. (138 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (58 resets) in 25 ms. (153 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (46 resets) in 22 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (49 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (52 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (46 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
[2025-06-02 19:49:52] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 135 cols
[2025-06-02 19:49:52] [INFO ] Computed 23 invariants in 8 ms
[2025-06-02 19:49:52] [INFO ] State equation strengthened by 97 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 57/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 39/113 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 7/120 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 445/565 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 89/227 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 25/590 variables, 14/241 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 1/591 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/591 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 255 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 135/135 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 57/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 39/113 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:53] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:53] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:53] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:54] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:54] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 7/120 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:54] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 445/565 variables, 120/144 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 89/233 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 13/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:55] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:55] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:56] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:56] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:57] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:57] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 14 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:57] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:58] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 13 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 25/590 variables, 14/268 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/590 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/590 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/590 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:59] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:00] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 8 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/590 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:00] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:01] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 19 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/590 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/590 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (OVERLAPS) 1/591 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/591 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/591 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (OVERLAPS) 0/591 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 287 constraints, problems are : Problem set: 0 solved, 14 unsolved in 11957 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 135/135 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13021ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 13 properties in 2678 ms.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 460/460 transitions.
Graph (complete) has 680 edges and 135 vertex of which 133 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 133 transition count 448
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 122 transition count 447
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 122 transition count 446
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 121 transition count 446
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 37 place count 110 transition count 396
Iterating global reduction 2 with 11 rules applied. Total rules applied 48 place count 110 transition count 396
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 106 transition count 376
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 106 transition count 376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 105 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 105 transition count 374
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 96 transition count 367
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 94 transition count 364
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 94 transition count 364
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 89 transition count 407
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 88 transition count 398
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 88 transition count 398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 87 transition count 396
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 87 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 124 place count 87 transition count 364
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 87 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 86 transition count 363
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 133 place count 86 transition count 619
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 171 place count 79 transition count 588
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 77 transition count 586
Applied a total of 173 rules in 101 ms. Remains 77 /135 variables (removed 58) and now considering 586/460 (removed -126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 77/135 places, 586/460 transitions.
RANDOM walk for 12702 steps (1523 resets) in 90 ms. (139 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2025-06-02 19:50:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 19:50:08] [INFO ] Flatten gal took : 41 ms
FORMULA MedleyA-PT-22-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 19:50:08] [INFO ] Flatten gal took : 40 ms
[2025-06-02 19:50:08] [INFO ] Input system was already deterministic with 499 transitions.
Computed a total of 19 stabilizing places and 20 stable transitions
Graph (complete) has 943 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 499
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 48 place count 190 transition count 428
Iterating global reduction 1 with 47 rules applied. Total rules applied 95 place count 190 transition count 428
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 98 place count 190 transition count 425
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 116 place count 172 transition count 385
Iterating global reduction 2 with 18 rules applied. Total rules applied 134 place count 172 transition count 385
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 140 place count 166 transition count 369
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 166 transition count 369
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 164 transition count 363
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 164 transition count 363
Applied a total of 150 rules in 18 ms. Remains 164 /238 variables (removed 74) and now considering 363/499 (removed 136) transitions.
// Phase 1: matrix 363 rows 164 cols
[2025-06-02 19:50:08] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:50:08] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-02 19:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:50:08] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2025-06-02 19:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:16] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:16] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:16] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:16] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:16] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:17] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:17] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/527 variables, 164/193 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:26] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:34] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 195 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/527 variables, 164/195 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 362/557 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:54] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:55] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:57] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:58] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 561 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60396ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60399ms
Starting structural reductions in LTL mode, iteration 1 : 164/238 places, 363/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61031 ms. Remains : 164/238 places, 363/499 transitions.
[2025-06-02 19:51:09] [INFO ] Flatten gal took : 32 ms
[2025-06-02 19:51:09] [INFO ] Flatten gal took : 48 ms
[2025-06-02 19:51:09] [INFO ] Input system was already deterministic with 363 transitions.
[2025-06-02 19:51:09] [INFO ] Flatten gal took : 31 ms
[2025-06-02 19:51:09] [INFO ] Flatten gal took : 29 ms
[2025-06-02 19:51:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality3445004210056871888.gal : 42 ms
[2025-06-02 19:51:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality13470656198590409821.ctl : 5 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/CTLCardinality3445004210056871888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13470656198590409821.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 19:51:39] [INFO ] Flatten gal took : 21 ms
[2025-06-02 19:51:39] [INFO ] Applying decomposition
[2025-06-02 19:51:39] [INFO ] Flatten gal took : 20 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/graph750426518376990922.txt' '-o' '/tmp/graph750426518376990922.bin' '-w' '/tmp/graph750426518376990922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph750426518376990922.bin' '-l' '-1' '-v' '-w' '/tmp/graph750426518376990922.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:51:39] [INFO ] Decomposing Gal with order
[2025-06-02 19:51:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:51:40] [INFO ] Removed a total of 747 redundant transitions.
[2025-06-02 19:51:40] [INFO ] Flatten gal took : 112 ms
[2025-06-02 19:51:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 23 ms.
[2025-06-02 19:51:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13210186414714617740.gal : 10 ms
[2025-06-02 19:51:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality6436154885382772281.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/CTLCardinality13210186414714617740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6436154885382772281.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31655e+11,7.65253,158420,3945,466,204889,4931,603,890048,126,61758,0


Converting to forward existential form...Done !
original formula: EF((AX(!(A(EF((i7.u41.p252==0)) U (i4.i1.u43.p293==0)))) * EX(((i8.i0.u34.p227==0)&&(i9.u3.p12==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EX(!(!(!((E(!((i4.i1.u43.p293==0)) U (!(E(TRUE U (i7.u41.p252==0))) * !((i4.i1.u43.p29...251
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t62, t75, t100, t134, t139, t151, t153, t181, t183, t185, t191, t195, t198, t297, t2...1257
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 192 transition count 429
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 192 transition count 429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 192 transition count 426
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 113 place count 174 transition count 387
Iterating global reduction 1 with 18 rules applied. Total rules applied 131 place count 174 transition count 387
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 137 place count 168 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 143 place count 168 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 167 transition count 367
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 167 transition count 367
Applied a total of 145 rules in 35 ms. Remains 167 /238 variables (removed 71) and now considering 367/499 (removed 132) transitions.
// Phase 1: matrix 367 rows 167 cols
[2025-06-02 19:52:10] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:52:10] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-02 19:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:52:10] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 19:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:15] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:16] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:16] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:16] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:16] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:16] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:16] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/533 variables, 166/195 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:24] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:36] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:36] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/534 variables, and 198 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 166/167 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/533 variables, 166/196 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 365/561 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/534 variables, and 563 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 166/167 constraints, PredecessorRefiner: 365/366 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in LTL mode, iteration 1 : 167/238 places, 367/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60892 ms. Remains : 167/238 places, 367/499 transitions.
[2025-06-02 19:53:11] [INFO ] Flatten gal took : 29 ms
[2025-06-02 19:53:11] [INFO ] Flatten gal took : 36 ms
[2025-06-02 19:53:11] [INFO ] Input system was already deterministic with 367 transitions.
[2025-06-02 19:53:11] [INFO ] Flatten gal took : 28 ms
[2025-06-02 19:53:11] [INFO ] Flatten gal took : 20 ms
[2025-06-02 19:53:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality17781633012638740518.gal : 4 ms
[2025-06-02 19:53:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4583678961195028152.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/CTLCardinality17781633012638740518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4583678961195028152.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 19:53:41] [INFO ] Flatten gal took : 19 ms
[2025-06-02 19:53:41] [INFO ] Applying decomposition
[2025-06-02 19:53:41] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11212622899813495266.txt' '-o' '/tmp/graph11212622899813495266.bin' '-w' '/tmp/graph11212622899813495266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11212622899813495266.bin' '-l' '-1' '-v' '-w' '/tmp/graph11212622899813495266.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:53:41] [INFO ] Decomposing Gal with order
[2025-06-02 19:53:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:53:41] [INFO ] Removed a total of 763 redundant transitions.
[2025-06-02 19:53:41] [INFO ] Flatten gal took : 47 ms
[2025-06-02 19:53:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 15 ms.
[2025-06-02 19:53:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16595395102435898568.gal : 4 ms
[2025-06-02 19:53:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality17313433083981545334.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/CTLCardinality16595395102435898568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17313433083981545334.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87562e+11,16.1261,344796,8137,696,457079,15428,678,2.05714e+06,127,217955,0


Converting to forward existential form...Done !
original formula: (AF(EG(EX((i5.u28.p177==0)))) + A(EF(!(AF((i9.i2.u47.p290==1)))) U EF(!(((i6.u30.p194==0)||(i9.i1.u44.p277==1))))))
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(E(TRUE U !(((i6.u30.p194==0)||(i9.i1.u44.p277==1))))) U (!(E(TRUE U !(!(EG(!((i9.i2.u47.p...332
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t33, t60, t102, t115, t136, t147, t163, t184, t188, t193, t198, t199, t201, t203, t2...1227
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Graph (complete) has 943 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 233 transition count 461
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 199 transition count 460
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 70 place count 199 transition count 457
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 196 transition count 457
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 109 place count 163 transition count 404
Iterating global reduction 2 with 33 rules applied. Total rules applied 142 place count 163 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 142 place count 163 transition count 401
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 160 transition count 401
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 165 place count 143 transition count 365
Iterating global reduction 2 with 17 rules applied. Total rules applied 182 place count 143 transition count 365
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 186 place count 139 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 190 place count 139 transition count 355
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 137 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 137 transition count 349
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 242 place count 112 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 112 transition count 325
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 248 place count 107 transition count 314
Iterating global reduction 3 with 5 rules applied. Total rules applied 253 place count 107 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 107 transition count 311
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 262 place count 104 transition count 308
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 264 place count 102 transition count 306
Applied a total of 264 rules in 93 ms. Remains 102 /238 variables (removed 136) and now considering 306/499 (removed 193) transitions.
// Phase 1: matrix 306 rows 102 cols
[2025-06-02 19:54:11] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:54:11] [INFO ] Implicit Places using invariants in 104 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 101/238 places, 306/499 transitions.
Applied a total of 0 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 211 ms. Remains : 101/238 places, 306/499 transitions.
[2025-06-02 19:54:11] [INFO ] Flatten gal took : 14 ms
[2025-06-02 19:54:11] [INFO ] Flatten gal took : 19 ms
[2025-06-02 19:54:11] [INFO ] Input system was already deterministic with 306 transitions.
[2025-06-02 19:54:11] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:54:12] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:54:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4761715263017533089.gal : 2 ms
[2025-06-02 19:54:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality1362745674206261128.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/CTLCardinality4761715263017533089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1362745674206261128.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 19:54:42] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:54:42] [INFO ] Applying decomposition
[2025-06-02 19:54:42] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph599926795031650070.txt' '-o' '/tmp/graph599926795031650070.bin' '-w' '/tmp/graph599926795031650070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph599926795031650070.bin' '-l' '-1' '-v' '-w' '/tmp/graph599926795031650070.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:54:42] [INFO ] Decomposing Gal with order
[2025-06-02 19:54:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:54:42] [INFO ] Removed a total of 666 redundant transitions.
[2025-06-02 19:54:42] [INFO ] Flatten gal took : 51 ms
[2025-06-02 19:54:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 7 ms.
[2025-06-02 19:54:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality13101519167776216970.gal : 3 ms
[2025-06-02 19:54:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality7993136120217396171.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/CTLCardinality13101519167776216970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7993136120217396171.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.41036e+09,10.7258,194192,1914,399,265224,5849,352,1.00502e+06,141,81880,0


Converting to forward existential form...Done !
original formula: (AF(AG((i3.u15.p258==0))) * AF(((EF(!(A((i0.u1.p40==1) U ((i3.u21.p263==0)||(i5.u8.p122==1))))) * (i2.u14.p162==0)) * (i2.u14.p112==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !((i3.u15.p258==0))))))] = FALSE * [FwdG(Init,!(((E(TRUE U !(!((E(!(((i3.u21.p263==0)||...337
Reverse transition relation is NOT exact ! Due to transitions t44, t74, t78, i0.t65, i0.t60, i0.u1.t50, i0.u1.t70, i0.u2.t66, i0.u2.t69, i0.u3.t67, i0.u3.t...971
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 499
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 47 place count 191 transition count 429
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 191 transition count 429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 96 place count 191 transition count 426
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 115 place count 172 transition count 382
Iterating global reduction 2 with 19 rules applied. Total rules applied 134 place count 172 transition count 382
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 141 place count 165 transition count 363
Iterating global reduction 2 with 7 rules applied. Total rules applied 148 place count 165 transition count 363
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 163 transition count 357
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 163 transition count 357
Applied a total of 152 rules in 24 ms. Remains 163 /238 variables (removed 75) and now considering 357/499 (removed 142) transitions.
// Phase 1: matrix 357 rows 163 cols
[2025-06-02 19:55:12] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:55:12] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 19:55:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:55:12] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2025-06-02 19:55:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:20] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:20] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:20] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:20] [INFO ] Deduced a trap composed of 31 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-02 19:55:21] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:21] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:21] [INFO ] Deduced a trap composed of 31 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-02 19:55:22] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:22] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (OVERLAPS) 357/520 variables, 163/194 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:32] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/520 variables, and 195 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (OVERLAPS) 357/520 variables, 163/195 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 356/551 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:57] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:59] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:00] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:00] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:01] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 5/556 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 556 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Starting structural reductions in LTL mode, iteration 1 : 163/238 places, 357/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61035 ms. Remains : 163/238 places, 357/499 transitions.
[2025-06-02 19:56:13] [INFO ] Flatten gal took : 14 ms
[2025-06-02 19:56:13] [INFO ] Flatten gal took : 15 ms
[2025-06-02 19:56:13] [INFO ] Input system was already deterministic with 357 transitions.
[2025-06-02 19:56:13] [INFO ] Flatten gal took : 14 ms
[2025-06-02 19:56:13] [INFO ] Flatten gal took : 15 ms
[2025-06-02 19:56:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8883132612308394116.gal : 5 ms
[2025-06-02 19:56:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10260179827200414758.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/CTLCardinality8883132612308394116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10260179827200414758.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 19:56:43] [INFO ] Flatten gal took : 15 ms
[2025-06-02 19:56:43] [INFO ] Applying decomposition
[2025-06-02 19:56:43] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15619304235796860354.txt' '-o' '/tmp/graph15619304235796860354.bin' '-w' '/tmp/graph15619304235796860354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15619304235796860354.bin' '-l' '-1' '-v' '-w' '/tmp/graph15619304235796860354.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:56:43] [INFO ] Decomposing Gal with order
[2025-06-02 19:56:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:56:43] [INFO ] Removed a total of 746 redundant transitions.
[2025-06-02 19:56:43] [INFO ] Flatten gal took : 37 ms
[2025-06-02 19:56:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 9 ms.
[2025-06-02 19:56:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13466547653764224748.gal : 3 ms
[2025-06-02 19:56:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality17554401916708757801.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/CTLCardinality13466547653764224748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17554401916708757801.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12816e+11,6.99288,147084,3348,180,237069,1355,592,633090,105,7791,0


Converting to forward existential form...Done !
original formula: A(!(EX(!(((i7.u31.p192==0)||(i6.u17.p120==1))))) U !(((i6.u28.p182==0)||(i1.u4.p5==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(((i6.u28.p182==0)||(i1.u4.p5==1))))))) * !(E(!(!(((i6.u28.p182==0)||(i1.u4.p5==1)))) U (!(!(E...255
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t60, t98, t133, t142, t161, t171, t181, t183, t199, t201, i1.u4.t128, i1.u4.t129, i1...1110
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 499
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 46 place count 192 transition count 430
Iterating global reduction 1 with 45 rules applied. Total rules applied 91 place count 192 transition count 430
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 94 place count 192 transition count 427
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 111 place count 175 transition count 385
Iterating global reduction 2 with 17 rules applied. Total rules applied 128 place count 175 transition count 385
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 168 transition count 366
Iterating global reduction 2 with 7 rules applied. Total rules applied 142 place count 168 transition count 366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 166 transition count 360
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 166 transition count 360
Applied a total of 146 rules in 10 ms. Remains 166 /238 variables (removed 72) and now considering 360/499 (removed 139) transitions.
// Phase 1: matrix 360 rows 166 cols
[2025-06-02 19:57:13] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:57:13] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-02 19:57:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:57:14] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2025-06-02 19:57:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:22] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:22] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:22] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:22] [INFO ] Deduced a trap composed of 31 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-02 19:57:23] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:23] [INFO ] Deduced a trap composed of 26 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-02 19:57:23] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/526 variables, 166/195 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:34] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 359 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 526/526 variables, and 196 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/526 variables, 166/196 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 359/555 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:03] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:04] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:04] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:04] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 4/559 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/526 variables, and 559 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Starting structural reductions in LTL mode, iteration 1 : 166/238 places, 360/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61180 ms. Remains : 166/238 places, 360/499 transitions.
[2025-06-02 19:58:14] [INFO ] Flatten gal took : 16 ms
[2025-06-02 19:58:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:58:15] [INFO ] Input system was already deterministic with 360 transitions.
[2025-06-02 19:58:15] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:58:15] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:58:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality16831500877404666278.gal : 4 ms
[2025-06-02 19:58:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality4927144017849284635.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/CTLCardinality16831500877404666278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4927144017849284635.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 19:58:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 19:58:45] [INFO ] Applying decomposition
[2025-06-02 19:58:45] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16821173299273848738.txt' '-o' '/tmp/graph16821173299273848738.bin' '-w' '/tmp/graph16821173299273848738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16821173299273848738.bin' '-l' '-1' '-v' '-w' '/tmp/graph16821173299273848738.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:58:45] [INFO ] Decomposing Gal with order
[2025-06-02 19:58:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:58:45] [INFO ] Removed a total of 721 redundant transitions.
[2025-06-02 19:58:45] [INFO ] Flatten gal took : 30 ms
[2025-06-02 19:58:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 9 ms.
[2025-06-02 19:58:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13834936843292017471.gal : 3 ms
[2025-06-02 19:58:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality6377740855330651173.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/CTLCardinality13834936843292017471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6377740855330651173.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.54839e+11,14.1124,277004,4718,445,451920,3460,561,1.0657e+06,139,18069,0


Converting to forward existential form...Done !
original formula: AG(AF(((AX(FALSE) * !(E(((i10.i1.u46.p292==0)||(i9.u30.p191==1)) U (i8.u34.p225==0)))) * ((AG(((i4.u19.p123==0)&&(i0.i0.u1.p1==1))) + AF(...220
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EX(!(FALSE))) * !(E(((i10.i1.u46.p292==0)||(i9.u30.p191==1)) U (i8.u34.p225==0)))) *...296
Reverse transition relation is NOT exact ! Due to transitions t21, t34, t61, t100, t133, t135, t140, t144, t146, t157, t159, t184, t186, t202, t204, i1.u6....1085
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 499
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 194 transition count 436
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 194 transition count 436
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 194 transition count 434
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 105 place count 178 transition count 401
Iterating global reduction 2 with 16 rules applied. Total rules applied 121 place count 178 transition count 401
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 126 place count 173 transition count 388
Iterating global reduction 2 with 5 rules applied. Total rules applied 131 place count 173 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 171 transition count 382
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 171 transition count 382
Applied a total of 135 rules in 11 ms. Remains 171 /238 variables (removed 67) and now considering 382/499 (removed 117) transitions.
// Phase 1: matrix 382 rows 171 cols
[2025-06-02 19:59:15] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:59:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 19:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:59:15] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2025-06-02 19:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:21] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:21] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:21] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:21] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:21] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:21] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:22] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:22] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 382/553 variables, 171/201 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:30] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:39] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:44] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:44] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:45] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 206 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 382/553 variables, 171/206 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 381/587 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:06] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:06] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 589 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in LTL mode, iteration 1 : 171/238 places, 382/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60804 ms. Remains : 171/238 places, 382/499 transitions.
[2025-06-02 20:00:16] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:00:16] [INFO ] Flatten gal took : 13 ms
[2025-06-02 20:00:16] [INFO ] Input system was already deterministic with 382 transitions.
[2025-06-02 20:00:16] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:00:16] [INFO ] Flatten gal took : 13 ms
[2025-06-02 20:00:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7750144560354772995.gal : 5 ms
[2025-06-02 20:00:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality4140847795941996086.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/CTLCardinality7750144560354772995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4140847795941996086.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:00:46] [INFO ] Flatten gal took : 13 ms
[2025-06-02 20:00:46] [INFO ] Applying decomposition
[2025-06-02 20:00:46] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8287241793167635285.txt' '-o' '/tmp/graph8287241793167635285.bin' '-w' '/tmp/graph8287241793167635285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8287241793167635285.bin' '-l' '-1' '-v' '-w' '/tmp/graph8287241793167635285.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:00:46] [INFO ] Decomposing Gal with order
[2025-06-02 20:00:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:00:46] [INFO ] Removed a total of 655 redundant transitions.
[2025-06-02 20:00:46] [INFO ] Flatten gal took : 31 ms
[2025-06-02 20:00:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 8 ms.
[2025-06-02 20:00:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2400302875833549976.gal : 3 ms
[2025-06-02 20:00:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality2086427193411310475.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/CTLCardinality2400302875833549976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2086427193411310475.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31087e+11,20.3501,306756,5796,1330,406493,39366,584,1.15003e+06,221,440619,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Graph (complete) has 943 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 234 transition count 461
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 199 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 198 transition count 459
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 198 transition count 456
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 195 transition count 456
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 115 place count 160 transition count 397
Iterating global reduction 3 with 35 rules applied. Total rules applied 150 place count 160 transition count 397
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 150 place count 160 transition count 394
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 157 transition count 394
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 173 place count 140 transition count 359
Iterating global reduction 3 with 17 rules applied. Total rules applied 190 place count 140 transition count 359
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 193 place count 137 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 196 place count 137 transition count 351
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 136 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 136 transition count 348
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 246 place count 111 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 248 place count 111 transition count 323
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 255 place count 104 transition count 308
Iterating global reduction 4 with 7 rules applied. Total rules applied 262 place count 104 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 265 place count 104 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 271 place count 101 transition count 302
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 99 transition count 300
Applied a total of 273 rules in 75 ms. Remains 99 /238 variables (removed 139) and now considering 300/499 (removed 199) transitions.
// Phase 1: matrix 300 rows 99 cols
[2025-06-02 20:01:16] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:01:16] [INFO ] Implicit Places using invariants in 140 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 98/238 places, 300/499 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 226 ms. Remains : 98/238 places, 300/499 transitions.
[2025-06-02 20:01:16] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:01:16] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:01:16] [INFO ] Input system was already deterministic with 300 transitions.
[2025-06-02 20:01:16] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:01:16] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:01:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7094655814178255579.gal : 2 ms
[2025-06-02 20:01:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality7729059778020194882.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/CTLCardinality7094655814178255579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7729059778020194882.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:01:46] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:01:46] [INFO ] Applying decomposition
[2025-06-02 20:01:46] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8576440533051931388.txt' '-o' '/tmp/graph8576440533051931388.bin' '-w' '/tmp/graph8576440533051931388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8576440533051931388.bin' '-l' '-1' '-v' '-w' '/tmp/graph8576440533051931388.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:01:46] [INFO ] Decomposing Gal with order
[2025-06-02 20:01:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:01:46] [INFO ] Removed a total of 721 redundant transitions.
[2025-06-02 20:01:46] [INFO ] Flatten gal took : 23 ms
[2025-06-02 20:01:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 3 ms.
[2025-06-02 20:01:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality7565160642264463124.gal : 2 ms
[2025-06-02 20:01:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality300650813934442642.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/CTLCardinality7565160642264463124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality300650813934442642.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.81246e+09,4.71133,95904,1464,318,133257,2660,376,445876,123,44463,0


Converting to forward existential form...Done !
original formula: (AG((EF((i5.u22.p295!=1)) * (i5.u26.p276!=1))) * AF((((i4.u21.p242==0)||(i2.u14.p178==1))&&(i5.u1.p34==0))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U (i5.u22.p295!=1))))] = FALSE * [(FwdU(Init,TRUE) * !((i5.u26.p276!=1)))] = FALS...239
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
(forward)formula 0,0,6.77991,95904,1,0,133257,6954,1392,445876,490,97076,127693
FORMULA MedleyA-PT-22-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 499
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 41 place count 197 transition count 441
Iterating global reduction 1 with 40 rules applied. Total rules applied 81 place count 197 transition count 441
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 197 transition count 439
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 97 place count 183 transition count 408
Iterating global reduction 2 with 14 rules applied. Total rules applied 111 place count 183 transition count 408
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 181 transition count 403
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 181 transition count 403
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 180 transition count 400
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 180 transition count 400
Applied a total of 117 rules in 14 ms. Remains 180 /238 variables (removed 58) and now considering 400/499 (removed 99) transitions.
// Phase 1: matrix 400 rows 180 cols
[2025-06-02 20:01:53] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:01:53] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-02 20:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:01:54] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2025-06-02 20:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:03] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:03] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:04] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:04] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:04] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:05] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:05] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:05] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (OVERLAPS) 400/580 variables, 180/210 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:17] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 19 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/580 variables, and 211 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/180 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (OVERLAPS) 400/580 variables, 180/211 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 399/610 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:44] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:44] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:47] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:47] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/580 variables, and 614 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Starting structural reductions in LTL mode, iteration 1 : 180/238 places, 400/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61305 ms. Remains : 180/238 places, 400/499 transitions.
[2025-06-02 20:02:55] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:02:55] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:02:55] [INFO ] Input system was already deterministic with 400 transitions.
[2025-06-02 20:02:55] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:02:55] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:02:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13624848751883765815.gal : 3 ms
[2025-06-02 20:02:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality579634571187115776.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/CTLCardinality13624848751883765815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality579634571187115776.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:03:25] [INFO ] Flatten gal took : 13 ms
[2025-06-02 20:03:25] [INFO ] Applying decomposition
[2025-06-02 20:03:25] [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/graph17366202357267046860.txt' '-o' '/tmp/graph17366202357267046860.bin' '-w' '/tmp/graph17366202357267046860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17366202357267046860.bin' '-l' '-1' '-v' '-w' '/tmp/graph17366202357267046860.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:03:25] [INFO ] Decomposing Gal with order
[2025-06-02 20:03:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:03:25] [INFO ] Removed a total of 674 redundant transitions.
[2025-06-02 20:03:25] [INFO ] Flatten gal took : 50 ms
[2025-06-02 20:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 10 ms.
[2025-06-02 20:03:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17995526457389423878.gal : 5 ms
[2025-06-02 20:03:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality7643133116327941510.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/CTLCardinality17995526457389423878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7643133116327941510.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 LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 499
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 46 place count 192 transition count 434
Iterating global reduction 1 with 45 rules applied. Total rules applied 91 place count 192 transition count 434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 192 transition count 432
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 111 place count 174 transition count 395
Iterating global reduction 2 with 18 rules applied. Total rules applied 129 place count 174 transition count 395
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 134 place count 169 transition count 381
Iterating global reduction 2 with 5 rules applied. Total rules applied 139 place count 169 transition count 381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 168 transition count 378
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 168 transition count 378
Applied a total of 141 rules in 13 ms. Remains 168 /238 variables (removed 70) and now considering 378/499 (removed 121) transitions.
// Phase 1: matrix 378 rows 168 cols
[2025-06-02 20:03:55] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:03:55] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-02 20:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:03:55] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2025-06-02 20:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:04] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:04] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:04] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:04] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:04] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:05] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:05] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:05] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:05] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:06] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/546 variables, 168/200 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:17] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 201 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/546 variables, 168/201 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 377/578 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:44] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:45] [INFO ] Deduced a trap composed of 34 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-02 20:04:46] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:46] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 582 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
Starting structural reductions in LTL mode, iteration 1 : 168/238 places, 378/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61080 ms. Remains : 168/238 places, 378/499 transitions.
[2025-06-02 20:04:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 20:04:56] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:04:56] [INFO ] Input system was already deterministic with 378 transitions.
[2025-06-02 20:04:56] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:04:56] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:04:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6698085088439356119.gal : 2 ms
[2025-06-02 20:04:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12864540268934063238.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/CTLCardinality6698085088439356119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12864540268934063238.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:05:26] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:05:26] [INFO ] Applying decomposition
[2025-06-02 20:05:26] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13059556535601582074.txt' '-o' '/tmp/graph13059556535601582074.bin' '-w' '/tmp/graph13059556535601582074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13059556535601582074.bin' '-l' '-1' '-v' '-w' '/tmp/graph13059556535601582074.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:05:26] [INFO ] Decomposing Gal with order
[2025-06-02 20:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:05:26] [INFO ] Removed a total of 745 redundant transitions.
[2025-06-02 20:05:26] [INFO ] Flatten gal took : 30 ms
[2025-06-02 20:05:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 9 ms.
[2025-06-02 20:05:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality16174571615506505013.gal : 5 ms
[2025-06-02 20:05:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality7483556805059586224.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/CTLCardinality16174571615506505013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7483556805059586224.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76337e+11,25.8641,412532,4625,723,602046,11025,658,1.79808e+06,158,89487,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 499
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 47 place count 191 transition count 429
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 191 transition count 429
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 191 transition count 427
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 115 place count 171 transition count 382
Iterating global reduction 2 with 20 rules applied. Total rules applied 135 place count 171 transition count 382
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 141 place count 165 transition count 366
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 165 transition count 366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 163 transition count 360
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 163 transition count 360
Applied a total of 151 rules in 11 ms. Remains 163 /238 variables (removed 75) and now considering 360/499 (removed 139) transitions.
// Phase 1: matrix 360 rows 163 cols
[2025-06-02 20:05:56] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:05:56] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-02 20:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:05:57] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2025-06-02 20:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:04] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:05] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:05] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:05] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:05] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:05] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:06] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/523 variables, 163/192 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:16] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 193 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/523 variables, 163/193 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 359/552 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:43] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 553 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in LTL mode, iteration 1 : 163/238 places, 360/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60835 ms. Remains : 163/238 places, 360/499 transitions.
[2025-06-02 20:06:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:06:57] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:06:57] [INFO ] Input system was already deterministic with 360 transitions.
[2025-06-02 20:06:57] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:06:57] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:06:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality10262446194180529835.gal : 3 ms
[2025-06-02 20:06:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality11239983794570050931.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/CTLCardinality10262446194180529835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11239983794570050931.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:07:27] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:07:27] [INFO ] Applying decomposition
[2025-06-02 20:07:27] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6454358002651766170.txt' '-o' '/tmp/graph6454358002651766170.bin' '-w' '/tmp/graph6454358002651766170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6454358002651766170.bin' '-l' '-1' '-v' '-w' '/tmp/graph6454358002651766170.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:07:27] [INFO ] Decomposing Gal with order
[2025-06-02 20:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:07:27] [INFO ] Removed a total of 720 redundant transitions.
[2025-06-02 20:07:27] [INFO ] Flatten gal took : 25 ms
[2025-06-02 20:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 6 ms.
[2025-06-02 20:07:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12107051006091953167.gal : 3 ms
[2025-06-02 20:07:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality14953392995595078591.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/CTLCardinality12107051006091953167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14953392995595078591.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19204e+11,10.3077,200032,4004,503,331233,3959,617,752205,145,23256,0


Converting to forward existential form...Done !
original formula: EF((((i0.i0.u4.p37==0)&&(i7.u41.p253==1)) * ((i3.u2.p24==1) + AX(FALSE))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((i0.i0.u4.p37==0)&&(i7.u41.p253==1))) * (i3.u2.p24==1))] != FALSE + [((FwdU(Init,TRUE) * ...223
(forward)formula 0,1,10.3607,200032,1,0,331233,3959,630,752205,152,23256,3915
FORMULA MedleyA-PT-22-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Graph (complete) has 943 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 233 transition count 461
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 72 place count 199 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 197 transition count 458
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 197 transition count 455
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 194 transition count 455
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 113 place count 161 transition count 399
Iterating global reduction 3 with 33 rules applied. Total rules applied 146 place count 161 transition count 399
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 146 place count 161 transition count 397
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 150 place count 159 transition count 397
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 166 place count 143 transition count 363
Iterating global reduction 3 with 16 rules applied. Total rules applied 182 place count 143 transition count 363
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 186 place count 139 transition count 353
Iterating global reduction 3 with 4 rules applied. Total rules applied 190 place count 139 transition count 353
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 137 transition count 347
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 137 transition count 347
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 243 place count 111 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 245 place count 111 transition count 322
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 251 place count 105 transition count 310
Iterating global reduction 4 with 6 rules applied. Total rules applied 257 place count 105 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 260 place count 105 transition count 307
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 266 place count 102 transition count 304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 268 place count 100 transition count 302
Applied a total of 268 rules in 69 ms. Remains 100 /238 variables (removed 138) and now considering 302/499 (removed 197) transitions.
// Phase 1: matrix 302 rows 100 cols
[2025-06-02 20:07:38] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:07:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-02 20:07:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:07:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 20:07:38] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:07:38] [INFO ] Redundant transitions in 20 ms returned []
Running 291 sub problems to find dead transitions.
[2025-06-02 20:07:38] [INFO ] Invariant cache hit.
[2025-06-02 20:07:38] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:40] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 3/99 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:45] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:47] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 301/400 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 2/402 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/402 variables, and 158 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 3/99 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 301/400 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 290/447 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 2/402 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 291 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 Int declared 402/402 variables, and 449 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/238 places, 302/499 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60702 ms. Remains : 100/238 places, 302/499 transitions.
[2025-06-02 20:08:39] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:08:39] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:08:39] [INFO ] Input system was already deterministic with 302 transitions.
[2025-06-02 20:08:39] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:08:39] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:08:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality8422324680020181261.gal : 3 ms
[2025-06-02 20:08:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality6158027185730341981.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/CTLCardinality8422324680020181261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6158027185730341981.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:09:09] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:09:09] [INFO ] Applying decomposition
[2025-06-02 20:09:09] [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/graph7857288122979070807.txt' '-o' '/tmp/graph7857288122979070807.bin' '-w' '/tmp/graph7857288122979070807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7857288122979070807.bin' '-l' '-1' '-v' '-w' '/tmp/graph7857288122979070807.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:09:09] [INFO ] Decomposing Gal with order
[2025-06-02 20:09:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:09:09] [INFO ] Removed a total of 733 redundant transitions.
[2025-06-02 20:09:09] [INFO ] Flatten gal took : 32 ms
[2025-06-02 20:09:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 5 ms.
[2025-06-02 20:09:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality17988205693682789716.gal : 3 ms
[2025-06-02 20:09:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality6597384266892568722.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/CTLCardinality17988205693682789716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6597384266892568722.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.18521e+09,26.5094,432936,3081,166,539224,1207,382,2.86358e+06,108,18817,0


Converting to forward existential form...Done !
original formula: AG(((AG((i4.u15.p203==0)) + AG(((i1.u0.p13==1)||(i2.u14.p160==1)))) + ((AG((i4.u16.p226==1)) * (i4.u21.p261==0)) * (i2.u8.p101==1))))
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !((!(E(TRUE U !((i4.u15.p203==0)))) + !(E(TRUE U !(((i1.u0.p13==1)||(i2.u14.p160==1)...495
Reverse transition relation is NOT exact ! Due to transitions t14, t19, t78, t86, t97, t98, t111, t156, t157, t171, t186, t257, t266, t267, i0.t82, i0.t61,...991
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Graph (complete) has 943 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 233 transition count 462
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 200 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 198 transition count 459
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 72 place count 198 transition count 455
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 80 place count 194 transition count 455
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 111 place count 163 transition count 404
Iterating global reduction 3 with 31 rules applied. Total rules applied 142 place count 163 transition count 404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 142 place count 163 transition count 402
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 146 place count 161 transition count 402
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 162 place count 145 transition count 366
Iterating global reduction 3 with 16 rules applied. Total rules applied 178 place count 145 transition count 366
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 181 place count 142 transition count 359
Iterating global reduction 3 with 3 rules applied. Total rules applied 184 place count 142 transition count 359
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 186 place count 140 transition count 353
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 140 transition count 353
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 235 place count 116 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 237 place count 116 transition count 328
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 245 place count 108 transition count 310
Iterating global reduction 4 with 8 rules applied. Total rules applied 253 place count 108 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 256 place count 108 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 260 place count 106 transition count 305
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 104 transition count 303
Applied a total of 262 rules in 50 ms. Remains 104 /238 variables (removed 134) and now considering 303/499 (removed 196) transitions.
// Phase 1: matrix 303 rows 104 cols
[2025-06-02 20:09:39] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:09:39] [INFO ] Implicit Places using invariants in 154 ms returned [6, 39]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 155 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 102/238 places, 303/499 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 211 ms. Remains : 102/238 places, 303/499 transitions.
[2025-06-02 20:09:39] [INFO ] Flatten gal took : 9 ms
[2025-06-02 20:09:39] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:09:39] [INFO ] Input system was already deterministic with 303 transitions.
[2025-06-02 20:09:39] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:09:39] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:09:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality9023825047280740591.gal : 2 ms
[2025-06-02 20:09:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality2672228484127953362.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/CTLCardinality9023825047280740591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2672228484127953362.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:10:09] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:10:09] [INFO ] Applying decomposition
[2025-06-02 20:10:09] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8143088826596879034.txt' '-o' '/tmp/graph8143088826596879034.bin' '-w' '/tmp/graph8143088826596879034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8143088826596879034.bin' '-l' '-1' '-v' '-w' '/tmp/graph8143088826596879034.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:10:09] [INFO ] Decomposing Gal with order
[2025-06-02 20:10:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:10:09] [INFO ] Removed a total of 758 redundant transitions.
[2025-06-02 20:10:09] [INFO ] Flatten gal took : 21 ms
[2025-06-02 20:10:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 4 ms.
[2025-06-02 20:10:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality5216960061649236032.gal : 2 ms
[2025-06-02 20:10:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality16353514397228780380.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/CTLCardinality5216960061649236032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16353514397228780380.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.3165e+09,1.57554,40060,1336,63,59534,439,445,196207,76,3020,0


Converting to forward existential form...Done !
original formula: EF((EF(((E(AF((i4.u20.p229==1)) U (((i0.u2.p39==1)||(i2.u10.p110==0))||(i2.u9.p15==1))) * (i1.u0.p25==1)) * ((i1.u1.p14==0)||(i3.u11.p97=...203
=> equivalent forward existential formula: [(FwdU(((FwdU((FwdU(Init,TRUE) * ((i5.i1.u26.p292==0)||(i1.u7.p67==1))),TRUE) * ((i1.u1.p14==0)||(i3.u11.p97==1)...269
Reverse transition relation is NOT exact ! Due to transitions t31, t80, t186, t224, t227, t295, t297, t299, t301, i0.t81, i0.t61, i0.t56, i0.u2.t42, i0.u2....933
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 499
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 47 place count 191 transition count 430
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 191 transition count 430
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 96 place count 191 transition count 427
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 114 place count 173 transition count 387
Iterating global reduction 2 with 18 rules applied. Total rules applied 132 place count 173 transition count 387
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 137 place count 168 transition count 373
Iterating global reduction 2 with 5 rules applied. Total rules applied 142 place count 168 transition count 373
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 167 transition count 370
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 167 transition count 370
Applied a total of 144 rules in 11 ms. Remains 167 /238 variables (removed 71) and now considering 370/499 (removed 129) transitions.
// Phase 1: matrix 370 rows 167 cols
[2025-06-02 20:10:39] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:10:39] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 20:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:10:40] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-02 20:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:48] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:48] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:48] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:48] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:49] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:49] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:49] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/537 variables, 167/196 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:00] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/537 variables, and 197 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/537 variables, 167/197 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 369/566 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:29] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:32] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 568 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Starting structural reductions in LTL mode, iteration 1 : 167/238 places, 370/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60917 ms. Remains : 167/238 places, 370/499 transitions.
[2025-06-02 20:11:40] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:11:40] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:11:40] [INFO ] Input system was already deterministic with 370 transitions.
[2025-06-02 20:11:40] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:11:40] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:11:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality5210948192331497849.gal : 2 ms
[2025-06-02 20:11:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality4788187582138875573.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/CTLCardinality5210948192331497849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4788187582138875573.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:12:10] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:12:10] [INFO ] Applying decomposition
[2025-06-02 20:12:10] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15937946054441575691.txt' '-o' '/tmp/graph15937946054441575691.bin' '-w' '/tmp/graph15937946054441575691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15937946054441575691.bin' '-l' '-1' '-v' '-w' '/tmp/graph15937946054441575691.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:12:10] [INFO ] Decomposing Gal with order
[2025-06-02 20:12:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:12:11] [INFO ] Removed a total of 730 redundant transitions.
[2025-06-02 20:12:11] [INFO ] Flatten gal took : 25 ms
[2025-06-02 20:12:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 5 ms.
[2025-06-02 20:12:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality13040330056731375520.gal : 3 ms
[2025-06-02 20:12:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16762736639357728274.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/CTLCardinality13040330056731375520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16762736639357728274.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.
[2025-06-02 20:12:41] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:12:41] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:12:41] [INFO ] Applying decomposition
[2025-06-02 20:12:41] [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/graph9179263765197210208.txt' '-o' '/tmp/graph9179263765197210208.bin' '-w' '/tmp/graph9179263765197210208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9179263765197210208.bin' '-l' '-1' '-v' '-w' '/tmp/graph9179263765197210208.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:12:41] [INFO ] Decomposing Gal with order
[2025-06-02 20:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:12:41] [INFO ] Removed a total of 822 redundant transitions.
[2025-06-02 20:12:41] [INFO ] Flatten gal took : 35 ms
[2025-06-02 20:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 7 ms.
[2025-06-02 20:12:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16453375186592359020.gal : 4 ms
[2025-06-02 20:12:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3235691268864902903.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/CTLCardinality16453375186592359020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3235691268864902903.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 11 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:40:43] [INFO ] Applying decomposition
[2025-06-02 20:40:43] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:40:43] [INFO ] Decomposing Gal with order
[2025-06-02 20:40:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:40:43] [INFO ] Removed a total of 848 redundant transitions.
[2025-06-02 20:40:43] [INFO ] Flatten gal took : 43 ms
[2025-06-02 20:40:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 7 ms.
[2025-06-02 20:40:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15075378486205356735.gal : 3 ms
[2025-06-02 20:40:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8530561971747768858.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/CTLCardinality15075378486205356735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8530561971747768858.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 11 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="MedleyA-PT-22"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-22, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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