About the Execution of ITS-Tools for MedleyA-PT-18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ????F?F??F???TF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200233.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200233
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 158K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748876177246
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 14:56:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 14:56:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 14:56:19] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2025-06-02 14:56:19] [INFO ] Transformed 252 places.
[2025-06-02 14:56:19] [INFO ] Transformed 543 transitions.
[2025-06-02 14:56:19] [INFO ] Found NUPN structural information;
[2025-06-02 14:56:19] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-18-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 124 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 238 transition count 518
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 238 transition count 518
Applied a total of 28 rules in 47 ms. Remains 238 /252 variables (removed 14) and now considering 518/541 (removed 23) transitions.
// Phase 1: matrix 518 rows 238 cols
[2025-06-02 14:56:19] [INFO ] Computed 7 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:56:20] [INFO ] Implicit Places using invariants in 595 ms returned []
[2025-06-02 14:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:56:21] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 517 sub problems to find dead transitions.
[2025-06-02 14:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:31] [INFO ] Deduced a trap composed of 14 places in 298 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:32] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:32] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:32] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:32] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:33] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:33] [INFO ] Deduced a trap composed of 35 places in 314 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:33] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:34] [INFO ] Deduced a trap composed of 35 places in 367 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:34] [INFO ] Deduced a trap composed of 139 places in 308 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:34] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:35] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:36] [INFO ] Deduced a trap composed of 144 places in 239 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:36] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:37] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:37] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:37] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:37] [INFO ] Deduced a trap composed of 139 places in 246 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:38] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:38] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:39] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:39] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:40] [INFO ] Deduced a trap composed of 37 places in 308 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:41] [INFO ] Deduced a trap composed of 29 places in 312 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:41] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:41] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:42] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:42] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:42] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:42] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:43] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:43] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:44] [INFO ] Deduced a trap composed of 27 places in 368 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:44] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:44] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:45] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:45] [INFO ] Deduced a trap composed of 22 places in 323 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:45] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:46] [INFO ] Deduced a trap composed of 116 places in 318 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:46] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/756 variables, and 47 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:57] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:59] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:59] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:56:59] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:00] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:00] [INFO ] Deduced a trap composed of 108 places in 349 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:01] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:01] [INFO ] Deduced a trap composed of 143 places in 236 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:01] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:02] [INFO ] Deduced a trap composed of 117 places in 320 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:03] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:03] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:07] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:07] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:08] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:15] [INFO ] Deduced a trap composed of 149 places in 291 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:16] [INFO ] Deduced a trap composed of 149 places in 288 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:17] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:17] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:17] [INFO ] Deduced a trap composed of 134 places in 251 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:18] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/756 variables, and 68 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 0/517 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60738ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 60767ms
Starting structural reductions in LTL mode, iteration 1 : 238/252 places, 518/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62100 ms. Remains : 238/252 places, 518/541 transitions.
Support contains 124 out of 238 places after structural reductions.
[2025-06-02 14:57:22] [INFO ] Flatten gal took : 166 ms
[2025-06-02 14:57:22] [INFO ] Flatten gal took : 91 ms
[2025-06-02 14:57:22] [INFO ] Input system was already deterministic with 518 transitions.
Support contains 113 out of 238 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (1531 resets) in 2321 ms. (17 steps per ms) remains 56/70 properties
BEST_FIRST walk for 4003 steps (32 resets) in 58 ms. (67 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 72 ms. (54 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 104 ms. (38 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 88 ms. (44 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (35 resets) in 56 ms. (70 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 56 ms. (70 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 32 ms. (121 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (32 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (35 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (44 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (35 resets) in 43 ms. (91 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (42 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (35 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (36 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (33 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (34 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (32 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (35 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (33 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (32 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (34 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (33 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (36 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (35 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (35 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
[2025-06-02 14:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 142/238 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 518/756 variables, 238/245 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 0/756 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 756/756 variables, and 245 constraints, problems are : Problem set: 0 solved, 56 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 142/238 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:28] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:28] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:28] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:28] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:29] [INFO ] Deduced a trap composed of 38 places in 252 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:29] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:29] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:29] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:30] [INFO ] Deduced a trap composed of 28 places in 356 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:30] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:30] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:31] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:31] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:31] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:31] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 24 ms to minimize.
Problem AtomicPropp39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:32] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:32] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 43 ms to minimize.
SMT process timed out in 8340ms, After SMT, problems are : Problem set: 1 solved, 55 unsolved
Fused 55 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 93 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 518/518 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 238 transition count 508
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 13 rules applied. Total rules applied 23 place count 228 transition count 505
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 225 transition count 505
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 26 place count 225 transition count 496
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 44 place count 216 transition count 496
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 49 place count 211 transition count 488
Iterating global reduction 3 with 5 rules applied. Total rules applied 54 place count 211 transition count 488
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 210 transition count 472
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 210 transition count 472
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 78 place count 199 transition count 461
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 199 transition count 459
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -19
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 102 place count 188 transition count 478
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 107 place count 188 transition count 473
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 186 transition count 471
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 186 transition count 471
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 184 transition count 469
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 129 place count 184 transition count 455
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 143 place count 170 transition count 455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 170 transition count 455
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 170 transition count 455
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 169 transition count 454
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 169 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 152 place count 169 transition count 451
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 168 transition count 450
Applied a total of 153 rules in 384 ms. Remains 168 /238 variables (removed 70) and now considering 450/518 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 168/238 places, 450/518 transitions.
RANDOM walk for 40000 steps (2269 resets) in 717 ms. (55 steps per ms) remains 44/55 properties
BEST_FIRST walk for 4004 steps (63 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (62 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (65 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (64 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (65 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (62 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (65 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (64 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (63 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (64 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (64 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (65 resets) in 30 ms. (129 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (69 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (64 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (67 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (66 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (64 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (64 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (65 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (64 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (71 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (65 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (83 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (65 resets) in 29 ms. (133 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4004 steps (67 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (65 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (65 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (65 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (68 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (65 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (64 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (66 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (66 resets) in 22 ms. (173 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (59 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (64 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (60 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (63 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (64 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (67 resets) in 43 ms. (90 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (61 resets) in 18 ms. (210 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4001 steps (83 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (64 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (62 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
// Phase 1: matrix 450 rows 168 cols
[2025-06-02 14:57:33] [INFO ] Computed 7 invariants in 5 ms
[2025-06-02 14:57:33] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 97/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 450/618 variables, 168/175 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 44/219 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/618 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 618/618 variables, and 219 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1517 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 97/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:35] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:35] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:35] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:36] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:36] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:36] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:36] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:36] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:36] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:37] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:37] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:37] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:38] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:38] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:39] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:39] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:39] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:40] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:40] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:40] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:40] [INFO ] Deduced a trap composed of 102 places in 263 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:41] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 450/618 variables, 168/197 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 44/241 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/618 variables, 41/282 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:43] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:50] [INFO ] Deduced a trap along path composed of 14 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:51] [INFO ] Deduced a trap along path composed of 17 places in 110 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:51] [INFO ] Deduced a trap along path composed of 14 places in 95 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:51] [INFO ] Deduced a trap along path composed of 21 places in 80 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:57:51] [INFO ] Deduced a trap along path composed of 19 places in 93 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/618 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/618 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:10] [INFO ] Deduced a trap composed of 30 places in 324 ms of which 31 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/618 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/618 variables, and 289 constraints, problems are : Problem set: 0 solved, 41 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 46562ms problems are : Problem set: 0 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 450/450 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 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 446
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 164 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 163 transition count 445
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 163 transition count 444
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 162 transition count 444
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 160 transition count 441
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 160 transition count 441
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 155 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 155 transition count 435
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 33 place count 152 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 152 transition count 436
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 39 place count 152 transition count 431
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 44 place count 147 transition count 431
Applied a total of 44 rules in 117 ms. Remains 147 /168 variables (removed 21) and now considering 431/450 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 147/168 places, 431/450 transitions.
RANDOM walk for 40000 steps (2739 resets) in 483 ms. (82 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4002 steps (78 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (77 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (79 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (82 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (83 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (85 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (80 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (83 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (84 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (84 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (84 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (85 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (82 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (85 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (80 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (84 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (84 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (80 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (82 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (87 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (78 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (106 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (80 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (88 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (84 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (83 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (88 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (80 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (82 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (84 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (82 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (82 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (82 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (82 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (82 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (80 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (82 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (108 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (86 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (82 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
Interrupted probabilistic random walk after 735561 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :38 out of 40
Probabilistic random walk after 735561 steps, saw 128615 distinct states, run finished after 3011 ms. (steps per millisecond=244 ) properties seen :38
[2025-06-02 14:58:23] [INFO ] Flow matrix only has 426 transitions (discarded 5 similar events)
// Phase 1: matrix 426 rows 147 cols
[2025-06-02 14:58:23] [INFO ] Computed 7 invariants in 6 ms
[2025-06-02 14:58:23] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 422/564 variables, 142/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 61/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 8/572 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/573 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/573 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/142 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:24] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:24] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:24] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:24] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:24] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:25] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:25] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:25] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 422/564 variables, 142/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 61/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/572 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:26] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:26] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/573 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:26] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:26] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:26] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:27] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/573 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/573 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 231 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3327 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3686ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 492 ms.
Support contains 12 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 431/431 transitions.
Graph (trivial) has 133 edges and 147 vertex of which 4 / 147 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 145 transition count 411
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 129 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 128 transition count 409
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 128 transition count 403
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 122 transition count 403
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 62 place count 108 transition count 374
Iterating global reduction 3 with 14 rules applied. Total rules applied 76 place count 108 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 108 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 108 transition count 372
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 107 transition count 372
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
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 101 place count 96 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 96 transition count 360
Performed 15 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 132 place count 81 transition count 422
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 140 place count 81 transition count 414
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 141 place count 80 transition count 410
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 80 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 150 place count 80 transition count 402
Free-agglomeration rule applied 13 times with reduction of 3 identical transitions.
Iterating global reduction 6 with 13 rules applied. Total rules applied 163 place count 80 transition count 386
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 37 rules applied. Total rules applied 200 place count 67 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 221 place count 67 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 223 place count 66 transition count 341
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 224 place count 66 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 227 place count 66 transition count 338
Applied a total of 227 rules in 165 ms. Remains 66 /147 variables (removed 81) and now considering 338/431 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 66/147 places, 338/431 transitions.
RANDOM walk for 40000 steps (2658 resets) in 731 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (775 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (763 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 56937 steps, run visited all 2 properties in 275 ms. (steps per millisecond=207 )
Probabilistic random walk after 56937 steps, saw 13110 distinct states, run finished after 283 ms. (steps per millisecond=201 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2025-06-02 14:58:28] [INFO ] Flatten gal took : 70 ms
[2025-06-02 14:58:28] [INFO ] Flatten gal took : 64 ms
[2025-06-02 14:58:28] [INFO ] Input system was already deterministic with 518 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 237 transition count 479
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 199 transition count 477
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 86 place count 198 transition count 470
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 93 place count 191 transition count 470
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 93 place count 191 transition count 460
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 113 place count 181 transition count 460
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 133 place count 161 transition count 424
Iterating global reduction 4 with 20 rules applied. Total rules applied 153 place count 161 transition count 424
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 153 place count 161 transition count 422
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 159 transition count 422
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 158 transition count 406
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 158 transition count 406
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 191 place count 142 transition count 390
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 139 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 139 transition count 384
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 137 transition count 380
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 137 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 210 place count 137 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 137 transition count 370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 136 transition count 370
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 4 with 10 rules applied. Total rules applied 222 place count 131 transition count 365
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 130 transition count 361
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 130 transition count 361
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 225 place count 129 transition count 359
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 129 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 129 transition count 358
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 230 place count 129 transition count 358
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 231 place count 128 transition count 357
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 128 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 128 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 234 place count 127 transition count 355
Applied a total of 234 rules in 119 ms. Remains 127 /238 variables (removed 111) and now considering 355/518 (removed 163) transitions.
// Phase 1: matrix 355 rows 127 cols
[2025-06-02 14:58:28] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:58:29] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 14:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:58:29] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 14:58:29] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:58:29] [INFO ] Redundant transitions in 31 ms returned []
Running 352 sub problems to find dead transitions.
[2025-06-02 14:58:29] [INFO ] Invariant cache hit.
[2025-06-02 14:58:29] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 3/127 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:34] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:35] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:35] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:35] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:35] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:35] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:35] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:36] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:36] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:36] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:36] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:36] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:37] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:37] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:37] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:37] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:37] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:37] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:38] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:38] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:40] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:41] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:41] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:42] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:43] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:43] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:43] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:44] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:45] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:49] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:51] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:58:51] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 10 (OVERLAPS) 355/482 variables, 127/166 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/482 variables, 74/240 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 240 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (OVERLAPS) 3/127 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 6 (OVERLAPS) 355/482 variables, 127/166 constraints. Problems are: Problem set: 42 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 74/240 constraints. Problems are: Problem set: 42 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 310/550 constraints. Problems are: Problem set: 42 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:59:12] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 1/551 constraints. Problems are: Problem set: 42 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 551 constraints, problems are : Problem set: 42 solved, 310 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 310/352 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60255ms problems are : Problem set: 42 solved, 310 unsolved
Search for dead transitions found 42 dead transitions in 60258ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 127/238 places, 313/518 transitions.
Applied a total of 0 rules in 13 ms. Remains 127 /127 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:59:29] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60843 ms. Remains : 127/238 places, 313/518 transitions.
[2025-06-02 14:59:29] [INFO ] Flatten gal took : 44 ms
[2025-06-02 14:59:29] [INFO ] Flatten gal took : 27 ms
[2025-06-02 14:59:29] [INFO ] Input system was already deterministic with 313 transitions.
[2025-06-02 14:59:29] [INFO ] Flatten gal took : 25 ms
[2025-06-02 14:59:29] [INFO ] Flatten gal took : 23 ms
[2025-06-02 14:59:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality3902017465843945953.gal : 27 ms
[2025-06-02 14:59:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality13646538870121998673.ctl : 8 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/CTLCardinality3902017465843945953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13646538870121998673.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,3.86983e+06,28.305,589636,2,32847,5,1.15405e+06,6,0,821,1.40443e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 15:00:00] [INFO ] Flatten gal took : 15 ms
[2025-06-02 15:00:00] [INFO ] Applying decomposition
[2025-06-02 15:00:00] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11094317156855728279.txt' '-o' '/tmp/graph11094317156855728279.bin' '-w' '/tmp/graph11094317156855728279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11094317156855728279.bin' '-l' '-1' '-v' '-w' '/tmp/graph11094317156855728279.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:00:00] [INFO ] Decomposing Gal with order
[2025-06-02 15:00:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:00:00] [INFO ] Removed a total of 438 redundant transitions.
[2025-06-02 15:00:00] [INFO ] Flatten gal took : 102 ms
[2025-06-02 15:00:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 17 ms.
[2025-06-02 15:00:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality3447237330115736718.gal : 11 ms
[2025-06-02 15:00:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17297864829383406297.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/CTLCardinality3447237330115736718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17297864829383406297.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.86983e+06,0.897929,25364,817,1199,20616,42562,757,33592,262,51225,0
Converting to forward existential form...Done !
original formula: !(A(((EG(((((((i5.i0.u15.p163==0)||(i0.u5.p49==1))&&(i6.u23.p182==1))||(i5.i1.u17.p152==0))||((i1.u3.p29==1)||(i1.u3.p32==0)))||(i8.i0.u3...572
=> equivalent forward existential formula: ([((((FwdU(Init,!(!(((!((!((i5.i1.u17.p134==0)||(i1.u3.p42==1)))||(((i3.u12.p79==0)||(i4.u2.p9==1))&&((i8.i1.u24...1014
Reverse transition relation is NOT exact ! Due to transitions t13, t53, t57, t101, t106, t108, t109, t110, t113, t114, t119, t139, t141, t143, t144, t149, ...1074
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 204 transition count 462
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 202 transition count 460
Applied a total of 72 rules in 11 ms. Remains 202 /238 variables (removed 36) and now considering 460/518 (removed 58) transitions.
// Phase 1: matrix 460 rows 202 cols
[2025-06-02 15:00:30] [INFO ] Computed 7 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:00:30] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-06-02 15:00:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:00:31] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 15:00:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:41] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:41] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:41] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:41] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:41] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:42] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:42] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:42] [INFO ] Deduced a trap composed of 125 places in 244 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:43] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:43] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:44] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:44] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:45] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:45] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:45] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:45] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:46] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:46] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:46] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:47] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:48] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:48] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:49] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:49] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:49] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:49] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:50] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:50] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:50] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:51] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:51] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:51] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:51] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:53] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:53] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:53] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:00:58] [INFO ] Deduced a trap composed of 125 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:00] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:00] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:00] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:01] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:01:01] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 23 ms to minimize.
SMT process timed out in 30392ms, After SMT, problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 30395ms
Starting structural reductions in LTL mode, iteration 1 : 202/238 places, 460/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31183 ms. Remains : 202/238 places, 460/518 transitions.
[2025-06-02 15:01:01] [INFO ] Flatten gal took : 38 ms
[2025-06-02 15:01:01] [INFO ] Flatten gal took : 50 ms
[2025-06-02 15:01:01] [INFO ] Input system was already deterministic with 460 transitions.
[2025-06-02 15:01:01] [INFO ] Flatten gal took : 36 ms
[2025-06-02 15:01:02] [INFO ] Flatten gal took : 37 ms
[2025-06-02 15:01:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10533540432282820094.gal : 13 ms
[2025-06-02 15:01:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality1757619409219888844.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/CTLCardinality10533540432282820094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1757619409219888844.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:01:32] [INFO ] Flatten gal took : 23 ms
[2025-06-02 15:01:32] [INFO ] Applying decomposition
[2025-06-02 15:01:32] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2940179897149224713.txt' '-o' '/tmp/graph2940179897149224713.bin' '-w' '/tmp/graph2940179897149224713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2940179897149224713.bin' '-l' '-1' '-v' '-w' '/tmp/graph2940179897149224713.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:01:32] [INFO ] Decomposing Gal with order
[2025-06-02 15:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:01:32] [INFO ] Removed a total of 1310 redundant transitions.
[2025-06-02 15:01:32] [INFO ] Flatten gal took : 99 ms
[2025-06-02 15:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 39 ms.
[2025-06-02 15:01:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality9937135317648678932.gal : 10 ms
[2025-06-02 15:01:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality12095531610008143562.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/CTLCardinality9937135317648678932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12095531610008143562.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.06148e+07,12.5913,210828,2975,33,87669,496,1185,2.24615e+06,77,1250,0
Converting to forward existential form...Done !
original formula: (AX(((i7.i2.u64.p231!=0)&&(i8.i1.u22.p79!=1))) * EX((i3.i0.u34.p129!=0)))
=> equivalent forward existential formula: ([(EY(Init) * !(((i7.i2.u64.p231!=0)&&(i8.i1.u22.p79!=1))))] = FALSE * [(Init * !(EX((i3.i0.u34.p129!=0))))] = F...160
Reverse transition relation is NOT exact ! Due to transitions t30, t39, t105, t118, t123, t161, t177, t188, t192, t202, t206, t228, t230, t236, t238, t260,...1057
(forward)formula 0,0,21.0193,295948,1,0,166587,496,7006,3.13259e+06,327,1250,708194
FORMULA MedleyA-PT-18-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 205 transition count 464
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 205 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 204 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 204 transition count 463
Applied a total of 68 rules in 10 ms. Remains 204 /238 variables (removed 34) and now considering 463/518 (removed 55) transitions.
// Phase 1: matrix 463 rows 204 cols
[2025-06-02 15:01:53] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:01:53] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 15:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:01:54] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2025-06-02 15:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:04] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:04] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:04] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:04] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:05] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:05] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:05] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:05] [INFO ] Deduced a trap composed of 127 places in 192 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:05] [INFO ] Deduced a trap composed of 127 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:06] [INFO ] Deduced a trap composed of 110 places in 298 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:06] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:07] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:07] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:08] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:08] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:08] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:08] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:09] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:09] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:09] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:11] [INFO ] Deduced a trap composed of 134 places in 295 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:11] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:12] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:12] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:12] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:13] [INFO ] Deduced a trap composed of 34 places in 318 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:13] [INFO ] Deduced a trap composed of 109 places in 275 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:13] [INFO ] Deduced a trap composed of 134 places in 293 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:14] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:14] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:14] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:14] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:15] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:15] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:15] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:15] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:16] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:16] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:22] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:22] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 15 ms to minimize.
(s61 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/667 variables, and 47 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:29] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:29] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:29] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:30] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:30] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:34] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:34] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:34] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:34] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:35] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:35] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:39] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:39] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:43] [INFO ] Deduced a trap composed of 132 places in 206 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:02:44] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 204/667 variables, and 62 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 0/462 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Starting structural reductions in LTL mode, iteration 1 : 204/238 places, 463/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61095 ms. Remains : 204/238 places, 463/518 transitions.
[2025-06-02 15:02:54] [INFO ] Flatten gal took : 33 ms
[2025-06-02 15:02:54] [INFO ] Flatten gal took : 35 ms
[2025-06-02 15:02:54] [INFO ] Input system was already deterministic with 463 transitions.
[2025-06-02 15:02:55] [INFO ] Flatten gal took : 32 ms
[2025-06-02 15:02:55] [INFO ] Flatten gal took : 33 ms
[2025-06-02 15:02:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality6763506498742314728.gal : 11 ms
[2025-06-02 15:02:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality18164775432068483470.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/CTLCardinality6763506498742314728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18164775432068483470.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:03:25] [INFO ] Flatten gal took : 20 ms
[2025-06-02 15:03:25] [INFO ] Applying decomposition
[2025-06-02 15:03:25] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3860697908223387964.txt' '-o' '/tmp/graph3860697908223387964.bin' '-w' '/tmp/graph3860697908223387964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3860697908223387964.bin' '-l' '-1' '-v' '-w' '/tmp/graph3860697908223387964.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:03:25] [INFO ] Decomposing Gal with order
[2025-06-02 15:03:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:03:25] [INFO ] Removed a total of 1328 redundant transitions.
[2025-06-02 15:03:25] [INFO ] Flatten gal took : 57 ms
[2025-06-02 15:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 26 ms.
[2025-06-02 15:03:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15883031572086786765.gal : 11 ms
[2025-06-02 15:03:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality5168102745735095761.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/CTLCardinality15883031572086786765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5168102745735095761.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.28566e+07,7.53743,152648,4289,42,122152,689,1254,1.2954e+06,87,1640,0
Converting to forward existential form...Done !
original formula: EX(EG((EF(EX(((i1.i0.u20.p91==0)&&(i3.i2.u38.p149==1)))) * ((AG((i4.i0.u37.p133==1)) + AG((i6.i1.u53.p191==0))) + ((i1.i0.u17.p73==0)||((...194
=> equivalent forward existential formula: [FwdG(EY(Init),(E(TRUE U EX(((i1.i0.u20.p91==0)&&(i3.i2.u38.p149==1)))) * ((!(E(TRUE U !((i4.i0.u37.p133==1)))) ...267
Reverse transition relation is NOT exact ! Due to transitions t35, t48, t52, t108, t125, t126, t162, t178, t191, t193, t209, t231, t233, t239, t241, t263, ...1186
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 204 transition count 461
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 204 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 202 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 202 transition count 459
Applied a total of 72 rules in 11 ms. Remains 202 /238 variables (removed 36) and now considering 459/518 (removed 59) transitions.
// Phase 1: matrix 459 rows 202 cols
[2025-06-02 15:03:55] [INFO ] Computed 7 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:03:55] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-02 15:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:03:56] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2025-06-02 15:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:03] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:04] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:04] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:04] [INFO ] Deduced a trap composed of 15 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-02 15:04:04] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:04] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:05] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:05] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:05] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:05] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:06] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:06] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:06] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:06] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:07] [INFO ] Deduced a trap composed of 134 places in 263 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:08] [INFO ] Deduced a trap composed of 126 places in 281 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:08] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:08] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:08] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:09] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:09] [INFO ] Deduced a trap composed of 126 places in 198 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:09] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:11] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:11] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:11] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:11] [INFO ] Deduced a trap composed of 130 places in 215 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:12] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:12] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:12] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:12] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:13] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:13] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:14] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:14] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:15] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:21] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:25] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:25] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/661 variables, and 45 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:32] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:37] [INFO ] Deduced a trap composed of 135 places in 305 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:38] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:38] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:38] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:39] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:39] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:44] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:44] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:45] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:45] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:50] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:04:50] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/661 variables, and 58 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 0/458 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in LTL mode, iteration 1 : 202/238 places, 459/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60974 ms. Remains : 202/238 places, 459/518 transitions.
[2025-06-02 15:04:56] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:04:56] [INFO ] Flatten gal took : 29 ms
[2025-06-02 15:04:56] [INFO ] Input system was already deterministic with 459 transitions.
[2025-06-02 15:04:56] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:04:56] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:04:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality16376000195036563328.gal : 7 ms
[2025-06-02 15:04:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality1779886431528863977.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/CTLCardinality16376000195036563328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1779886431528863977.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:05:26] [INFO ] Flatten gal took : 17 ms
[2025-06-02 15:05:26] [INFO ] Applying decomposition
[2025-06-02 15:05:26] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10748367237448926564.txt' '-o' '/tmp/graph10748367237448926564.bin' '-w' '/tmp/graph10748367237448926564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10748367237448926564.bin' '-l' '-1' '-v' '-w' '/tmp/graph10748367237448926564.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:05:26] [INFO ] Decomposing Gal with order
[2025-06-02 15:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:05:26] [INFO ] Removed a total of 1300 redundant transitions.
[2025-06-02 15:05:26] [INFO ] Flatten gal took : 69 ms
[2025-06-02 15:05:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 18 ms.
[2025-06-02 15:05:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2610461095673772706.gal : 8 ms
[2025-06-02 15:05:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality1008435978856963292.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/CTLCardinality2610461095673772706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1008435978856963292.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99279e+07,29.1115,481168,4634,28,138668,327,1162,5.74594e+06,65,899,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Graph (trivial) has 234 edges and 238 vertex of which 9 / 238 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 230 transition count 471
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 82 place count 191 transition count 468
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 188 transition count 468
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 85 place count 188 transition count 459
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 103 place count 179 transition count 459
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 127 place count 155 transition count 416
Iterating global reduction 3 with 24 rules applied. Total rules applied 151 place count 155 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 155 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 152 place count 155 transition count 414
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 154 transition count 414
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 153 transition count 398
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 153 transition count 398
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 190 place count 136 transition count 381
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 194 place count 132 transition count 373
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 132 transition count 373
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 130 transition count 369
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 130 transition count 369
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 212 place count 130 transition count 359
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 4 with 12 rules applied. Total rules applied 224 place count 124 transition count 353
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 122 transition count 345
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 122 transition count 345
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 120 transition count 341
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 120 transition count 341
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 120 transition count 341
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 119 transition count 340
Applied a total of 234 rules in 78 ms. Remains 119 /238 variables (removed 119) and now considering 340/518 (removed 178) transitions.
[2025-06-02 15:05:57] [INFO ] Flow matrix only has 339 transitions (discarded 1 similar events)
// Phase 1: matrix 339 rows 119 cols
[2025-06-02 15:05:57] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:05:57] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 15:05:57] [INFO ] Flow matrix only has 339 transitions (discarded 1 similar events)
[2025-06-02 15:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:05:57] [INFO ] State equation strengthened by 139 read => feed constraints.
[2025-06-02 15:05:57] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:05:57] [INFO ] Redundant transitions in 6 ms returned []
Running 339 sub problems to find dead transitions.
[2025-06-02 15:05:57] [INFO ] Flow matrix only has 339 transitions (discarded 1 similar events)
[2025-06-02 15:05:57] [INFO ] Invariant cache hit.
[2025-06-02 15:05:57] [INFO ] State equation strengthened by 139 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:02] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:02] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:02] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:03] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:03] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:03] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:03] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:03] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:03] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:04] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:04] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:04] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:04] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:04] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:05] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:05] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:05] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:05] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:06] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:06] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:08] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:08] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:09] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:09] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:06:09] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (OVERLAPS) 338/457 variables, 119/151 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 138/289 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (OVERLAPS) 1/458 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/458 variables, and 290 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 6 (OVERLAPS) 338/457 variables, 119/151 constraints. Problems are: Problem set: 42 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 138/289 constraints. Problems are: Problem set: 42 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 297/586 constraints. Problems are: Problem set: 42 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/458 variables, and 586 constraints, problems are : Problem set: 42 solved, 297 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 138/139 constraints, PredecessorRefiner: 297/339 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 42 solved, 297 unsolved
Search for dead transitions found 42 dead transitions in 60297ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 119/238 places, 298/518 transitions.
Applied a total of 0 rules in 13 ms. Remains 119 /119 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:06:57] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60885 ms. Remains : 119/238 places, 298/518 transitions.
[2025-06-02 15:06:57] [INFO ] Flatten gal took : 14 ms
[2025-06-02 15:06:57] [INFO ] Flatten gal took : 15 ms
[2025-06-02 15:06:58] [INFO ] Input system was already deterministic with 298 transitions.
[2025-06-02 15:06:58] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:06:58] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:06:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality3655931792307344864.gal : 3 ms
[2025-06-02 15:06:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality1813360472119873605.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/CTLCardinality3655931792307344864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1813360472119873605.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,2.5269e+06,22.1369,443768,2,35933,5,1.12538e+06,6,0,774,1.24075e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 15:07:28] [INFO ] Flatten gal took : 9 ms
[2025-06-02 15:07:28] [INFO ] Applying decomposition
[2025-06-02 15:07:28] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8867992342525540383.txt' '-o' '/tmp/graph8867992342525540383.bin' '-w' '/tmp/graph8867992342525540383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8867992342525540383.bin' '-l' '-1' '-v' '-w' '/tmp/graph8867992342525540383.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:07:28] [INFO ] Decomposing Gal with order
[2025-06-02 15:07:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:07:28] [INFO ] Removed a total of 600 redundant transitions.
[2025-06-02 15:07:28] [INFO ] Flatten gal took : 38 ms
[2025-06-02 15:07:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 9 ms.
[2025-06-02 15:07:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality4879074516925313074.gal : 6 ms
[2025-06-02 15:07:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2813432956203758474.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/CTLCardinality4879074516925313074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2813432956203758474.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.5269e+06,2.35318,49564,1291,142,71874,2246,644,199535,95,10732,0
Converting to forward existential form...Done !
original formula: AG((((EF((((i7.u31.p199==0)&&(i1.u7.p55==0))&&(i5.u19.p124==1))) + AG(((i1.u10.p59==0)&&(i0.i1.u18.p115==1)))) + ((i7.u36.p228==0)||(i3.u...410
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,TRUE) * !((((EG((i0.i0.u5.p33==1)) * (i3.u15.p50==0)) * ((((i1.u10.p65==0)||(i1.u7.p57==0))|...486
Reverse transition relation is NOT exact ! Due to transitions t2, t17, t28, t32, t39, t45, t54, t60, t66, t93, t95, t103, t107, t108, t109, t111, t112, t11...827
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,19.4303,395408,1,0,438923,4834,4734,2.86871e+06,494,19611,1172625
FORMULA MedleyA-PT-18-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 206 transition count 465
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 206 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 205 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 205 transition count 464
Applied a total of 66 rules in 7 ms. Remains 205 /238 variables (removed 33) and now considering 464/518 (removed 54) transitions.
// Phase 1: matrix 464 rows 205 cols
[2025-06-02 15:07:47] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:07:47] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-02 15:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:07:48] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-02 15:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:07:57] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:07:57] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:07:58] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:07:58] [INFO ] Deduced a trap composed of 15 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-02 15:07:58] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:07:58] [INFO ] Deduced a trap composed of 127 places in 224 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:07:58] [INFO ] Deduced a trap composed of 127 places in 243 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:07:59] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:00] [INFO ] Deduced a trap composed of 127 places in 222 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:00] [INFO ] Deduced a trap composed of 110 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:00] [INFO ] Deduced a trap composed of 113 places in 273 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:01] [INFO ] Deduced a trap composed of 137 places in 300 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:01] [INFO ] Deduced a trap composed of 136 places in 290 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:02] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:02] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:02] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:03] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:03] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:03] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:03] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:04] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:05] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:06] [INFO ] Deduced a trap composed of 24 places in 339 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:06] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:07] [INFO ] Deduced a trap composed of 35 places in 266 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:07] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:07] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:08] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:08] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:09] [INFO ] Deduced a trap composed of 22 places in 306 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:09] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:09] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:10] [INFO ] Deduced a trap composed of 33 places in 337 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:10] [INFO ] Deduced a trap composed of 34 places in 339 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:10] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:12] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:12] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:18] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:18] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:08:18] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 23 ms to minimize.
SMT process timed out in 30560ms, After SMT, problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 30563ms
Starting structural reductions in LTL mode, iteration 1 : 205/238 places, 464/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31086 ms. Remains : 205/238 places, 464/518 transitions.
[2025-06-02 15:08:18] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:08:18] [INFO ] Flatten gal took : 38 ms
[2025-06-02 15:08:19] [INFO ] Input system was already deterministic with 464 transitions.
[2025-06-02 15:08:19] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:08:19] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:08:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16834265300563039865.gal : 5 ms
[2025-06-02 15:08:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17949314087133108750.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/CTLCardinality16834265300563039865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17949314087133108750.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:08:49] [INFO ] Flatten gal took : 16 ms
[2025-06-02 15:08:49] [INFO ] Applying decomposition
[2025-06-02 15:08:49] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4432551357316737145.txt' '-o' '/tmp/graph4432551357316737145.bin' '-w' '/tmp/graph4432551357316737145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4432551357316737145.bin' '-l' '-1' '-v' '-w' '/tmp/graph4432551357316737145.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:08:49] [INFO ] Decomposing Gal with order
[2025-06-02 15:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:08:49] [INFO ] Removed a total of 1282 redundant transitions.
[2025-06-02 15:08:49] [INFO ] Flatten gal took : 41 ms
[2025-06-02 15:08:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 8 ms.
[2025-06-02 15:08:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality16302579039712054866.gal : 6 ms
[2025-06-02 15:08:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3921818099167986914.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/CTLCardinality16302579039712054866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3921818099167986914.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.39002e+07,4.30126,119544,3209,78,148536,1194,1202,819250,91,4146,0
Converting to forward existential form...Done !
original formula: A((((!((((AG(((i7.i2.u64.p223==1)&&((i5.i0.u30.p125==0)||(i3.i1.u28.p117==1)))) + A(((i3.i1.u27.p122==0)||(i1.u2.p4==1)) U (i1.u1.p50==1)...400
=> equivalent forward existential formula: [((Init * !(EG(!(EG(((i3.i2.u43.p163==0)||(i2.i0.u5.p25==1))))))) * !(E(!(EG(((i3.i2.u43.p163==0)||(i2.i0.u5.p25...640
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t49, t83, t102, t115, t161, t177, t185, t190, t194, t199, t210, t232, t234, t240, t...1115
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 204 transition count 461
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 204 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 203 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 203 transition count 460
Applied a total of 70 rules in 7 ms. Remains 203 /238 variables (removed 35) and now considering 460/518 (removed 58) transitions.
// Phase 1: matrix 460 rows 203 cols
[2025-06-02 15:09:19] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:19] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 15:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:09:20] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 15:09:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:28] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:28] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:28] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:28] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:29] [INFO ] Deduced a trap composed of 127 places in 201 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:30] [INFO ] Deduced a trap composed of 127 places in 238 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:30] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:30] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:32] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:32] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:32] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:32] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:32] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:33] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:33] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:33] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:34] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:34] [INFO ] Deduced a trap composed of 127 places in 227 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:35] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:35] [INFO ] Deduced a trap composed of 112 places in 280 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:36] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:36] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:37] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:37] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:37] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:38] [INFO ] Deduced a trap composed of 135 places in 216 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:38] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:39] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:44] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:48] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:48] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:48] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:49] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:49] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 34 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/663 variables, and 46 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:54] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:55] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:56] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:56] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:59] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:09:59] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:00] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:05] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:06] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:10] [INFO ] Deduced a trap composed of 136 places in 316 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:11] [INFO ] Deduced a trap composed of 138 places in 278 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:12] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:10:17] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 33 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/663 variables, and 61 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 0/459 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 203/238 places, 460/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60906 ms. Remains : 203/238 places, 460/518 transitions.
[2025-06-02 15:10:20] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:10:20] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:10:20] [INFO ] Input system was already deterministic with 460 transitions.
[2025-06-02 15:10:20] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:10:20] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:10:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5219334994552691857.gal : 5 ms
[2025-06-02 15:10:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality2469790425040855124.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/CTLCardinality5219334994552691857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2469790425040855124.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:10:50] [INFO ] Flatten gal took : 19 ms
[2025-06-02 15:10:50] [INFO ] Applying decomposition
[2025-06-02 15:10:50] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11122543975716759879.txt' '-o' '/tmp/graph11122543975716759879.bin' '-w' '/tmp/graph11122543975716759879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11122543975716759879.bin' '-l' '-1' '-v' '-w' '/tmp/graph11122543975716759879.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:10:50] [INFO ] Decomposing Gal with order
[2025-06-02 15:10:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:10:50] [INFO ] Removed a total of 1296 redundant transitions.
[2025-06-02 15:10:50] [INFO ] Flatten gal took : 53 ms
[2025-06-02 15:10:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 8 ms.
[2025-06-02 15:10:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality17074701345100398932.gal : 5 ms
[2025-06-02 15:10:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11267810299685552879.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/CTLCardinality17074701345100398932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11267810299685552879.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.03476e+07,6.28399,126632,3716,31,87735,433,1135,1.15586e+06,73,1039,0
Converting to forward existential form...Done !
original formula: ((E(((AF((i5.u8.p36!=1)) + EF(((i8.u6.p42==0)||(i0.i1.u20.p87==1)))) + !(EX(AG(((i2.i0.u4.p18==0)||(i0.i2.u22.p95==1)))))) U (i4.i2.u46.p...241
=> equivalent forward existential formula: (([(Init * !(E(((!(EG(!((i5.u8.p36!=1)))) + E(TRUE U ((i8.u6.p42==0)||(i0.i1.u20.p87==1)))) + !(EX(!(E(TRUE U !(...360
Reverse transition relation is NOT exact ! Due to transitions t11, t30, t50, t54, t96, t125, t161, t177, t188, t190, t192, t204, t206, t226, t230, t234, t2...973
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 207 transition count 468
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 207 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 205 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 205 transition count 466
Applied a total of 66 rules in 8 ms. Remains 205 /238 variables (removed 33) and now considering 466/518 (removed 52) transitions.
// Phase 1: matrix 466 rows 205 cols
[2025-06-02 15:11:20] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:20] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-02 15:11:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:11:21] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-02 15:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:30] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:30] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:30] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:30] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:31] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:32] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:32] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:33] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:34] [INFO ] Deduced a trap composed of 24 places in 337 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:34] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:34] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:34] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:35] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:35] [INFO ] Deduced a trap composed of 136 places in 243 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:35] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:37] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:37] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:38] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:38] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:38] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:39] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:39] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:39] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:39] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:40] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:40] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:40] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:41] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:42] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:42] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:46] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:47] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:47] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:11:51] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 17 ms to minimize.
SMT process timed out in 30317ms, After SMT, problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 30319ms
Starting structural reductions in LTL mode, iteration 1 : 205/238 places, 466/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30825 ms. Remains : 205/238 places, 466/518 transitions.
[2025-06-02 15:11:51] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:11:51] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:11:51] [INFO ] Input system was already deterministic with 466 transitions.
[2025-06-02 15:11:51] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:11:51] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:11:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6099310204972479712.gal : 5 ms
[2025-06-02 15:11:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16812746778227478063.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/CTLCardinality6099310204972479712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16812746778227478063.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:12:21] [INFO ] Flatten gal took : 16 ms
[2025-06-02 15:12:21] [INFO ] Applying decomposition
[2025-06-02 15:12:21] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11125485585442607685.txt' '-o' '/tmp/graph11125485585442607685.bin' '-w' '/tmp/graph11125485585442607685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11125485585442607685.bin' '-l' '-1' '-v' '-w' '/tmp/graph11125485585442607685.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:12:21] [INFO ] Decomposing Gal with order
[2025-06-02 15:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:12:21] [INFO ] Removed a total of 1295 redundant transitions.
[2025-06-02 15:12:21] [INFO ] Flatten gal took : 34 ms
[2025-06-02 15:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 9 ms.
[2025-06-02 15:12:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality7874134826474610006.gal : 5 ms
[2025-06-02 15:12:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality18003113840519687909.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/CTLCardinality7874134826474610006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18003113840519687909.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.21608e+07,12.5552,211484,3057,49,87284,703,1143,2.27939e+06,87,2125,0
Converting to forward existential form...Done !
original formula: (EG(AX((((i3.i1.u31.p121==0)||(i6.u53.p184==1))||(((i8.i1.u61.p207==0)&&(i2.i1.u21.p89==0))&&(i2.i2.u23.p99==1))))) * EX(TRUE))
=> equivalent forward existential formula: [(EY((Init * EG(!(EX(!((((i3.i1.u31.p121==0)||(i6.u53.p184==1))||(((i8.i1.u61.p207==0)&&(i2.i1.u21.p89==0))&&(i2...196
Reverse transition relation is NOT exact ! Due to transitions t41, t59, t89, t98, t100, t105, t109, t167, t183, t194, t196, t198, t208, t212, t236, t244, t...1174
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 204 transition count 462
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 202 transition count 460
Applied a total of 72 rules in 7 ms. Remains 202 /238 variables (removed 36) and now considering 460/518 (removed 58) transitions.
// Phase 1: matrix 460 rows 202 cols
[2025-06-02 15:12:52] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:12:52] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-02 15:12:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:12:52] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 15:12:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:03] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:04] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:04] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:04] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:04] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:05] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:05] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:06] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:07] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:07] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:07] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:07] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:07] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:08] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:08] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:09] [INFO ] Deduced a trap composed of 125 places in 250 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:09] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:10] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:11] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:11] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:11] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:11] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:12] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:12] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:12] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:13] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:14] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:14] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:19] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:20] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:20] [INFO ] Deduced a trap composed of 133 places in 249 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:21] [INFO ] Deduced a trap composed of 125 places in 227 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:21] [INFO ] Deduced a trap composed of 108 places in 277 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:21] [INFO ] Deduced a trap composed of 111 places in 311 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:22] [INFO ] Deduced a trap composed of 125 places in 297 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:22] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:22] [INFO ] Deduced a trap composed of 130 places in 284 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:22] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:13:23] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 20 ms to minimize.
SMT process timed out in 30521ms, After SMT, problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 30523ms
Starting structural reductions in LTL mode, iteration 1 : 202/238 places, 460/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31302 ms. Remains : 202/238 places, 460/518 transitions.
[2025-06-02 15:13:23] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:13:23] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:13:23] [INFO ] Input system was already deterministic with 460 transitions.
[2025-06-02 15:13:23] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:13:23] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:13:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8912575721274921358.gal : 4 ms
[2025-06-02 15:13:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality1289908222771121531.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/CTLCardinality8912575721274921358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1289908222771121531.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:13:53] [INFO ] Flatten gal took : 15 ms
[2025-06-02 15:13:53] [INFO ] Applying decomposition
[2025-06-02 15:13:53] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4028297626220675747.txt' '-o' '/tmp/graph4028297626220675747.bin' '-w' '/tmp/graph4028297626220675747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4028297626220675747.bin' '-l' '-1' '-v' '-w' '/tmp/graph4028297626220675747.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:13:53] [INFO ] Decomposing Gal with order
[2025-06-02 15:13:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:13:53] [INFO ] Removed a total of 1292 redundant transitions.
[2025-06-02 15:13:53] [INFO ] Flatten gal took : 33 ms
[2025-06-02 15:13:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2025-06-02 15:13:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9672099612752625681.gal : 5 ms
[2025-06-02 15:13:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality3838812528285411217.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/CTLCardinality9672099612752625681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3838812528285411217.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.08919e+07,11.6936,168848,2452,52,111711,556,1124,1.49863e+06,74,1905,0
Converting to forward existential form...Done !
original formula: AG(EX((EX(((i8.i0.u13.p64==0)||(i8.i1.u20.p83==1))) * ((i2.i0.u30.p165==0)||(i3.i0.u39.p150==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((EX(((i8.i0.u13.p64==0)||(i8.i1.u20.p83==1))) * ((i2.i0.u30.p165==0)||(i3.i0.u39.p150==...171
Reverse transition relation is NOT exact ! Due to transitions t30, t39, t101, t114, t159, t177, t190, t192, t202, t206, t230, t238, t262, t270, t302, t304,...1072
(forward)formula 0,0,20.9846,273464,1,0,175295,556,6617,2.85539e+06,307,1905,427826
FORMULA MedleyA-PT-18-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Graph (trivial) has 251 edges and 238 vertex of which 8 / 238 are part of one of the 2 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 231 transition count 463
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 101 place count 183 transition count 459
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 181 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 180 transition count 458
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 105 place count 180 transition count 450
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 121 place count 172 transition count 450
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 148 place count 145 transition count 401
Iterating global reduction 4 with 27 rules applied. Total rules applied 175 place count 145 transition count 401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 175 place count 145 transition count 399
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 179 place count 143 transition count 399
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 180 place count 142 transition count 383
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 142 transition count 383
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 211 place count 127 transition count 368
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 215 place count 123 transition count 360
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 123 transition count 360
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 221 place count 121 transition count 356
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 121 transition count 356
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 235 place count 121 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 235 place count 121 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 120 transition count 343
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 4 with 12 rules applied. Total rules applied 249 place count 114 transition count 337
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 251 place count 112 transition count 329
Iterating global reduction 4 with 2 rules applied. Total rules applied 253 place count 112 transition count 329
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 255 place count 110 transition count 325
Iterating global reduction 4 with 2 rules applied. Total rules applied 257 place count 110 transition count 325
Applied a total of 257 rules in 90 ms. Remains 110 /238 variables (removed 128) and now considering 325/518 (removed 193) transitions.
[2025-06-02 15:14:14] [INFO ] Flow matrix only has 324 transitions (discarded 1 similar events)
// Phase 1: matrix 324 rows 110 cols
[2025-06-02 15:14:14] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:14:15] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 15:14:15] [INFO ] Flow matrix only has 324 transitions (discarded 1 similar events)
[2025-06-02 15:14:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:14:15] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-02 15:14:15] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:14:15] [INFO ] Redundant transitions in 4 ms returned []
Running 324 sub problems to find dead transitions.
[2025-06-02 15:14:15] [INFO ] Flow matrix only has 324 transitions (discarded 1 similar events)
[2025-06-02 15:14:15] [INFO ] Invariant cache hit.
[2025-06-02 15:14:15] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:20] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:20] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:21] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:21] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:21] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:21] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:22] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:22] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:22] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:22] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:22] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:23] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:23] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:23] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:23] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:23] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:24] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:24] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:24] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:27] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:28] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 323/433 variables, 110/139 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 68/207 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (OVERLAPS) 1/434 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 208 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 6 (OVERLAPS) 323/433 variables, 110/139 constraints. Problems are: Problem set: 42 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 68/207 constraints. Problems are: Problem set: 42 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 282/489 constraints. Problems are: Problem set: 42 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:09] [INFO ] Deduced a trap along path composed of 11 places in 134 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/434 variables, and 490 constraints, problems are : Problem set: 42 solved, 282 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 68/69 constraints, PredecessorRefiner: 282/324 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60339ms problems are : Problem set: 42 solved, 282 unsolved
Search for dead transitions found 42 dead transitions in 60341ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 110/238 places, 283/518 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:15:15] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60914 ms. Remains : 110/238 places, 283/518 transitions.
[2025-06-02 15:15:15] [INFO ] Flatten gal took : 9 ms
[2025-06-02 15:15:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 15:15:15] [INFO ] Input system was already deterministic with 283 transitions.
[2025-06-02 15:15:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 15:15:15] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:15:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality4356928307530326596.gal : 2 ms
[2025-06-02 15:15:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality10362220538066857954.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/CTLCardinality4356928307530326596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10362220538066857954.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26298e+06,12.8766,270008,2,28615,5,652621,6,0,723,705683,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 15:15:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 15:15:45] [INFO ] Applying decomposition
[2025-06-02 15:15:45] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7854485794433161621.txt' '-o' '/tmp/graph7854485794433161621.bin' '-w' '/tmp/graph7854485794433161621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7854485794433161621.bin' '-l' '-1' '-v' '-w' '/tmp/graph7854485794433161621.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:15:45] [INFO ] Decomposing Gal with order
[2025-06-02 15:15:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:15:45] [INFO ] Removed a total of 714 redundant transitions.
[2025-06-02 15:15:45] [INFO ] Flatten gal took : 20 ms
[2025-06-02 15:15:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 5 ms.
[2025-06-02 15:15:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality18184100569182862486.gal : 2 ms
[2025-06-02 15:15:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality9465211588527663412.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/CTLCardinality18184100569182862486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9465211588527663412.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26298e+06,10.1866,253972,1939,48,99115,387,698,2.91117e+06,70,1325,0
Converting to forward existential form...Done !
original formula: E(((AF((i6.u17.p94==1)) + !(EG((i4.u28.p190==1)))) + E(EF((i5.i1.u34.p227==1)) U A(((i1.i0.u1.p26==0)||(i6.u4.p21==1)) U ((i6.u37.p237==0...262
=> equivalent forward existential formula: [((FwdU(Init,((!(EG(!((i6.u17.p94==1)))) + !(EG((i4.u28.p190==1)))) + E(E(TRUE U (i5.i1.u34.p227==1)) U !((E(!((...585
Reverse transition relation is NOT exact ! Due to transitions t30, t40, t50, t69, t71, t80, t85, t93, t94, t95, t96, t97, t101, t102, t131, t132, t185, t18...678
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 204 transition count 462
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 202 transition count 460
Applied a total of 72 rules in 7 ms. Remains 202 /238 variables (removed 36) and now considering 460/518 (removed 58) transitions.
// Phase 1: matrix 460 rows 202 cols
[2025-06-02 15:16:16] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:16:16] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 15:16:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:16:16] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 15:16:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:27] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:27] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:27] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:28] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:28] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:28] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:29] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:29] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:29] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:29] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:30] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:31] [INFO ] Deduced a trap composed of 24 places in 329 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:32] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:32] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:32] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:32] [INFO ] Deduced a trap composed of 22 places in 314 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:33] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:33] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:33] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:34] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:34] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:35] [INFO ] Deduced a trap composed of 125 places in 222 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:35] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:35] [INFO ] Deduced a trap composed of 125 places in 228 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:35] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:35] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:37] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:37] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:37] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:38] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:38] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:38] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:39] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:39] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:40] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:40] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:41] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 44 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:51] [INFO ] Deduced a trap composed of 28 places in 325 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:52] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:52] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:53] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:16:57] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:17:02] [INFO ] Deduced a trap composed of 134 places in 292 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 7 (OVERLAPS) 460/662 variables, 202/252 constraints. Problems are: Problem set: 50 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 409/661 constraints. Problems are: Problem set: 50 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 661 constraints, problems are : Problem set: 50 solved, 409 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 409/459 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60359ms problems are : Problem set: 50 solved, 409 unsolved
Search for dead transitions found 50 dead transitions in 60361ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/238 places, 410/518 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61096 ms. Remains : 202/238 places, 410/518 transitions.
[2025-06-02 15:17:17] [INFO ] Flatten gal took : 20 ms
[2025-06-02 15:17:17] [INFO ] Flatten gal took : 24 ms
[2025-06-02 15:17:17] [INFO ] Input system was already deterministic with 410 transitions.
[2025-06-02 15:17:17] [INFO ] Flatten gal took : 19 ms
[2025-06-02 15:17:17] [INFO ] Flatten gal took : 19 ms
[2025-06-02 15:17:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1388322972434519962.gal : 3 ms
[2025-06-02 15:17:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5243718763765745505.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/CTLCardinality1388322972434519962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5243718763765745505.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:17:47] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:17:47] [INFO ] Applying decomposition
[2025-06-02 15:17:47] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17869708329821088739.txt' '-o' '/tmp/graph17869708329821088739.bin' '-w' '/tmp/graph17869708329821088739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17869708329821088739.bin' '-l' '-1' '-v' '-w' '/tmp/graph17869708329821088739.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:17:47] [INFO ] Decomposing Gal with order
[2025-06-02 15:17:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:17:47] [INFO ] Removed a total of 917 redundant transitions.
[2025-06-02 15:17:47] [INFO ] Flatten gal took : 28 ms
[2025-06-02 15:17:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 6 ms.
[2025-06-02 15:17:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16552854947992643654.gal : 3 ms
[2025-06-02 15:17:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10139128909893917199.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/CTLCardinality16552854947992643654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10139128909893917199.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09273e+07,16.0235,302004,2482,38,309648,500,1013,2.53081e+06,71,1865,0
Converting to forward existential form...Done !
original formula: EG(E((i3.i1.u44.p161==0) U A(AX((i0.u12.p57==1)) U (i3.i0.u25.p108==1))))
=> equivalent forward existential formula: [FwdG(Init,E((i3.i1.u44.p161==0) U !((E(!((i3.i0.u25.p108==1)) U (!(!(EX(!((i0.u12.p57==1))))) * !((i3.i0.u25.p1...207
Reverse transition relation is NOT exact ! Due to transitions t48, t66, t101, t105, t123, t183, t188, t197, t202, t204, t230, t238, t262, t270, t275, t276,...1037
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 203 transition count 460
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 201 transition count 458
Applied a total of 74 rules in 7 ms. Remains 201 /238 variables (removed 37) and now considering 458/518 (removed 60) transitions.
// Phase 1: matrix 458 rows 201 cols
[2025-06-02 15:18:17] [INFO ] Computed 7 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:18:17] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-02 15:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:18:18] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 15:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:28] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:28] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:29] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:29] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:29] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:30] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:30] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:30] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:30] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:31] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:31] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:32] [INFO ] Deduced a trap composed of 24 places in 320 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:33] [INFO ] Deduced a trap composed of 24 places in 320 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:33] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:33] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:34] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:34] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:34] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:34] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:35] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:36] [INFO ] Deduced a trap composed of 125 places in 227 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:36] [INFO ] Deduced a trap composed of 125 places in 233 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:36] [INFO ] Deduced a trap composed of 125 places in 258 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:38] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:38] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:38] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:39] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:39] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:39] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:39] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:40] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:40] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:40] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:40] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:41] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:42] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:42] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:18:42] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/659 variables, and 45 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 4 (OVERLAPS) 458/659 variables, 201/246 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 407/653 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 653 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60373ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 201/238 places, 408/518 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61089 ms. Remains : 201/238 places, 408/518 transitions.
[2025-06-02 15:19:18] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:19:18] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:19:18] [INFO ] Input system was already deterministic with 408 transitions.
[2025-06-02 15:19:18] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:19:18] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:19:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality13832371384862123522.gal : 3 ms
[2025-06-02 15:19:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality14624363660915499356.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/CTLCardinality13832371384862123522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14624363660915499356.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:19:48] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:19:48] [INFO ] Applying decomposition
[2025-06-02 15:19:48] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1334745286464295323.txt' '-o' '/tmp/graph1334745286464295323.bin' '-w' '/tmp/graph1334745286464295323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1334745286464295323.bin' '-l' '-1' '-v' '-w' '/tmp/graph1334745286464295323.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:19:48] [INFO ] Decomposing Gal with order
[2025-06-02 15:19:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:19:48] [INFO ] Removed a total of 932 redundant transitions.
[2025-06-02 15:19:48] [INFO ] Flatten gal took : 22 ms
[2025-06-02 15:19:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2025-06-02 15:19:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10447381822003778078.gal : 3 ms
[2025-06-02 15:19:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality18115165027536651588.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/CTLCardinality10447381822003778078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18115165027536651588.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.94267e+07,7.82346,176356,2734,28,152088,365,1057,1.59518e+06,65,1011,0
Converting to forward existential form...Done !
original formula: AF(E((AF(((i6.i0.u54.p229==0)||(i2.u28.p113==1))) + (i4.i0.u33.p129==1)) U AG((AX((i4.i1.u32.p127==0)) + AG(((i7.i1.u61.p210==0)||(i8.i0....173
=> equivalent forward existential formula: [FwdG(Init,!(E((!(EG(!(((i6.i0.u54.p229==0)||(i2.u28.p113==1))))) + (i4.i0.u33.p129==1)) U !(E(TRUE U !((!(EX(!(...254
Reverse transition relation is NOT exact ! Due to transitions t19, t28, t48, t96, t114, t181, t188, t195, t200, t202, t226, t228, t234, t236, t258, t260, t...1028
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 207 transition count 465
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 207 transition count 465
Applied a total of 62 rules in 7 ms. Remains 207 /238 variables (removed 31) and now considering 465/518 (removed 53) transitions.
// Phase 1: matrix 465 rows 207 cols
[2025-06-02 15:20:19] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:20:19] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-02 15:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:20:19] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-02 15:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:29] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:29] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:29] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:29] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:29] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:30] [INFO ] Deduced a trap composed of 130 places in 226 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:30] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:30] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:31] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:32] [INFO ] Deduced a trap composed of 22 places in 318 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:32] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:32] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:33] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:33] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:33] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:33] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:34] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:34] [INFO ] Deduced a trap composed of 22 places in 317 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:34] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:35] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:35] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:36] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:36] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:38] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:38] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:38] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:38] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:38] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:39] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:39] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:39] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:40] [INFO ] Deduced a trap composed of 130 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:41] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:41] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:42] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:46] [INFO ] Deduced a trap composed of 130 places in 138 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:47] [INFO ] Deduced a trap composed of 115 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:48] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:48] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:48] [INFO ] Deduced a trap composed of 135 places in 261 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:49] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:49] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:20:50] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 30 ms to minimize.
SMT process timed out in 30579ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 30582ms
Starting structural reductions in LTL mode, iteration 1 : 207/238 places, 465/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31269 ms. Remains : 207/238 places, 465/518 transitions.
[2025-06-02 15:20:50] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:20:50] [INFO ] Flatten gal took : 27 ms
[2025-06-02 15:20:50] [INFO ] Input system was already deterministic with 465 transitions.
[2025-06-02 15:20:50] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:20:50] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:20:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality6644850029166432143.gal : 4 ms
[2025-06-02 15:20:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality18412891581008428074.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/CTLCardinality6644850029166432143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18412891581008428074.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:21:20] [INFO ] Flatten gal took : 18 ms
[2025-06-02 15:21:20] [INFO ] Applying decomposition
[2025-06-02 15:21:20] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18097816955068420452.txt' '-o' '/tmp/graph18097816955068420452.bin' '-w' '/tmp/graph18097816955068420452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18097816955068420452.bin' '-l' '-1' '-v' '-w' '/tmp/graph18097816955068420452.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:21:20] [INFO ] Decomposing Gal with order
[2025-06-02 15:21:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:21:20] [INFO ] Removed a total of 1301 redundant transitions.
[2025-06-02 15:21:20] [INFO ] Flatten gal took : 26 ms
[2025-06-02 15:21:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 8 ms.
[2025-06-02 15:21:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8385162522856818744.gal : 3 ms
[2025-06-02 15:21:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6139211539031674874.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/CTLCardinality8385162522856818744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6139211539031674874.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.15348e+07,13.4705,267956,5546,35,163726,828,1223,2.68946e+06,79,2076,0
Converting to forward existential form...Done !
original formula: ((AF((((i6.i1.u54.p182==1)&&(i0.i0.u25.p170==0))&&(i3.i2.u40.p138==0))) + A((AF(((i2.i2.u42.p153==0)||(i6.i4.u71.p232==1))) * (!(AG(((i3....488
=> equivalent forward existential formula: [FwdG(((Init * !((!(EG(!((((i6.i1.u54.p182==1)&&(i0.i0.u25.p170==0))&&(i3.i2.u40.p138==0))))) + !((E(!(E(TRUE U ...668
Reverse transition relation is NOT exact ! Due to transitions t19, t50, t87, t111, t165, t167, t173, t182, t195, t197, t209, t211, t233, t265, t273, t285, ...1046
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 518/518 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 204 transition count 462
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 202 transition count 460
Applied a total of 72 rules in 9 ms. Remains 202 /238 variables (removed 36) and now considering 460/518 (removed 58) transitions.
// Phase 1: matrix 460 rows 202 cols
[2025-06-02 15:21:50] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:21:50] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-02 15:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:21:51] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 15:21:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:01] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:01] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:02] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:02] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:02] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:02] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:03] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:03] [INFO ] Deduced a trap composed of 125 places in 187 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:03] [INFO ] Deduced a trap composed of 125 places in 217 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:03] [INFO ] Deduced a trap composed of 112 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:04] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:05] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:05] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:06] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:06] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:06] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:06] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:07] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:07] [INFO ] Deduced a trap composed of 33 places in 305 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:07] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:08] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:09] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:09] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:10] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:10] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:10] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:11] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:12] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:12] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:16] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:17] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:21] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 39 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:25] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:26] [INFO ] Deduced a trap composed of 134 places in 221 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:26] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:27] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:27] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:27] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:31] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:32] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:32] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:32] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:36] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:22:37] [INFO ] Deduced a trap composed of 128 places in 201 ms of which 31 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 7 (OVERLAPS) 460/662 variables, 202/253 constraints. Problems are: Problem set: 50 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 409/662 constraints. Problems are: Problem set: 50 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 662 constraints, problems are : Problem set: 50 solved, 409 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 409/459 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60399ms problems are : Problem set: 50 solved, 409 unsolved
Search for dead transitions found 50 dead transitions in 60402ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/238 places, 410/518 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61045 ms. Remains : 202/238 places, 410/518 transitions.
[2025-06-02 15:22:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:22:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:22:51] [INFO ] Input system was already deterministic with 410 transitions.
[2025-06-02 15:22:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:22:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:22:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality14462664413621375517.gal : 3 ms
[2025-06-02 15:22:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality9558769951078361631.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/CTLCardinality14462664413621375517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9558769951078361631.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:23:21] [INFO ] Flatten gal took : 13 ms
[2025-06-02 15:23:21] [INFO ] Applying decomposition
[2025-06-02 15:23:21] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2734233597589180256.txt' '-o' '/tmp/graph2734233597589180256.bin' '-w' '/tmp/graph2734233597589180256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2734233597589180256.bin' '-l' '-1' '-v' '-w' '/tmp/graph2734233597589180256.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:23:21] [INFO ] Decomposing Gal with order
[2025-06-02 15:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:23:21] [INFO ] Removed a total of 927 redundant transitions.
[2025-06-02 15:23:22] [INFO ] Flatten gal took : 23 ms
[2025-06-02 15:23:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 6 ms.
[2025-06-02 15:23:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality512293708533667552.gal : 3 ms
[2025-06-02 15:23:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10650481778802524693.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/CTLCardinality512293708533667552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10650481778802524693.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.08533e+07,3.18826,83136,2976,29,201168,556,1000,273352,69,1738,0
Converting to forward existential form...Done !
original formula: !(E(A((E(((i1.u15.p68==1)||(i1.u15.p65==1)) U !(((i0.u8.p30==0)||(i0.u8.p31==1)))) + EG(E((i10.i1.u5.p24==1) U ((i5.i0.u33.p124==0)||(i4....233
=> equivalent forward existential formula: [(EY(FwdU(Init,!((E(!(((i5.i2.u49.p166==0)||(i5.i1.u37.p131==1))) U (!((E(((i1.u15.p68==1)||(i1.u15.p65==1)) U !...388
Reverse transition relation is NOT exact ! Due to transitions t16, t28, t39, t48, t56, t57, t105, t122, t123, t135, t181, t192, t197, t202, t204, t228, t22...1095
Detected timeout of ITS tools.
[2025-06-02 15:23:52] [INFO ] Flatten gal took : 17 ms
[2025-06-02 15:23:52] [INFO ] Flatten gal took : 17 ms
[2025-06-02 15:23:52] [INFO ] Applying decomposition
[2025-06-02 15:23:52] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph51704810305299825.txt' '-o' '/tmp/graph51704810305299825.bin' '-w' '/tmp/graph51704810305299825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph51704810305299825.bin' '-l' '-1' '-v' '-w' '/tmp/graph51704810305299825.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:23:52] [INFO ] Decomposing Gal with order
[2025-06-02 15:23:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:23:52] [INFO ] Removed a total of 900 redundant transitions.
[2025-06-02 15:23:52] [INFO ] Flatten gal took : 30 ms
[2025-06-02 15:23:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 10 ms.
[2025-06-02 15:23:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality17558047902319617158.gal : 4 ms
[2025-06-02 15:23:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality1452832799071250031.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/CTLCardinality17558047902319617158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1452832799071250031.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 15:53:05] [INFO ] Applying decomposition
[2025-06-02 15:53:05] [INFO ] Flatten gal took : 309 ms
[2025-06-02 15:53:06] [INFO ] Decomposing Gal with order
[2025-06-02 15:53:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:53:06] [INFO ] Removed a total of 840 redundant transitions.
[2025-06-02 15:53:06] [INFO ] Flatten gal took : 575 ms
[2025-06-02 15:53:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 84 ms.
[2025-06-02 15:53:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3233233145749897915.gal : 55 ms
[2025-06-02 15:53:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14809587147082603897.ctl : 17 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/CTLCardinality3233233145749897915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14809587147082603897.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.14414e+07,4.60666,96308,1678,2798,81817,51453,296,433367,473,654916,0
Converting to forward existential form...Done !
original formula: !(A(((EG(((((((i0.i1.u10.p163==0)||(i0.i0.i0.u5.p49==1))&&(i0.i1.u11.p182==1))||(i0.i1.u10.p152==0))||((i0.i0.i0.u5.p29==1)||(i0.i0.i0.u5...650
=> equivalent forward existential formula: ([((((FwdU(Init,!(!(((!((!((i0.i1.u10.p134==0)||(i0.i0.i0.u5.p42==1)))||(((i0.i0.i1.u8.p79==0)||(i0.i0.i0.u4.p9=...1156
Reverse transition relation is NOT exact ! Due to transitions t266, u12.t2, u12.t6, i0.t478, i0.t474, i0.i0.i0.u4.t245, i0.i0.i0.u4.t247, i0.i0.i0.u4.t248,...2405
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-18"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-18, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;