Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K 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 168K 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 FireWire-PT-18-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-18-CTLCardinality-2024-15
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-00
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-01
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-02
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-03
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-04
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-05
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-06
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-07
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-08
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-09
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-10
FORMULA_NAME FireWire-PT-18-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748893488823

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 19:44:51] [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:44:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:44:52] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2025-06-02 19:44:52] [INFO ] Transformed 437 places.
[2025-06-02 19:44:52] [INFO ] Transformed 707 transitions.
[2025-06-02 19:44:52] [INFO ] Found NUPN structural information;
[2025-06-02 19:44:52] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
FORMULA FireWire-PT-18-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 96 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 431 transition count 707
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 78 place count 359 transition count 635
Iterating global reduction 1 with 72 rules applied. Total rules applied 150 place count 359 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 151 place count 359 transition count 634
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 160 place count 350 transition count 602
Iterating global reduction 2 with 9 rules applied. Total rules applied 169 place count 350 transition count 602
Applied a total of 169 rules in 193 ms. Remains 350 /437 variables (removed 87) and now considering 602/707 (removed 105) transitions.
// Phase 1: matrix 602 rows 350 cols
[2025-06-02 19:44:52] [INFO ] Computed 7 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:44:53] [INFO ] Implicit Places using invariants in 896 ms returned []
[2025-06-02 19:44:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:44:54] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 2343 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2025-06-02 19:44: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/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:13] [INFO ] Deduced a trap composed of 177 places in 530 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:14] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:15] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:16] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:16] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:16] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:17] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:17] [INFO ] Deduced a trap composed of 49 places in 364 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:18] [INFO ] Deduced a trap composed of 60 places in 429 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:19] [INFO ] Deduced a trap composed of 107 places in 328 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:19] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/952 variables, and 18 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/350 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:34] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:36] [INFO ] Deduced a trap composed of 54 places in 474 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:37] [INFO ] Deduced a trap composed of 59 places in 439 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:37] [INFO ] Deduced a trap composed of 60 places in 376 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:38] [INFO ] Deduced a trap composed of 52 places in 446 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:38] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:47] [INFO ] Deduced a trap composed of 63 places in 379 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:48] [INFO ] Deduced a trap composed of 198 places in 479 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:49] [INFO ] Deduced a trap composed of 50 places in 426 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:50] [INFO ] Deduced a trap composed of 198 places in 450 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:50] [INFO ] Deduced a trap composed of 97 places in 439 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:50] [INFO ] Deduced a trap composed of 123 places in 425 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:45:51] [INFO ] Deduced a trap composed of 198 places in 357 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/952 variables, and 31 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/350 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60723ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60764ms
Starting structural reductions in LTL mode, iteration 1 : 350/437 places, 602/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63350 ms. Remains : 350/437 places, 602/707 transitions.
Support contains 96 out of 350 places after structural reductions.
[2025-06-02 19:45:56] [INFO ] Flatten gal took : 145 ms
[2025-06-02 19:45:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-18-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 19:45:56] [INFO ] Flatten gal took : 89 ms
[2025-06-02 19:45:56] [INFO ] Input system was already deterministic with 602 transitions.
Support contains 71 out of 350 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (13 resets) in 1925 ms. (20 steps per ms) remains 40/50 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (9 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
[2025-06-02 19:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 268/323 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 582/905 variables, 323/330 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 28/933 variables, 16/346 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 15/948 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/948 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 4/952 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/952 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 952/952 variables, and 357 constraints, problems are : Problem set: 0 solved, 40 unsolved in 4626 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 350/350 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 268/323 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:02] [INFO ] Deduced a trap composed of 105 places in 308 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:03] [INFO ] Deduced a trap composed of 96 places in 312 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:03] [INFO ] Deduced a trap composed of 107 places in 266 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:03] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:04] [INFO ] Deduced a trap composed of 164 places in 333 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:04] [INFO ] Deduced a trap composed of 49 places in 399 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:04] [INFO ] Deduced a trap composed of 50 places in 307 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:04] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:05] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:05] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:06] [INFO ] Deduced a trap composed of 200 places in 319 ms of which 65 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/952 variables, and 18 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/350 constraints, PredecessorRefiner: 0/40 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9670ms problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 602/602 transitions.
Graph (trivial) has 181 edges and 350 vertex of which 8 / 350 are part of one of the 2 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1091 edges and 344 vertex of which 343 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 343 transition count 563
Reduce places removed 30 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 313 transition count 560
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 310 transition count 560
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 68 place count 310 transition count 543
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 102 place count 293 transition count 543
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 111 place count 284 transition count 534
Iterating global reduction 3 with 9 rules applied. Total rules applied 120 place count 284 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 284 transition count 533
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 121 place count 284 transition count 532
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 283 transition count 532
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 185 place count 252 transition count 501
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 217 place count 236 transition count 570
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 236 transition count 569
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 242 place count 236 transition count 545
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 269 place count 212 transition count 542
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 270 place count 211 transition count 541
Iterating global reduction 5 with 1 rules applied. Total rules applied 271 place count 211 transition count 541
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 276 place count 211 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 285 place count 211 transition count 527
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 211 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 287 place count 210 transition count 526
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 293 place count 210 transition count 526
Applied a total of 293 rules in 435 ms. Remains 210 /350 variables (removed 140) and now considering 526/602 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 210/350 places, 526/602 transitions.
RANDOM walk for 40000 steps (13 resets) in 1216 ms. (32 steps per ms) remains 32/40 properties
BEST_FIRST walk for 4000 steps (11 resets) in 93 ms. (42 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (18 resets) in 101 ms. (39 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (12 resets) in 100 ms. (39 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4001 steps (10 resets) in 100 ms. (39 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (14 resets) in 79 ms. (50 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (13 resets) in 103 ms. (38 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4001 steps (16 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (23 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (18 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (10 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (14 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (17 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (16 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (12 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (10 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (15 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (13 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (14 resets) in 33 ms. (117 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4002 steps (13 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (16 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (12 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (13 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (15 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (19 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (15 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (13 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
[2025-06-02 19:46:08] [INFO ] Flow matrix only has 520 transitions (discarded 6 similar events)
// Phase 1: matrix 520 rows 210 cols
[2025-06-02 19:46:08] [INFO ] Computed 7 invariants in 4 ms
[2025-06-02 19:46:08] [INFO ] State equation strengthened by 67 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 165/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 520/722 variables, 202/209 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/722 variables, 67/276 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 8/730 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/730 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 730/730 variables, and 284 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 210/210 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 165/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:11] [INFO ] Deduced a trap composed of 66 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 19:46:11] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:11] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:11] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 520/722 variables, 202/213 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 67/280 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 26/306 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:12] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:13] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 32 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/722 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:14] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:15] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 22 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/722 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:16] [INFO ] Deduced a trap composed of 56 places in 219 ms of which 28 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:19] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 50 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/722 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/722 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 8/730 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/730 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/730 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 0/730 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 730/730 variables, and 322 constraints, problems are : Problem set: 0 solved, 28 unsolved in 23221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 210/210 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25552ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 2 properties in 2725 ms.
Support contains 36 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 526/526 transitions.
Graph (complete) has 877 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 209 transition count 519
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 202 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 201 transition count 518
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 201 transition count 517
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 200 transition count 517
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 22 place count 197 transition count 477
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 197 transition count 477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 197 transition count 476
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 30 place count 195 transition count 474
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 35 place count 195 transition count 469
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 45 place count 190 transition count 482
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 47 place count 190 transition count 480
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 6 with 62 rules applied. Total rules applied 109 place count 190 transition count 418
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 111 place count 190 transition count 416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 113 place count 188 transition count 416
Applied a total of 113 rules in 84 ms. Remains 188 /210 variables (removed 22) and now considering 416/526 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 188/210 places, 416/526 transitions.
RANDOM walk for 40000 steps (9 resets) in 635 ms. (62 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (14 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (17 resets) in 61 ms. (64 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (12 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (14 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (17 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (10 resets) in 45 ms. (86 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (14 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (18 resets) in 62 ms. (63 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (15 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (13 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (13 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (16 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (16 resets) in 66 ms. (59 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (19 resets) in 45 ms. (87 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (12 resets) in 48 ms. (81 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (11 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (19 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4000 steps (10 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (11 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (15 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (20 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (13 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (13 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (14 resets) in 22 ms. (173 steps per ms) remains 23/24 properties
[2025-06-02 19:46:37] [INFO ] Flow matrix only has 387 transitions (discarded 29 similar events)
// Phase 1: matrix 387 rows 188 cols
[2025-06-02 19:46:37] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 19:46:37] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 147/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 386/565 variables, 179/186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 65/251 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 10/575 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/575 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 260 constraints, problems are : Problem set: 0 solved, 23 unsolved in 4191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 147/179 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:42] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:42] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:42] [INFO ] Deduced a trap composed of 61 places in 262 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:42] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:42] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:43] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 386/565 variables, 179/192 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 65/257 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 22/279 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:44] [INFO ] Deduced a trap composed of 107 places in 211 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:45] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:45] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 25 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:46] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 10/575 variables, 9/292 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:50] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 23 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:54] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 5 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/575 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/575 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:59] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:00] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 6 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/575 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:02] [INFO ] Deduced a trap along path composed of 4 places in 42 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/575 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 0/575 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 575/575 variables, and 298 constraints, problems are : Problem set: 0 solved, 23 unsolved in 29732 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33941ms problems are : Problem set: 0 solved, 23 unsolved
Parikh walk visited 2 properties in 2558 ms.
Support contains 29 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 416/416 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 187 transition count 415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 187 transition count 413
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 185 transition count 413
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 184 transition count 412
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 182 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 181 transition count 409
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 181 transition count 409
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 179 transition count 415
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 179 transition count 414
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 23 place count 178 transition count 411
Applied a total of 23 rules in 49 ms. Remains 178 /188 variables (removed 10) and now considering 411/416 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 178/188 places, 411/416 transitions.
RANDOM walk for 40000 steps (13 resets) in 306 ms. (130 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (17 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (18 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (18 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (10 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (15 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (17 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (22 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (11 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (16 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (12 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (19 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (13 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (12 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (15 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (12 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (12 resets) in 28 ms. (137 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (18 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (11 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (14 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 300679 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :12 out of 21
Probabilistic random walk after 300679 steps, saw 86553 distinct states, run finished after 3010 ms. (steps per millisecond=99 ) properties seen :12
[2025-06-02 19:47:17] [INFO ] Flow matrix only has 379 transitions (discarded 32 similar events)
// Phase 1: matrix 379 rows 178 cols
[2025-06-02 19:47:17] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 19:47:17] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 132/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 22/168 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 378/546 variables, 168/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 68/243 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 10/556 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/557 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/557 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 253 constraints, problems are : Problem set: 0 solved, 9 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 132/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:18] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:18] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 22/168 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 378/546 variables, 168/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 68/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:19] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:20] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 27 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 10/556 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:21] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 15 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/556 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/556 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 1/557 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/557 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 267 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5627ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 4464 ms.
Support contains 14 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 411/411 transitions.
Graph (trivial) has 35 edges and 178 vertex of which 2 / 178 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 758 edges and 177 vertex of which 175 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 175 transition count 405
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 172 transition count 405
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 170 transition count 403
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 170 transition count 403
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 170 transition count 402
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 169 transition count 402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 168 transition count 400
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 168 transition count 400
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 2 with 6 rules applied. Total rules applied 23 place count 165 transition count 397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 164 transition count 396
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 164 transition count 396
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 2 with 4 rules applied. Total rules applied 29 place count 162 transition count 398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 161 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 161 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 160 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 160 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 159 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 159 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 158 transition count 385
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 158 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 157 transition count 382
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 157 transition count 382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 156 transition count 380
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 156 transition count 380
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 155 transition count 377
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 155 transition count 377
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 154 transition count 375
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 154 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 153 transition count 372
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 153 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 152 transition count 370
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 152 transition count 370
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 151 transition count 368
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 151 transition count 368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 150 transition count 366
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 150 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 150 transition count 365
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 150 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 149 transition count 364
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 149 transition count 363
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 148 transition count 362
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 148 transition count 362
Applied a total of 60 rules in 88 ms. Remains 148 /178 variables (removed 30) and now considering 362/411 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 148/178 places, 362/411 transitions.
RANDOM walk for 40000 steps (1748 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (452 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (419 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (434 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (422 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (422 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (418 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (425 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (442 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (422 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 279579 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 9
Probabilistic random walk after 279579 steps, saw 84124 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2025-06-02 19:47:30] [INFO ] Flow matrix only has 329 transitions (discarded 33 similar events)
// Phase 1: matrix 329 rows 148 cols
[2025-06-02 19:47:30] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 19:47:30] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 106/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 20/140 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 329/469 variables, 140/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 64/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 8/477 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/477 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 219 constraints, problems are : Problem set: 0 solved, 9 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 106/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:32] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 20/140 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:32] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 329/469 variables, 140/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 64/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:33] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 30 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:33] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:33] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:33] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:34] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 8/477 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/477 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 235 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3945 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4899ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 3622 ms.
Support contains 14 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 362/362 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 362/362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 148/148 places, 362/362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 362/362 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2025-06-02 19:47:39] [INFO ] Flow matrix only has 329 transitions (discarded 33 similar events)
[2025-06-02 19:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:47:39] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-06-02 19:47:39] [INFO ] Flow matrix only has 329 transitions (discarded 33 similar events)
[2025-06-02 19:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:47:39] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-02 19:47:40] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:47:40] [INFO ] Redundant transitions in 30 ms returned []
Running 360 sub problems to find dead transitions.
[2025-06-02 19:47:40] [INFO ] Flow matrix only has 329 transitions (discarded 33 similar events)
[2025-06-02 19:47:40] [INFO ] Invariant cache hit.
[2025-06-02 19:47:40] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:46] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:46] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:47] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:47] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:47] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:47] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:48] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:48] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:49] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 329/477 variables, 148/164 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 64/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/477 variables, and 228 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:13] [INFO ] Deduced a trap composed of 110 places in 158 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 329/477 variables, 148/165 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 64/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 360/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:39] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 590 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60940 ms. Remains : 148/148 places, 362/362 transitions.
[2025-06-02 19:48:40] [INFO ] Flatten gal took : 46 ms
[2025-06-02 19:48:40] [INFO ] Flatten gal took : 42 ms
[2025-06-02 19:48:40] [INFO ] Input system was already deterministic with 602 transitions.
Computed a total of 103 stabilizing places and 157 stable transitions
Graph (complete) has 1100 edges and 350 vertex of which 346 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.22 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Graph (trivial) has 253 edges and 350 vertex of which 11 / 350 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1091 edges and 342 vertex of which 338 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 337 transition count 542
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 287 transition count 540
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 286 transition count 540
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 105 place count 286 transition count 521
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 143 place count 267 transition count 521
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 166 place count 244 transition count 477
Iterating global reduction 3 with 23 rules applied. Total rules applied 189 place count 244 transition count 477
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 193 place count 244 transition count 473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 194 place count 243 transition count 473
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 194 place count 243 transition count 468
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 204 place count 238 transition count 468
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 213 place count 229 transition count 453
Iterating global reduction 5 with 9 rules applied. Total rules applied 222 place count 229 transition count 453
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 227 place count 224 transition count 444
Iterating global reduction 5 with 5 rules applied. Total rules applied 232 place count 224 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 234 place count 224 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 223 transition count 442
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 237 place count 221 transition count 436
Iterating global reduction 7 with 2 rules applied. Total rules applied 239 place count 221 transition count 436
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 241 place count 219 transition count 432
Iterating global reduction 7 with 2 rules applied. Total rules applied 243 place count 219 transition count 432
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 245 place count 217 transition count 426
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 217 transition count 426
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 249 place count 215 transition count 422
Iterating global reduction 7 with 2 rules applied. Total rules applied 251 place count 215 transition count 422
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 253 place count 213 transition count 416
Iterating global reduction 7 with 2 rules applied. Total rules applied 255 place count 213 transition count 416
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 257 place count 211 transition count 412
Iterating global reduction 7 with 2 rules applied. Total rules applied 259 place count 211 transition count 412
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 261 place count 209 transition count 406
Iterating global reduction 7 with 2 rules applied. Total rules applied 263 place count 209 transition count 406
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 265 place count 207 transition count 402
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 207 transition count 402
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 269 place count 205 transition count 397
Iterating global reduction 7 with 2 rules applied. Total rules applied 271 place count 205 transition count 397
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 273 place count 203 transition count 393
Iterating global reduction 7 with 2 rules applied. Total rules applied 275 place count 203 transition count 393
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 276 place count 202 transition count 391
Iterating global reduction 7 with 1 rules applied. Total rules applied 277 place count 202 transition count 391
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 278 place count 201 transition count 389
Iterating global reduction 7 with 1 rules applied. Total rules applied 279 place count 201 transition count 389
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 313 place count 184 transition count 372
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 317 place count 180 transition count 346
Iterating global reduction 7 with 4 rules applied. Total rules applied 321 place count 180 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 322 place count 180 transition count 345
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 324 place count 178 transition count 343
Applied a total of 324 rules in 176 ms. Remains 178 /350 variables (removed 172) and now considering 343/602 (removed 259) transitions.
[2025-06-02 19:48:40] [INFO ] Flow matrix only has 339 transitions (discarded 4 similar events)
// Phase 1: matrix 339 rows 178 cols
[2025-06-02 19:48:40] [INFO ] Computed 7 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:48:41] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-02 19:48:41] [INFO ] Flow matrix only has 339 transitions (discarded 4 similar events)
[2025-06-02 19:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:48:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 19:48:41] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:48:41] [INFO ] Redundant transitions in 22 ms returned []
Running 334 sub problems to find dead transitions.
[2025-06-02 19:48:41] [INFO ] Flow matrix only has 339 transitions (discarded 4 similar events)
[2025-06-02 19:48:41] [INFO ] Invariant cache hit.
[2025-06-02 19:48:41] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:44] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:44] [INFO ] Deduced a trap composed of 25 places in 181 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:45] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:45] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:46] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:46] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:46] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:47] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:47] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:47] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:49] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/514 variables, 176/194 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 2/516 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 334 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 516/517 variables, and 198 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (OVERLAPS) 338/514 variables, 176/194 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 334/530 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 2/516 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/517 variables, and 532 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in SI_CTL mode, iteration 1 : 178/350 places, 343/602 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60970 ms. Remains : 178/350 places, 343/602 transitions.
[2025-06-02 19:49:41] [INFO ] Flatten gal took : 31 ms
[2025-06-02 19:49:41] [INFO ] Flatten gal took : 29 ms
[2025-06-02 19:49:41] [INFO ] Input system was already deterministic with 343 transitions.
[2025-06-02 19:49:41] [INFO ] Flatten gal took : 40 ms
[2025-06-02 19:49:41] [INFO ] Flatten gal took : 34 ms
RANDOM walk for 40000 steps (1739 resets) in 549 ms. (72 steps per ms) remains 1/1 properties
[2025-06-02 19:49:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5890443444800091553.gal : 42 ms
BEST_FIRST walk for 40003 steps (396 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
[2025-06-02 19:49:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4443680928893883076.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5890443444800091553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4443680928893883076.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Finished probabilistic random walk after 7787 steps, run visited all 1 properties in 58 ms. (steps per millisecond=134 )
Probabilistic random walk after 7787 steps, saw 2385 distinct states, run finished after 65 ms. (steps per millisecond=119 ) properties seen :1
FORMULA FireWire-PT-18-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 346 transition count 602
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 311 transition count 547
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 311 transition count 547
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 311 transition count 546
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 298 transition count 505
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 298 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 298 transition count 504
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 294 transition count 497
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 294 transition count 497
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 293 transition count 494
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 293 transition count 494
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 292 transition count 492
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 292 transition count 492
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 291 transition count 489
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 291 transition count 489
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 290 transition count 487
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 290 transition count 487
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 289 transition count 484
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 289 transition count 484
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 288 transition count 482
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 288 transition count 482
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 287 transition count 479
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 287 transition count 479
Applied a total of 124 rules in 99 ms. Remains 287 /350 variables (removed 63) and now considering 479/602 (removed 123) transitions.
// Phase 1: matrix 479 rows 287 cols
[2025-06-02 19:49:42] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:49:42] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-02 19:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:49:43] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
Running 478 sub problems to find dead transitions.
[2025-06-02 19:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 478 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 148 places in 412 ms of which 100 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 78 places in 129 ms of which 6 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 79 places in 126 ms of which 14 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 92 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:58] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 6 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 88 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:58] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:59] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 46 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 90 places in 365 ms of which 73 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 50 places in 280 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:07] [INFO ] Deduced a trap composed of 174 places in 230 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/766 variables, and 18 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/287 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:18] [INFO ] Deduced a trap composed of 163 places in 238 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:19] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:21] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:22] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:22] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:23] [INFO ] Deduced a trap composed of 81 places in 89 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:23] [INFO ] Deduced a trap composed of 109 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:23] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:23] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:27] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:28] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:29] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 38 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (OVERLAPS) 479/766 variables, 287/317 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/766 variables, 478/795 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/766 variables, and 795 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 287/350 places, 479/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61224 ms. Remains : 287/350 places, 479/602 transitions.
[2025-06-02 19:50:43] [INFO ] Flatten gal took : 33 ms
[2025-06-02 19:50:43] [INFO ] Flatten gal took : 33 ms
[2025-06-02 19:50:43] [INFO ] Input system was already deterministic with 479 transitions.
[2025-06-02 19:50:43] [INFO ] Flatten gal took : 31 ms
[2025-06-02 19:50:43] [INFO ] Flatten gal took : 31 ms
[2025-06-02 19:50:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality16491282638429218979.gal : 9 ms
[2025-06-02 19:50:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality17528934622833861015.ctl : 9 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/CTLCardinality16491282638429218979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17528934622833861015.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 19:51:13] [INFO ] Flatten gal took : 31 ms
[2025-06-02 19:51:13] [INFO ] Applying decomposition
[2025-06-02 19:51:13] [INFO ] Flatten gal took : 28 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/graph5416903119696024946.txt' '-o' '/tmp/graph5416903119696024946.bin' '-w' '/tmp/graph5416903119696024946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5416903119696024946.bin' '-l' '-1' '-v' '-w' '/tmp/graph5416903119696024946.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:51:13] [INFO ] Decomposing Gal with order
[2025-06-02 19:51:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:51:14] [INFO ] Removed a total of 522 redundant transitions.
[2025-06-02 19:51:14] [INFO ] Flatten gal took : 152 ms
[2025-06-02 19:51:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 35 ms.
[2025-06-02 19:51:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14872229440440378671.gal : 21 ms
[2025-06-02 19:51:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality10894343308282591345.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/CTLCardinality14872229440440378671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10894343308282591345.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.66312e+10,28.3704,455628,2607,72,491572,739,1078,2.85263e+06,87,2859,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Graph (trivial) has 254 edges and 350 vertex of which 11 / 350 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1091 edges and 342 vertex of which 338 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 337 transition count 541
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 286 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 285 transition count 539
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 107 place count 285 transition count 520
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 145 place count 266 transition count 520
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 167 place count 244 transition count 477
Iterating global reduction 3 with 22 rules applied. Total rules applied 189 place count 244 transition count 477
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 193 place count 244 transition count 473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 194 place count 243 transition count 473
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 194 place count 243 transition count 468
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 204 place count 238 transition count 468
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 212 place count 230 transition count 454
Iterating global reduction 5 with 8 rules applied. Total rules applied 220 place count 230 transition count 454
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 224 place count 226 transition count 447
Iterating global reduction 5 with 4 rules applied. Total rules applied 228 place count 226 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 230 place count 226 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 225 transition count 445
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 233 place count 223 transition count 439
Iterating global reduction 7 with 2 rules applied. Total rules applied 235 place count 223 transition count 439
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 237 place count 221 transition count 435
Iterating global reduction 7 with 2 rules applied. Total rules applied 239 place count 221 transition count 435
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 241 place count 219 transition count 429
Iterating global reduction 7 with 2 rules applied. Total rules applied 243 place count 219 transition count 429
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 245 place count 217 transition count 425
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 217 transition count 425
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 249 place count 215 transition count 419
Iterating global reduction 7 with 2 rules applied. Total rules applied 251 place count 215 transition count 419
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 253 place count 213 transition count 415
Iterating global reduction 7 with 2 rules applied. Total rules applied 255 place count 213 transition count 415
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 257 place count 211 transition count 409
Iterating global reduction 7 with 2 rules applied. Total rules applied 259 place count 211 transition count 409
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 261 place count 209 transition count 405
Iterating global reduction 7 with 2 rules applied. Total rules applied 263 place count 209 transition count 405
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 265 place count 207 transition count 400
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 207 transition count 400
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 269 place count 205 transition count 396
Iterating global reduction 7 with 2 rules applied. Total rules applied 271 place count 205 transition count 396
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 272 place count 204 transition count 394
Iterating global reduction 7 with 1 rules applied. Total rules applied 273 place count 204 transition count 394
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 274 place count 203 transition count 392
Iterating global reduction 7 with 1 rules applied. Total rules applied 275 place count 203 transition count 392
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 309 place count 186 transition count 375
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 313 place count 182 transition count 349
Iterating global reduction 7 with 4 rules applied. Total rules applied 317 place count 182 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 318 place count 182 transition count 348
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 320 place count 180 transition count 346
Applied a total of 320 rules in 102 ms. Remains 180 /350 variables (removed 170) and now considering 346/602 (removed 256) transitions.
[2025-06-02 19:51:44] [INFO ] Flow matrix only has 342 transitions (discarded 4 similar events)
// Phase 1: matrix 342 rows 180 cols
[2025-06-02 19:51:44] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:51:44] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-02 19:51:44] [INFO ] Flow matrix only has 342 transitions (discarded 4 similar events)
[2025-06-02 19:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:51:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 19:51:45] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:51:45] [INFO ] Redundant transitions in 6 ms returned []
Running 337 sub problems to find dead transitions.
[2025-06-02 19:51:45] [INFO ] Flow matrix only has 342 transitions (discarded 4 similar events)
[2025-06-02 19:51:45] [INFO ] Invariant cache hit.
[2025-06-02 19:51:45] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:47] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:48] [INFO ] Deduced a trap composed of 54 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:48] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:48] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:49] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:49] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:50] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:50] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:50] [INFO ] Deduced a trap composed of 120 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:51] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:51] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:52] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:53] [INFO ] Deduced a trap composed of 127 places in 200 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 341/519 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:04] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/522 variables, and 201 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/180 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (OVERLAPS) 341/519 variables, 178/199 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 337/538 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 337 unsolved
SMT process timed out in 60102ms, After SMT, problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in SI_CTL mode, iteration 1 : 180/350 places, 346/602 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60940 ms. Remains : 180/350 places, 346/602 transitions.
[2025-06-02 19:52:45] [INFO ] Flatten gal took : 15 ms
[2025-06-02 19:52:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 19:52:45] [INFO ] Input system was already deterministic with 346 transitions.
[2025-06-02 19:52:45] [INFO ] Flatten gal took : 33 ms
[2025-06-02 19:52:45] [INFO ] Flatten gal took : 24 ms
[2025-06-02 19:52:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality37940745129683106.gal : 11 ms
[2025-06-02 19:52:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15830632328541820272.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality37940745129683106.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15830632328541820272.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (1739 resets) in 218 ms. (182 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40004 steps (409 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality15830632328541820272.prop.
Finished probabilistic random walk after 19724 steps, run visited all 1 properties in 76 ms. (steps per millisecond=259 )
Probabilistic random walk after 19724 steps, saw 6766 distinct states, run finished after 77 ms. (steps per millisecond=256 ) properties seen :1
FORMULA FireWire-PT-18-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 346 transition count 602
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 311 transition count 547
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 311 transition count 547
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 311 transition count 546
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 298 transition count 507
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 298 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 298 transition count 506
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 293 transition count 497
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 293 transition count 497
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 291 transition count 491
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 291 transition count 491
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 289 transition count 487
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 289 transition count 487
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 287 transition count 481
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 287 transition count 481
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 285 transition count 477
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 285 transition count 477
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 283 transition count 471
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 283 transition count 471
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 281 transition count 467
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 281 transition count 467
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 279 transition count 461
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 279 transition count 461
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 277 transition count 457
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 277 transition count 457
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 275 transition count 452
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 275 transition count 452
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 273 transition count 448
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 273 transition count 448
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 271 transition count 445
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 271 transition count 445
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 270 transition count 443
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 270 transition count 443
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 269 transition count 442
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 269 transition count 442
Applied a total of 160 rules in 55 ms. Remains 269 /350 variables (removed 81) and now considering 442/602 (removed 160) transitions.
// Phase 1: matrix 442 rows 269 cols
[2025-06-02 19:52:45] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:52:45] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-02 19:52:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:52:46] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Running 441 sub problems to find dead transitions.
[2025-06-02 19:52:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:58] [INFO ] Deduced a trap composed of 149 places in 355 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:58] [INFO ] Deduced a trap composed of 152 places in 240 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:59] [INFO ] Deduced a trap composed of 153 places in 278 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:59] [INFO ] Deduced a trap composed of 79 places in 287 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:59] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:00] [INFO ] Deduced a trap composed of 152 places in 262 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:01] [INFO ] Deduced a trap composed of 152 places in 314 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:01] [INFO ] Deduced a trap composed of 82 places in 270 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:01] [INFO ] Deduced a trap composed of 153 places in 277 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:03] [INFO ] Deduced a trap composed of 82 places in 293 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:03] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:04] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:05] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:09] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/711 variables, and 21 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/269 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 442/711 variables, 269/290 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/711 variables, 441/731 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:40] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 711/711 variables, and 732 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 269/350 places, 442/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60829 ms. Remains : 269/350 places, 442/602 transitions.
[2025-06-02 19:53:46] [INFO ] Flatten gal took : 15 ms
[2025-06-02 19:53:46] [INFO ] Flatten gal took : 14 ms
[2025-06-02 19:53:46] [INFO ] Input system was already deterministic with 442 transitions.
[2025-06-02 19:53:46] [INFO ] Flatten gal took : 13 ms
[2025-06-02 19:53:46] [INFO ] Flatten gal took : 13 ms
[2025-06-02 19:53:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13592057481533039736.gal : 4 ms
[2025-06-02 19:53:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4732787904928257608.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13592057481533039736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4732787904928257608.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:54:16] [INFO ] Flatten gal took : 13 ms
[2025-06-02 19:54:16] [INFO ] Applying decomposition
[2025-06-02 19:54:16] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9480630094427958555.txt' '-o' '/tmp/graph9480630094427958555.bin' '-w' '/tmp/graph9480630094427958555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9480630094427958555.bin' '-l' '-1' '-v' '-w' '/tmp/graph9480630094427958555.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:54:16] [INFO ] Decomposing Gal with order
[2025-06-02 19:54:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:54:16] [INFO ] Removed a total of 466 redundant transitions.
[2025-06-02 19:54:16] [INFO ] Flatten gal took : 52 ms
[2025-06-02 19:54:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 24 ms.
[2025-06-02 19:54:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7818021734884963056.gal : 8 ms
[2025-06-02 19:54:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5113304097085935249.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/CTLCardinality7818021734884963056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5113304097085935249.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Graph (trivial) has 250 edges and 350 vertex of which 11 / 350 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1091 edges and 342 vertex of which 339 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 338 transition count 542
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 288 transition count 540
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 287 transition count 540
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 105 place count 287 transition count 522
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 141 place count 269 transition count 522
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 162 place count 248 transition count 481
Iterating global reduction 3 with 21 rules applied. Total rules applied 183 place count 248 transition count 481
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 248 transition count 478
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 247 transition count 478
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 187 place count 247 transition count 473
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 197 place count 242 transition count 473
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 205 place count 234 transition count 461
Iterating global reduction 5 with 8 rules applied. Total rules applied 213 place count 234 transition count 461
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 217 place count 230 transition count 454
Iterating global reduction 5 with 4 rules applied. Total rules applied 221 place count 230 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 223 place count 230 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 224 place count 229 transition count 452
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 225 place count 228 transition count 449
Iterating global reduction 7 with 1 rules applied. Total rules applied 226 place count 228 transition count 449
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 227 place count 227 transition count 447
Iterating global reduction 7 with 1 rules applied. Total rules applied 228 place count 227 transition count 447
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 229 place count 226 transition count 444
Iterating global reduction 7 with 1 rules applied. Total rules applied 230 place count 226 transition count 444
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 231 place count 225 transition count 442
Iterating global reduction 7 with 1 rules applied. Total rules applied 232 place count 225 transition count 442
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 233 place count 224 transition count 439
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 224 transition count 439
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 235 place count 223 transition count 437
Iterating global reduction 7 with 1 rules applied. Total rules applied 236 place count 223 transition count 437
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 237 place count 222 transition count 434
Iterating global reduction 7 with 1 rules applied. Total rules applied 238 place count 222 transition count 434
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 239 place count 221 transition count 432
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 221 transition count 432
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 241 place count 220 transition count 429
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 220 transition count 429
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 243 place count 219 transition count 427
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 219 transition count 427
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 245 place count 218 transition count 425
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 218 transition count 425
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 247 place count 217 transition count 423
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 217 transition count 423
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 282 place count 200 transition count 406
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 286 place count 196 transition count 380
Iterating global reduction 7 with 4 rules applied. Total rules applied 290 place count 196 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 291 place count 196 transition count 379
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 293 place count 194 transition count 377
Applied a total of 293 rules in 91 ms. Remains 194 /350 variables (removed 156) and now considering 377/602 (removed 225) transitions.
[2025-06-02 19:54:47] [INFO ] Flow matrix only has 373 transitions (discarded 4 similar events)
// Phase 1: matrix 373 rows 194 cols
[2025-06-02 19:54:47] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:54:47] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-06-02 19:54:47] [INFO ] Flow matrix only has 373 transitions (discarded 4 similar events)
[2025-06-02 19:54:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:54:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 19:54:47] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:54:47] [INFO ] Redundant transitions in 4 ms returned []
Running 367 sub problems to find dead transitions.
[2025-06-02 19:54:47] [INFO ] Flow matrix only has 373 transitions (discarded 4 similar events)
[2025-06-02 19:54:47] [INFO ] Invariant cache hit.
[2025-06-02 19:54:47] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:51] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:51] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:51] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:51] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:52] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:52] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:53] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:53] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:54] [INFO ] Deduced a trap composed of 119 places in 226 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:55] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:55] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 30 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 372/563 variables, 191/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/567 variables, and 211 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 372/563 variables, 191/209 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 360/571 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/567 variables, and 571 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 360/367 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in SI_CTL mode, iteration 1 : 194/350 places, 377/602 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60967 ms. Remains : 194/350 places, 377/602 transitions.
[2025-06-02 19:55:47] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:55:47] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:55:47] [INFO ] Input system was already deterministic with 377 transitions.
[2025-06-02 19:55:48] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:55:48] [INFO ] Flatten gal took : 16 ms
[2025-06-02 19:55:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17245596359110117469.gal : 4 ms
[2025-06-02 19:55:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality636904667601630297.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/CTLCardinality17245596359110117469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality636904667601630297.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32217e+09,13.3882,287952,2,10224,5,630589,6,0,1146,1.08245e+06,0


Converting to forward existential form...Done !
original formula: E((p349==0) U ((p264==1) + !(EF(((p228==0)||(p363==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,(p349==0)) * (p264==1))] != FALSE + [(FwdU(Init,(p349==0)) * !(E(TRUE U ((p228==0)||(p363==1)))))] ...164
Hit Full ! (commute/partial/dont) 374/0/3
(forward)formula 0,1,20.4999,287952,1,0,9,630589,15,1,2198,1.08245e+06,4
FORMULA FireWire-PT-18-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 346 transition count 602
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 41 place count 309 transition count 545
Iterating global reduction 1 with 37 rules applied. Total rules applied 78 place count 309 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 309 transition count 544
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 94 place count 294 transition count 500
Iterating global reduction 2 with 15 rules applied. Total rules applied 109 place count 294 transition count 500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 294 transition count 499
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 288 transition count 489
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 288 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 288 transition count 488
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 286 transition count 482
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 286 transition count 482
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 129 place count 284 transition count 478
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 284 transition count 478
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 133 place count 282 transition count 472
Iterating global reduction 4 with 2 rules applied. Total rules applied 135 place count 282 transition count 472
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 137 place count 280 transition count 468
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 280 transition count 468
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 141 place count 278 transition count 462
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 278 transition count 462
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 276 transition count 458
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 276 transition count 458
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 274 transition count 452
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 274 transition count 452
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 153 place count 272 transition count 448
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 272 transition count 448
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 157 place count 270 transition count 443
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 270 transition count 443
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 161 place count 268 transition count 439
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 268 transition count 439
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 165 place count 266 transition count 436
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 266 transition count 436
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 265 transition count 434
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 265 transition count 434
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 264 transition count 433
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 264 transition count 433
Applied a total of 171 rules in 45 ms. Remains 264 /350 variables (removed 86) and now considering 433/602 (removed 169) transitions.
// Phase 1: matrix 433 rows 264 cols
[2025-06-02 19:56:08] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:56:08] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-06-02 19:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:56:09] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2025-06-02 19:56:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:20] [INFO ] Deduced a trap composed of 146 places in 209 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:20] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:20] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:21] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:21] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:21] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:22] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/278 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:34] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:36] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/697 variables, and 280 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:47] [INFO ] Deduced a trap composed of 155 places in 300 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:49] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (OVERLAPS) 433/697 variables, 264/282 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 432/714 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 714 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 264/350 places, 433/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61096 ms. Remains : 264/350 places, 433/602 transitions.
[2025-06-02 19:57:09] [INFO ] Flatten gal took : 16 ms
[2025-06-02 19:57:09] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:57:09] [INFO ] Input system was already deterministic with 433 transitions.
[2025-06-02 19:57:09] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:57:09] [INFO ] Flatten gal took : 19 ms
[2025-06-02 19:57:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality12334142494739575007.gal : 4 ms
[2025-06-02 19:57:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality14544563842392067325.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/CTLCardinality12334142494739575007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14544563842392067325.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 19:57:39] [INFO ] Flatten gal took : 10 ms
[2025-06-02 19:57:39] [INFO ] Applying decomposition
[2025-06-02 19:57:39] [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/graph12946452042356375805.txt' '-o' '/tmp/graph12946452042356375805.bin' '-w' '/tmp/graph12946452042356375805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12946452042356375805.bin' '-l' '-1' '-v' '-w' '/tmp/graph12946452042356375805.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:57:40] [INFO ] Decomposing Gal with order
[2025-06-02 19:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:57:40] [INFO ] Removed a total of 454 redundant transitions.
[2025-06-02 19:57:40] [INFO ] Flatten gal took : 34 ms
[2025-06-02 19:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 8 ms.
[2025-06-02 19:57:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality6349373059502340281.gal : 4 ms
[2025-06-02 19:57:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality4223497656741064260.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/CTLCardinality6349373059502340281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4223497656741064260.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.43806e+10,4.98681,114208,1766,86,159146,943,951,553206,84,4036,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(EG(((i0.i0.u5.p34==0)||(i11.i0.u73.p344==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U EG(((i0.i0.u5.p34==0)||(i11.i0.u73.p344==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t63, t140, t147, t184, t186, t187, t189, t198, t200, t207, t212, t213, t215, t243, t244,...1065
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 346 transition count 602
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 41 place count 309 transition count 545
Iterating global reduction 1 with 37 rules applied. Total rules applied 78 place count 309 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 309 transition count 544
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 295 transition count 502
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 295 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 295 transition count 501
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 289 transition count 491
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 289 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 289 transition count 490
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 287 transition count 484
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 287 transition count 484
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 285 transition count 480
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 285 transition count 480
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 283 transition count 474
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 283 transition count 474
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 281 transition count 470
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 281 transition count 470
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 279 transition count 464
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 279 transition count 464
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 143 place count 277 transition count 460
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 277 transition count 460
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 147 place count 275 transition count 454
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 275 transition count 454
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 273 transition count 450
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 273 transition count 450
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 155 place count 271 transition count 445
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 271 transition count 445
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 159 place count 269 transition count 441
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 269 transition count 441
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 267 transition count 438
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 267 transition count 438
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 266 transition count 436
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 266 transition count 436
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 265 transition count 435
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 265 transition count 435
Applied a total of 169 rules in 52 ms. Remains 265 /350 variables (removed 85) and now considering 435/602 (removed 167) transitions.
// Phase 1: matrix 435 rows 265 cols
[2025-06-02 19:58:10] [INFO ] Computed 7 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:58:10] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-02 19:58:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:58:10] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-06-02 19:58: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/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:22] [INFO ] Deduced a trap composed of 148 places in 361 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:22] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:23] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:24] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:24] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:24] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:25] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:26] [INFO ] Deduced a trap composed of 149 places in 271 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:28] [INFO ] Deduced a trap composed of 78 places in 221 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:35] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/700 variables, and 17 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:45] [INFO ] Deduced a trap composed of 150 places in 223 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:51] [INFO ] Deduced a trap composed of 150 places in 258 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:51] [INFO ] Deduced a trap composed of 151 places in 281 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:53] [INFO ] Deduced a trap composed of 81 places in 294 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 6 (OVERLAPS) 435/700 variables, 265/286 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/700 variables, 434/720 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:09] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 700/700 variables, and 721 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 265/350 places, 435/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60796 ms. Remains : 265/350 places, 435/602 transitions.
[2025-06-02 19:59:10] [INFO ] Flatten gal took : 16 ms
[2025-06-02 19:59:11] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:59:11] [INFO ] Input system was already deterministic with 435 transitions.
[2025-06-02 19:59:11] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:59:11] [INFO ] Flatten gal took : 18 ms
[2025-06-02 19:59:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality14169960855478787990.gal : 6 ms
[2025-06-02 19:59:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7068147756667648125.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/CTLCardinality14169960855478787990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7068147756667648125.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:59:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 19:59:41] [INFO ] Applying decomposition
[2025-06-02 19:59:41] [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/graph10338292352361617034.txt' '-o' '/tmp/graph10338292352361617034.bin' '-w' '/tmp/graph10338292352361617034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10338292352361617034.bin' '-l' '-1' '-v' '-w' '/tmp/graph10338292352361617034.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:59:41] [INFO ] Decomposing Gal with order
[2025-06-02 19:59:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:59:41] [INFO ] Removed a total of 449 redundant transitions.
[2025-06-02 19:59:41] [INFO ] Flatten gal took : 27 ms
[2025-06-02 19:59:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 7 ms.
[2025-06-02 19:59:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2016939830575443935.gal : 5 ms
[2025-06-02 19:59:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality10681279266041611116.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/CTLCardinality2016939830575443935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10681279266041611116.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.50068e+10,28.0438,586704,2471,102,722124,1040,971,4.49473e+06,104,4424,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 348 transition count 602
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 312 transition count 546
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 312 transition count 546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 312 transition count 545
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 298 transition count 504
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 298 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 298 transition count 503
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 110 place count 292 transition count 493
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 292 transition count 493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 292 transition count 492
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 119 place count 290 transition count 486
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 290 transition count 486
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 288 transition count 482
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 288 transition count 482
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 286 transition count 476
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 286 transition count 476
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 284 transition count 472
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 284 transition count 472
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 282 transition count 466
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 282 transition count 466
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 281 transition count 464
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 281 transition count 464
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 280 transition count 461
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 280 transition count 461
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 279 transition count 459
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 279 transition count 459
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 278 transition count 457
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 278 transition count 457
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 277 transition count 455
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 277 transition count 455
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 276 transition count 454
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 276 transition count 454
Applied a total of 149 rules in 56 ms. Remains 276 /350 variables (removed 74) and now considering 454/602 (removed 148) transitions.
// Phase 1: matrix 454 rows 276 cols
[2025-06-02 20:00:11] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:00:11] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-06-02 20:00:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:00:12] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2025-06-02 20:00: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/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:23] [INFO ] Deduced a trap composed of 147 places in 349 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:24] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:24] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:24] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:25] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:25] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:26] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:27] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:29] [INFO ] Deduced a trap composed of 148 places in 321 ms of which 64 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:33] [INFO ] Deduced a trap composed of 84 places in 336 ms of which 59 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:41] [INFO ] Deduced a trap composed of 78 places in 290 ms of which 35 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s44 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.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 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 274/730 variables, and 18 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/276 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:47] [INFO ] Deduced a trap composed of 149 places in 289 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:54] [INFO ] Deduced a trap composed of 154 places in 304 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (OVERLAPS) 454/728 variables, 274/294 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 443/737 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/730 variables, and 737 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 274/276 constraints, PredecessorRefiner: 443/453 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 276/350 places, 454/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60850 ms. Remains : 276/350 places, 454/602 transitions.
[2025-06-02 20:01:12] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:01:12] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:01:12] [INFO ] Input system was already deterministic with 454 transitions.
[2025-06-02 20:01:12] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:01:12] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:01:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality14026679036799322040.gal : 2 ms
[2025-06-02 20:01:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality6886309268990144693.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/CTLCardinality14026679036799322040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6886309268990144693.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:01:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:01:42] [INFO ] Applying decomposition
[2025-06-02 20:01:42] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9297632377133694769.txt' '-o' '/tmp/graph9297632377133694769.bin' '-w' '/tmp/graph9297632377133694769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9297632377133694769.bin' '-l' '-1' '-v' '-w' '/tmp/graph9297632377133694769.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:01:42] [INFO ] Decomposing Gal with order
[2025-06-02 20:01:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:01:42] [INFO ] Removed a total of 488 redundant transitions.
[2025-06-02 20:01:42] [INFO ] Flatten gal took : 42 ms
[2025-06-02 20:01:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2025-06-02 20:01:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality3037611116001483084.gal : 7 ms
[2025-06-02 20:01:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality8467854892364725226.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/CTLCardinality3037611116001483084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8467854892364725226.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Graph (trivial) has 249 edges and 350 vertex of which 11 / 350 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1091 edges and 342 vertex of which 339 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 338 transition count 542
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 288 transition count 540
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 287 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 286 transition count 539
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 107 place count 286 transition count 520
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 145 place count 267 transition count 520
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 168 place count 244 transition count 476
Iterating global reduction 4 with 23 rules applied. Total rules applied 191 place count 244 transition count 476
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 195 place count 244 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 196 place count 243 transition count 472
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 196 place count 243 transition count 467
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 206 place count 238 transition count 467
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 214 place count 230 transition count 453
Iterating global reduction 6 with 8 rules applied. Total rules applied 222 place count 230 transition count 453
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 226 place count 226 transition count 446
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 226 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 232 place count 226 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 233 place count 225 transition count 444
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 234 place count 224 transition count 441
Iterating global reduction 8 with 1 rules applied. Total rules applied 235 place count 224 transition count 441
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 236 place count 223 transition count 439
Iterating global reduction 8 with 1 rules applied. Total rules applied 237 place count 223 transition count 439
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 238 place count 222 transition count 436
Iterating global reduction 8 with 1 rules applied. Total rules applied 239 place count 222 transition count 436
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 240 place count 221 transition count 434
Iterating global reduction 8 with 1 rules applied. Total rules applied 241 place count 221 transition count 434
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 242 place count 220 transition count 431
Iterating global reduction 8 with 1 rules applied. Total rules applied 243 place count 220 transition count 431
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 244 place count 219 transition count 429
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 219 transition count 429
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 246 place count 218 transition count 426
Iterating global reduction 8 with 1 rules applied. Total rules applied 247 place count 218 transition count 426
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 248 place count 217 transition count 424
Iterating global reduction 8 with 1 rules applied. Total rules applied 249 place count 217 transition count 424
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 250 place count 216 transition count 422
Iterating global reduction 8 with 1 rules applied. Total rules applied 251 place count 216 transition count 422
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 252 place count 215 transition count 420
Iterating global reduction 8 with 1 rules applied. Total rules applied 253 place count 215 transition count 420
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 287 place count 198 transition count 403
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 291 place count 194 transition count 377
Iterating global reduction 8 with 4 rules applied. Total rules applied 295 place count 194 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 296 place count 194 transition count 376
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 298 place count 194 transition count 376
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 300 place count 192 transition count 374
Applied a total of 300 rules in 143 ms. Remains 192 /350 variables (removed 158) and now considering 374/602 (removed 228) transitions.
[2025-06-02 20:02:12] [INFO ] Flow matrix only has 370 transitions (discarded 4 similar events)
// Phase 1: matrix 370 rows 192 cols
[2025-06-02 20:02:12] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:02:12] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-02 20:02:12] [INFO ] Flow matrix only has 370 transitions (discarded 4 similar events)
[2025-06-02 20:02:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:02:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 20:02:13] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:02:13] [INFO ] Redundant transitions in 4 ms returned []
Running 365 sub problems to find dead transitions.
[2025-06-02 20:02:13] [INFO ] Flow matrix only has 370 transitions (discarded 4 similar events)
[2025-06-02 20:02:13] [INFO ] Invariant cache hit.
[2025-06-02 20:02:13] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:16] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:17] [INFO ] Deduced a trap composed of 61 places in 194 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:17] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 26 ms to minimize.
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 54 places in 82 ms of which 6 ms to minimize.
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 28 places in 238 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:18] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:18] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:20] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 36 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:23] [INFO ] Deduced a trap composed of 120 places in 233 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:23] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:24] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:24] [INFO ] Deduced a trap composed of 112 places in 249 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 369/558 variables, 189/208 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/562 variables, and 210 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:46] [INFO ] Deduced a trap composed of 127 places in 237 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/558 variables, 189/209 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 364/575 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:06] [INFO ] Deduced a trap composed of 131 places in 248 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/562 variables, and 576 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 364/365 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in SI_CTL mode, iteration 1 : 192/350 places, 374/602 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61019 ms. Remains : 192/350 places, 374/602 transitions.
[2025-06-02 20:03:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 20:03:13] [INFO ] Flatten gal took : 8 ms
[2025-06-02 20:03:13] [INFO ] Input system was already deterministic with 374 transitions.
[2025-06-02 20:03:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 20:03:13] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:03:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality15737493323538927620.gal : 2 ms
[2025-06-02 20:03:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality16497586214787930021.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/CTLCardinality15737493323538927620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16497586214787930021.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.302e+09,18.5381,364588,2,11766,5,829656,6,0,1136,1.47635e+06,0


Converting to forward existential form...Done !
original formula: EF((EG(((p156==0)&&(p187==1))) * !(A(EG((p322==0)) U AG((p258==0))))))
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,TRUE) * EG(((p156==0)&&(p187==1)))),!(!(E(TRUE U !((p258==0)))))) * !(EG((p322==0)))),T...281
Reverse transition relation is NOT exact ! Due to transitions t4, t24, t27, t30, t32, t39, t44, t63, t69, t71, t77, t79, t84, t85, t86, t88, t92, t93, t95,...772
Detected timeout of ITS tools.
[2025-06-02 20:03:43] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:03:43] [INFO ] Applying decomposition
[2025-06-02 20:03:43] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9588317773765834176.txt' '-o' '/tmp/graph9588317773765834176.bin' '-w' '/tmp/graph9588317773765834176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9588317773765834176.bin' '-l' '-1' '-v' '-w' '/tmp/graph9588317773765834176.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:03:43] [INFO ] Decomposing Gal with order
[2025-06-02 20:03:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:03:43] [INFO ] Removed a total of 472 redundant transitions.
[2025-06-02 20:03:43] [INFO ] Flatten gal took : 22 ms
[2025-06-02 20:03:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 4 ms.
[2025-06-02 20:03:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5176755398153202773.gal : 5 ms
[2025-06-02 20:03:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3034803829496280912.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/CTLCardinality5176755398153202773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3034803829496280912.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.302e+09,4.85476,97244,1391,62,126120,1412,813,521167,81,4769,0


Converting to forward existential form...Done !
original formula: EF((EG(((i5.i1.u24.p156==0)&&(i3.i1.u30.p187==1))) * !(A(EG((i10.u45.p322==0)) U AG((i8.u36.p258==0))))))
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,TRUE) * EG(((i5.i1.u24.p156==0)&&(i3.i1.u30.p187==1)))),!(!(E(TRUE U !((i8.u36.p258==0)...350
Reverse transition relation is NOT exact ! Due to transitions t84, t88, t92, t93, t95, t99, t101, t104, t106, t111, t116, t121, t130, t132, t153, t158, t15...928
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 346 transition count 602
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 311 transition count 547
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 311 transition count 547
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 311 transition count 546
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 298 transition count 506
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 298 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 298 transition count 505
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 294 transition count 498
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 294 transition count 498
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 293 transition count 495
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 293 transition count 495
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 292 transition count 493
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 292 transition count 493
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 291 transition count 490
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 291 transition count 490
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 290 transition count 488
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 290 transition count 488
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 289 transition count 485
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 289 transition count 485
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 288 transition count 483
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 288 transition count 483
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 287 transition count 480
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 287 transition count 480
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 286 transition count 478
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 286 transition count 478
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 285 transition count 476
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 285 transition count 476
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 284 transition count 474
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 284 transition count 474
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 283 transition count 473
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 283 transition count 473
Applied a total of 132 rules in 51 ms. Remains 283 /350 variables (removed 67) and now considering 473/602 (removed 129) transitions.
// Phase 1: matrix 473 rows 283 cols
[2025-06-02 20:04:13] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:04:14] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-02 20:04:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:04:14] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2025-06-02 20:04: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/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:22] [INFO ] Deduced a trap composed of 152 places in 229 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:23] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:23] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:23] [INFO ] Deduced a trap composed of 80 places in 65 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:24] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:24] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:24] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:25] [INFO ] Deduced a trap composed of 50 places in 305 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:26] [INFO ] Deduced a trap composed of 175 places in 289 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:27] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:29] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (OVERLAPS) 473/756 variables, 283/301 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:42] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:43] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 756/756 variables, and 303 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:48] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:48] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:53] [INFO ] Deduced a trap composed of 162 places in 261 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:57] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:58] [INFO ] Deduced a trap composed of 164 places in 279 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:59] [INFO ] Deduced a trap composed of 162 places in 351 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:59] [INFO ] Deduced a trap composed of 91 places in 353 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:00] [INFO ] Deduced a trap composed of 82 places in 331 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:01] [INFO ] Deduced a trap composed of 108 places in 324 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:01] [INFO ] Deduced a trap composed of 164 places in 349 ms of which 74 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:06] [INFO ] Deduced a trap composed of 163 places in 286 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 472 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 283/756 variables, and 31 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/283 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 283/350 places, 473/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 283/350 places, 473/602 transitions.
[2025-06-02 20:05:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:05:14] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:05:14] [INFO ] Input system was already deterministic with 473 transitions.
[2025-06-02 20:05:14] [INFO ] Flatten gal took : 19 ms
[2025-06-02 20:05:14] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:05:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality2006258140486982459.gal : 6 ms
[2025-06-02 20:05:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13648027418154542662.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/CTLCardinality2006258140486982459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13648027418154542662.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:44] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:05:45] [INFO ] Applying decomposition
[2025-06-02 20:05:45] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12337196211032827544.txt' '-o' '/tmp/graph12337196211032827544.bin' '-w' '/tmp/graph12337196211032827544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12337196211032827544.bin' '-l' '-1' '-v' '-w' '/tmp/graph12337196211032827544.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:05:45] [INFO ] Decomposing Gal with order
[2025-06-02 20:05:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:05:45] [INFO ] Removed a total of 514 redundant transitions.
[2025-06-02 20:05:45] [INFO ] Flatten gal took : 48 ms
[2025-06-02 20:05:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 12 ms.
[2025-06-02 20:05:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality11027619909193528906.gal : 7 ms
[2025-06-02 20:05:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality11319030557626306805.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/CTLCardinality11027619909193528906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11319030557626306805.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71322e+10,24.0465,492052,2549,67,573489,837,1082,3.45238e+06,87,2852,0


Converting to forward existential form...Done !
original formula: AX(((A((i4.i0.u33.p151==1) U ((i2.u37.p161==0)||(i8.u65.p308==1))) * AF(((i7.i0.u81.p315==0)||(i3.i1.u69.p324==1)))) * ((i4.i1.u53.p211==...183
=> equivalent forward existential formula: ((([(FwdU(EY(Init),!(((i2.u37.p161==0)||(i8.u65.p308==1)))) * (!((i4.i0.u33.p151==1)) * !(((i2.u37.p161==0)||(i8...423
Reverse transition relation is NOT exact ! Due to transitions t60, t67, t149, t156, t192, t194, t195, t197, t206, t215, t254, t255, t296, t298, t342, t348,...1324
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Graph (trivial) has 252 edges and 350 vertex of which 11 / 350 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1091 edges and 342 vertex of which 338 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 337 transition count 543
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 288 transition count 541
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 287 transition count 540
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 286 transition count 540
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 105 place count 286 transition count 521
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 143 place count 267 transition count 521
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 165 place count 245 transition count 478
Iterating global reduction 4 with 22 rules applied. Total rules applied 187 place count 245 transition count 478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 190 place count 245 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 191 place count 244 transition count 475
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 191 place count 244 transition count 471
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 199 place count 240 transition count 471
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 207 place count 232 transition count 458
Iterating global reduction 6 with 8 rules applied. Total rules applied 215 place count 232 transition count 458
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 220 place count 227 transition count 449
Iterating global reduction 6 with 5 rules applied. Total rules applied 225 place count 227 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 227 place count 227 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 228 place count 226 transition count 447
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 230 place count 224 transition count 441
Iterating global reduction 8 with 2 rules applied. Total rules applied 232 place count 224 transition count 441
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 234 place count 222 transition count 437
Iterating global reduction 8 with 2 rules applied. Total rules applied 236 place count 222 transition count 437
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 238 place count 220 transition count 431
Iterating global reduction 8 with 2 rules applied. Total rules applied 240 place count 220 transition count 431
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 242 place count 218 transition count 427
Iterating global reduction 8 with 2 rules applied. Total rules applied 244 place count 218 transition count 427
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 246 place count 216 transition count 421
Iterating global reduction 8 with 2 rules applied. Total rules applied 248 place count 216 transition count 421
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 250 place count 214 transition count 417
Iterating global reduction 8 with 2 rules applied. Total rules applied 252 place count 214 transition count 417
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 254 place count 212 transition count 411
Iterating global reduction 8 with 2 rules applied. Total rules applied 256 place count 212 transition count 411
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 258 place count 210 transition count 407
Iterating global reduction 8 with 2 rules applied. Total rules applied 260 place count 210 transition count 407
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 262 place count 208 transition count 402
Iterating global reduction 8 with 2 rules applied. Total rules applied 264 place count 208 transition count 402
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 266 place count 206 transition count 398
Iterating global reduction 8 with 2 rules applied. Total rules applied 268 place count 206 transition count 398
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 269 place count 205 transition count 396
Iterating global reduction 8 with 1 rules applied. Total rules applied 270 place count 205 transition count 396
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 271 place count 204 transition count 394
Iterating global reduction 8 with 1 rules applied. Total rules applied 272 place count 204 transition count 394
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 308 place count 186 transition count 376
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 312 place count 182 transition count 350
Iterating global reduction 8 with 4 rules applied. Total rules applied 316 place count 182 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 317 place count 182 transition count 349
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 319 place count 182 transition count 349
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 320 place count 181 transition count 348
Applied a total of 320 rules in 84 ms. Remains 181 /350 variables (removed 169) and now considering 348/602 (removed 254) transitions.
[2025-06-02 20:06:15] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
// Phase 1: matrix 344 rows 181 cols
[2025-06-02 20:06:15] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:06:15] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-02 20:06:15] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
[2025-06-02 20:06:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:06:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 20:06:15] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:06:15] [INFO ] Redundant transitions in 3 ms returned []
Running 344 sub problems to find dead transitions.
[2025-06-02 20:06:15] [INFO ] Flow matrix only has 344 transitions (discarded 4 similar events)
[2025-06-02 20:06:15] [INFO ] Invariant cache hit.
[2025-06-02 20:06:15] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:20] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:21] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:21] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:21] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:21] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:21] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:21] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:22] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:22] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:23] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:23] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:26] [INFO ] Deduced a trap composed of 118 places in 117 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 343/524 variables, 181/200 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 9 (OVERLAPS) 0/524 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/525 variables, and 202 constraints, problems are : Problem set: 0 solved, 344 unsolved in 28450 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (OVERLAPS) 1/181 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 343/524 variables, 181/200 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 344/546 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/525 variables, and 546 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58553ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 58554ms
Starting structural reductions in SI_CTL mode, iteration 1 : 181/350 places, 348/602 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59214 ms. Remains : 181/350 places, 348/602 transitions.
[2025-06-02 20:07:14] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:07:14] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:07:14] [INFO ] Input system was already deterministic with 348 transitions.
[2025-06-02 20:07:14] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:07:14] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:07:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality7475595057472342781.gal : 3 ms
[2025-06-02 20:07:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14418883843748238373.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/CTLCardinality7475595057472342781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14418883843748238373.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:07:44] [INFO ] Flatten gal took : 8 ms
[2025-06-02 20:07:44] [INFO ] Applying decomposition
[2025-06-02 20:07:44] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5192780479317526073.txt' '-o' '/tmp/graph5192780479317526073.bin' '-w' '/tmp/graph5192780479317526073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5192780479317526073.bin' '-l' '-1' '-v' '-w' '/tmp/graph5192780479317526073.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:07:44] [INFO ] Decomposing Gal with order
[2025-06-02 20:07:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:07:44] [INFO ] Removed a total of 431 redundant transitions.
[2025-06-02 20:07:44] [INFO ] Flatten gal took : 20 ms
[2025-06-02 20:07:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2025-06-02 20:07:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4005951829399960850.gal : 3 ms
[2025-06-02 20:07:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17378702149963689220.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/CTLCardinality4005951829399960850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17378702149963689220.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.09933e+09,2.27334,52576,1226,95,80947,1279,742,175144,87,4822,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((i8.u37.p272==0)&&(i1.u23.p149==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((i8.u37.p272==0)&&(i1.u23.p149==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t73, t86, t90, t94, t95, t97, t103, t108, t113, t117, t118, t123, t132, t153, t155, t162, t16...878
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,5.07872,87776,1,0,137377,1924,4710,337400,459,7378,412036
FORMULA FireWire-PT-18-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 346 transition count 602
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 38 place count 312 transition count 548
Iterating global reduction 1 with 34 rules applied. Total rules applied 72 place count 312 transition count 548
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 312 transition count 547
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 85 place count 300 transition count 509
Iterating global reduction 2 with 12 rules applied. Total rules applied 97 place count 300 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 300 transition count 508
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 294 transition count 498
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 294 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 294 transition count 497
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 292 transition count 491
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 292 transition count 491
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 290 transition count 487
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 290 transition count 487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 289 transition count 484
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 289 transition count 484
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 288 transition count 482
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 288 transition count 482
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 287 transition count 479
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 287 transition count 479
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 286 transition count 477
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 286 transition count 477
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 285 transition count 474
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 285 transition count 474
Applied a total of 129 rules in 31 ms. Remains 285 /350 variables (removed 65) and now considering 474/602 (removed 128) transitions.
// Phase 1: matrix 474 rows 285 cols
[2025-06-02 20:07:49] [INFO ] Computed 7 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:07:50] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-02 20:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:07:50] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2025-06-02 20:07:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:03] [INFO ] Deduced a trap composed of 150 places in 367 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:04] [INFO ] Deduced a trap composed of 92 places in 284 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:04] [INFO ] Deduced a trap composed of 162 places in 277 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:04] [INFO ] Deduced a trap composed of 163 places in 295 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:05] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:05] [INFO ] Deduced a trap composed of 162 places in 291 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:05] [INFO ] Deduced a trap composed of 163 places in 313 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:06] [INFO ] Deduced a trap composed of 90 places in 287 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:06] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:07] [INFO ] Deduced a trap composed of 162 places in 335 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:07] [INFO ] Deduced a trap composed of 80 places in 309 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:08] [INFO ] Deduced a trap composed of 78 places in 321 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:08] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:09] [INFO ] Deduced a trap composed of 87 places in 365 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:10] [INFO ] Deduced a trap composed of 40 places in 325 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:10] [INFO ] Deduced a trap composed of 50 places in 349 ms of which 58 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/759 variables, and 23 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 474/759 variables, 285/308 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/759 variables, 473/781 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:39] [INFO ] Deduced a trap composed of 161 places in 195 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:42] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:49] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 759/759 variables, and 784 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 285/350 places, 474/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61162 ms. Remains : 285/350 places, 474/602 transitions.
[2025-06-02 20:08:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:08:50] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:08:50] [INFO ] Input system was already deterministic with 474 transitions.
[2025-06-02 20:08:51] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:08:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:08:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality8827910063284516038.gal : 2 ms
[2025-06-02 20:08:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality10812542845634822258.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/CTLCardinality8827910063284516038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10812542845634822258.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:09:21] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:09:21] [INFO ] Applying decomposition
[2025-06-02 20:09:21] [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/graph11986160340321540260.txt' '-o' '/tmp/graph11986160340321540260.bin' '-w' '/tmp/graph11986160340321540260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11986160340321540260.bin' '-l' '-1' '-v' '-w' '/tmp/graph11986160340321540260.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:09:21] [INFO ] Decomposing Gal with order
[2025-06-02 20:09:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:09:21] [INFO ] Removed a total of 510 redundant transitions.
[2025-06-02 20:09:21] [INFO ] Flatten gal took : 26 ms
[2025-06-02 20:09:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2025-06-02 20:09:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality278108239831556519.gal : 4 ms
[2025-06-02 20:09:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality12318689841084022636.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/CTLCardinality278108239831556519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12318689841084022636.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.6705e+10,5.11686,107912,1822,63,149860,697,996,487990,82,2225,0


Converting to forward existential form...Done !
original formula: A((A((i12.u10.p5==1) U AF(AX((i5.u29.p142==0)))) * (((!(AG(((((i10.i0.u84.p361==0)||(i4.i0.u22.p115==0))||(i8.i0.u60.p275==1)) * A((i10.i...430
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!((EG((i4.i0.u43.p182==1)) + E((i6.u46.p202!=1) U ((i0.u17.p92==1)||(i10.i1.u88.p372==1)...1598
Reverse transition relation is NOT exact ! Due to transitions t67, t156, t192, t198, t209, t216, t221, t222, t224, t229, t234, t236, t237, t239, t244, t248...1106
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 346 transition count 602
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 41 place count 309 transition count 545
Iterating global reduction 1 with 37 rules applied. Total rules applied 78 place count 309 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 309 transition count 544
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 94 place count 294 transition count 500
Iterating global reduction 2 with 15 rules applied. Total rules applied 109 place count 294 transition count 500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 294 transition count 499
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 288 transition count 489
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 288 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 288 transition count 488
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 286 transition count 482
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 286 transition count 482
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 129 place count 284 transition count 478
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 284 transition count 478
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 133 place count 282 transition count 472
Iterating global reduction 4 with 2 rules applied. Total rules applied 135 place count 282 transition count 472
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 137 place count 280 transition count 468
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 280 transition count 468
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 141 place count 278 transition count 462
Iterating global reduction 4 with 2 rules applied. Total rules applied 143 place count 278 transition count 462
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 276 transition count 458
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 276 transition count 458
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 274 transition count 452
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 274 transition count 452
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 153 place count 272 transition count 448
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 272 transition count 448
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 157 place count 270 transition count 443
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 270 transition count 443
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 161 place count 268 transition count 439
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 268 transition count 439
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 165 place count 266 transition count 436
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 266 transition count 436
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 265 transition count 434
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 265 transition count 434
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 264 transition count 433
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 264 transition count 433
Applied a total of 171 rules in 58 ms. Remains 264 /350 variables (removed 86) and now considering 433/602 (removed 169) transitions.
// Phase 1: matrix 433 rows 264 cols
[2025-06-02 20:09:51] [INFO ] Computed 7 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:09:51] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-02 20:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:09:52] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2025-06-02 20:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:03] [INFO ] Deduced a trap composed of 146 places in 203 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:03] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:03] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:04] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:04] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:05] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:05] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/278 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:18] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/697 variables, and 279 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/279 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 432/711 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:38] [INFO ] Deduced a trap composed of 43 places in 326 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:42] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:42] [INFO ] Deduced a trap composed of 82 places in 346 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:43] [INFO ] Deduced a trap composed of 147 places in 349 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:44] [INFO ] Deduced a trap composed of 155 places in 237 ms of which 40 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 716 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 264/350 places, 433/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61114 ms. Remains : 264/350 places, 433/602 transitions.
[2025-06-02 20:10:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:10:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:10:52] [INFO ] Input system was already deterministic with 433 transitions.
[2025-06-02 20:10:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:10:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:10:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8065048035464156578.gal : 1 ms
[2025-06-02 20:10:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality4789462042360513620.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/CTLCardinality8065048035464156578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4789462042360513620.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:11:22] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:11:22] [INFO ] Applying decomposition
[2025-06-02 20:11:22] [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/graph8460398097891662725.txt' '-o' '/tmp/graph8460398097891662725.bin' '-w' '/tmp/graph8460398097891662725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8460398097891662725.bin' '-l' '-1' '-v' '-w' '/tmp/graph8460398097891662725.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:11:22] [INFO ] Decomposing Gal with order
[2025-06-02 20:11:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:11:22] [INFO ] Removed a total of 456 redundant transitions.
[2025-06-02 20:11:22] [INFO ] Flatten gal took : 21 ms
[2025-06-02 20:11:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2025-06-02 20:11:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality754565048359250759.gal : 4 ms
[2025-06-02 20:11:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12377846996262700276.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/CTLCardinality754565048359250759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12377846996262700276.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 602/602 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 347 transition count 602
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 31 place count 319 transition count 573
Iterating global reduction 1 with 28 rules applied. Total rules applied 59 place count 319 transition count 573
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 310 transition count 556
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 310 transition count 556
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 305 transition count 548
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 305 transition count 548
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 305 transition count 547
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 303 transition count 541
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 303 transition count 541
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 301 transition count 537
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 301 transition count 537
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 299 transition count 531
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 299 transition count 531
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 298 transition count 529
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 298 transition count 529
Applied a total of 102 rules in 25 ms. Remains 298 /350 variables (removed 52) and now considering 529/602 (removed 73) transitions.
// Phase 1: matrix 529 rows 298 cols
[2025-06-02 20:11:52] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:11:52] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-06-02 20:11:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:11:53] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Running 528 sub problems to find dead transitions.
[2025-06-02 20:11:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:07] [INFO ] Deduced a trap composed of 156 places in 255 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:07] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:08] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:08] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:08] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:09] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:09] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:10] [INFO ] Deduced a trap composed of 140 places in 248 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:10] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:12] [INFO ] Deduced a trap composed of 52 places in 342 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:12] [INFO ] Deduced a trap composed of 157 places in 303 ms of which 46 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:14] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/827 variables, and 19 constraints, problems are : Problem set: 0 solved, 528 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/298 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 528 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 4 (OVERLAPS) 529/826 variables, 297/316 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 525/841 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:49] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:52] [INFO ] Deduced a trap composed of 91 places in 402 ms of which 68 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/827 variables, and 843 constraints, problems are : Problem set: 0 solved, 528 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/298 constraints, PredecessorRefiner: 525/528 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 528 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 298/350 places, 529/602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61004 ms. Remains : 298/350 places, 529/602 transitions.
[2025-06-02 20:12:53] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:12:53] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:12:53] [INFO ] Input system was already deterministic with 529 transitions.
[2025-06-02 20:12:53] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:12:53] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:12:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14931424057087056441.gal : 3 ms
[2025-06-02 20:12:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality12583580592279764158.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/CTLCardinality14931424057087056441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12583580592279764158.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:13:23] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:13:23] [INFO ] Applying decomposition
[2025-06-02 20:13:23] [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/graph528367073848622071.txt' '-o' '/tmp/graph528367073848622071.bin' '-w' '/tmp/graph528367073848622071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph528367073848622071.bin' '-l' '-1' '-v' '-w' '/tmp/graph528367073848622071.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:13:23] [INFO ] Decomposing Gal with order
[2025-06-02 20:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:13:23] [INFO ] Removed a total of 579 redundant transitions.
[2025-06-02 20:13:23] [INFO ] Flatten gal took : 26 ms
[2025-06-02 20:13:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 5 ms.
[2025-06-02 20:13:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15705836161360841081.gal : 4 ms
[2025-06-02 20:13:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8532929728612704916.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/CTLCardinality15705836161360841081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8532929728612704916.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.53488e+10,12.9022,357820,2804,79,341266,1487,1041,3.21332e+06,94,4924,0


Converting to forward existential form...Done !
original formula: (EF((i11.u91.p306==1)) + ((AX((A(((i3.i0.u22.p95==0)||(i4.u33.p142==1)) U (i13.i2.u105.p382==1)) * EX((i13.i2.u105.p435==1)))) * EX(((i3....501
=> equivalent forward existential formula: (((([(FwdU(EY((Init * !(E(TRUE U (i11.u91.p306==1))))),!((i13.i2.u105.p382==1))) * (!(((i3.i0.u22.p95==0)||(i4.u...1026
Reverse transition relation is NOT exact ! Due to transitions t59, t66, t115, t159, t194, t199, t204, t213, t215, t222, t227, t228, t230, t236, t254, t258,...1233
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
[2025-06-02 20:13:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:13:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:13:54] [INFO ] Applying decomposition
[2025-06-02 20:13:54] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3922156417946356542.txt' '-o' '/tmp/graph3922156417946356542.bin' '-w' '/tmp/graph3922156417946356542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3922156417946356542.bin' '-l' '-1' '-v' '-w' '/tmp/graph3922156417946356542.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:13:54] [INFO ] Decomposing Gal with order
[2025-06-02 20:13:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:13:54] [INFO ] Removed a total of 635 redundant transitions.
[2025-06-02 20:13:54] [INFO ] Flatten gal took : 27 ms
[2025-06-02 20:13:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 8 ms.
[2025-06-02 20:13:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality15248246295603895937.gal : 5 ms
[2025-06-02 20:13:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality9372504900364684987.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/CTLCardinality15248246295603895937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9372504900364684987.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27287e+11,14.6426,293780,3987,148,376943,5993,1287,1.81704e+06,147,25183,0


Converting to forward existential form...Done !
original formula: AX((AF(AX((i12.i1.u111.p415==1))) + (AG((((i9.i0.u95.p352==0)||(i8.i1.u68.p259==1))||(i3.i1.u20.p79==1))) * (EX(((i4.i0.u64.p238==0)||(i1...201
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !(!(EG(!(!(EX(!((i12.i1.u111.p415==1))))))))),TRUE) * !((((i9.i0.u95.p352==0)||(i8.i1.u68.p2...348
Reverse transition relation is NOT exact ! Due to transitions t18, t85, t170, t187, t224, t231, t240, t258, t266, t275, t294, t296, t297, t298, t299, t354,...1529
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,100.376,1438312,1,0,1.87941e+06,8330,7695,6.76494e+06,677,33380,3779603
FORMULA FireWire-PT-18-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(EF((EF((i3.i2.u29.p105==1)) + ((i11.i0.u104.p394==0)&&(i9.i0.u95.p352==1)))))
=> equivalent forward existential formula: ([(FwdU(FwdU(EY(Init),TRUE),TRUE) * (i3.i2.u29.p105==1))] != FALSE + [(FwdU(EY(Init),TRUE) * ((i11.i0.u104.p394=...192
(forward)formula 1,1,100.391,1438568,1,0,1.87994e+06,8330,7699,6.76615e+06,678,33380,3781213
FORMULA FireWire-PT-18-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AG(EF(EG(((i1.u3.p34==0)||(i2.u91.p344==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U EG(((i1.u3.p34==0)||(i2.u91.p344==1))))))] = FALSE
(forward)formula 2,1,219.002,2357480,1,0,3.07468e+06,8991,3787,1.00606e+07,362,35551,2140127
FORMULA FireWire-PT-18-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AX(EX(AF((i10.i1.u80.p302==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(EG(!((i10.i1.u80.p302==1)))))))))] != FALSE
(forward)formula 3,1,248.292,2357480,1,0,3.07468e+06,8991,3805,1.00606e+07,364,35551,3606286
FORMULA FireWire-PT-18-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-02 20:43:34] [INFO ] Applying decomposition
[2025-06-02 20:43:34] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:43:34] [INFO ] Decomposing Gal with order
[2025-06-02 20:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:43:34] [INFO ] Removed a total of 497 redundant transitions.
[2025-06-02 20:43:34] [INFO ] Flatten gal took : 35 ms
[2025-06-02 20:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 365 labels/synchronizations in 6 ms.
[2025-06-02 20:43:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality1815645694579998850.gal : 2 ms
[2025-06-02 20:43:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11126532264988589848.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/CTLCardinality1815645694579998850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11126532264988589848.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.

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="FireWire-PT-18"
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 FireWire-PT-18, 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 r086-smll-174860102400377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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