Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 97K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748605306730

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 11:41:47] [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-05-30 11:41:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:41:48] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-05-30 11:41:48] [INFO ] Transformed 383 places.
[2025-05-30 11:41:48] [INFO ] Transformed 454 transitions.
[2025-05-30 11:41:48] [INFO ] Found NUPN structural information;
[2025-05-30 11:41:48] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-06-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 276 transition count 334
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 55 place count 228 transition count 285
Iterating global reduction 1 with 48 rules applied. Total rules applied 103 place count 228 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 228 transition count 282
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 130 place count 204 transition count 258
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 204 transition count 258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 202 transition count 255
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 202 transition count 255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 201 transition count 254
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 201 transition count 254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 200 transition count 253
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 200 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 200 transition count 252
Applied a total of 163 rules in 74 ms. Remains 200 /283 variables (removed 83) and now considering 252/334 (removed 82) transitions.
// Phase 1: matrix 252 rows 200 cols
[2025-05-30 11:41:48] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:41:48] [INFO ] Implicit Places using invariants in 226 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 255 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/283 places, 252/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 348 ms. Remains : 199/283 places, 252/334 transitions.
Support contains 43 out of 199 places after structural reductions.
[2025-05-30 11:41:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 11:41:48] [INFO ] Flatten gal took : 39 ms
FORMULA CO4-PT-06-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:41:48] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:41:48] [INFO ] Input system was already deterministic with 252 transitions.
Support contains 37 out of 199 places (down from 43) after GAL structural reductions.
RANDOM walk for 40000 steps (69 resets) in 1743 ms. (22 steps per ms) remains 19/24 properties
BEST_FIRST walk for 4001 steps (25 resets) in 51 ms. (76 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (42 resets) in 31 ms. (125 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4001 steps (22 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (26 resets) in 52 ms. (75 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (36 resets) in 24 ms. (160 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4001 steps (29 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (33 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (26 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (44 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (20 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (30 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4001 steps (27 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (33 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (36 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (32 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
// Phase 1: matrix 252 rows 199 cols
[2025-05-30 11:41:49] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 19/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 71/114 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 134/248 variables, 43/89 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 137/385 variables, 73/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 58/443 variables, 34/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 11 (OVERLAPS) 8/451 variables, 6/202 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/451 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 202 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 10/29 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 10/39 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 63/102 variables, 39/42 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 129/231 variables, 39/82 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 13/95 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 146/377 variables, 76/171 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 65/442 variables, 38/209 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:51] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 9/451 variables, 7/217 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/451 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 217 constraints, problems are : Problem set: 1 solved, 14 unsolved in 2424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3513ms problems are : Problem set: 1 solved, 14 unsolved
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 14 properties in 728 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-05-30 11:41:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 11:41:53] [INFO ] Flatten gal took : 11 ms
FORMULA CO4-PT-06-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:41:53] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:41:53] [INFO ] Input system was already deterministic with 252 transitions.
Support contains 30 out of 199 places (down from 32) after GAL structural reductions.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 321 edges and 199 vertex of which 192 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 251
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 19 place count 181 transition count 235
Iterating global reduction 1 with 15 rules applied. Total rules applied 34 place count 181 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 181 transition count 233
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 176 transition count 228
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 176 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 174 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 174 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 173 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 173 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 172 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 172 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 172 transition count 222
Applied a total of 55 rules in 17 ms. Remains 172 /199 variables (removed 27) and now considering 222/252 (removed 30) transitions.
// Phase 1: matrix 222 rows 172 cols
[2025-05-30 11:41:53] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:41:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-30 11:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:41:54] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-05-30 11:41: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/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/394 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:58] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:58] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 177 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14762 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/394 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 221/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:42:16] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 399 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27793 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42598ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 42600ms
Starting structural reductions in LTL mode, iteration 1 : 172/199 places, 222/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42776 ms. Remains : 172/199 places, 222/252 transitions.
[2025-05-30 11:42:36] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:42:36] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:42:36] [INFO ] Input system was already deterministic with 222 transitions.
[2025-05-30 11:42:36] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:42:36] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:42:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality12959299757778526441.gal : 3 ms
[2025-05-30 11:42:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality9339184646221475326.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12959299757778526441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9339184646221475326.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,204351,0.117061,8060,2,822,5,15395,6,0,908,19363,0


Converting to forward existential form...Done !
original formula: EG(AX(AF(((p328==0)||(p235==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(((p328==0)||(p235==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t31, t33, t34, t35, t37, t38, t42, t43, t46, t156, t179, t206, ...255
(forward)formula 0,1,1.67877,68108,1,0,564,281337,471,355,5058,382128,751
FORMULA CO4-PT-06-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 251
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 20 place count 180 transition count 235
Iterating global reduction 1 with 16 rules applied. Total rules applied 36 place count 180 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 180 transition count 234
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 44 place count 173 transition count 226
Iterating global reduction 2 with 7 rules applied. Total rules applied 51 place count 173 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 170 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 170 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 169 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 169 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 168 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 168 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 168 transition count 219
Applied a total of 62 rules in 19 ms. Remains 168 /199 variables (removed 31) and now considering 219/252 (removed 33) transitions.
// Phase 1: matrix 219 rows 168 cols
[2025-05-30 11:42:38] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:42:38] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-05-30 11:42:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:42:38] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-30 11:42:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/387 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:42:43] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:42:43] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/387 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 173 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/387 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 218/391 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:43:00] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 392 constraints, problems are : Problem set: 0 solved, 218 unsolved in 28715 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42852ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 42854ms
Starting structural reductions in LTL mode, iteration 1 : 168/199 places, 219/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43223 ms. Remains : 168/199 places, 219/252 transitions.
[2025-05-30 11:43:21] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:43:21] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:43:21] [INFO ] Input system was already deterministic with 219 transitions.
[2025-05-30 11:43:21] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:43:21] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:43:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14102394191957713010.gal : 2 ms
[2025-05-30 11:43:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality3065106688911276509.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/CTLCardinality14102394191957713010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3065106688911276509.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,231867,0.087182,7348,2,741,5,12245,6,0,889,14510,0


Converting to forward existential form...Done !
original formula: AF(AX((p376==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((p376==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t18, t27, t32, t33, t35, t36, t40, t41, t44, t153, t176, t203, ...254
(forward)formula 0,0,1.15639,50784,1,0,455,164854,461,299,4977,302054,590
FORMULA CO4-PT-06-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 251
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 20 place count 180 transition count 234
Iterating global reduction 1 with 16 rules applied. Total rules applied 36 place count 180 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 180 transition count 232
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 45 place count 173 transition count 224
Iterating global reduction 2 with 7 rules applied. Total rules applied 52 place count 173 transition count 224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 170 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 170 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 169 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 169 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 168 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 168 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 168 transition count 217
Applied a total of 63 rules in 14 ms. Remains 168 /199 variables (removed 31) and now considering 217/252 (removed 35) transitions.
// Phase 1: matrix 217 rows 168 cols
[2025-05-30 11:43:22] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:43:23] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 11:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:43:23] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 11:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/385 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:43:27] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:43:27] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 173 constraints, problems are : Problem set: 0 solved, 216 unsolved in 13918 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/385 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 216/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:43:42] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 390 constraints, problems are : Problem set: 0 solved, 216 unsolved in 27301 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41245ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 41246ms
Starting structural reductions in LTL mode, iteration 1 : 168/199 places, 217/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41398 ms. Remains : 168/199 places, 217/252 transitions.
[2025-05-30 11:44:04] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:44:04] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:44:04] [INFO ] Input system was already deterministic with 217 transitions.
[2025-05-30 11:44:04] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:44:04] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:44:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality16553235236112702711.gal : 2 ms
[2025-05-30 11:44:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9657799996237358595.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/CTLCardinality16553235236112702711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9657799996237358595.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,181731,0.093653,7800,2,775,5,13504,6,0,887,16774,0


Converting to forward existential form...Done !
original formula: AG(EX(((p347==0)||(p255==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((p347==0)||(p255==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t152, t175, t202, Intersect...245
(forward)formula 0,0,0.501383,24004,1,0,272,71762,450,175,4795,73928,441
FORMULA CO4-PT-06-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 251
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 182 transition count 235
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 182 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 182 transition count 234
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 176 transition count 227
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 176 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 173 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 173 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 172 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 172 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 171 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 171 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 171 transition count 220
Applied a total of 57 rules in 11 ms. Remains 171 /199 variables (removed 28) and now considering 220/252 (removed 32) transitions.
// Phase 1: matrix 220 rows 171 cols
[2025-05-30 11:44:04] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:44:04] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 11:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:44:05] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-30 11:44:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/390 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:44:09] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:44:09] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 1/391 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/391 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 176 constraints, problems are : Problem set: 0 solved, 219 unsolved in 18342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/390 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 218/393 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:44:28] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 396 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48373ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 48373ms
Starting structural reductions in LTL mode, iteration 1 : 171/199 places, 220/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48519 ms. Remains : 171/199 places, 220/252 transitions.
[2025-05-30 11:44:53] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:44:53] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:44:53] [INFO ] Input system was already deterministic with 220 transitions.
[2025-05-30 11:44:53] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:44:53] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:44:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality11960407070727785895.gal : 1 ms
[2025-05-30 11:44:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4668556913341740070.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/CTLCardinality11960407070727785895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4668556913341740070.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,186087,0.097263,7860,2,780,5,13742,6,0,899,16545,0


Converting to forward existential form...Done !
original formula: EF((AG(E(((p273==0)||(p162==1)) U (p176==0))) + AX((((p112==0)&&(p277==1))||(p107==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(E(((p273==0)||(p162==1)) U (p176==0))))))] != FALSE + [(FwdU(Init,TRUE) * !(EX...208
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t153, t177, t204, Intersect...245
(forward)formula 0,1,1.05844,43948,1,0,291,230176,465,187,5162,169183,471
FORMULA CO4-PT-06-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 : 199/199 places, 252/252 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 251
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 21 place count 179 transition count 233
Iterating global reduction 1 with 17 rules applied. Total rules applied 38 place count 179 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 179 transition count 231
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 172 transition count 223
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 172 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 169 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 169 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 168 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 168 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 167 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 167 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 167 transition count 216
Applied a total of 65 rules in 11 ms. Remains 167 /199 variables (removed 32) and now considering 216/252 (removed 36) transitions.
// Phase 1: matrix 216 rows 167 cols
[2025-05-30 11:44:54] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:44:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-30 11:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:44:54] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-05-30 11:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:44:58] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:44:58] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14005 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:17] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 388 constraints, problems are : Problem set: 0 solved, 215 unsolved in 26976 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40998ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40998ms
Starting structural reductions in LTL mode, iteration 1 : 167/199 places, 216/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41169 ms. Remains : 167/199 places, 216/252 transitions.
[2025-05-30 11:45:35] [INFO ] Flatten gal took : 21 ms
[2025-05-30 11:45:35] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:45:35] [INFO ] Input system was already deterministic with 216 transitions.
[2025-05-30 11:45:35] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:45:35] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:45:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9423909260981441200.gal : 1 ms
[2025-05-30 11:45:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality10205620897674763878.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/CTLCardinality9423909260981441200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10205620897674763878.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,180279,0.089971,7520,2,766,5,12829,6,0,882,15697,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t151, t174, t201, Intersect...245
(forward)formula 0,1,1.18349,51340,1,0,445,173616,453,294,4925,297834,579
FORMULA CO4-PT-06-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 251
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 20 place count 180 transition count 234
Iterating global reduction 1 with 16 rules applied. Total rules applied 36 place count 180 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 180 transition count 232
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 174 transition count 225
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 174 transition count 225
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 171 transition count 221
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 171 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 170 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 170 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 169 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 169 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 169 transition count 218
Applied a total of 61 rules in 10 ms. Remains 169 /199 variables (removed 30) and now considering 218/252 (removed 34) transitions.
// Phase 1: matrix 218 rows 169 cols
[2025-05-30 11:45:36] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 11:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-30 11:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/387 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:41] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:41] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/387 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 175 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14567 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/387 variables, 169/175 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 217/392 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:45:56] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 393 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44597ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 44597ms
Starting structural reductions in LTL mode, iteration 1 : 169/199 places, 218/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44751 ms. Remains : 169/199 places, 218/252 transitions.
[2025-05-30 11:46:21] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:46:21] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:46:21] [INFO ] Input system was already deterministic with 218 transitions.
[2025-05-30 11:46:21] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:46:21] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:46:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality13361892451992214015.gal : 1 ms
[2025-05-30 11:46:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1629374844311022285.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/CTLCardinality13361892451992214015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1629374844311022285.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,182397,0.091738,7732,2,905,5,13247,6,0,892,16593,0


Converting to forward existential form...Done !
original formula: A(((p108==0)||(p276==1)) U ((p236==1) * ((EX(AF(EX(TRUE))) + (p215==0)) + (p295==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(((p236==1) * ((EX(!(EG(!(EX(TRUE))))) + (p215==0)) + (p295==1))))))) * !(E(!(((p236==1) * ((EX(...315
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t43, t56, t67, t76, t85, t127, t1...319
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.01902,231988,1,0,798,1.52141e+06,467,518,5263,1.53407e+06,927
FORMULA CO4-PT-06-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 251
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 21 place count 179 transition count 233
Iterating global reduction 1 with 17 rules applied. Total rules applied 38 place count 179 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 179 transition count 231
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 173 transition count 224
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 173 transition count 224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 170 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 170 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 169 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 169 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 168 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 168 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 168 transition count 217
Applied a total of 63 rules in 9 ms. Remains 168 /199 variables (removed 31) and now considering 217/252 (removed 35) transitions.
// Phase 1: matrix 217 rows 168 cols
[2025-05-30 11:46:27] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:27] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 11:46:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:27] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 11:46:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/385 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:32] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:32] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 173 constraints, problems are : Problem set: 0 solved, 216 unsolved in 14051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/385 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 216/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:47] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 390 constraints, problems are : Problem set: 0 solved, 216 unsolved in 27680 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41753ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 41753ms
Starting structural reductions in LTL mode, iteration 1 : 168/199 places, 217/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41899 ms. Remains : 168/199 places, 217/252 transitions.
[2025-05-30 11:47:09] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:47:09] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:47:09] [INFO ] Input system was already deterministic with 217 transitions.
[2025-05-30 11:47:09] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:47:09] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:47:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality2378097844780739510.gal : 1 ms
[2025-05-30 11:47:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality303670360072815714.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/CTLCardinality2378097844780739510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality303670360072815714.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,181731,0.090219,7672,2,765,5,13253,6,0,887,16062,0


Converting to forward existential form...Done !
original formula: EF(EX(AG((p116!=0))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((p116!=0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t151, t174, t201, Intersect...245
(forward)formula 0,0,0.61394,27800,1,0,270,107898,456,173,4944,86840,444
FORMULA CO4-PT-06-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Graph (trivial) has 210 edges and 199 vertex of which 2 / 199 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 320 edges and 198 vertex of which 191 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 190 transition count 168
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 114 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 113 transition count 165
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 159 place count 113 transition count 150
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 189 place count 98 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 95 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 95 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 95 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 196 place count 95 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 94 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 93 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 93 transition count 143
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 224 place count 81 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 228 place count 81 transition count 126
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 231 place count 80 transition count 124
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 6 with 3 rules applied. Total rules applied 234 place count 79 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 235 place count 78 transition count 122
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 237 place count 76 transition count 120
Iterating global reduction 8 with 2 rules applied. Total rules applied 239 place count 76 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 243 place count 76 transition count 116
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 244 place count 76 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 245 place count 75 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 247 place count 74 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 249 place count 72 transition count 112
Applied a total of 249 rules in 44 ms. Remains 72 /199 variables (removed 127) and now considering 112/252 (removed 140) transitions.
// Phase 1: matrix 112 rows 72 cols
[2025-05-30 11:47:10] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 11:47:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:47:10] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:47:10] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-05-30 11:47:10] [INFO ] Invariant cache hit.
[2025-05-30 11:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2964 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 102/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 178 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4236 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7214ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 7215ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/199 places, 112/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7354 ms. Remains : 72/199 places, 112/252 transitions.
[2025-05-30 11:47:17] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:47:17] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:47:17] [INFO ] Input system was already deterministic with 112 transitions.
[2025-05-30 11:47:17] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:47:17] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:47:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality17762241719962100057.gal : 0 ms
[2025-05-30 11:47:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality12723011831504945232.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/CTLCardinality17762241719962100057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12723011831504945232.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,9901,0.018971,4480,2,206,5,2164,6,0,393,2145,0


Converting to forward existential form...Done !
original formula: !(A((p144!=1) U (p336==1)))
=> equivalent forward existential formula: ([(FwdU(Init,!((p336==1))) * (!((p144!=1)) * !((p336==1))))] != FALSE + [FwdG(Init,!((p336==1)))] != FALSE)
Hit Full ! (commute/partial/dont) 110/0/2
(forward)formula 0,1,0.026872,4736,1,0,10,2317,19,3,732,2219,5
FORMULA CO4-PT-06-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Graph (trivial) has 210 edges and 199 vertex of which 2 / 199 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 320 edges and 198 vertex of which 191 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 190 transition count 167
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 113 transition count 164
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 112 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 111 transition count 163
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 163 place count 111 transition count 149
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 191 place count 97 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 94 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 94 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 198 place count 94 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 198 place count 94 transition count 143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 93 transition count 143
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 92 transition count 142
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 92 transition count 142
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 226 place count 80 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 230 place count 80 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 233 place count 79 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 236 place count 78 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 238 place count 77 transition count 120
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 240 place count 75 transition count 118
Iterating global reduction 9 with 2 rules applied. Total rules applied 242 place count 75 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 244 place count 74 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 248 place count 74 transition count 113
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 249 place count 74 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 250 place count 73 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 252 place count 72 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 254 place count 70 transition count 109
Applied a total of 254 rules in 31 ms. Remains 70 /199 variables (removed 129) and now considering 109/252 (removed 143) transitions.
// Phase 1: matrix 109 rows 70 cols
[2025-05-30 11:47:17] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:17] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 11:47:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:47:17] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:47:17] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2025-05-30 11:47:17] [INFO ] Invariant cache hit.
[2025-05-30 11:47:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 108/178 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/179 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 74 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2817 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 108/178 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 99/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/179 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 173 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3346 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6170ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 6170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/199 places, 109/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6295 ms. Remains : 70/199 places, 109/252 transitions.
[2025-05-30 11:47:24] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:47:24] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:47:24] [INFO ] Input system was already deterministic with 109 transitions.
[2025-05-30 11:47:24] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:47:24] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:47:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2407828562754570496.gal : 1 ms
[2025-05-30 11:47:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5431602961414456476.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2407828562754570496.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5431602961414456476.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5431602961414456476.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 31
Reachability property CO4-PT-06-CTLCardinality-2025-11 is true.
FORMULA CO4-PT-06-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,46,0.021029,4348,2,196,10,1142,6,0,382,460,0
Total reachable state count : 46

Verifying 1 reachability properties.
Reachability property CO4-PT-06-CTLCardinality-2025-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-06-CTLCardinality-2025-11,1,0.021592,4476,2,71,10,1142,7,0,385,460,0
RANDOM walk for 40000 steps (5490 resets) in 381 ms. (104 steps per ms) remains 1/1 properties
ITS tools runner thread asked to quit. Dying gracefully.
BEST_FIRST walk for 40003 steps (1019 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 430 steps, run visited all 1 properties in 9 ms. (steps per millisecond=47 )
Probabilistic random walk after 430 steps, saw 190 distinct states, run finished after 12 ms. (steps per millisecond=35 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 251
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 18 place count 182 transition count 236
Iterating global reduction 1 with 14 rules applied. Total rules applied 32 place count 182 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 182 transition count 234
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 177 transition count 229
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 177 transition count 229
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 175 transition count 226
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 175 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 174 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 174 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 173 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 173 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 173 transition count 223
Applied a total of 53 rules in 8 ms. Remains 173 /199 variables (removed 26) and now considering 223/252 (removed 29) transitions.
// Phase 1: matrix 223 rows 173 cols
[2025-05-30 11:47:24] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:24] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-30 11:47:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:24] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-05-30 11:47: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/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/396 variables, 173/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:47:28] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:47:28] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 178 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14727 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/396 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 222/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:47:44] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/396 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 401 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44767ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 44768ms
Starting structural reductions in LTL mode, iteration 1 : 173/199 places, 223/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45030 ms. Remains : 173/199 places, 223/252 transitions.
[2025-05-30 11:48:09] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:48:09] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:48:09] [INFO ] Input system was already deterministic with 223 transitions.
[2025-05-30 11:48:09] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:48:09] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:48:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality12134504143381661973.gal : 1 ms
[2025-05-30 11:48:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality10224145838857389135.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/CTLCardinality12134504143381661973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10224145838857389135.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,205971,0.093138,7728,2,787,5,13112,6,0,913,16247,0


Converting to forward existential form...Done !
original formula: EX(EG(EF((AF((p249==1)) + ((p331!=0)&&(p193!=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U (!(EG(!((p249==1)))) + ((p331!=0)&&(p193!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t32, t33, t34, t35, t37, t38, t42, t43, t46, t157, t180, t207, ...255
(forward)formula 0,1,5.8425,216280,1,0,748,1.25019e+06,479,429,5390,1.40518e+06,921
FORMULA CO4-PT-06-CTLCardinality-2024-12 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 : 199/199 places, 252/252 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 252
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 183 transition count 237
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 183 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 183 transition count 235
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 178 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 178 transition count 230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 177 transition count 229
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 177 transition count 229
Applied a total of 44 rules in 14 ms. Remains 177 /199 variables (removed 22) and now considering 229/252 (removed 23) transitions.
// Phase 1: matrix 229 rows 177 cols
[2025-05-30 11:48:15] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:48:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 11:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:48:15] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2025-05-30 11:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 229/405 variables, 176/179 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:48:19] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:48:20] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 1/406 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 182 constraints, problems are : Problem set: 0 solved, 228 unsolved in 18726 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/405 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 199/380 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:48:39] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/406 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 29/411 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 411 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48754ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 48754ms
Starting structural reductions in LTL mode, iteration 1 : 177/199 places, 229/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48900 ms. Remains : 177/199 places, 229/252 transitions.
[2025-05-30 11:49:04] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:49:04] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:49:04] [INFO ] Input system was already deterministic with 229 transitions.
[2025-05-30 11:49:04] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:49:04] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:49:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11616223521235919807.gal : 1 ms
[2025-05-30 11:49:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality10203095406834375848.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/CTLCardinality11616223521235919807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10203095406834375848.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,249731,0.098135,7880,2,808,5,13945,6,0,932,16667,0


Converting to forward existential form...Done !
original formula: A(!((EF(((p189==0)||(p357==1))) + AX(EG((p316==1))))) U !(EX(((AF((p207==1)) + AF((p277==0))) + ((p314==0)||(p331==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(((!(EG(!((p207==1)))) + !(EG(!((p277==0))))) + ((p314==0)||(p331==1))))))))) * !(E(!(!(EX(...395
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t15, t26, t33, t34, t35, t36, t38, t39, t44, t46, t50, t51, t54, t163, t1...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.62411,265004,1,0,1085,1.86215e+06,505,583,5811,1.60166e+06,1414
FORMULA CO4-PT-06-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Graph (trivial) has 211 edges and 199 vertex of which 2 / 199 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 320 edges and 198 vertex of which 191 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 190 transition count 167
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 113 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 112 transition count 164
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 161 place count 112 transition count 149
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 191 place count 97 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 94 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 94 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 94 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 198 place count 94 transition count 143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 93 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 92 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 92 transition count 142
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 226 place count 80 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 230 place count 80 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 233 place count 79 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 236 place count 78 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 238 place count 77 transition count 120
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 240 place count 75 transition count 118
Iterating global reduction 8 with 2 rules applied. Total rules applied 242 place count 75 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 244 place count 74 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 248 place count 74 transition count 113
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 249 place count 74 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 250 place count 73 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 252 place count 72 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 254 place count 70 transition count 109
Applied a total of 254 rules in 33 ms. Remains 70 /199 variables (removed 129) and now considering 109/252 (removed 143) transitions.
// Phase 1: matrix 109 rows 70 cols
[2025-05-30 11:49:11] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-30 11:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:49:11] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:49:12] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2025-05-30 11:49:12] [INFO ] Invariant cache hit.
[2025-05-30 11:49:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 108/178 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/179 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 74 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2760 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 108/178 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 99/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/179 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 173 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3502 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6268ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 6268ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/199 places, 109/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6397 ms. Remains : 70/199 places, 109/252 transitions.
[2025-05-30 11:49:18] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:49:18] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:49:18] [INFO ] Input system was already deterministic with 109 transitions.
[2025-05-30 11:49:18] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:49:18] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:49:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4608293738312057149.gal : 1 ms
[2025-05-30 11:49:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11904052750847695418.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/CTLCardinality4608293738312057149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11904052750847695418.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,7921,0.020969,4272,2,206,5,1597,6,0,382,1335,0


Converting to forward existential form...Done !
original formula: EG((p201==0))
=> equivalent forward existential formula: [FwdG(Init,(p201==0))] != FALSE
Hit Full ! (commute/partial/dont) 107/0/2
(forward)formula 0,1,0.053171,5808,1,0,8,9375,19,4,1756,5216,8
FORMULA CO4-PT-06-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 252/252 transitions.
Graph (trivial) has 211 edges and 199 vertex of which 2 / 199 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 320 edges and 198 vertex of which 191 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 190 transition count 168
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 114 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 113 transition count 165
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 159 place count 113 transition count 150
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 189 place count 98 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 95 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 95 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 95 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 196 place count 95 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 94 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 199 place count 93 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 93 transition count 143
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 224 place count 81 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 228 place count 81 transition count 126
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 231 place count 80 transition count 124
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 234 place count 79 transition count 122
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 236 place count 78 transition count 121
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 238 place count 76 transition count 119
Iterating global reduction 8 with 2 rules applied. Total rules applied 240 place count 76 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 242 place count 75 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 246 place count 75 transition count 114
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 247 place count 75 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 248 place count 74 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 250 place count 73 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 252 place count 71 transition count 110
Applied a total of 252 rules in 28 ms. Remains 71 /199 variables (removed 128) and now considering 110/252 (removed 142) transitions.
// Phase 1: matrix 110 rows 71 cols
[2025-05-30 11:49:18] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-30 11:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:49:18] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:49:18] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2025-05-30 11:49:18] [INFO ] Invariant cache hit.
[2025-05-30 11:49:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 109/180 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/181 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 75 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2907 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 109/180 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 100/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 1/181 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 175 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3407 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6322ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6322ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/199 places, 110/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6497 ms. Remains : 71/199 places, 110/252 transitions.
[2025-05-30 11:49:24] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:49:24] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:49:24] [INFO ] Input system was already deterministic with 110 transitions.
[2025-05-30 11:49:24] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:49:24] [INFO ] Flatten gal took : 2 ms
[2025-05-30 11:49:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality7383820253820808530.gal : 1 ms
[2025-05-30 11:49:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality14768065991569584682.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/CTLCardinality7383820253820808530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14768065991569584682.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,8065,0.022166,4408,2,214,5,1655,6,0,387,1369,0


Converting to forward existential form...Done !
original formula: AF(AG((p286==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p286==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t34, t37, t44, t49, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,0,0.095216,7864,1,0,144,18054,245,79,2370,14601,234
FORMULA CO4-PT-06-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-05-30 11:49:24] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:49:25] [INFO ] Flatten gal took : 5 ms
Total runtime 457093 ms.

BK_STOP 1748605765044

--------------------
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="CO4-PT-06"
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 CO4-PT-06, 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 r044-tall-174854028400417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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