Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.3K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 11:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 179K Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749325307643

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H08T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-07 19:41:49] [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-07 19:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:41:49] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-06-07 19:41:49] [INFO ] Transformed 739 places.
[2025-06-07 19:41:49] [INFO ] Transformed 1088 transitions.
[2025-06-07 19:41:49] [INFO ] Found NUPN structural information;
[2025-06-07 19:41:49] [INFO ] Parsed PT model containing 739 places and 1088 transitions and 2936 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 43 ms.
Support contains 96 out of 739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 739/739 places, 1088/1088 transitions.
Discarding 154 places :
Symmetric choice reduction at 0 with 154 rule applications. Total rules 154 place count 585 transition count 934
Iterating global reduction 0 with 154 rules applied. Total rules applied 308 place count 585 transition count 934
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 387 place count 506 transition count 855
Iterating global reduction 0 with 79 rules applied. Total rules applied 466 place count 506 transition count 855
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 505 place count 467 transition count 746
Iterating global reduction 0 with 39 rules applied. Total rules applied 544 place count 467 transition count 746
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 561 place count 467 transition count 729
Applied a total of 561 rules in 309 ms. Remains 467 /739 variables (removed 272) and now considering 729/1088 (removed 359) transitions.
// Phase 1: matrix 729 rows 467 cols
[2025-06-07 19:41:50] [INFO ] Computed 37 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:41:50] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-06-07 19:41:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:41:50] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2025-06-07 19:41: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/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:05] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:06] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:07] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:07] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:07] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:07] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:07] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:07] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:08] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:08] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:08] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:08] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:11] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:11] [INFO ] Deduced a trap composed of 32 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-07 19:42:11] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:11] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:12] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:12] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:12] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:12] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:13] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:13] [INFO ] Deduced a trap composed of 27 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-07 19:42:13] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/1196 variables, and 68 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 31/68 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (OVERLAPS) 729/1196 variables, 467/535 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1196 variables, 728/1263 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:38] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:38] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:38] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:38] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:38] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:38] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:39] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:39] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:39] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:39] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:39] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:39] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:40] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:40] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:40] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:40] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:40] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:40] [INFO ] Deduced a trap composed of 45 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-07 19:42:41] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:41] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1196 variables, 20/1283 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:44] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:44] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:45] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:45] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:46] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:46] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:47] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:47] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:48] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:49] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:49] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:49] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:50] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 9 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 1196/1196 variables, and 1296 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Starting structural reductions in LTL mode, iteration 1 : 467/739 places, 729/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61422 ms. Remains : 467/739 places, 729/1088 transitions.
Support contains 96 out of 467 places after structural reductions.
[2025-06-07 19:42:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-07 19:42:51] [INFO ] Flatten gal took : 68 ms
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-07 19:42:51] [INFO ] Flatten gal took : 35 ms
[2025-06-07 19:42:51] [INFO ] Input system was already deterministic with 729 transitions.
Support contains 79 out of 467 places (down from 96) after GAL structural reductions.
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (86 resets) in 1630 ms. (24 steps per ms) remains 4/45 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
[2025-06-07 19:42:52] [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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 92/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 366/467 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 729/1196 variables, 467/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:52] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:52] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:52] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:52] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:52] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 30 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-07 19:42:53] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 29 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-07 19:42:53] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:53] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:54] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1196 variables, 20/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1196 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1196 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1196/1196 variables, and 524 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2105 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 92/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 366/467 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:54] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:54] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:42:54] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 729/1196 variables, 467/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1196 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1196 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1196 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1196/1196 variables, and 531 constraints, problems are : Problem set: 0 solved, 4 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3023ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 544 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=181 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 69 ms.
[2025-06-07 19:42:55] [INFO ] Flatten gal took : 27 ms
[2025-06-07 19:42:55] [INFO ] Flatten gal took : 27 ms
[2025-06-07 19:42:55] [INFO ] Input system was already deterministic with 729 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 404 transition count 632
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 404 transition count 632
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 136 place count 404 transition count 622
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 166 place count 374 transition count 566
Iterating global reduction 1 with 30 rules applied. Total rules applied 196 place count 374 transition count 566
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 204 place count 374 transition count 558
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 218 place count 360 transition count 538
Iterating global reduction 2 with 14 rules applied. Total rules applied 232 place count 360 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 234 place count 360 transition count 536
Applied a total of 234 rules in 44 ms. Remains 360 /467 variables (removed 107) and now considering 536/729 (removed 193) transitions.
// Phase 1: matrix 536 rows 360 cols
[2025-06-07 19:42:55] [INFO ] Computed 37 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:42:55] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-07 19:42:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:42:55] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2025-06-07 19:42:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (OVERLAPS) 536/896 variables, 360/397 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 896/896 variables, and 397 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (OVERLAPS) 536/896 variables, 360/397 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 535/932 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:44] [INFO ] Deduced a trap along path composed of 9 places in 55 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 535 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 896/896 variables, and 933 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 360/467 places, 536/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60534 ms. Remains : 360/467 places, 536/729 transitions.
[2025-06-07 19:43:56] [INFO ] Flatten gal took : 18 ms
[2025-06-07 19:43:56] [INFO ] Flatten gal took : 18 ms
[2025-06-07 19:43:56] [INFO ] Input system was already deterministic with 536 transitions.
[2025-06-07 19:43:56] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:43:56] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:43:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality369741711806261454.gal : 11 ms
[2025-06-07 19:43:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality8428289053554800601.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality369741711806261454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8428289053554800601.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.6229e+34,0.407477,17808,2,2840,5,82132,6,0,1978,48226,0


Converting to forward existential form...Done !
original formula: EX(EF(AG((p415==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((p415==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t27, t31, t36, t40, t45, t46, t50, t56, t60, t65, t69, t74, t75, t79, t85, t89, t95,...549
(forward)formula 0,0,5.03915,146200,1,0,893,933370,1094,465,12440,603262,1085
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Graph (trivial) has 448 edges and 467 vertex of which 63 / 467 are part of one of the 12 SCC in 2 ms
Free SCC test removed 51 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 415 transition count 562
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 174 rules applied. Total rules applied 282 place count 308 transition count 495
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 314 place count 276 transition count 495
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 314 place count 276 transition count 483
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 338 place count 264 transition count 483
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 379 place count 223 transition count 408
Iterating global reduction 3 with 41 rules applied. Total rules applied 420 place count 223 transition count 408
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 426 place count 223 transition count 402
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 426 place count 223 transition count 389
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 452 place count 210 transition count 389
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 458 place count 204 transition count 352
Iterating global reduction 4 with 6 rules applied. Total rules applied 464 place count 204 transition count 352
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 470 place count 204 transition count 346
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 5 with 196 rules applied. Total rules applied 666 place count 106 transition count 248
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 667 place count 105 transition count 246
Iterating global reduction 5 with 1 rules applied. Total rules applied 668 place count 105 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 669 place count 105 transition count 245
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 671 place count 103 transition count 243
Applied a total of 671 rules in 90 ms. Remains 103 /467 variables (removed 364) and now considering 243/729 (removed 486) transitions.
[2025-06-07 19:44:01] [INFO ] Flow matrix only has 96 transitions (discarded 147 similar events)
// Phase 1: matrix 96 rows 103 cols
[2025-06-07 19:44:01] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:01] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 19:44:01] [INFO ] Flow matrix only has 96 transitions (discarded 147 similar events)
[2025-06-07 19:44:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:01] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:44:01] [INFO ] Redundant transitions in 10 ms returned []
Running 166 sub problems to find dead transitions.
[2025-06-07 19:44:01] [INFO ] Flow matrix only has 96 transitions (discarded 147 similar events)
[2025-06-07 19:44:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 95/198 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/198 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/199 variables, and 140 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4432 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 95/198 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 166/306 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/199 variables, and 306 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4737 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9192ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 9192ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/467 places, 243/729 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9469 ms. Remains : 103/467 places, 243/729 transitions.
[2025-06-07 19:44:10] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:44:10] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:44:10] [INFO ] Input system was already deterministic with 243 transitions.
[2025-06-07 19:44:10] [INFO ] Flatten gal took : 9 ms
RANDOM walk for 1001 steps (14 resets) in 31 ms. (31 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 19:44:10] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:44:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10189138104183878609.gal : 3 ms
[2025-06-07 19:44:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5511158380155351901.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/ReachabilityCardinality10189138104183878609.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5511158380155351901.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 414 transition count 645
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 414 transition count 645
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 115 place count 414 transition count 636
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 139 place count 390 transition count 595
Iterating global reduction 1 with 24 rules applied. Total rules applied 163 place count 390 transition count 595
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 168 place count 390 transition count 590
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 180 place count 378 transition count 578
Iterating global reduction 2 with 12 rules applied. Total rules applied 192 place count 378 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 378 transition count 577
Applied a total of 193 rules in 20 ms. Remains 378 /467 variables (removed 89) and now considering 577/729 (removed 152) transitions.
// Phase 1: matrix 577 rows 378 cols
[2025-06-07 19:44:10] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:10] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-07 19:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:11] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2025-06-07 19:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:20] [INFO ] Deduced a trap composed of 26 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-07 19:44:21] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:21] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:21] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:22] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 577/955 variables, 378/420 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 955/955 variables, and 420 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 577/955 variables, 378/420 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 576/996 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:52] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:52] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:53] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:53] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:53] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:53] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:54] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:54] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:55] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:55] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:55] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:56] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:56] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:57] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 14/1010 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:45:01] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:45:02] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:45:02] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:45:03] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/955 variables, 4/1014 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 955/955 variables, and 1014 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 378/467 places, 577/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 378/467 places, 577/729 transitions.
[2025-06-07 19:45:11] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:45:11] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:45:11] [INFO ] Input system was already deterministic with 577 transitions.
[2025-06-07 19:45:11] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:45:11] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:45:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality939676275742796957.gal : 3 ms
[2025-06-07 19:45:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality3684174832231830548.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/CTLCardinality939676275742796957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3684174832231830548.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 19:45:41] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:45:41] [INFO ] Applying decomposition
[2025-06-07 19:45:41] [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/graph10054381327775652988.txt' '-o' '/tmp/graph10054381327775652988.bin' '-w' '/tmp/graph10054381327775652988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10054381327775652988.bin' '-l' '-1' '-v' '-w' '/tmp/graph10054381327775652988.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:45:41] [INFO ] Decomposing Gal with order
[2025-06-07 19:45:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:45:41] [INFO ] Removed a total of 468 redundant transitions.
[2025-06-07 19:45:41] [INFO ] Flatten gal took : 78 ms
[2025-06-07 19:45:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 18 ms.
[2025-06-07 19:45:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality7270576020545907647.gal : 8 ms
[2025-06-07 19:45:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality12951756456342096632.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/CTLCardinality7270576020545907647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12951756456342096632.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.44118e+35,1.15896,28764,3304,35,46019,916,897,97185,88,2009,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * (E((EF((((((i17.u52.p346==1)&&((i3.u8.p48==0)||(i18.i1.u58.p366==1)))&&(((i28.i1.u92.p585==0)||(i5.u16.p109==1))&&(i18.i0.u56...448
=> equivalent forward existential formula: ((([((FwdU(FwdU((Init * EX(TRUE)),(E(TRUE U (((((i17.u52.p346==1)&&((i3.u8.p48==0)||(i18.i1.u58.p366==1)))&&(((i...1595
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t46, t57, t76, t98, t117, t138, t157, t189, t211, t284, t368, i0.i1.u14.t342, i1.t38...1079
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Graph (trivial) has 443 edges and 467 vertex of which 66 / 467 are part of one of the 12 SCC in 0 ms
Free SCC test removed 54 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 412 transition count 564
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 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 1 with 165 rules applied. Total rules applied 267 place count 311 transition count 500
Reduce places removed 30 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 33 rules applied. Total rules applied 300 place count 281 transition count 497
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 305 place count 278 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 306 place count 277 transition count 495
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 306 place count 277 transition count 482
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 332 place count 264 transition count 482
Discarding 39 places :
Symmetric choice reduction at 5 with 39 rule applications. Total rules 371 place count 225 transition count 409
Iterating global reduction 5 with 39 rules applied. Total rules applied 410 place count 225 transition count 409
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 416 place count 225 transition count 403
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 416 place count 225 transition count 390
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 442 place count 212 transition count 390
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 448 place count 206 transition count 353
Iterating global reduction 6 with 6 rules applied. Total rules applied 454 place count 206 transition count 353
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 460 place count 206 transition count 347
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 7 with 190 rules applied. Total rules applied 650 place count 111 transition count 252
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 651 place count 110 transition count 250
Iterating global reduction 7 with 1 rules applied. Total rules applied 652 place count 110 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 653 place count 110 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 655 place count 108 transition count 247
Applied a total of 655 rules in 116 ms. Remains 108 /467 variables (removed 359) and now considering 247/729 (removed 482) transitions.
[2025-06-07 19:46:11] [INFO ] Flow matrix only has 112 transitions (discarded 135 similar events)
// Phase 1: matrix 112 rows 108 cols
[2025-06-07 19:46:11] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:12] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-07 19:46:12] [INFO ] Flow matrix only has 112 transitions (discarded 135 similar events)
[2025-06-07 19:46:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-07 19:46:12] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:46:12] [INFO ] Redundant transitions in 9 ms returned []
Running 181 sub problems to find dead transitions.
[2025-06-07 19:46:12] [INFO ] Flow matrix only has 112 transitions (discarded 135 similar events)
[2025-06-07 19:46:12] [INFO ] Invariant cache hit.
[2025-06-07 19:46:12] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 4/108 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 111/219 variables, 108/145 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/220 variables, and 149 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5802 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 108/108 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 4/108 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 111/219 variables, 108/145 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 181/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/220 variables, and 330 constraints, problems are : Problem set: 0 solved, 181 unsolved in 5442 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 108/108 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11274ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 11275ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/467 places, 247/729 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11757 ms. Remains : 108/467 places, 247/729 transitions.
[2025-06-07 19:46:23] [INFO ] Flatten gal took : 33 ms
[2025-06-07 19:46:23] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:46:23] [INFO ] Input system was already deterministic with 247 transitions.
[2025-06-07 19:46:23] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:46:23] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:46:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality13464952463356073993.gal : 2 ms
[2025-06-07 19:46:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality3866650253889249545.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/CTLCardinality13464952463356073993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3866650253889249545.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.63804e+16,0.047222,5484,2,203,5,2910,6,0,668,1348,0


Converting to forward existential form...Done !
original formula: AG(A(!(EF((p599==0))) U (!(AG((p421==1))) * ((p298==0)||(p193==1)))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!((!(!(E(TRUE U !((p421==1))))) * ((p298==0)||(p193==1))))) * !(!(E(TRUE U (p599==0)))...443
Reverse transition relation is NOT exact ! Due to transitions t141, t187, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
(forward)formula 0,0,0.444715,12012,1,0,453,54791,511,217,4434,32682,499
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Graph (trivial) has 447 edges and 467 vertex of which 66 / 467 are part of one of the 12 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 412 transition count 560
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 170 rules applied. Total rules applied 276 place count 307 transition count 495
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 308 place count 276 transition count 494
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 311 place count 275 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 274 transition count 492
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 312 place count 274 transition count 480
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 336 place count 262 transition count 480
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 377 place count 221 transition count 405
Iterating global reduction 5 with 41 rules applied. Total rules applied 418 place count 221 transition count 405
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 424 place count 221 transition count 399
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 424 place count 221 transition count 386
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 450 place count 208 transition count 386
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 456 place count 202 transition count 349
Iterating global reduction 6 with 6 rules applied. Total rules applied 462 place count 202 transition count 349
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 468 place count 202 transition count 343
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 660 place count 106 transition count 247
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 661 place count 105 transition count 245
Iterating global reduction 7 with 1 rules applied. Total rules applied 662 place count 105 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 663 place count 105 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 665 place count 103 transition count 242
Applied a total of 665 rules in 107 ms. Remains 103 /467 variables (removed 364) and now considering 242/729 (removed 487) transitions.
[2025-06-07 19:46:24] [INFO ] Flow matrix only has 99 transitions (discarded 143 similar events)
// Phase 1: matrix 99 rows 103 cols
[2025-06-07 19:46:24] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:24] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-07 19:46:24] [INFO ] Flow matrix only has 99 transitions (discarded 143 similar events)
[2025-06-07 19:46:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:24] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:46:24] [INFO ] Redundant transitions in 2 ms returned []
Running 166 sub problems to find dead transitions.
[2025-06-07 19:46:24] [INFO ] Flow matrix only has 99 transitions (discarded 143 similar events)
[2025-06-07 19:46:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 98/201 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/202 variables, and 140 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4387 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 2/103 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 98/201 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 166/306 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/202 variables, and 306 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4623 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9037ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 9038ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/467 places, 242/729 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9377 ms. Remains : 103/467 places, 242/729 transitions.
[2025-06-07 19:46:33] [INFO ] Flatten gal took : 7 ms
[2025-06-07 19:46:33] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:46:33] [INFO ] Input system was already deterministic with 242 transitions.
[2025-06-07 19:46:33] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:46:33] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:46:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9756777867277714792.gal : 1 ms
[2025-06-07 19:46:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality13472857020359547733.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/CTLCardinality9756777867277714792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13472857020359547733.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3882e+16,0.038235,5292,2,170,5,2461,6,0,645,1168,0


Converting to forward existential form...Done !
original formula: E((p702==0) U (p497==1))
=> equivalent forward existential formula: [(FwdU(Init,(p702==0)) * (p497==1))] != FALSE
Hit Full ! (commute/partial/dont) 240/0/2
(forward)formula 0,1,0.04784,5548,1,0,10,2515,15,1,1225,1209,4
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 411 transition count 650
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 411 transition count 650
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 118 place count 411 transition count 644
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 145 place count 384 transition count 594
Iterating global reduction 1 with 27 rules applied. Total rules applied 172 place count 384 transition count 594
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 178 place count 384 transition count 588
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 191 place count 371 transition count 569
Iterating global reduction 2 with 13 rules applied. Total rules applied 204 place count 371 transition count 569
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 371 transition count 567
Applied a total of 206 rules in 41 ms. Remains 371 /467 variables (removed 96) and now considering 567/729 (removed 162) transitions.
// Phase 1: matrix 567 rows 371 cols
[2025-06-07 19:46:33] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:34] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-07 19:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2025-06-07 19:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (OVERLAPS) 567/938 variables, 371/408 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 938/938 variables, and 408 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (OVERLAPS) 567/938 variables, 371/408 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/938 variables, 566/974 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:47:23] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/938 variables, 1/975 constraints. Problems are: Problem set: 0 solved, 566 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 938/938 variables, and 975 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 371/467 places, 567/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 371/467 places, 567/729 transitions.
[2025-06-07 19:47:34] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:47:34] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:47:34] [INFO ] Input system was already deterministic with 567 transitions.
[2025-06-07 19:47:34] [INFO ] Flatten gal took : 27 ms
[2025-06-07 19:47:34] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:47:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality8161474188578865740.gal : 19 ms
[2025-06-07 19:47:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11764486078080576672.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/CTLCardinality8161474188578865740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11764486078080576672.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-07 19:48:04] [INFO ] Flatten gal took : 21 ms
[2025-06-07 19:48:04] [INFO ] Applying decomposition
[2025-06-07 19:48:04] [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/graph105362963104498867.txt' '-o' '/tmp/graph105362963104498867.bin' '-w' '/tmp/graph105362963104498867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph105362963104498867.bin' '-l' '-1' '-v' '-w' '/tmp/graph105362963104498867.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:48:04] [INFO ] Decomposing Gal with order
[2025-06-07 19:48:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:48:04] [INFO ] Removed a total of 485 redundant transitions.
[2025-06-07 19:48:04] [INFO ] Flatten gal took : 49 ms
[2025-06-07 19:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 22 ms.
[2025-06-07 19:48:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12942290579095385747.gal : 4 ms
[2025-06-07 19:48:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality907368473890756921.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/CTLCardinality12942290579095385747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality907368473890756921.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.30843e+35,0.173693,10400,899,27,12280,845,803,16768,79,1935,0


Converting to forward existential form...Done !
original formula: (AG(A(!(((((i5.u11.p75==1)||(i30.i1.u95.p629==1)) * EF(((i14.u38.p291==0)||(i20.u60.p418==1)))) * EX((i11.u29.p209==1)))) U ((i30.i1.u99....308
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(!((E(!(((i30.i1.u99.p640!=1)||(!(((i6.u13.p91==0)&&((i6.u14.p101==0)||(i31.i0.u91....684
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t82, t121, t160, t209, i0.i1.t305, i1.t325, i2.t376, i3.i1.t367, i4.t357, i5.u12.t34...965
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
(forward)formula 0,0,3.06764,117792,1,0,261156,1199,5949,340297,478,3157,397300
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 405 transition count 635
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 405 transition count 635
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 133 place count 405 transition count 626
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 163 place count 375 transition count 570
Iterating global reduction 1 with 30 rules applied. Total rules applied 193 place count 375 transition count 570
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 201 place count 375 transition count 562
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 215 place count 361 transition count 542
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 361 transition count 542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 231 place count 361 transition count 540
Applied a total of 231 rules in 17 ms. Remains 361 /467 variables (removed 106) and now considering 540/729 (removed 189) transitions.
// Phase 1: matrix 540 rows 361 cols
[2025-06-07 19:48:08] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:48:08] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-07 19:48:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:48:08] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2025-06-07 19:48:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:18] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (OVERLAPS) 540/901 variables, 361/399 constraints. Problems are: Problem set: 0 solved, 539 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 Real declared 901/901 variables, and 399 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (OVERLAPS) 540/901 variables, 361/399 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 539/938 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:48] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:48] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:48] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:48] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:49] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:49] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:49] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:50] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:50] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/901 variables, 9/947 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:57] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/901 variables, 1/948 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:06] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 901/901 variables, and 949 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 361/467 places, 540/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60576 ms. Remains : 361/467 places, 540/729 transitions.
[2025-06-07 19:49:08] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:49:08] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:49:08] [INFO ] Input system was already deterministic with 540 transitions.
[2025-06-07 19:49:08] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:49:08] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:49:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality11937650805907612935.gal : 2 ms
[2025-06-07 19:49:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality518240804623723688.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/CTLCardinality11937650805907612935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality518240804623723688.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,8.48952e+34,0.618223,23156,2,3401,5,112350,6,0,1986,73625,0


Converting to forward existential form...Done !
original formula: AG(AX(EF(((p49==0)&&(p689==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((p49==0)&&(p689==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t27, t31, t37, t41, t46, t47, t51, t56, t57, t61, t66, t70, t75, t76, t80, t86, t90,...584
(forward)formula 0,0,24.9613,677368,1,0,1154,3.82568e+06,1101,593,12719,3.67081e+06,1404
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 407 transition count 635
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 407 transition count 635
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 130 place count 407 transition count 625
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 158 place count 379 transition count 580
Iterating global reduction 1 with 28 rules applied. Total rules applied 186 place count 379 transition count 580
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 193 place count 379 transition count 573
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 206 place count 366 transition count 554
Iterating global reduction 2 with 13 rules applied. Total rules applied 219 place count 366 transition count 554
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 221 place count 366 transition count 552
Applied a total of 221 rules in 28 ms. Remains 366 /467 variables (removed 101) and now considering 552/729 (removed 177) transitions.
// Phase 1: matrix 552 rows 366 cols
[2025-06-07 19:49:33] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:49:33] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-07 19:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:49:34] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2025-06-07 19:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:44] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:45] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (OVERLAPS) 552/918 variables, 366/405 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/918 variables, and 405 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (OVERLAPS) 552/918 variables, 366/405 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/918 variables, 551/956 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:14] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:14] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:14] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:14] [INFO ] Deduced a trap composed of 26 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-07 19:50:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:15] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:15] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:15] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:16] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 9/965 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:24] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/918 variables, and 966 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 366/467 places, 552/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60520 ms. Remains : 366/467 places, 552/729 transitions.
[2025-06-07 19:50:34] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:50:34] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:50:34] [INFO ] Input system was already deterministic with 552 transitions.
[2025-06-07 19:50:34] [INFO ] Flatten gal took : 41 ms
[2025-06-07 19:50:34] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:50:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality14483073307677436496.gal : 2 ms
[2025-06-07 19:50:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality5505161846322847987.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/CTLCardinality14483073307677436496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5505161846322847987.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-07 19:51:04] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:51:04] [INFO ] Applying decomposition
[2025-06-07 19:51:04] [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/graph17193934131806844849.txt' '-o' '/tmp/graph17193934131806844849.bin' '-w' '/tmp/graph17193934131806844849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17193934131806844849.bin' '-l' '-1' '-v' '-w' '/tmp/graph17193934131806844849.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:51:04] [INFO ] Decomposing Gal with order
[2025-06-07 19:51:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:51:04] [INFO ] Removed a total of 462 redundant transitions.
[2025-06-07 19:51:04] [INFO ] Flatten gal took : 29 ms
[2025-06-07 19:51:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2025-06-07 19:51:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4809636185576160159.gal : 13 ms
[2025-06-07 19:51:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality12621281473176354437.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/CTLCardinality4809636185576160159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12621281473176354437.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.36582e+35,0.203752,11408,1414,29,13778,784,783,16030,68,1695,0


Converting to forward existential form...Done !
original formula: AG((E((i35.i1.u115.p733==1) U EX((((i26.i1.u67.p441==0)||(i12.u32.p227==1))||(i13.u33.p250==1)))) + EG(((i20.i1.u58.p396==1)||(i19.i1.u54...168
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(((i20.i1.u58.p396==1)||(i19.i1.u54.p355==0))))) * !(E((i35.i1.u115.p733==1) U EX((((i2...225
Reverse transition relation is NOT exact ! Due to transitions t7, t27, t46, t56, t75, t95, t114, t134, t153, t206, t357, i0.t342, i1.u5.t371, i2.t362, i3.u...970
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
(forward)formula 0,1,6.13618,214800,1,0,452464,784,5122,545056,382,1695,642723
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Graph (trivial) has 447 edges and 467 vertex of which 66 / 467 are part of one of the 12 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 412 transition count 561
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 171 rules applied. Total rules applied 276 place count 308 transition count 494
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 308 place count 276 transition count 494
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 308 place count 276 transition count 481
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 334 place count 263 transition count 481
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 373 place count 224 transition count 408
Iterating global reduction 3 with 39 rules applied. Total rules applied 412 place count 224 transition count 408
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 418 place count 224 transition count 402
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 418 place count 224 transition count 390
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 442 place count 212 transition count 390
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 447 place count 207 transition count 363
Iterating global reduction 4 with 5 rules applied. Total rules applied 452 place count 207 transition count 363
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 457 place count 207 transition count 358
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 5 with 198 rules applied. Total rules applied 655 place count 108 transition count 259
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 656 place count 107 transition count 257
Iterating global reduction 5 with 1 rules applied. Total rules applied 657 place count 107 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 658 place count 107 transition count 256
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 660 place count 105 transition count 254
Applied a total of 660 rules in 44 ms. Remains 105 /467 variables (removed 362) and now considering 254/729 (removed 475) transitions.
[2025-06-07 19:51:10] [INFO ] Flow matrix only has 102 transitions (discarded 152 similar events)
// Phase 1: matrix 102 rows 105 cols
[2025-06-07 19:51:10] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:51:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-07 19:51:10] [INFO ] Flow matrix only has 102 transitions (discarded 152 similar events)
[2025-06-07 19:51:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:51:11] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:51:11] [INFO ] Redundant transitions in 2 ms returned []
Running 177 sub problems to find dead transitions.
[2025-06-07 19:51:11] [INFO ] Flow matrix only has 102 transitions (discarded 152 similar events)
[2025-06-07 19:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 101/206 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/207 variables, and 142 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4786 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 101/206 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 177/319 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/207 variables, and 319 constraints, problems are : Problem set: 0 solved, 177 unsolved in 5159 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9983ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 9985ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/467 places, 254/729 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10282 ms. Remains : 105/467 places, 254/729 transitions.
[2025-06-07 19:51:21] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:51:21] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:51:21] [INFO ] Input system was already deterministic with 254 transitions.
[2025-06-07 19:51:21] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:51:21] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:51:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality10810188078649574319.gal : 1 ms
[2025-06-07 19:51:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality8333086012469261522.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/CTLCardinality10810188078649574319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8333086012469261522.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16906e+16,0.03895,5576,2,174,5,2534,6,0,665,1187,0


Converting to forward existential form...Done !
original formula: EF(AG(((p252==0)||(p431==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p252==0)||(p431==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.121186,6984,1,0,9,17587,15,3,2998,7603,5
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Graph (trivial) has 446 edges and 467 vertex of which 66 / 467 are part of one of the 12 SCC in 0 ms
Free SCC test removed 54 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 412 transition count 561
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 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 1 with 168 rules applied. Total rules applied 273 place count 308 transition count 497
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 303 place count 278 transition count 497
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 303 place count 278 transition count 484
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 329 place count 265 transition count 484
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 370 place count 224 transition count 409
Iterating global reduction 3 with 41 rules applied. Total rules applied 411 place count 224 transition count 409
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 417 place count 224 transition count 403
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 417 place count 224 transition count 390
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 443 place count 211 transition count 390
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 449 place count 205 transition count 353
Iterating global reduction 4 with 6 rules applied. Total rules applied 455 place count 205 transition count 353
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 461 place count 205 transition count 347
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 5 with 194 rules applied. Total rules applied 655 place count 108 transition count 250
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 656 place count 107 transition count 248
Iterating global reduction 5 with 1 rules applied. Total rules applied 657 place count 107 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 658 place count 107 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 660 place count 105 transition count 245
Applied a total of 660 rules in 63 ms. Remains 105 /467 variables (removed 362) and now considering 245/729 (removed 484) transitions.
[2025-06-07 19:51:21] [INFO ] Flow matrix only has 103 transitions (discarded 142 similar events)
// Phase 1: matrix 103 rows 105 cols
[2025-06-07 19:51:21] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:51:21] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-07 19:51:21] [INFO ] Flow matrix only has 103 transitions (discarded 142 similar events)
[2025-06-07 19:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:51:21] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:51:21] [INFO ] Redundant transitions in 13 ms returned []
Running 169 sub problems to find dead transitions.
[2025-06-07 19:51:21] [INFO ] Flow matrix only has 103 transitions (discarded 142 similar events)
[2025-06-07 19:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 102/207 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 0/207 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/208 variables, and 142 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4621 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 102/207 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 169/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/208 variables, and 311 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4859 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9507ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 9520ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/467 places, 245/729 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9832 ms. Remains : 105/467 places, 245/729 transitions.
[2025-06-07 19:51:31] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:51:31] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:51:31] [INFO ] Input system was already deterministic with 245 transitions.
[2025-06-07 19:51:31] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 2289 steps (34 resets) in 15 ms. (143 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 19:51:31] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:51:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1463536595985260581.gal : 17 ms
[2025-06-07 19:51:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11534928126375380534.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/ReachabilityCardinality1463536595985260581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11534928126375380534.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 411 transition count 648
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 411 transition count 648
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 411 transition count 639
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 148 place count 384 transition count 587
Iterating global reduction 1 with 27 rules applied. Total rules applied 175 place count 384 transition count 587
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 182 place count 384 transition count 580
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 195 place count 371 transition count 561
Iterating global reduction 2 with 13 rules applied. Total rules applied 208 place count 371 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 371 transition count 559
Applied a total of 210 rules in 15 ms. Remains 371 /467 variables (removed 96) and now considering 559/729 (removed 170) transitions.
// Phase 1: matrix 559 rows 371 cols
[2025-06-07 19:51:31] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:51:31] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-07 19:51:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:51:31] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 558 sub problems to find dead transitions.
[2025-06-07 19:51:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:51:40] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 559/930 variables, 371/409 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 930/930 variables, and 409 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 559/930 variables, 371/409 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/930 variables, 558/967 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:52:12] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/930 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:52:24] [INFO ] Deduced a trap along path composed of 11 places in 41 ms of which 0 ms to minimize.
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 930/930 variables, and 969 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 371/467 places, 559/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60578 ms. Remains : 371/467 places, 559/729 transitions.
[2025-06-07 19:52:31] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:52:31] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:52:31] [INFO ] Input system was already deterministic with 559 transitions.
[2025-06-07 19:52:31] [INFO ] Flatten gal took : 20 ms
[2025-06-07 19:52:31] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:52:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15804840116876033030.gal : 2 ms
[2025-06-07 19:52:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality1109436657940897206.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/CTLCardinality15804840116876033030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1109436657940897206.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-07 19:53:01] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:53:01] [INFO ] Applying decomposition
[2025-06-07 19:53:01] [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/graph12674368031937328366.txt' '-o' '/tmp/graph12674368031937328366.bin' '-w' '/tmp/graph12674368031937328366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12674368031937328366.bin' '-l' '-1' '-v' '-w' '/tmp/graph12674368031937328366.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:53:02] [INFO ] Decomposing Gal with order
[2025-06-07 19:53:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:53:02] [INFO ] Removed a total of 476 redundant transitions.
[2025-06-07 19:53:02] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:53:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2025-06-07 19:53:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16314607289347174509.gal : 4 ms
[2025-06-07 19:53:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10875444241232885537.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/CTLCardinality16314607289347174509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10875444241232885537.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.33579e+35,0.196822,11120,1087,30,12991,772,821,20763,66,1711,0


Converting to forward existential form...Done !
original formula: EX((E((i32.i0.u109.p661==0) U (((i11.u44.p319==0)||(i27.u92.p580==1))&&(i20.u66.p414==1))) * !(E((AG(((i33.i1.u121.p727==0)||(i6.u15.p99=...260
=> equivalent forward existential formula: [((EY(Init) * E((i32.i0.u109.p661==0) U (((i11.u44.p319==0)||(i27.u92.p580==1))&&(i20.u66.p414==1)))) * !(E((!(E...329
Reverse transition relation is NOT exact ! Due to transitions t7, t28, t47, t76, t117, t156, t208, t281, i0.i1.t189, i0.i1.u58.t193, i1.t306, i2.t347, i3.i...1029
(forward)formula 0,1,27.6571,695664,1,0,1.38066e+06,772,5378,2.91309e+06,340,1725,1418679
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Graph (trivial) has 437 edges and 467 vertex of which 61 / 467 are part of one of the 12 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 417 transition count 570
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 167 rules applied. Total rules applied 270 place count 315 transition count 505
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 34 rules applied. Total rules applied 304 place count 284 transition count 502
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 309 place count 281 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 310 place count 280 transition count 500
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 310 place count 280 transition count 487
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 336 place count 267 transition count 487
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 373 place count 230 transition count 425
Iterating global reduction 5 with 37 rules applied. Total rules applied 410 place count 230 transition count 425
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 415 place count 230 transition count 420
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 415 place count 230 transition count 408
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 439 place count 218 transition count 408
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 445 place count 212 transition count 371
Iterating global reduction 6 with 6 rules applied. Total rules applied 451 place count 212 transition count 371
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 457 place count 212 transition count 365
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 7 with 196 rules applied. Total rules applied 653 place count 114 transition count 267
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 654 place count 113 transition count 265
Iterating global reduction 7 with 1 rules applied. Total rules applied 655 place count 113 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 656 place count 113 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 658 place count 111 transition count 262
Applied a total of 658 rules in 36 ms. Remains 111 /467 variables (removed 356) and now considering 262/729 (removed 467) transitions.
[2025-06-07 19:53:29] [INFO ] Flow matrix only has 115 transitions (discarded 147 similar events)
// Phase 1: matrix 115 rows 111 cols
[2025-06-07 19:53:29] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:53:30] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-06-07 19:53:30] [INFO ] Flow matrix only has 115 transitions (discarded 147 similar events)
[2025-06-07 19:53:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:53:30] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:53:30] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2025-06-07 19:53:30] [INFO ] Flow matrix only has 115 transitions (discarded 147 similar events)
[2025-06-07 19:53:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 2/111 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 114/225 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/225 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/226 variables, and 148 constraints, problems are : Problem set: 0 solved, 189 unsolved in 5357 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 2/111 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 114/225 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 189/337 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:53:38] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/226 variables, and 338 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7631 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13019ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 13021ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/467 places, 262/729 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13487 ms. Remains : 111/467 places, 262/729 transitions.
[2025-06-07 19:53:43] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:53:43] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:53:43] [INFO ] Input system was already deterministic with 262 transitions.
[2025-06-07 19:53:43] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:53:43] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:53:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15043118155487722874.gal : 1 ms
[2025-06-07 19:53:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15282656950205083049.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/CTLCardinality15043118155487722874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15282656950205083049.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.25323e+17,0.049003,5504,2,189,5,2958,6,0,695,1414,0


Converting to forward existential form...Done !
original formula: EG(AG((((p234==0) + EG((p94!=1))) + (AF((E((p145==1) U ((p473==0)||(p720==1))) * AG((p317==0)))) + ((p500==0)&&(p129==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((((p234==0) + EG((p94!=1))) + (!(EG(!((E((p145==1) U ((p473==0)||(p720==1))) * !(E(TRUE ...216
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 260/0/2
Hit Full ! (commute/partial/dont) 260/0/2
Using saturation style SCC detection
(forward)formula 0,0,0.808723,33708,1,0,28,146002,44,15,3836,178034,21
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Graph (trivial) has 446 edges and 467 vertex of which 66 / 467 are part of one of the 12 SCC in 0 ms
Free SCC test removed 54 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 412 transition count 563
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 271 place count 310 transition count 497
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 303 place count 279 transition count 496
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 304 place count 278 transition count 496
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 304 place count 278 transition count 482
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 332 place count 264 transition count 482
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 371 place count 225 transition count 409
Iterating global reduction 4 with 39 rules applied. Total rules applied 410 place count 225 transition count 409
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 416 place count 225 transition count 403
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 416 place count 225 transition count 392
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 438 place count 214 transition count 392
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 444 place count 208 transition count 355
Iterating global reduction 5 with 6 rules applied. Total rules applied 450 place count 208 transition count 355
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 456 place count 208 transition count 349
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 6 with 200 rules applied. Total rules applied 656 place count 108 transition count 249
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 657 place count 107 transition count 247
Iterating global reduction 6 with 1 rules applied. Total rules applied 658 place count 107 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 659 place count 107 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 661 place count 105 transition count 244
Applied a total of 661 rules in 58 ms. Remains 105 /467 variables (removed 362) and now considering 244/729 (removed 485) transitions.
[2025-06-07 19:53:44] [INFO ] Flow matrix only has 101 transitions (discarded 143 similar events)
// Phase 1: matrix 101 rows 105 cols
[2025-06-07 19:53:44] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:53:44] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-07 19:53:44] [INFO ] Flow matrix only has 101 transitions (discarded 143 similar events)
[2025-06-07 19:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:53:44] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:53:44] [INFO ] Redundant transitions in 0 ms returned []
Running 169 sub problems to find dead transitions.
[2025-06-07 19:53:44] [INFO ] Flow matrix only has 101 transitions (discarded 143 similar events)
[2025-06-07 19:53:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 3/105 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 100/205 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/206 variables, and 142 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4518 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 3/105 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 100/205 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 169/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/206 variables, and 311 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4705 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9247ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 9248ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/467 places, 244/729 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9682 ms. Remains : 105/467 places, 244/729 transitions.
[2025-06-07 19:53:53] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:53:53] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:53:53] [INFO ] Input system was already deterministic with 244 transitions.
RANDOM walk for 143 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 19:53:53] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:53:53] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:53:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9372520821253350785.gal : 1 ms
[2025-06-07 19:53:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18082034728534358308.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/ReachabilityCardinality9372520821253350785.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18082034728534358308.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 729/729 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 414 transition count 642
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 414 transition count 642
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 116 place count 414 transition count 632
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 138 place count 392 transition count 587
Iterating global reduction 1 with 22 rules applied. Total rules applied 160 place count 392 transition count 587
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 166 place count 392 transition count 581
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 176 place count 382 transition count 571
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 382 transition count 571
Applied a total of 186 rules in 34 ms. Remains 382 /467 variables (removed 85) and now considering 571/729 (removed 158) transitions.
// Phase 1: matrix 571 rows 382 cols
[2025-06-07 19:53:54] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:53:54] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-07 19:53:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:53:54] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 570 sub problems to find dead transitions.
[2025-06-07 19:53: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/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:04] [INFO ] Deduced a trap composed of 26 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-07 19:54:05] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 4 (OVERLAPS) 571/953 variables, 382/421 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/953 variables, and 421 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 4 (OVERLAPS) 571/953 variables, 382/421 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 570/991 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:35] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:36] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:36] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:36] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:38] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:39] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:39] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:40] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 8/999 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:51] [INFO ] Deduced a trap along path composed of 9 places in 48 ms of which 1 ms to minimize.
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 953/953 variables, and 1000 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 382/467 places, 571/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60736 ms. Remains : 382/467 places, 571/729 transitions.
[2025-06-07 19:54:54] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:54:54] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:54:54] [INFO ] Input system was already deterministic with 571 transitions.
[2025-06-07 19:54:54] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:54:54] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:54:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality884261103332431863.gal : 2 ms
[2025-06-07 19:54:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality16307611826899700101.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/CTLCardinality884261103332431863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16307611826899700101.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.51126e+35,0.616889,25092,2,3800,5,124245,6,0,2101,80183,0


Converting to forward existential form...Done !
original formula: (A(!((((p629==0) * AX(((p457==0)||(p351==1)))) * AF(((p63==0)||(p381==1))))) U (AG(EX((p658==0))) * ((p42==0)||(p633==1)))) * EG(((((p112...224
=> equivalent forward existential formula: [FwdG((Init * !((E(!((!(E(TRUE U !(EX((p658==0))))) * ((p42==0)||(p633==1)))) U (!(!((((p629==0) * !(EX(!(((p457...442
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t27, t31, t36, t40, t48, t51, t57, t58, t59, t63, t67, t72, t76, t81, t82, t86, t92,...603
Detected timeout of ITS tools.
[2025-06-07 19:55:24] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:55:24] [INFO ] Applying decomposition
[2025-06-07 19:55:24] [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/graph17243590311340679498.txt' '-o' '/tmp/graph17243590311340679498.bin' '-w' '/tmp/graph17243590311340679498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17243590311340679498.bin' '-l' '-1' '-v' '-w' '/tmp/graph17243590311340679498.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:55:24] [INFO ] Decomposing Gal with order
[2025-06-07 19:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:55:24] [INFO ] Removed a total of 455 redundant transitions.
[2025-06-07 19:55:24] [INFO ] Flatten gal took : 36 ms
[2025-06-07 19:55:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 19:55:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10502150018369771378.gal : 4 ms
[2025-06-07 19:55:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality13821805840008808651.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/CTLCardinality10502150018369771378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13821805840008808651.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.51126e+35,0.222374,13008,1157,34,17299,799,881,25328,72,1950,0


Converting to forward existential form...Done !
original formula: (A(!((((i30.i1.u105.p629==0) * AX(((i22.i3.u73.p457==0)||(i17.u56.p351==1)))) * AF(((i3.u12.p63==0)||(i18.u58.p381==1))))) U (AG(EX((i31....344
=> equivalent forward existential formula: [FwdG((Init * !((E(!((!(E(TRUE U !(EX((i31.u108.p658==0))))) * ((i2.u9.p42==0)||(i30.i1.u106.p633==1)))) U (!(!(...616
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t58, t81, t101, t120, t161, t216, t266, t372, i0.t227, i0.u48.t231, i1.i1.u6.t387, i...1058
Using 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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Detected timeout of ITS tools.
[2025-06-07 19:55:55] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:55:55] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:55:55] [INFO ] Applying decomposition
[2025-06-07 19:55:55] [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/graph16388711250111993500.txt' '-o' '/tmp/graph16388711250111993500.bin' '-w' '/tmp/graph16388711250111993500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16388711250111993500.bin' '-l' '-1' '-v' '-w' '/tmp/graph16388711250111993500.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:55:55] [INFO ] Decomposing Gal with order
[2025-06-07 19:55:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:55:55] [INFO ] Removed a total of 571 redundant transitions.
[2025-06-07 19:55:55] [INFO ] Flatten gal took : 38 ms
[2025-06-07 19:55:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 9 ms.
[2025-06-07 19:55:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality10214749377660361662.gal : 6 ms
[2025-06-07 19:55:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality17421057172592904443.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/CTLCardinality10214749377660361662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17421057172592904443.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 2 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,9.41606e+38,0.456667,20492,2170,41,32571,870,1061,58223,87,2251,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * (E((EF((((((i16.u77.p346==1)&&((i3.u12.p48==0)||(i15.u82.p366==1)))&&(((i24.u124.p585==0)||(i5.u24.p109==1))&&(i15.u79.p373==...438
=> equivalent forward existential formula: ((([((FwdU(FwdU((Init * EX(TRUE)),(E(TRUE U (((((i16.u77.p346==1)&&((i3.u12.p48==0)||(i15.u82.p366==1)))&&(((i24...1561
Reverse transition relation is NOT exact ! Due to transitions t7, t71, t121, t167, t266, t349, t448, i0.t416, i0.u21.t418, i1.u5.t467, i2.t455, i2.t290, i2...1323
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,20.6814,549644,1,0,1.06466e+06,1221,8555,1.47237e+06,484,3680,1302330
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(!((((i27.u133.p629==0) * AX(((i20.u102.p457==0)||(i16.u73.p351==1)))) * AF(((i3.u15.p63==0)||(i15.u83.p381==1))))) U (AG(EX((i26.u139....328
=> equivalent forward existential formula: [FwdG((Init * !((E(!((!(E(TRUE U !(EX((i26.u139.p658==0))))) * ((i2.u10.p42==0)||(i27.u135.p633==1)))) U (!(!(((...596
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 1,0,104.599,1988940,1,0,3.32787e+06,1345,8767,6.00165e+06,502,4307,3469010
FORMULA Champagne-PT-H08T0R-CTLCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 950887 ms.

BK_STOP 1749326260186

--------------------
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="Champagne-PT-H08T0R"
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 Champagne-PT-H08T0R, 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 r254-tall-174931339300097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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