Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 613K May 29 14:33 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 StigmergyCommit-PT-05a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2023-15
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-05a-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749062624902

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 18:43:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 18:43:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 18:43:47] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2025-06-04 18:43:47] [INFO ] Transformed 220 places.
[2025-06-04 18:43:47] [INFO ] Transformed 1212 transitions.
[2025-06-04 18:43:47] [INFO ] Found NUPN structural information;
[2025-06-04 18:43:47] [INFO ] Parsed PT model containing 220 places and 1212 transitions and 11640 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 412/412 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 194 transition count 384
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 194 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 194 transition count 378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 191 transition count 374
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 191 transition count 374
Applied a total of 64 rules in 78 ms. Remains 191 /220 variables (removed 29) and now considering 374/412 (removed 38) transitions.
[2025-06-04 18:43:47] [INFO ] Flow matrix only has 361 transitions (discarded 13 similar events)
// Phase 1: matrix 361 rows 191 cols
[2025-06-04 18:43:47] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:43:48] [INFO ] Implicit Places using invariants in 485 ms returned []
[2025-06-04 18:43:48] [INFO ] Flow matrix only has 361 transitions (discarded 13 similar events)
[2025-06-04 18:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:43:48] [INFO ] State equation strengthened by 207 read => feed constraints.
[2025-06-04 18:43:49] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned [190]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1726 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/220 places, 374/412 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 184 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 183 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 183 transition count 365
Applied a total of 16 rules in 24 ms. Remains 183 /190 variables (removed 7) and now considering 365/374 (removed 9) transitions.
[2025-06-04 18:43:49] [INFO ] Flow matrix only has 352 transitions (discarded 13 similar events)
// Phase 1: matrix 352 rows 183 cols
[2025-06-04 18:43:49] [INFO ] Computed 3 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:43:49] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-04 18:43:49] [INFO ] Flow matrix only has 352 transitions (discarded 13 similar events)
[2025-06-04 18:43:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:43:49] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 18:43:49] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/220 places, 365/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2212 ms. Remains : 183/220 places, 365/412 transitions.
Support contains 84 out of 183 places after structural reductions.
[2025-06-04 18:43:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-04 18:43:50] [INFO ] Flatten gal took : 90 ms
[2025-06-04 18:43:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 18:43:50] [INFO ] Flatten gal took : 40 ms
[2025-06-04 18:43:50] [INFO ] Input system was already deterministic with 365 transitions.
Support contains 67 out of 183 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (31 resets) in 3100 ms. (12 steps per ms) remains 1/48 properties
BEST_FIRST walk for 40004 steps (9 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
[2025-06-04 18:43:51] [INFO ] Flow matrix only has 352 transitions (discarded 13 similar events)
[2025-06-04 18:43:51] [INFO ] Invariant cache hit.
[2025-06-04 18:43:51] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:51] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 63/183 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 351/534 variables, 183/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 130/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/535 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 183/183 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:52] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:52] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:52] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:53] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:53] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:53] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:53] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Int declared 120/535 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/183 constraints, ReadFeed: 0/131 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1944ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2025-06-04 18:43:53] [INFO ] Flatten gal took : 24 ms
[2025-06-04 18:43:53] [INFO ] Flatten gal took : 26 ms
[2025-06-04 18:43:53] [INFO ] Input system was already deterministic with 365 transitions.
Support contains 57 out of 183 places (down from 65) after GAL structural reductions.
Computed a total of 35 stabilizing places and 35 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 156 transition count 333
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 156 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 156 transition count 332
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 134 transition count 306
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 134 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 105 place count 134 transition count 300
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 117 place count 122 transition count 288
Iterating global reduction 2 with 12 rules applied. Total rules applied 129 place count 122 transition count 288
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 138 place count 113 transition count 279
Iterating global reduction 2 with 9 rules applied. Total rules applied 147 place count 113 transition count 279
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 104 transition count 270
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 104 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 170 place count 99 transition count 265
Iterating global reduction 2 with 5 rules applied. Total rules applied 175 place count 99 transition count 265
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 178 place count 99 transition count 262
Applied a total of 178 rules in 27 ms. Remains 99 /183 variables (removed 84) and now considering 262/365 (removed 103) transitions.
[2025-06-04 18:43:53] [INFO ] Flow matrix only has 255 transitions (discarded 7 similar events)
// Phase 1: matrix 255 rows 99 cols
[2025-06-04 18:43:53] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:43:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 18:43:53] [INFO ] Flow matrix only has 255 transitions (discarded 7 similar events)
[2025-06-04 18:43:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:43:53] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 18:43:53] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-06-04 18:43:53] [INFO ] Flow matrix only has 255 transitions (discarded 7 similar events)
[2025-06-04 18:43:53] [INFO ] Invariant cache hit.
[2025-06-04 18:43:53] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:56] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:57] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:43:59] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:00] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:00] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:00] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:00] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:00] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:01] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:02] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:02] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:02] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:04] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 254/353 variables, 99/155 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 130/285 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:11] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:14] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:14] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 30616ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 30628ms
Starting structural reductions in LTL mode, iteration 1 : 99/183 places, 262/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30919 ms. Remains : 99/183 places, 262/365 transitions.
[2025-06-04 18:44:24] [INFO ] Flatten gal took : 19 ms
[2025-06-04 18:44:24] [INFO ] Flatten gal took : 21 ms
[2025-06-04 18:44:24] [INFO ] Input system was already deterministic with 262 transitions.
[2025-06-04 18:44:24] [INFO ] Flatten gal took : 15 ms
[2025-06-04 18:44:24] [INFO ] Flatten gal took : 15 ms
[2025-06-04 18:44:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8882663105846355365.gal : 15 ms
[2025-06-04 18:44:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality676610174024010936.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8882663105846355365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality676610174024010936.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,167946,0.322717,11032,2,1767,5,18476,6,0,651,12417,0


Converting to forward existential form...Done !
original formula: (AG(EX(AX((((p7!=0)&&(p131!=1))||(p197!=1))))) + AG(((AX(AF(EG(((p27==0)||(p49==1))))) + ((p197==0)&&(p0==1))) + (((p11==0) + AF(((p65==0...190
=> equivalent forward existential formula: ([FwdG(((FwdU((Init * !(!(E(TRUE U !(EX(!(EX(!((((p7!=0)&&(p131!=1))||(p197!=1))))))))))),TRUE) * !((!(EX(!(!(EG...462
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t32,...427
Using saturation style SCC detection
(forward)formula 0,1,1.96776,45948,1,0,395,138434,556,128,6931,114333,580
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 182 transition count 251
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 132 rules applied. Total rules applied 245 place count 69 transition count 232
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 253 place count 66 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 255 place count 64 transition count 227
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 255 place count 64 transition count 216
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 277 place count 53 transition count 216
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 286 place count 44 transition count 202
Iterating global reduction 4 with 9 rules applied. Total rules applied 295 place count 44 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 44 transition count 201
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 300 place count 40 transition count 193
Iterating global reduction 5 with 4 rules applied. Total rules applied 304 place count 40 transition count 193
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 334 place count 40 transition count 163
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 344 place count 35 transition count 158
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 6 with 36 rules applied. Total rules applied 380 place count 35 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 384 place count 33 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 386 place count 33 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 8 with 62 rules applied. Total rules applied 448 place count 33 transition count 56
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 460 place count 27 transition count 50
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 464 place count 27 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 465 place count 27 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 466 place count 27 transition count 48
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 470 place count 23 transition count 44
Applied a total of 470 rules in 90 ms. Remains 23 /183 variables (removed 160) and now considering 44/365 (removed 321) transitions.
[2025-06-04 18:44:26] [INFO ] Flow matrix only has 38 transitions (discarded 6 similar events)
// Phase 1: matrix 38 rows 23 cols
[2025-06-04 18:44:26] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:44:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-04 18:44:26] [INFO ] Flow matrix only has 38 transitions (discarded 6 similar events)
[2025-06-04 18:44:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:44:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:44:26] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:44:26] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2025-06-04 18:44:26] [INFO ] Flow matrix only has 38 transitions (discarded 6 similar events)
[2025-06-04 18:44:26] [INFO ] Invariant cache hit.
[2025-06-04 18:44:26] [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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 6/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 37/60 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/61 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/61 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 55 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 6/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:29] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:29] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 37/60 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 28/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/61 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/61 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 86 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3274ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 3274ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/183 places, 44/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3486 ms. Remains : 23/183 places, 44/365 transitions.
[2025-06-04 18:44:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:44:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:44:30] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-04 18:44:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:44:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:44:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality1294762615877984074.gal : 2 ms
[2025-06-04 18:44:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality8460325665558154559.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/CTLCardinality1294762615877984074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8460325665558154559.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((EG((p128==0)) + ((p154==0)&&(p98==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p154==0)&&(p98==1)))) * !(EG((p128==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t28, t29, t30, t31, t32, t33, Intersection with...235
(forward)formula 0,0,0.033399,4656,1,0,87,2884,105,38,1070,2567,99
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 151 transition count 328
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 151 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 151 transition count 327
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 92 place count 124 transition count 296
Iterating global reduction 1 with 27 rules applied. Total rules applied 119 place count 124 transition count 296
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 128 place count 124 transition count 287
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 144 place count 108 transition count 271
Iterating global reduction 2 with 16 rules applied. Total rules applied 160 place count 108 transition count 271
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 172 place count 96 transition count 259
Iterating global reduction 2 with 12 rules applied. Total rules applied 184 place count 96 transition count 259
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 196 place count 84 transition count 247
Iterating global reduction 2 with 12 rules applied. Total rules applied 208 place count 84 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 209 place count 84 transition count 246
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 217 place count 76 transition count 238
Iterating global reduction 3 with 8 rules applied. Total rules applied 225 place count 76 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 230 place count 76 transition count 233
Applied a total of 230 rules in 18 ms. Remains 76 /183 variables (removed 107) and now considering 233/365 (removed 132) transitions.
[2025-06-04 18:44:30] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2025-06-04 18:44:30] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:44:30] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-04 18:44:30] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2025-06-04 18:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:44:30] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 18:44:30] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2025-06-04 18:44:30] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2025-06-04 18:44:30] [INFO ] Invariant cache hit.
[2025-06-04 18:44:30] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:32] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:32] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:32] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:32] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:32] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:32] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:32] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:33] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:34] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:35] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:35] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:35] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:35] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:36] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:37] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:37] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:37] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:37] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:37] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:37] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:37] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:38] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:38] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:38] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:38] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 225/301 variables, 76/131 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 130/261 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 1/302 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:44:48] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (OVERLAPS) 0/302 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 263 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 225/301 variables, 76/133 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 130/263 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 232/495 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:22] [INFO ] Deduced a trap along path composed of 6 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:29] [INFO ] Deduced a trap along path composed of 6 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/302 variables, and 497 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 130/131 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60384ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Starting structural reductions in LTL mode, iteration 1 : 76/183 places, 233/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60637 ms. Remains : 76/183 places, 233/365 transitions.
[2025-06-04 18:45:30] [INFO ] Flatten gal took : 12 ms
[2025-06-04 18:45:30] [INFO ] Flatten gal took : 11 ms
[2025-06-04 18:45:30] [INFO ] Input system was already deterministic with 233 transitions.
[2025-06-04 18:45:30] [INFO ] Flatten gal took : 12 ms
[2025-06-04 18:45:30] [INFO ] Flatten gal took : 12 ms
[2025-06-04 18:45:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7460714745677233148.gal : 5 ms
[2025-06-04 18:45:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1669466795486021646.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/CTLCardinality7460714745677233148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1669466795486021646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t56, t59,...372
(forward)formula 0,1,0.500033,15028,1,0,303,41365,473,92,5466,31658,464
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 182 transition count 248
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 138 rules applied. Total rules applied 254 place count 66 transition count 226
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 262 place count 62 transition count 222
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 262 place count 62 transition count 210
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 286 place count 50 transition count 210
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 296 place count 40 transition count 195
Iterating global reduction 3 with 10 rules applied. Total rules applied 306 place count 40 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 309 place count 40 transition count 192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 313 place count 36 transition count 184
Iterating global reduction 4 with 4 rules applied. Total rules applied 317 place count 36 transition count 184
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 347 place count 36 transition count 154
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 357 place count 31 transition count 149
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 393 place count 31 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 6 with 62 rules applied. Total rules applied 455 place count 31 transition count 51
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 467 place count 25 transition count 45
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 472 place count 20 transition count 40
Applied a total of 472 rules in 41 ms. Remains 20 /183 variables (removed 163) and now considering 40/365 (removed 325) transitions.
[2025-06-04 18:45:31] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
// Phase 1: matrix 34 rows 20 cols
[2025-06-04 18:45:31] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:45:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-04 18:45:31] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
[2025-06-04 18:45:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:45:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-04 18:45:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:45:31] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2025-06-04 18:45:31] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
[2025-06-04 18:45:31] [INFO ] Invariant cache hit.
[2025-06-04 18:45:31] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:31] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 33/53 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/54 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/54 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/54 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 64 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2441 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 33/53 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 39/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/54 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/54 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 103 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1347 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3799ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3799ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/183 places, 40/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3923 ms. Remains : 20/183 places, 40/365 transitions.
[2025-06-04 18:45:35] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:45:35] [INFO ] Flatten gal took : 1 ms
[2025-06-04 18:45:35] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-04 18:45:35] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:45:35] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:45:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality17546268978005338648.gal : 0 ms
[2025-06-04 18:45:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality10550762165696752752.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/CTLCardinality17546268978005338648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10550762165696752752.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,77,0.011566,4096,2,101,5,755,6,0,114,504,0


Converting to forward existential form...Done !
original formula: EG((p138==0))
=> equivalent forward existential formula: [FwdG(Init,(p138==0))] != FALSE
Hit Full ! (commute/partial/dont) 24/0/16
(forward)formula 0,0,0.021322,4352,1,0,7,1707,19,2,800,941,8
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 182 transition count 247
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 140 rules applied. Total rules applied 257 place count 65 transition count 224
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 267 place count 60 transition count 219
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 267 place count 60 transition count 208
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 289 place count 49 transition count 208
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 296 place count 42 transition count 196
Iterating global reduction 3 with 7 rules applied. Total rules applied 303 place count 42 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 304 place count 42 transition count 195
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 308 place count 38 transition count 187
Iterating global reduction 4 with 4 rules applied. Total rules applied 312 place count 38 transition count 187
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 342 place count 38 transition count 157
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 352 place count 33 transition count 152
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 388 place count 33 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 6 with 62 rules applied. Total rules applied 450 place count 33 transition count 54
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 462 place count 27 transition count 48
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 468 place count 21 transition count 42
Applied a total of 468 rules in 32 ms. Remains 21 /183 variables (removed 162) and now considering 42/365 (removed 323) transitions.
[2025-06-04 18:45:35] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 21 cols
[2025-06-04 18:45:35] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:45:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-04 18:45:35] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2025-06-04 18:45:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:45:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:45:35] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:45:35] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2025-06-04 18:45:35] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2025-06-04 18:45:35] [INFO ] Invariant cache hit.
[2025-06-04 18:45:35] [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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 35/56 variables, 21/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 0/57 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 53 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 35/56 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 28/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 82 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3177ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 3177ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/183 places, 42/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3281 ms. Remains : 21/183 places, 42/365 transitions.
[2025-06-04 18:45:38] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:45:38] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:45:38] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-04 18:45:38] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:45:38] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:45:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9319475098717543078.gal : 1 ms
[2025-06-04 18:45:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality10454220213540069862.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/CTLCardinality9319475098717543078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10454220213540069862.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,78,0.013123,4208,2,97,5,747,6,0,120,486,0


Converting to forward existential form...Done !
original formula: EG(AF((p59==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p59==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t17, t30, t31, t32, t33, Interse...245
(forward)formula 0,0,0.033037,4464,1,0,89,3007,104,37,1025,2681,94
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 154 transition count 331
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 154 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 154 transition count 330
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 81 place count 132 transition count 304
Iterating global reduction 1 with 22 rules applied. Total rules applied 103 place count 132 transition count 304
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 110 place count 132 transition count 297
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 123 place count 119 transition count 284
Iterating global reduction 2 with 13 rules applied. Total rules applied 136 place count 119 transition count 284
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 145 place count 110 transition count 275
Iterating global reduction 2 with 9 rules applied. Total rules applied 154 place count 110 transition count 275
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 163 place count 101 transition count 266
Iterating global reduction 2 with 9 rules applied. Total rules applied 172 place count 101 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 177 place count 96 transition count 261
Iterating global reduction 2 with 5 rules applied. Total rules applied 182 place count 96 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 96 transition count 258
Applied a total of 185 rules in 19 ms. Remains 96 /183 variables (removed 87) and now considering 258/365 (removed 107) transitions.
[2025-06-04 18:45:38] [INFO ] Flow matrix only has 250 transitions (discarded 8 similar events)
// Phase 1: matrix 250 rows 96 cols
[2025-06-04 18:45:38] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:45:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-04 18:45:38] [INFO ] Flow matrix only has 250 transitions (discarded 8 similar events)
[2025-06-04 18:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:45:38] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 18:45:39] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-06-04 18:45:39] [INFO ] Flow matrix only has 250 transitions (discarded 8 similar events)
[2025-06-04 18:45:39] [INFO ] Invariant cache hit.
[2025-06-04 18:45:39] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:41] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:41] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:41] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:41] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:41] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:43] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:44] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:45] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:46] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:46] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:47] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:48] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:48] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:48] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:49] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:50] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:50] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 249/345 variables, 96/149 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 130/279 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:55] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:45:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 14 (OVERLAPS) 1/346 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/346 variables, and 282 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:10] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 249/345 variables, 96/152 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 130/282 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 257/539 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:29] [INFO ] Deduced a trap along path composed of 7 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:36] [INFO ] Deduced a trap along path composed of 6 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/346 variables, and 541 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 130/131 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Starting structural reductions in LTL mode, iteration 1 : 96/183 places, 258/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60560 ms. Remains : 96/183 places, 258/365 transitions.
[2025-06-04 18:46:39] [INFO ] Flatten gal took : 10 ms
[2025-06-04 18:46:39] [INFO ] Flatten gal took : 10 ms
[2025-06-04 18:46:39] [INFO ] Input system was already deterministic with 258 transitions.
[2025-06-04 18:46:39] [INFO ] Flatten gal took : 10 ms
[2025-06-04 18:46:39] [INFO ] Flatten gal took : 11 ms
[2025-06-04 18:46:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality10398256114418598122.gal : 4 ms
[2025-06-04 18:46:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality9035073139210935457.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/CTLCardinality10398256114418598122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9035073139210935457.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,168709,0.264636,9788,2,1590,5,16502,6,0,632,10660,0


Converting to forward existential form...Done !
original formula: A((EF((((p188==1) * ((p187==1) + AX((p211==1)))) * AX(FALSE))) * ((p75!=1) + !(EF((p122==1))))) U A(AX(((p120==0) + EG(((p198==0)||(p75==...188
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((p164==1)||(p131==1))) U (!(!(EX(!(((p120==0) + EG(((p198==0)||(p75==1)))))))) * !(((p1...668
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t8, t9, t11, t13, t14, t16, t18, t19, t20, t21, t23, t24, t26, t28, t29, t32,...425
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.19437,58396,1,0,454,203087,553,160,6956,151958,677
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-07 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 : 183/183 places, 365/365 transitions.
Reduce places removed 1 places and 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 77 rules applied. Total rules applied 77 place count 182 transition count 287
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 89 rules applied. Total rules applied 166 place count 105 transition count 275
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 17 rules applied. Total rules applied 183 place count 101 transition count 262
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 192 place count 92 transition count 262
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 192 place count 92 transition count 250
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 216 place count 80 transition count 250
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 223 place count 73 transition count 239
Iterating global reduction 4 with 7 rules applied. Total rules applied 230 place count 73 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 73 transition count 238
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 234 place count 70 transition count 232
Iterating global reduction 5 with 3 rules applied. Total rules applied 237 place count 70 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 243 place count 70 transition count 226
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 253 place count 65 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 264 place count 65 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 266 place count 64 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 267 place count 64 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 8 with 102 rules applied. Total rules applied 369 place count 64 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 381 place count 58 transition count 100
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 392 place count 58 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 395 place count 58 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 396 place count 58 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 397 place count 57 transition count 95
Applied a total of 397 rules in 57 ms. Remains 57 /183 variables (removed 126) and now considering 95/365 (removed 270) transitions.
[2025-06-04 18:46:41] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 57 cols
[2025-06-04 18:46:41] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:46:41] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 18:46:41] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2025-06-04 18:46:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:46:41] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-04 18:46:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:46:41] [INFO ] Redundant transitions in 2 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-04 18:46:41] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2025-06-04 18:46:41] [INFO ] Invariant cache hit.
[2025-06-04 18:46:41] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 4/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:42] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:43] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:44] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:44] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:44] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:44] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 87/144 variables, 57/102 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 27/129 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:45] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:46] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:46] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 1/145 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/145 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 133 constraints, problems are : Problem set: 0 solved, 91 unsolved in 8269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 87/144 variables, 57/105 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 27/132 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 91/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:54] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:46:54] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 1/145 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 226 constraints, problems are : Problem set: 0 solved, 91 unsolved in 12220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20518ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 20519ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/183 places, 95/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20747 ms. Remains : 57/183 places, 95/365 transitions.
[2025-06-04 18:47:02] [INFO ] Flatten gal took : 4 ms
[2025-06-04 18:47:02] [INFO ] Flatten gal took : 4 ms
[2025-06-04 18:47:02] [INFO ] Input system was already deterministic with 95 transitions.
[2025-06-04 18:47:02] [INFO ] Flatten gal took : 4 ms
[2025-06-04 18:47:02] [INFO ] Flatten gal took : 4 ms
[2025-06-04 18:47:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality8136761971937665330.gal : 2 ms
[2025-06-04 18:47:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality5387800575256419874.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/CTLCardinality8136761971937665330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5387800575256419874.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (E(EG(!(AG(((p176==1)||(p35==1))))) U ((AF((p119==0)) + (p71==0)) + (p141==1))) * EG((AF(((((p204==1)||(p205==1))||((p170==0)||(p10==1)))...369
=> equivalent forward existential formula: [FwdG((Init * E(EG(!(!(E(TRUE U !(((p176==1)||(p35==1))))))) U ((!(EG(!((p119==0)))) + (p71==0)) + (p141==1)))),...487
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t35, t42, t44, t45, t47, t49, t52, t54, t56, t57, t58, t6...296
(forward)formula 0,1,0.172537,8760,1,0,181,19702,246,89,2633,18057,263
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 154 transition count 332
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 154 transition count 332
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 83 place count 129 transition count 304
Iterating global reduction 0 with 25 rules applied. Total rules applied 108 place count 129 transition count 304
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 117 place count 129 transition count 295
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 131 place count 115 transition count 281
Iterating global reduction 1 with 14 rules applied. Total rules applied 145 place count 115 transition count 281
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 155 place count 105 transition count 271
Iterating global reduction 1 with 10 rules applied. Total rules applied 165 place count 105 transition count 271
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 175 place count 95 transition count 261
Iterating global reduction 1 with 10 rules applied. Total rules applied 185 place count 95 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 186 place count 95 transition count 260
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 193 place count 88 transition count 253
Iterating global reduction 2 with 7 rules applied. Total rules applied 200 place count 88 transition count 253
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 204 place count 88 transition count 249
Applied a total of 204 rules in 13 ms. Remains 88 /183 variables (removed 95) and now considering 249/365 (removed 116) transitions.
[2025-06-04 18:47:02] [INFO ] Flow matrix only has 241 transitions (discarded 8 similar events)
// Phase 1: matrix 241 rows 88 cols
[2025-06-04 18:47:02] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:47:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-04 18:47:02] [INFO ] Flow matrix only has 241 transitions (discarded 8 similar events)
[2025-06-04 18:47:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:47:02] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 18:47:02] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-04 18:47:02] [INFO ] Flow matrix only has 241 transitions (discarded 8 similar events)
[2025-06-04 18:47:02] [INFO ] Invariant cache hit.
[2025-06-04 18:47:02] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:05] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:06] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:09] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:09] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:10] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:10] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:10] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:10] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:11] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:13] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:13] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (OVERLAPS) 240/328 variables, 88/147 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 1/329 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 329/329 variables, and 278 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 240/328 variables, 88/147 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 248/525 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:47:51] [INFO ] Deduced a trap along path composed of 6 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:01] [INFO ] Deduced a trap along path composed of 6 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 2/527 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/329 variables, and 527 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 130/131 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Starting structural reductions in LTL mode, iteration 1 : 88/183 places, 249/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 88/183 places, 249/365 transitions.
[2025-06-04 18:48:03] [INFO ] Flatten gal took : 8 ms
[2025-06-04 18:48:03] [INFO ] Flatten gal took : 8 ms
[2025-06-04 18:48:03] [INFO ] Input system was already deterministic with 249 transitions.
[2025-06-04 18:48:03] [INFO ] Flatten gal took : 9 ms
[2025-06-04 18:48:03] [INFO ] Flatten gal took : 9 ms
[2025-06-04 18:48:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15931766806663203307.gal : 4 ms
[2025-06-04 18:48:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality11109835616775053989.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/CTLCardinality15931766806663203307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11109835616775053989.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,169981,0.12681,6908,2,1102,5,7236,6,0,593,5133,0


Converting to forward existential form...Done !
original formula: E((p73==1) U AX((AG((p51==0)) + AG(A((p107==0) U (p192==0))))))
=> equivalent forward existential formula: [(FwdU(Init,(p73==1)) * !(EX(!((!(E(TRUE U !((p51==0)))) + !(E(TRUE U !(!((E(!((p192==0)) U (!((p107==0)) * !((p...204
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t22, t24, t26, t27, t29, t31, t32,...420
Hit Full ! (commute/partial/dont) 246/0/3
(forward)formula 0,1,1.4338,40828,1,0,406,129269,530,134,6127,106472,604
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 155 transition count 333
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 155 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 155 transition count 332
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 133 transition count 307
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 133 transition count 307
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 107 place count 133 transition count 301
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 121 place count 119 transition count 287
Iterating global reduction 2 with 14 rules applied. Total rules applied 135 place count 119 transition count 287
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 144 place count 110 transition count 278
Iterating global reduction 2 with 9 rules applied. Total rules applied 153 place count 110 transition count 278
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 161 place count 102 transition count 270
Iterating global reduction 2 with 8 rules applied. Total rules applied 169 place count 102 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 102 transition count 269
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 175 place count 97 transition count 264
Iterating global reduction 3 with 5 rules applied. Total rules applied 180 place count 97 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 182 place count 97 transition count 262
Applied a total of 182 rules in 16 ms. Remains 97 /183 variables (removed 86) and now considering 262/365 (removed 103) transitions.
[2025-06-04 18:48:04] [INFO ] Flow matrix only has 254 transitions (discarded 8 similar events)
// Phase 1: matrix 254 rows 97 cols
[2025-06-04 18:48:04] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:48:04] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 18:48:04] [INFO ] Flow matrix only has 254 transitions (discarded 8 similar events)
[2025-06-04 18:48:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:48:04] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 18:48:04] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-06-04 18:48:04] [INFO ] Flow matrix only has 254 transitions (discarded 8 similar events)
[2025-06-04 18:48:04] [INFO ] Invariant cache hit.
[2025-06-04 18:48:04] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:07] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:07] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:07] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:07] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:07] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:08] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:09] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:10] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:11] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:11] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:11] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:12] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:12] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:13] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:13] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:13] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:13] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:14] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:16] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:17] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:17] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:17] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 253/350 variables, 97/156 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 130/286 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:48:23] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 14 (OVERLAPS) 1/351 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 351/351 variables, and 288 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 253/350 variables, 97/157 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 130/287 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 261/548 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:03] [INFO ] Deduced a trap along path composed of 6 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:03] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/351 variables, and 550 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 130/131 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Starting structural reductions in LTL mode, iteration 1 : 97/183 places, 262/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60559 ms. Remains : 97/183 places, 262/365 transitions.
[2025-06-04 18:49:05] [INFO ] Flatten gal took : 9 ms
[2025-06-04 18:49:05] [INFO ] Flatten gal took : 9 ms
[2025-06-04 18:49:05] [INFO ] Input system was already deterministic with 262 transitions.
[2025-06-04 18:49:05] [INFO ] Flatten gal took : 10 ms
[2025-06-04 18:49:05] [INFO ] Flatten gal took : 10 ms
[2025-06-04 18:49:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality15750129683882801406.gal : 3 ms
[2025-06-04 18:49:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality16456056400319356805.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/CTLCardinality15750129683882801406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16456056400319356805.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,169990,0.128586,6976,2,1050,5,7002,6,0,642,4870,0


Converting to forward existential form...Done !
original formula: AF((AG((p163==0)) + (((p49==0)&&(p5==1)) * (EX(AF((p71==1))) + A(((p157==0)||(p195==1)) U ((p54==0)||(p10==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p163==0)))) + (((p49==0)&&(p5==1)) * (EX(!(EG(!((p71==1))))) + !((E(!(((p54==0)||(p1...265
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t32,...447
(forward)formula 0,0,3.3285,83412,1,0,729,360601,560,335,6267,337873,963
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 182 transition count 248
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 137 rules applied. Total rules applied 253 place count 66 transition count 227
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 264 place count 62 transition count 220
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 270 place count 59 transition count 217
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 272 place count 58 transition count 216
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 272 place count 58 transition count 205
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 294 place count 47 transition count 205
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 301 place count 40 transition count 193
Iterating global reduction 5 with 7 rules applied. Total rules applied 308 place count 40 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 309 place count 40 transition count 192
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 313 place count 36 transition count 184
Iterating global reduction 6 with 4 rules applied. Total rules applied 317 place count 36 transition count 184
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 347 place count 36 transition count 154
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 357 place count 31 transition count 149
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 393 place count 31 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 8 with 62 rules applied. Total rules applied 455 place count 31 transition count 51
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 467 place count 25 transition count 45
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 473 place count 19 transition count 39
Applied a total of 473 rules in 24 ms. Remains 19 /183 variables (removed 164) and now considering 39/365 (removed 326) transitions.
[2025-06-04 18:49:08] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 19 cols
[2025-06-04 18:49:08] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:49:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-04 18:49:08] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2025-06-04 18:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:49:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 18:49:08] [INFO ] Implicit Places using invariants and state equation in 46 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-06-04 18:49:08] [INFO ] Redundant transitions in 1 ms returned []
Running 25 sub problems to find dead transitions.
[2025-06-04 18:49:08] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2025-06-04 18:49:08] [INFO ] Invariant cache hit.
[2025-06-04 18:49:08] [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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 32/51 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 32/51 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/52 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 76 constraints, problems are : Problem set: 0 solved, 25 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2539ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 2541ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/183 places, 39/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2658 ms. Remains : 19/183 places, 39/365 transitions.
[2025-06-04 18:49:11] [INFO ] Flatten gal took : 3 ms
[2025-06-04 18:49:11] [INFO ] Flatten gal took : 1 ms
[2025-06-04 18:49:11] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-04 18:49:11] [INFO ] Flatten gal took : 1 ms
[2025-06-04 18:49:11] [INFO ] Flatten gal took : 1 ms
[2025-06-04 18:49:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality14411347911359102610.gal : 0 ms
[2025-06-04 18:49:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4369229833207970214.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/CTLCardinality14411347911359102610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4369229833207970214.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,76,0.013446,4176,2,92,5,721,6,0,109,476,0


Converting to forward existential form...Done !
original formula: AF((p101==1))
=> equivalent forward existential formula: [FwdG(Init,!((p101==1)))] = FALSE
Hit Full ! (commute/partial/dont) 36/0/3
(forward)formula 0,0,0.024023,4304,1,0,8,1689,20,2,775,1140,8
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 182 transition count 252
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 133 rules applied. Total rules applied 245 place count 70 transition count 231
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 255 place count 66 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 257 place count 64 transition count 225
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 257 place count 64 transition count 214
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 279 place count 53 transition count 214
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 285 place count 47 transition count 204
Iterating global reduction 4 with 6 rules applied. Total rules applied 291 place count 47 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 292 place count 47 transition count 203
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 295 place count 44 transition count 197
Iterating global reduction 5 with 3 rules applied. Total rules applied 298 place count 44 transition count 197
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 312 place count 44 transition count 183
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 322 place count 39 transition count 178
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 342 place count 39 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 344 place count 38 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 345 place count 38 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 8 with 90 rules applied. Total rules applied 435 place count 38 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 447 place count 32 transition count 60
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 448 place count 32 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 449 place count 32 transition count 59
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 453 place count 28 transition count 55
Applied a total of 453 rules in 32 ms. Remains 28 /183 variables (removed 155) and now considering 55/365 (removed 310) transitions.
[2025-06-04 18:49:11] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
// Phase 1: matrix 47 rows 28 cols
[2025-06-04 18:49:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:49:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-04 18:49:11] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
[2025-06-04 18:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:49:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 18:49:11] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 18:49:11] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-04 18:49:11] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
[2025-06-04 18:49:11] [INFO ] Invariant cache hit.
[2025-06-04 18:49:11] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:11] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:12] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:13] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 46/74 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 1/75 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/75 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 70 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3533 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 46/74 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 54/124 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 1/75 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/75 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 125 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6505ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 6510ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/183 places, 55/365 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6641 ms. Remains : 28/183 places, 55/365 transitions.
[2025-06-04 18:49:18] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:49:18] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:49:18] [INFO ] Input system was already deterministic with 55 transitions.
[2025-06-04 18:49:18] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:49:18] [INFO ] Flatten gal took : 2 ms
[2025-06-04 18:49:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality1999130399156749199.gal : 0 ms
[2025-06-04 18:49:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality7683839983301003439.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/CTLCardinality1999130399156749199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7683839983301003439.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(A(E(EF(((p1==0)||(p107==1))) U (p202!=0)) U ((p134==0)||(p44==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((p134==0)||(p44==1))) U (!(E(E(TRUE U ((p1==0)||(p107==1))) U (p202!=0))) * !(((p134==0)||(p4...208
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t16, t21, t28, t37, t38, t39, t40, t41, t4...256
(forward)formula 0,1,0.060876,5204,1,0,121,5596,133,61,1385,5314,165
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 365/365 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 151 transition count 328
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 151 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 151 transition count 327
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 92 place count 124 transition count 296
Iterating global reduction 1 with 27 rules applied. Total rules applied 119 place count 124 transition count 296
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 128 place count 124 transition count 287
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 143 place count 109 transition count 272
Iterating global reduction 2 with 15 rules applied. Total rules applied 158 place count 109 transition count 272
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 168 place count 99 transition count 262
Iterating global reduction 2 with 10 rules applied. Total rules applied 178 place count 99 transition count 262
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 188 place count 89 transition count 252
Iterating global reduction 2 with 10 rules applied. Total rules applied 198 place count 89 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 89 transition count 251
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 205 place count 83 transition count 245
Iterating global reduction 3 with 6 rules applied. Total rules applied 211 place count 83 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 215 place count 83 transition count 241
Applied a total of 215 rules in 10 ms. Remains 83 /183 variables (removed 100) and now considering 241/365 (removed 124) transitions.
[2025-06-04 18:49:18] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
// Phase 1: matrix 234 rows 83 cols
[2025-06-04 18:49:18] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:49:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-04 18:49:18] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
[2025-06-04 18:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 18:49:18] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-04 18:49:18] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2025-06-04 18:49:18] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
[2025-06-04 18:49:18] [INFO ] Invariant cache hit.
[2025-06-04 18:49:18] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:20] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:20] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:20] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:20] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:21] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:22] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:23] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:23] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:23] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:23] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:23] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:24] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:24] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:25] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:25] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:25] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:25] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:25] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:26] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 233/316 variables, 83/134 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 130/264 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:30] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:49:34] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 1/317 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 1.0)
(t3 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/317 variables, and 267 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 233/316 variables, 83/136 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 130/266 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 240/506 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:05] [INFO ] Deduced a trap along path composed of 6 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:50:11] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/317 variables, and 508 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 130/131 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in LTL mode, iteration 1 : 83/183 places, 241/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60694 ms. Remains : 83/183 places, 241/365 transitions.
[2025-06-04 18:50:18] [INFO ] Flatten gal took : 7 ms
[2025-06-04 18:50:18] [INFO ] Flatten gal took : 8 ms
[2025-06-04 18:50:18] [INFO ] Input system was already deterministic with 241 transitions.
[2025-06-04 18:50:18] [INFO ] Flatten gal took : 8 ms
[2025-06-04 18:50:18] [INFO ] Flatten gal took : 9 ms
[2025-06-04 18:50:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4148609658525567417.gal : 4 ms
[2025-06-04 18:50:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality6784251728135295950.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/CTLCardinality4148609658525567417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6784251728135295950.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AG(AX((p205==1))) + EG(EF((p213==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!((p205==1))))))))] != FALSE + [FwdG(FwdU(Init,TRUE),E(TRUE U (p213==0)))...166
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t60, t63,...372
(forward)formula 0,1,1.93362,41376,1,0,354,107225,501,103,6569,88478,534
FORMULA StigmergyCommit-PT-05a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-04 18:50:20] [INFO ] Flatten gal took : 11 ms
[2025-06-04 18:50:20] [INFO ] Flatten gal took : 16 ms
Total runtime 394034 ms.

BK_STOP 1749063020901

--------------------
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="StigmergyCommit-PT-05a"
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 StigmergyCommit-PT-05a, 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 r226-smll-174903490600049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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