Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300074.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 BusinessProcesses-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14: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 131K 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 BusinessProcesses-PT-10-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2023-15
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748566652221

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 00:57:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 00:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:57:34] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2025-05-30 00:57:34] [INFO ] Transformed 518 places.
[2025-05-30 00:57:34] [INFO ] Transformed 471 transitions.
[2025-05-30 00:57:34] [INFO ] Found NUPN structural information;
[2025-05-30 00:57:34] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 125 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 55 place count 463 transition count 417
Iterating global reduction 1 with 54 rules applied. Total rules applied 109 place count 463 transition count 417
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 129 place count 443 transition count 397
Iterating global reduction 1 with 20 rules applied. Total rules applied 149 place count 443 transition count 397
Applied a total of 149 rules in 237 ms. Remains 443 /518 variables (removed 75) and now considering 397/471 (removed 74) transitions.
// Phase 1: matrix 397 rows 443 cols
[2025-05-30 00:57:35] [INFO ] Computed 84 invariants in 59 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:57:35] [INFO ] Implicit Places using invariants in 760 ms returned []
[2025-05-30 00:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:57:36] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2025-05-30 00:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/443 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:57:59] [INFO ] Deduced a trap composed of 62 places in 424 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:00] [INFO ] Deduced a trap composed of 61 places in 350 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:00] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:01] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:01] [INFO ] Deduced a trap composed of 67 places in 319 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:01] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:02] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:02] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:02] [INFO ] Deduced a trap composed of 62 places in 247 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:03] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:03] [INFO ] Deduced a trap composed of 82 places in 259 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:03] [INFO ] Deduced a trap composed of 82 places in 234 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:03] [INFO ] Deduced a trap composed of 83 places in 326 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:04] [INFO ] Deduced a trap composed of 83 places in 285 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:04] [INFO ] Deduced a trap composed of 83 places in 350 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:04] [INFO ] Deduced a trap composed of 78 places in 336 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:05] [INFO ] Deduced a trap composed of 78 places in 333 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:05] [INFO ] Deduced a trap composed of 62 places in 341 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:06] [INFO ] Deduced a trap composed of 62 places in 366 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:06] [INFO ] Deduced a trap composed of 61 places in 398 ms of which 67 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/840 variables, and 104 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/443 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:14] [INFO ] Deduced a trap composed of 53 places in 381 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:15] [INFO ] Deduced a trap composed of 57 places in 358 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:15] [INFO ] Deduced a trap composed of 57 places in 388 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:16] [INFO ] Deduced a trap composed of 53 places in 381 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:16] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:16] [INFO ] Deduced a trap composed of 54 places in 368 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:17] [INFO ] Deduced a trap composed of 55 places in 273 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:17] [INFO ] Deduced a trap composed of 55 places in 344 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:17] [INFO ] Deduced a trap composed of 54 places in 362 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 54 places in 342 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 54 places in 374 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:19] [INFO ] Deduced a trap composed of 55 places in 331 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:19] [INFO ] Deduced a trap composed of 55 places in 331 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:20] [INFO ] Deduced a trap composed of 54 places in 364 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:20] [INFO ] Deduced a trap composed of 54 places in 339 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:20] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:21] [INFO ] Deduced a trap composed of 55 places in 319 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:21] [INFO ] Deduced a trap composed of 55 places in 335 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:21] [INFO ] Deduced a trap composed of 55 places in 330 ms of which 60 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:22] [INFO ] Deduced a trap composed of 83 places in 385 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:23] [INFO ] Deduced a trap composed of 85 places in 332 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:23] [INFO ] Deduced a trap composed of 85 places in 287 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:23] [INFO ] Deduced a trap composed of 85 places in 337 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:24] [INFO ] Deduced a trap composed of 64 places in 346 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:24] [INFO ] Deduced a trap composed of 85 places in 275 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:24] [INFO ] Deduced a trap composed of 80 places in 359 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:25] [INFO ] Deduced a trap composed of 80 places in 389 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:25] [INFO ] Deduced a trap composed of 85 places in 360 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:26] [INFO ] Deduced a trap composed of 80 places in 349 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:26] [INFO ] Deduced a trap composed of 80 places in 375 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:26] [INFO ] Deduced a trap composed of 76 places in 249 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:27] [INFO ] Deduced a trap composed of 78 places in 290 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:27] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:27] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:27] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:28] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:28] [INFO ] Deduced a trap composed of 66 places in 330 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:28] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:29] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 51 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:29] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:30] [INFO ] Deduced a trap composed of 63 places in 310 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:30] [INFO ] Deduced a trap composed of 63 places in 307 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:30] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:31] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:31] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:31] [INFO ] Deduced a trap composed of 70 places in 223 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:31] [INFO ] Deduced a trap composed of 69 places in 323 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:32] [INFO ] Deduced a trap composed of 77 places in 221 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:32] [INFO ] Deduced a trap composed of 77 places in 345 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:32] [INFO ] Deduced a trap composed of 77 places in 307 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:33] [INFO ] Deduced a trap composed of 71 places in 244 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:33] [INFO ] Deduced a trap composed of 72 places in 236 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:33] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:33] [INFO ] Deduced a trap composed of 75 places in 337 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:34] [INFO ] Deduced a trap composed of 75 places in 347 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:34] [INFO ] Deduced a trap composed of 70 places in 211 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:34] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:35] [INFO ] Deduced a trap composed of 75 places in 317 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:35] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 44 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:36] [INFO ] Deduced a trap composed of 83 places in 297 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:36] [INFO ] Deduced a trap composed of 67 places in 307 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:36] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:36] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:37] [INFO ] Deduced a trap composed of 70 places in 335 ms of which 60 ms to minimize.
SMT process timed out in 60315ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60335ms
Starting structural reductions in LTL mode, iteration 1 : 443/518 places, 397/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62408 ms. Remains : 443/518 places, 397/471 transitions.
Support contains 125 out of 443 places after structural reductions.
[2025-05-30 00:58:37] [INFO ] Flatten gal took : 109 ms
[2025-05-30 00:58:37] [INFO ] Flatten gal took : 43 ms
[2025-05-30 00:58:37] [INFO ] Input system was already deterministic with 397 transitions.
RANDOM walk for 40000 steps (328 resets) in 2798 ms. (14 steps per ms) remains 32/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
[2025-05-30 00:58:38] [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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp54 is UNSAT
At refinement iteration 1 (OVERLAPS) 212/266 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 66/332 variables, 16/45 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 5 (OVERLAPS) 108/440 variables, 39/84 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 395/835 variables, 440/524 constraints. Problems are: Problem set: 3 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/835 variables, 0/524 constraints. Problems are: Problem set: 3 solved, 29 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 9 (OVERLAPS) 5/840 variables, 3/527 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 0/527 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/840 variables, 0/527 constraints. Problems are: Problem set: 9 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 527 constraints, problems are : Problem set: 9 solved, 23 unsolved in 4983 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 23 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 206/243 variables, 26/26 constraints. Problems are: Problem set: 9 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:44] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 10 ms to minimize.
Problem AtomicPropp16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:44] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:44] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:44] [INFO ] Deduced a trap composed of 82 places in 461 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:45] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:45] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 6/32 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 81/324 variables, 19/51 constraints. Problems are: Problem set: 10 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:45] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:46] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:46] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:46] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:46] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:46] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:47] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:47] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:47] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:47] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:47] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:48] [INFO ] Deduced a trap composed of 77 places in 230 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:48] [INFO ] Deduced a trap composed of 77 places in 238 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:48] [INFO ] Deduced a trap composed of 74 places in 244 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:48] [INFO ] Deduced a trap composed of 80 places in 218 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:48] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 4 ms to minimize.
SMT process timed out in 10069ms, After SMT, problems are : Problem set: 10 solved, 22 unsolved
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 397/397 transitions.
Graph (complete) has 985 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 442 transition count 357
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 403 transition count 354
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 400 transition count 354
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 85 place count 400 transition count 271
Deduced a syphon composed of 83 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 263 place count 305 transition count 271
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 283 place count 285 transition count 251
Iterating global reduction 3 with 20 rules applied. Total rules applied 303 place count 285 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 303 place count 285 transition count 249
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 307 place count 283 transition count 249
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 499 place count 185 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 500 place count 185 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 502 place count 184 transition count 157
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 510 place count 184 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 511 place count 183 transition count 156
Applied a total of 511 rules in 221 ms. Remains 183 /443 variables (removed 260) and now considering 156/397 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 183/443 places, 156/397 transitions.
RANDOM walk for 40000 steps (3217 resets) in 896 ms. (44 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4004 steps (74 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (75 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (80 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (71 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (79 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (75 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (75 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (77 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (84 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (78 resets) in 21 ms. (182 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (75 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (61 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (82 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (78 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (70 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (81 resets) in 82 ms. (48 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (77 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (73 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (72 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (77 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
// Phase 1: matrix 156 rows 183 cols
[2025-05-30 00:58:49] [INFO ] Computed 68 invariants in 13 ms
[2025-05-30 00:58:49] [INFO ] State equation strengthened by 3 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 73/101 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 29/130 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 34/164 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 156/320 variables, 164/223 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 19/339 variables, 19/245 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:50] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:51] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:51] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:51] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:51] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:51] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:51] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:52] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 22 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/339 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 262 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2916 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 183/183 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 73/101 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 29/130 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 7 (OVERLAPS) 34/164 variables, 22/61 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 156/320 variables, 164/227 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 3/230 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 15/245 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:53] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 15 (OVERLAPS) 19/339 variables, 19/265 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 9/274 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 3/277 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/339 variables, 4/281 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:54] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:54] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:55] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:55] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:55] [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-05-30 00:58:55] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:55] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:56] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:56] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:56] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:56] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:56] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:56] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:57] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:57] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:57] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:57] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:57] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:57] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:58] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 24 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/339 variables, 20/301 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:58] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:58] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:58] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:59] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 19 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/339 variables, 4/305 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:59] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 23 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/339 variables, 1/306 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:00] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/339 variables, 1/307 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:00] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 15 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/339 variables, 1/308 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/339 variables, 0/308 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:01] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 9 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/339 variables, 1/309 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/339 variables, 0/309 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 0/339 variables, 0/309 constraints. Problems are: Problem set: 4 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 309 constraints, problems are : Problem set: 4 solved, 15 unsolved in 10561 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 183/183 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13507ms problems are : Problem set: 4 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 10 properties in 13971 ms.
Support contains 6 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 156/156 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 183 transition count 152
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 179 transition count 152
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 8 place count 179 transition count 143
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 27 place count 169 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 168 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 168 transition count 142
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 54 place count 155 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 154 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 153 transition count 146
Applied a total of 57 rules in 38 ms. Remains 153 /183 variables (removed 30) and now considering 146/156 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 153/183 places, 146/156 transitions.
RANDOM walk for 40000 steps (4654 resets) in 278 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1399 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1154 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1402 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1396 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1352 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 445 steps, run visited all 5 properties in 19 ms. (steps per millisecond=23 )
Probabilistic random walk after 445 steps, saw 214 distinct states, run finished after 25 ms. (steps per millisecond=17 ) properties seen :5
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
[2025-05-30 00:59:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 00:59:17] [INFO ] Flatten gal took : 33 ms
FORMULA BusinessProcesses-PT-10-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 00:59:17] [INFO ] Flatten gal took : 33 ms
[2025-05-30 00:59:17] [INFO ] Input system was already deterministic with 397 transitions.
Support contains 90 out of 443 places (down from 97) after GAL structural reductions.
Computed a total of 221 stabilizing places and 226 stable transitions
Graph (complete) has 985 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Graph (trivial) has 220 edges and 443 vertex of which 7 / 443 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 978 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 435 transition count 333
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 380 transition count 333
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 112 place count 380 transition count 249
Deduced a syphon composed of 84 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 181 rules applied. Total rules applied 293 place count 283 transition count 249
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 320 place count 256 transition count 222
Iterating global reduction 2 with 27 rules applied. Total rules applied 347 place count 256 transition count 222
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 347 place count 256 transition count 217
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 357 place count 251 transition count 217
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 199 rules applied. Total rules applied 556 place count 149 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 557 place count 148 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 147 transition count 119
Applied a total of 558 rules in 112 ms. Remains 147 /443 variables (removed 296) and now considering 119/397 (removed 278) transitions.
// Phase 1: matrix 119 rows 147 cols
[2025-05-30 00:59:17] [INFO ] Computed 65 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:59:18] [INFO ] Implicit Places using invariants in 285 ms returned [0, 1, 2, 3, 4, 5, 6, 20, 21, 22, 23, 24, 25, 49]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 288 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 133/443 places, 119/397 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 413 ms. Remains : 133/443 places, 119/397 transitions.
[2025-05-30 00:59:18] [INFO ] Flatten gal took : 18 ms
[2025-05-30 00:59:18] [INFO ] Flatten gal took : 18 ms
[2025-05-30 00:59:18] [INFO ] Input system was already deterministic with 119 transitions.
RANDOM walk for 2417 steps (459 resets) in 78 ms. (30 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-10-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 00:59:18] [INFO ] Flatten gal took : 28 ms
[2025-05-30 00:59:18] [INFO ] Flatten gal took : 19 ms
[2025-05-30 00:59:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11678767434249924365.gal : 22 ms
[2025-05-30 00:59:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17204326242734264868.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11678767434249924365.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17204326242734264868.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 412 transition count 366
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 412 transition count 366
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 402 transition count 356
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 402 transition count 356
Applied a total of 82 rules in 98 ms. Remains 402 /443 variables (removed 41) and now considering 356/397 (removed 41) transitions.
// Phase 1: matrix 356 rows 402 cols
[2025-05-30 00:59:18] [INFO ] Computed 84 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:59:19] [INFO ] Implicit Places using invariants in 605 ms returned []
[2025-05-30 00:59:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:59:20] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2025-05-30 00:59: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/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:38] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:39] [INFO ] Deduced a trap composed of 68 places in 355 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:39] [INFO ] Deduced a trap composed of 68 places in 338 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:40] [INFO ] Deduced a trap composed of 68 places in 338 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:40] [INFO ] Deduced a trap composed of 69 places in 325 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:40] [INFO ] Deduced a trap composed of 69 places in 324 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:41] [INFO ] Deduced a trap composed of 69 places in 313 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:41] [INFO ] Deduced a trap composed of 69 places in 316 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:41] [INFO ] Deduced a trap composed of 64 places in 333 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:42] [INFO ] Deduced a trap composed of 64 places in 334 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:42] [INFO ] Deduced a trap composed of 64 places in 311 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:42] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:43] [INFO ] Deduced a trap composed of 69 places in 303 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:43] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:43] [INFO ] Deduced a trap composed of 69 places in 325 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:43] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:44] [INFO ] Deduced a trap composed of 63 places in 325 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:44] [INFO ] Deduced a trap composed of 63 places in 296 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:45] [INFO ] Deduced a trap composed of 69 places in 319 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:45] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 44 ms to minimize.
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 4 solved, 351 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:46] [INFO ] Deduced a trap composed of 70 places in 287 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:46] [INFO ] Deduced a trap composed of 69 places in 344 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:47] [INFO ] Deduced a trap composed of 70 places in 337 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:47] [INFO ] Deduced a trap composed of 68 places in 378 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:47] [INFO ] Deduced a trap composed of 30 places in 332 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:48] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:48] [INFO ] Deduced a trap composed of 69 places in 339 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:48] [INFO ] Deduced a trap composed of 70 places in 286 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:49] [INFO ] Deduced a trap composed of 67 places in 331 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:49] [INFO ] Deduced a trap composed of 69 places in 340 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:50] [INFO ] Deduced a trap composed of 63 places in 314 ms of which 54 ms to minimize.
SMT process timed out in 30320ms, After SMT, problems are : Problem set: 4 solved, 351 unsolved
Search for dead transitions found 4 dead transitions in 30326ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 402/443 places, 352/397 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31928 ms. Remains : 402/443 places, 352/397 transitions.
[2025-05-30 00:59:50] [INFO ] Flatten gal took : 39 ms
[2025-05-30 00:59:50] [INFO ] Flatten gal took : 39 ms
[2025-05-30 00:59:50] [INFO ] Input system was already deterministic with 352 transitions.
[2025-05-30 00:59:50] [INFO ] Flatten gal took : 42 ms
[2025-05-30 00:59:50] [INFO ] Flatten gal took : 32 ms
[2025-05-30 00:59:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7899244587601102103.gal : 14 ms
[2025-05-30 00:59:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3072721414728367255.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/CTLFireability7899244587601102103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3072721414728367255.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-05-30 01:00:20] [INFO ] Flatten gal took : 21 ms
[2025-05-30 01:00:20] [INFO ] Applying decomposition
[2025-05-30 01:00:20] [INFO ] Flatten gal took : 18 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/graph7586452158172838047.txt' '-o' '/tmp/graph7586452158172838047.bin' '-w' '/tmp/graph7586452158172838047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7586452158172838047.bin' '-l' '-1' '-v' '-w' '/tmp/graph7586452158172838047.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:00:21] [INFO ] Decomposing Gal with order
[2025-05-30 01:00:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:00:21] [INFO ] Removed a total of 231 redundant transitions.
[2025-05-30 01:00:21] [INFO ] Flatten gal took : 99 ms
[2025-05-30 01:00:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-05-30 01:00:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6194325557813773254.gal : 15 ms
[2025-05-30 01:00:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7819289711335936303.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/CTLFireability6194325557813773254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7819289711335936303.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.87783e+24,5.4465,113064,8138,50,213005,711,939,360267,60,1671,0


Converting to forward existential form...Done !
original formula: E((E((((i4.u41.p123==1)&&(i12.u92.p294==1))&&(i4.u117.p436==1)) U (!(EG((i4.u41.p124==1))) + AG(((i17.i1.u60.p181==1)&&(i17.i1.u61.p184==...328
=> equivalent forward existential formula: [(FwdU(Init,(E((((i4.u41.p123==1)&&(i12.u92.p294==1))&&(i4.u117.p436==1)) U (!(EG((i4.u41.p124==1))) + !(E(TRUE ...422
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t8, t9, t10, t16, t145, t167, t211, t220, t228, t232, t313, t315, t317, t319, t32...1120
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 411 transition count 365
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 411 transition count 365
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 400 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 400 transition count 354
Applied a total of 86 rules in 39 ms. Remains 400 /443 variables (removed 43) and now considering 354/397 (removed 43) transitions.
// Phase 1: matrix 354 rows 400 cols
[2025-05-30 01:00:51] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:00:51] [INFO ] Implicit Places using invariants in 414 ms returned []
[2025-05-30 01:00:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:00:52] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2025-05-30 01:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:11] [INFO ] Deduced a trap composed of 47 places in 330 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:12] [INFO ] Deduced a trap composed of 47 places in 317 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:12] [INFO ] Deduced a trap composed of 47 places in 327 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:12] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:13] [INFO ] Deduced a trap composed of 48 places in 273 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:13] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:13] [INFO ] Deduced a trap composed of 68 places in 306 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:14] [INFO ] Deduced a trap composed of 68 places in 304 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:14] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:14] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:15] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:15] [INFO ] Deduced a trap composed of 68 places in 330 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:15] [INFO ] Deduced a trap composed of 63 places in 415 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 68 places in 289 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 68 places in 272 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 53 places in 326 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:18] [INFO ] Deduced a trap composed of 48 places in 317 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:18] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:20] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:20] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:20] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:21] [INFO ] Deduced a trap composed of 31 places in 300 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:21] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:21] [INFO ] Deduced a trap composed of 60 places in 327 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:22] [INFO ] Deduced a trap composed of 71 places in 463 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:22] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:23] [INFO ] Deduced a trap composed of 18 places in 290 ms of which 21 ms to minimize.
SMT process timed out in 30093ms, After SMT, problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 30096ms
Starting structural reductions in LTL mode, iteration 1 : 400/443 places, 354/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31750 ms. Remains : 400/443 places, 354/397 transitions.
[2025-05-30 01:01:23] [INFO ] Flatten gal took : 26 ms
[2025-05-30 01:01:23] [INFO ] Flatten gal took : 24 ms
[2025-05-30 01:01:23] [INFO ] Input system was already deterministic with 354 transitions.
[2025-05-30 01:01:23] [INFO ] Flatten gal took : 23 ms
[2025-05-30 01:01:23] [INFO ] Flatten gal took : 22 ms
[2025-05-30 01:01:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3179808727150869512.gal : 6 ms
[2025-05-30 01:01:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14685645821714607321.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/CTLFireability3179808727150869512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14685645821714607321.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-05-30 01:01:53] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:01:53] [INFO ] Applying decomposition
[2025-05-30 01:01:53] [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/graph3624477740064803591.txt' '-o' '/tmp/graph3624477740064803591.bin' '-w' '/tmp/graph3624477740064803591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3624477740064803591.bin' '-l' '-1' '-v' '-w' '/tmp/graph3624477740064803591.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:01:53] [INFO ] Decomposing Gal with order
[2025-05-30 01:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:01:53] [INFO ] Removed a total of 255 redundant transitions.
[2025-05-30 01:01:53] [INFO ] Flatten gal took : 38 ms
[2025-05-30 01:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 11 ms.
[2025-05-30 01:01:53] [INFO ] Time to serialize gal into /tmp/CTLFireability757764246342704012.gal : 6 ms
[2025-05-30 01:01:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7547833302603238216.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/CTLFireability757764246342704012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7547833302603238216.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 -...261
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.87567e+24,26.6234,490308,8514,40,886286,569,805,2.66854e+06,48,1358,0


Converting to forward existential form...Done !
original formula: EF(EX((i11.u52.p152==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (i11.u52.p152==1))] != FALSE
(forward)formula 0,1,28.1565,490308,1,0,886286,569,1402,2.66854e+06,65,1358,154066
FORMULA BusinessProcesses-PT-10-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 413 transition count 367
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 413 transition count 367
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 403 transition count 357
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 403 transition count 357
Applied a total of 80 rules in 32 ms. Remains 403 /443 variables (removed 40) and now considering 357/397 (removed 40) transitions.
// Phase 1: matrix 357 rows 403 cols
[2025-05-30 01:02:21] [INFO ] Computed 84 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:22] [INFO ] Implicit Places using invariants in 499 ms returned []
[2025-05-30 01:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:23] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2025-05-30 01:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:43] [INFO ] Deduced a trap composed of 49 places in 304 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:43] [INFO ] Deduced a trap composed of 49 places in 311 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:43] [INFO ] Deduced a trap composed of 49 places in 335 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:44] [INFO ] Deduced a trap composed of 68 places in 317 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:44] [INFO ] Deduced a trap composed of 63 places in 336 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:44] [INFO ] Deduced a trap composed of 63 places in 471 ms of which 222 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:45] [INFO ] Deduced a trap composed of 63 places in 339 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:45] [INFO ] Deduced a trap composed of 63 places in 452 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:46] [INFO ] Deduced a trap composed of 70 places in 293 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:46] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:46] [INFO ] Deduced a trap composed of 70 places in 301 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:47] [INFO ] Deduced a trap composed of 67 places in 291 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:48] [INFO ] Deduced a trap composed of 64 places in 366 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:48] [INFO ] Deduced a trap composed of 64 places in 323 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:48] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:49] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:49] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:51] [INFO ] Deduced a trap composed of 18 places in 396 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:51] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:51] [INFO ] Deduced a trap composed of 66 places in 333 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:52] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:52] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:53] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 42 ms to minimize.
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 30170ms
Starting structural reductions in LTL mode, iteration 1 : 403/443 places, 357/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31664 ms. Remains : 403/443 places, 357/397 transitions.
[2025-05-30 01:02:53] [INFO ] Flatten gal took : 18 ms
[2025-05-30 01:02:53] [INFO ] Flatten gal took : 19 ms
[2025-05-30 01:02:53] [INFO ] Input system was already deterministic with 357 transitions.
[2025-05-30 01:02:53] [INFO ] Flatten gal took : 18 ms
[2025-05-30 01:02:53] [INFO ] Flatten gal took : 19 ms
[2025-05-30 01:02:53] [INFO ] Time to serialize gal into /tmp/CTLFireability814156807416079454.gal : 4 ms
[2025-05-30 01:02:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10236652185695520458.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/CTLFireability814156807416079454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10236652185695520458.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-05-30 01:03:23] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:03:23] [INFO ] Applying decomposition
[2025-05-30 01:03:23] [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/graph12164098362013541528.txt' '-o' '/tmp/graph12164098362013541528.bin' '-w' '/tmp/graph12164098362013541528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12164098362013541528.bin' '-l' '-1' '-v' '-w' '/tmp/graph12164098362013541528.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:03:23] [INFO ] Decomposing Gal with order
[2025-05-30 01:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:03:23] [INFO ] Removed a total of 251 redundant transitions.
[2025-05-30 01:03:23] [INFO ] Flatten gal took : 33 ms
[2025-05-30 01:03:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2025-05-30 01:03:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9161832638387503913.gal : 6 ms
[2025-05-30 01:03:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3877858615325728975.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/CTLFireability9161832638387503913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3877858615325728975.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 412 transition count 366
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 412 transition count 366
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 401 transition count 355
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 401 transition count 355
Applied a total of 84 rules in 26 ms. Remains 401 /443 variables (removed 42) and now considering 355/397 (removed 42) transitions.
// Phase 1: matrix 355 rows 401 cols
[2025-05-30 01:03:54] [INFO ] Computed 84 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:54] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-05-30 01:03:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:55] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2025-05-30 01:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:15] [INFO ] Deduced a trap composed of 47 places in 333 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:15] [INFO ] Deduced a trap composed of 66 places in 337 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:15] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:16] [INFO ] Deduced a trap composed of 67 places in 372 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:16] [INFO ] Deduced a trap composed of 67 places in 364 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:16] [INFO ] Deduced a trap composed of 67 places in 320 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:17] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:17] [INFO ] Deduced a trap composed of 62 places in 323 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:17] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:18] [INFO ] Deduced a trap composed of 48 places in 308 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:18] [INFO ] Deduced a trap composed of 62 places in 349 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:18] [INFO ] Deduced a trap composed of 62 places in 307 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:18] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:19] [INFO ] Deduced a trap composed of 68 places in 325 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:19] [INFO ] Deduced a trap composed of 68 places in 283 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:19] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 68 places in 318 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:21] [INFO ] Deduced a trap composed of 68 places in 321 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:21] [INFO ] Deduced a trap composed of 68 places in 284 ms of which 61 ms to minimize.
Problem TDEAD269 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/104 constraints. Problems are: Problem set: 3 solved, 351 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:22] [INFO ] Deduced a trap composed of 68 places in 300 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:22] [INFO ] Deduced a trap composed of 63 places in 330 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:22] [INFO ] Deduced a trap composed of 63 places in 321 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:23] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:23] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:24] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:24] [INFO ] Deduced a trap composed of 68 places in 281 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:24] [INFO ] Deduced a trap composed of 69 places in 319 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:25] [INFO ] Deduced a trap composed of 69 places in 309 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:25] [INFO ] Deduced a trap composed of 69 places in 314 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:25] [INFO ] Deduced a trap composed of 69 places in 327 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:25] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/756 variables, and 116 constraints, problems are : Problem set: 3 solved, 351 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 3 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 3 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 3 solved, 351 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 32/116 constraints. Problems are: Problem set: 23 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:32] [INFO ] Deduced a trap composed of 69 places in 310 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:32] [INFO ] Deduced a trap composed of 69 places in 303 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:33] [INFO ] Deduced a trap composed of 69 places in 274 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:33] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:33] [INFO ] Deduced a trap composed of 69 places in 296 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:34] [INFO ] Deduced a trap composed of 69 places in 309 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:34] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:35] [INFO ] Deduced a trap composed of 68 places in 340 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:35] [INFO ] Deduced a trap composed of 68 places in 401 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:36] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:36] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:36] [INFO ] Deduced a trap composed of 20 places in 322 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:37] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:37] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:37] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:38] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:38] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:38] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:39] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:39] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 17 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/136 constraints. Problems are: Problem set: 28 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:40] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:41] [INFO ] Deduced a trap composed of 66 places in 321 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:41] [INFO ] Deduced a trap composed of 66 places in 337 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:41] [INFO ] Deduced a trap composed of 67 places in 326 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:42] [INFO ] Deduced a trap composed of 68 places in 349 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:42] [INFO ] Deduced a trap composed of 68 places in 429 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:43] [INFO ] Deduced a trap composed of 68 places in 426 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:43] [INFO ] Deduced a trap composed of 67 places in 368 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:44] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:45] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:46] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:46] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:46] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:47] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:47] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:47] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:48] [INFO ] Deduced a trap composed of 67 places in 358 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:48] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:48] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:48] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/156 constraints. Problems are: Problem set: 28 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:50] [INFO ] Deduced a trap composed of 71 places in 343 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:50] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:51] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:51] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:52] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:53] [INFO ] Deduced a trap composed of 35 places in 350 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:53] [INFO ] Deduced a trap composed of 62 places in 406 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:54] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:54] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:54] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:55] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:55] [INFO ] Deduced a trap composed of 67 places in 320 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:55] [INFO ] Deduced a trap composed of 67 places in 332 ms of which 39 ms to minimize.
SMT process timed out in 60086ms, After SMT, problems are : Problem set: 28 solved, 326 unsolved
Search for dead transitions found 28 dead transitions in 60088ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 401/443 places, 327/397 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61916 ms. Remains : 401/443 places, 327/397 transitions.
[2025-05-30 01:04:55] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:04:55] [INFO ] Flatten gal took : 17 ms
[2025-05-30 01:04:55] [INFO ] Input system was already deterministic with 327 transitions.
[2025-05-30 01:04:55] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:04:56] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:04:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5293393848918833173.gal : 5 ms
[2025-05-30 01:04:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15544534835908441709.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/CTLFireability5293393848918833173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15544534835908441709.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-05-30 01:05:26] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:05:26] [INFO ] Applying decomposition
[2025-05-30 01:05:26] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15102186298136013364.txt' '-o' '/tmp/graph15102186298136013364.bin' '-w' '/tmp/graph15102186298136013364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15102186298136013364.bin' '-l' '-1' '-v' '-w' '/tmp/graph15102186298136013364.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:05:26] [INFO ] Decomposing Gal with order
[2025-05-30 01:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:05:26] [INFO ] Removed a total of 124 redundant transitions.
[2025-05-30 01:05:26] [INFO ] Flatten gal took : 37 ms
[2025-05-30 01:05:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2025-05-30 01:05:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8988842207500171118.gal : 5 ms
[2025-05-30 01:05:26] [INFO ] Time to serialize properties into /tmp/CTLFireability10860315532155248944.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/CTLFireability8988842207500171118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10860315532155248944.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Graph (trivial) has 216 edges and 443 vertex of which 7 / 443 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 978 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 435 transition count 336
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 383 transition count 336
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 106 place count 383 transition count 251
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 289 place count 285 transition count 251
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 316 place count 258 transition count 224
Iterating global reduction 2 with 27 rules applied. Total rules applied 343 place count 258 transition count 224
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 343 place count 258 transition count 219
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 353 place count 253 transition count 219
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 531 place count 163 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 532 place count 162 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 533 place count 161 transition count 130
Applied a total of 533 rules in 108 ms. Remains 161 /443 variables (removed 282) and now considering 130/397 (removed 267) transitions.
// Phase 1: matrix 130 rows 161 cols
[2025-05-30 01:05:56] [INFO ] Computed 68 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:05:56] [INFO ] Implicit Places using invariants in 325 ms returned [0, 4, 5, 6, 7, 8, 16, 18, 20, 25, 26, 27, 28, 29, 30, 53]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 327 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/443 places, 130/397 transitions.
Applied a total of 0 rules in 9 ms. Remains 145 /145 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 445 ms. Remains : 145/443 places, 130/397 transitions.
[2025-05-30 01:05:56] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:05:56] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:05:56] [INFO ] Input system was already deterministic with 130 transitions.
[2025-05-30 01:05:56] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:05:56] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:05:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8811073355668725067.gal : 2 ms
[2025-05-30 01:05:56] [INFO ] Time to serialize properties into /tmp/CTLFireability645776843364929851.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8811073355668725067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability645776843364929851.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.17567e+09,2.95552,68792,2,5001,5,371753,6,0,710,203323,0


Converting to forward existential form...Done !
original formula: (AG((p230==1)) + EG((!(E(E((p442==1) U (p32==1)) U ((p222!=1) * EG((p424==1))))) * EF((p233==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((!(E(E((p442==1) U (p32==1)) U ((p222!=1) * EG((p424==1))))) * E(TRUE U (p233==1)))))),TRUE)...180
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t16, t24, t25, t26, t27, t28, t35, t36, t37, t38, t39, t71, t83, t84, t85, t86, t87, ...360
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,11.0046,227608,1,0,320,1.45737e+06,268,156,5348,1.04578e+06,377
FORMULA BusinessProcesses-PT-10-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Graph (trivial) has 219 edges and 443 vertex of which 7 / 443 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 978 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 435 transition count 333
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 380 transition count 333
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 112 place count 380 transition count 249
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 181 rules applied. Total rules applied 293 place count 283 transition count 249
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 321 place count 255 transition count 221
Iterating global reduction 2 with 28 rules applied. Total rules applied 349 place count 255 transition count 221
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 349 place count 255 transition count 216
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 359 place count 250 transition count 216
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 189 rules applied. Total rules applied 548 place count 153 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 549 place count 152 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 550 place count 151 transition count 123
Applied a total of 550 rules in 64 ms. Remains 151 /443 variables (removed 292) and now considering 123/397 (removed 274) transitions.
// Phase 1: matrix 123 rows 151 cols
[2025-05-30 01:06:08] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:06:08] [INFO ] Implicit Places using invariants in 317 ms returned [5, 6, 7, 8, 22, 23, 24, 25, 26, 27, 51]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 319 ms to find 11 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/443 places, 123/397 transitions.
Applied a total of 0 rules in 9 ms. Remains 140 /140 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 392 ms. Remains : 140/443 places, 123/397 transitions.
[2025-05-30 01:06:08] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:06:08] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:06:08] [INFO ] Input system was already deterministic with 123 transitions.
[2025-05-30 01:06:08] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:06:08] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:06:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15106209737847581959.gal : 2 ms
[2025-05-30 01:06:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6130803802620240849.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/CTLFireability15106209737847581959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6130803802620240849.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39591e+09,3.64734,81896,2,7214,5,424839,6,0,682,257250,0


Converting to forward existential form...Done !
original formula: !(E(EF(((p191==1)&&(p306==1))) U (p20==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((p191==1)&&(p306==1)))) * (p20==1))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t6, t15, t23, t24, t25, t26, t27, t34, t35, t36, t37, t38, t70, t81, t82, t96, t97, t...342
(forward)formula 0,0,5.32149,82024,1,0,294,439706,235,171,5120,290550,356
FORMULA BusinessProcesses-PT-10-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 417 transition count 371
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 417 transition count 371
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 409 transition count 363
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 409 transition count 363
Applied a total of 68 rules in 44 ms. Remains 409 /443 variables (removed 34) and now considering 363/397 (removed 34) transitions.
// Phase 1: matrix 363 rows 409 cols
[2025-05-30 01:06:13] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:06:14] [INFO ] Implicit Places using invariants in 512 ms returned []
[2025-05-30 01:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:06:15] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2025-05-30 01:06:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/409 variables, 48/78 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:34] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:34] [INFO ] Deduced a trap composed of 69 places in 315 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:35] [INFO ] Deduced a trap composed of 69 places in 353 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:35] [INFO ] Deduced a trap composed of 70 places in 358 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:35] [INFO ] Deduced a trap composed of 71 places in 286 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:36] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:36] [INFO ] Deduced a trap composed of 71 places in 261 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:36] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:36] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:37] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:37] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:37] [INFO ] Deduced a trap composed of 71 places in 284 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:38] [INFO ] Deduced a trap composed of 69 places in 296 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:38] [INFO ] Deduced a trap composed of 70 places in 325 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:39] [INFO ] Deduced a trap composed of 70 places in 323 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:39] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:39] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:39] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:40] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:40] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 56 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:41] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:41] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:41] [INFO ] Deduced a trap composed of 71 places in 286 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:42] [INFO ] Deduced a trap composed of 65 places in 312 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:43] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:43] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:43] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:44] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:44] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:44] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:45] [INFO ] Deduced a trap composed of 12 places in 333 ms of which 25 ms to minimize.
SMT process timed out in 30126ms, After SMT, problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 30127ms
Starting structural reductions in LTL mode, iteration 1 : 409/443 places, 363/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31810 ms. Remains : 409/443 places, 363/397 transitions.
[2025-05-30 01:06:45] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:06:45] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:06:45] [INFO ] Input system was already deterministic with 363 transitions.
[2025-05-30 01:06:45] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:06:45] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:06:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10422022061174683910.gal : 2 ms
[2025-05-30 01:06:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3438988106660806095.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/CTLFireability10422022061174683910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3438988106660806095.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-05-30 01:07:15] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:07:15] [INFO ] Applying decomposition
[2025-05-30 01:07:15] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14759550078258434556.txt' '-o' '/tmp/graph14759550078258434556.bin' '-w' '/tmp/graph14759550078258434556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14759550078258434556.bin' '-l' '-1' '-v' '-w' '/tmp/graph14759550078258434556.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:07:15] [INFO ] Decomposing Gal with order
[2025-05-30 01:07:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:07:15] [INFO ] Removed a total of 251 redundant transitions.
[2025-05-30 01:07:15] [INFO ] Flatten gal took : 22 ms
[2025-05-30 01:07:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 01:07:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9242995485952403422.gal : 5 ms
[2025-05-30 01:07:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1026390456743395369.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/CTLFireability9242995485952403422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1026390456743395369.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 414 transition count 368
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 414 transition count 368
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 403 transition count 357
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 403 transition count 357
Applied a total of 80 rules in 35 ms. Remains 403 /443 variables (removed 40) and now considering 357/397 (removed 40) transitions.
// Phase 1: matrix 357 rows 403 cols
[2025-05-30 01:07:45] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:07:46] [INFO ] Implicit Places using invariants in 512 ms returned []
[2025-05-30 01:07:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:07:47] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2025-05-30 01:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:06] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:06] [INFO ] Deduced a trap composed of 47 places in 318 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:07] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:07] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:07] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:07] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:08] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:08] [INFO ] Deduced a trap composed of 66 places in 295 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:08] [INFO ] Deduced a trap composed of 61 places in 321 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:09] [INFO ] Deduced a trap composed of 61 places in 325 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:09] [INFO ] Deduced a trap composed of 68 places in 284 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:09] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:09] [INFO ] Deduced a trap composed of 68 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:10] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:10] [INFO ] Deduced a trap composed of 62 places in 372 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:10] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:11] [INFO ] Deduced a trap composed of 67 places in 364 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:11] [INFO ] Deduced a trap composed of 62 places in 255 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:11] [INFO ] Deduced a trap composed of 67 places in 317 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:11] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:12] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:12] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:13] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:13] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:13] [INFO ] Deduced a trap composed of 63 places in 309 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:14] [INFO ] Deduced a trap composed of 53 places in 328 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:14] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:14] [INFO ] Deduced a trap composed of 48 places in 318 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:15] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:15] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:15] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:16] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:16] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:16] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:16] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:17] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:17] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:17] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 25 ms to minimize.
SMT process timed out in 30131ms, After SMT, problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 30134ms
Starting structural reductions in LTL mode, iteration 1 : 403/443 places, 357/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31711 ms. Remains : 403/443 places, 357/397 transitions.
[2025-05-30 01:08:17] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:08:17] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:08:17] [INFO ] Input system was already deterministic with 357 transitions.
[2025-05-30 01:08:17] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:08:17] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:08:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1840618545685492186.gal : 3 ms
[2025-05-30 01:08:17] [INFO ] Time to serialize properties into /tmp/CTLFireability14944751740948330233.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/CTLFireability1840618545685492186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14944751740948330233.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-05-30 01:08:47] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:08:47] [INFO ] Applying decomposition
[2025-05-30 01:08:47] [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/graph9611205954502555214.txt' '-o' '/tmp/graph9611205954502555214.bin' '-w' '/tmp/graph9611205954502555214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9611205954502555214.bin' '-l' '-1' '-v' '-w' '/tmp/graph9611205954502555214.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:08:47] [INFO ] Decomposing Gal with order
[2025-05-30 01:08:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:08:47] [INFO ] Removed a total of 248 redundant transitions.
[2025-05-30 01:08:48] [INFO ] Flatten gal took : 45 ms
[2025-05-30 01:08:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 13 ms.
[2025-05-30 01:08:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10325918945966321717.gal : 8 ms
[2025-05-30 01:08:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17276623620115777204.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/CTLFireability10325918945966321717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17276623620115777204.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.96426e+24,27.4388,495080,7409,75,792360,1354,1007,2.84368e+06,74,3435,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 414 transition count 368
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 414 transition count 368
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 404 transition count 358
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 404 transition count 358
Applied a total of 78 rules in 38 ms. Remains 404 /443 variables (removed 39) and now considering 358/397 (removed 39) transitions.
// Phase 1: matrix 358 rows 404 cols
[2025-05-30 01:09:18] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:18] [INFO ] Implicit Places using invariants in 530 ms returned []
[2025-05-30 01:09:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:19] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2025-05-30 01:09: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/403 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/404 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:37] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:38] [INFO ] Deduced a trap composed of 69 places in 332 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:38] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:38] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:38] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:39] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:39] [INFO ] Deduced a trap composed of 71 places in 311 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:40] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:40] [INFO ] Deduced a trap composed of 69 places in 287 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:40] [INFO ] Deduced a trap composed of 70 places in 336 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:41] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:41] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:41] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:41] [INFO ] Deduced a trap composed of 65 places in 383 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:42] [INFO ] Deduced a trap composed of 64 places in 355 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:42] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:42] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:43] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:43] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:43] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 13 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 20/104 constraints. Problems are: Problem set: 7 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:44] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:44] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:45] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:45] [INFO ] Deduced a trap composed of 66 places in 297 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:45] [INFO ] Deduced a trap composed of 71 places in 290 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:46] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:46] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:47] [INFO ] Deduced a trap composed of 28 places in 306 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:47] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:47] [INFO ] Deduced a trap composed of 65 places in 301 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:47] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:48] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:49] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:49] [INFO ] Deduced a trap composed of 61 places in 367 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:49] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 20 ms to minimize.
SMT process timed out in 30182ms, After SMT, problems are : Problem set: 7 solved, 350 unsolved
Search for dead transitions found 7 dead transitions in 30184ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 404/443 places, 351/397 transitions.
Applied a total of 0 rules in 12 ms. Remains 404 /404 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31846 ms. Remains : 404/443 places, 351/397 transitions.
[2025-05-30 01:09:49] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:09:50] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:09:50] [INFO ] Input system was already deterministic with 351 transitions.
[2025-05-30 01:09:50] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:09:50] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:09:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4481047807721647712.gal : 3 ms
[2025-05-30 01:09:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12896421490438384384.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/CTLFireability4481047807721647712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12896421490438384384.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-05-30 01:10:20] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:10:20] [INFO ] Applying decomposition
[2025-05-30 01:10:20] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16071736625330530843.txt' '-o' '/tmp/graph16071736625330530843.bin' '-w' '/tmp/graph16071736625330530843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16071736625330530843.bin' '-l' '-1' '-v' '-w' '/tmp/graph16071736625330530843.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:10:20] [INFO ] Decomposing Gal with order
[2025-05-30 01:10:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:10:20] [INFO ] Removed a total of 225 redundant transitions.
[2025-05-30 01:10:20] [INFO ] Flatten gal took : 24 ms
[2025-05-30 01:10:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2025-05-30 01:10:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15022048379440744359.gal : 6 ms
[2025-05-30 01:10:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2104931762527485087.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/CTLFireability15022048379440744359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2104931762527485087.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 412 transition count 366
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 412 transition count 366
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 401 transition count 355
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 401 transition count 355
Applied a total of 84 rules in 31 ms. Remains 401 /443 variables (removed 42) and now considering 355/397 (removed 42) transitions.
// Phase 1: matrix 355 rows 401 cols
[2025-05-30 01:10:50] [INFO ] Computed 84 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:10:50] [INFO ] Implicit Places using invariants in 538 ms returned []
[2025-05-30 01:10:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:10:51] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2025-05-30 01:10: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/400 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:10] [INFO ] Deduced a trap composed of 47 places in 311 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:10] [INFO ] Deduced a trap composed of 66 places in 324 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:10] [INFO ] Deduced a trap composed of 48 places in 289 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:11] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:11] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:11] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:12] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:12] [INFO ] Deduced a trap composed of 68 places in 171 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:12] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:12] [INFO ] Deduced a trap composed of 63 places in 304 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:12] [INFO ] Deduced a trap composed of 68 places in 196 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:13] [INFO ] Deduced a trap composed of 68 places in 178 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:13] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:13] [INFO ] Deduced a trap composed of 68 places in 318 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:14] [INFO ] Deduced a trap composed of 62 places in 557 ms of which 417 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:14] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:15] [INFO ] Deduced a trap composed of 62 places in 293 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:15] [INFO ] Deduced a trap composed of 62 places in 275 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:15] [INFO ] Deduced a trap composed of 62 places in 522 ms of which 379 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:16] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 27 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/104 constraints. Problems are: Problem set: 12 solved, 342 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:17] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:17] [INFO ] Deduced a trap composed of 67 places in 304 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:17] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:17] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:18] [INFO ] Deduced a trap composed of 66 places in 326 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:18] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:18] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:19] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:20] [INFO ] Deduced a trap composed of 92 places in 330 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:20] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:20] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:21] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:21] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:21] [INFO ] Deduced a trap composed of 39 places in 298 ms of which 33 ms to minimize.
SMT process timed out in 30061ms, After SMT, problems are : Problem set: 12 solved, 342 unsolved
Search for dead transitions found 12 dead transitions in 30062ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 401/443 places, 343/397 transitions.
Applied a total of 0 rules in 16 ms. Remains 401 /401 variables (removed 0) and now considering 343/343 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31672 ms. Remains : 401/443 places, 343/397 transitions.
[2025-05-30 01:11:22] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:11:22] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:11:22] [INFO ] Input system was already deterministic with 343 transitions.
[2025-05-30 01:11:22] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:11:22] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:11:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13173968778711489681.gal : 3 ms
[2025-05-30 01:11:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17772786905654331037.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/CTLFireability13173968778711489681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17772786905654331037.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-05-30 01:11:52] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:11:52] [INFO ] Applying decomposition
[2025-05-30 01:11:52] [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/graph9149699259711619740.txt' '-o' '/tmp/graph9149699259711619740.bin' '-w' '/tmp/graph9149699259711619740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9149699259711619740.bin' '-l' '-1' '-v' '-w' '/tmp/graph9149699259711619740.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:11:52] [INFO ] Decomposing Gal with order
[2025-05-30 01:11:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:11:52] [INFO ] Removed a total of 193 redundant transitions.
[2025-05-30 01:11:52] [INFO ] Flatten gal took : 36 ms
[2025-05-30 01:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2025-05-30 01:11:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4226124006335998291.gal : 4 ms
[2025-05-30 01:11:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15678373048591105024.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/CTLFireability4226124006335998291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15678373048591105024.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.02119e+24,8.20232,157440,5698,66,262068,771,974,569446,66,2109,0


Converting to forward existential form...Done !
original formula: ((AX(EF((((i4.i0.u11.p27==1)&&(i4.i1.u82.p253==1))&&(i19.u104.p479==1)))) + AG(EF((i18.i0.u49.p155==1)))) * (EX(AF((i17.u77.p230==0))) + ...187
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EX(!(E(TRUE U (((i4.i0.u11.p27==1)&&(i4.i1.u82.p253==1))&&(i19.u104.p479==1)))))))),TRUE) * ...311
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t139, t143, t186, t210, t219, t231, t304, t306, t308, t310, t311, t312, t320, t3...1126
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Graph (trivial) has 215 edges and 443 vertex of which 4 / 443 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 982 edges and 440 vertex of which 439 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 438 transition count 337
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 383 transition count 337
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 112 place count 383 transition count 252
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 295 place count 285 transition count 252
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 322 place count 258 transition count 225
Iterating global reduction 2 with 27 rules applied. Total rules applied 349 place count 258 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 349 place count 258 transition count 221
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 357 place count 254 transition count 221
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 191 rules applied. Total rules applied 548 place count 156 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 549 place count 156 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 550 place count 155 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 551 place count 154 transition count 127
Applied a total of 551 rules in 85 ms. Remains 154 /443 variables (removed 289) and now considering 127/397 (removed 270) transitions.
// Phase 1: matrix 127 rows 154 cols
[2025-05-30 01:12:22] [INFO ] Computed 65 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:22] [INFO ] Implicit Places using invariants in 353 ms returned [0, 1, 4, 5, 6, 7, 21, 22, 23, 24, 25, 26, 50]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 355 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 141/443 places, 127/397 transitions.
Applied a total of 0 rules in 11 ms. Remains 141 /141 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 451 ms. Remains : 141/443 places, 127/397 transitions.
[2025-05-30 01:12:22] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:12:22] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:12:22] [INFO ] Input system was already deterministic with 127 transitions.
[2025-05-30 01:12:22] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:12:22] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:12:22] [INFO ] Time to serialize gal into /tmp/CTLFireability18050539373606025260.gal : 2 ms
[2025-05-30 01:12:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1335085527764420056.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/CTLFireability18050539373606025260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1335085527764420056.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.64889e+09,6.65239,134008,2,7350,5,695855,6,0,691,387111,0


Converting to forward existential form...Done !
original formula: EF(((p306==1) + (((p40==1) * AF((((p183==1)&&(p344==1))&&(p503==1)))) * AG((p368==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p306==1))] != FALSE + [((FwdU(Init,TRUE) * ((p40==1) * !(EG(!((((p183==1)&&(p344==1))&&(p5...207
(forward)formula 0,1,6.65818,134008,1,0,7,695855,8,1,694,387111,1
FORMULA BusinessProcesses-PT-10-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 412 transition count 366
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 412 transition count 366
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 402 transition count 356
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 402 transition count 356
Applied a total of 82 rules in 29 ms. Remains 402 /443 variables (removed 41) and now considering 356/397 (removed 41) transitions.
// Phase 1: matrix 356 rows 402 cols
[2025-05-30 01:12:29] [INFO ] Computed 84 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:30] [INFO ] Implicit Places using invariants in 339 ms returned []
[2025-05-30 01:12:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:31] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2025-05-30 01:12: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/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:47] [INFO ] Deduced a trap composed of 47 places in 308 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:47] [INFO ] Deduced a trap composed of 47 places in 294 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:47] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:48] [INFO ] Deduced a trap composed of 66 places in 293 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:48] [INFO ] Deduced a trap composed of 66 places in 324 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:48] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:49] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:49] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:49] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:49] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:50] [INFO ] Deduced a trap composed of 68 places in 281 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:50] [INFO ] Deduced a trap composed of 68 places in 283 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:50] [INFO ] Deduced a trap composed of 68 places in 301 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:51] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:51] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:51] [INFO ] Deduced a trap composed of 68 places in 299 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:52] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:52] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:52] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:53] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 62 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 7 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:53] [INFO ] Deduced a trap composed of 53 places in 307 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:54] [INFO ] Deduced a trap composed of 48 places in 295 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:54] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:54] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:55] [INFO ] Deduced a trap composed of 62 places in 308 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:55] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:55] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:56] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:56] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:57] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:57] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:57] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:58] [INFO ] Deduced a trap composed of 60 places in 372 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:58] [INFO ] Deduced a trap composed of 61 places in 257 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:58] [INFO ] Deduced a trap composed of 62 places in 265 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:59] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:59] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:59] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:59] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:13:00] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/124 constraints. Problems are: Problem set: 7 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:13:00] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:13:00] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:13:01] [INFO ] Deduced a trap composed of 62 places in 350 ms of which 124 ms to minimize.
SMT process timed out in 30184ms, After SMT, problems are : Problem set: 7 solved, 348 unsolved
Search for dead transitions found 7 dead transitions in 30186ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 402/443 places, 349/397 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31657 ms. Remains : 402/443 places, 349/397 transitions.
[2025-05-30 01:13:01] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:13:01] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:13:01] [INFO ] Input system was already deterministic with 349 transitions.
[2025-05-30 01:13:01] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:13:01] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:13:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8850110919129522686.gal : 2 ms
[2025-05-30 01:13:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2371266945675472055.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/CTLFireability8850110919129522686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2371266945675472055.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-05-30 01:13:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:13:31] [INFO ] Applying decomposition
[2025-05-30 01:13:31] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11848128761633346194.txt' '-o' '/tmp/graph11848128761633346194.bin' '-w' '/tmp/graph11848128761633346194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11848128761633346194.bin' '-l' '-1' '-v' '-w' '/tmp/graph11848128761633346194.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:13:31] [INFO ] Decomposing Gal with order
[2025-05-30 01:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:13:31] [INFO ] Removed a total of 222 redundant transitions.
[2025-05-30 01:13:31] [INFO ] Flatten gal took : 24 ms
[2025-05-30 01:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-05-30 01:13:31] [INFO ] Time to serialize gal into /tmp/CTLFireability607142174828208359.gal : 5 ms
[2025-05-30 01:13:31] [INFO ] Time to serialize properties into /tmp/CTLFireability17963073022652931107.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/CTLFireability607142174828208359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17963073022652931107.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.91065e+24,12.3643,278320,6802,54,458371,691,814,1.81372e+06,64,1375,0


Converting to forward existential form...Done !
original formula: E(AX(EG(E((((i0.u41.p126==1)&&(i6.u95.p308==1))&&(i15.u107.p479==1)) U EF((i0.u2.p6==1))))) U (i8.u50.p162==1))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(EG(E((((i0.u41.p126==1)&&(i6.u95.p308==1))&&(i15.u107.p479==1)) U E(TRUE U (i0.u2.p6==1))))))...187
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t139, t143, t167, t187, t211, t232, t310, t312, t314, t316, t317, t318, t326, t3...1050
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
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 a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 411 transition count 365
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 411 transition count 365
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 400 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 400 transition count 354
Applied a total of 86 rules in 29 ms. Remains 400 /443 variables (removed 43) and now considering 354/397 (removed 43) transitions.
// Phase 1: matrix 354 rows 400 cols
[2025-05-30 01:14:01] [INFO ] Computed 84 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:14:02] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-05-30 01:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:14:02] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2025-05-30 01:14:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:15] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:15] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:16] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:16] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:16] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:16] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:17] [INFO ] Deduced a trap composed of 68 places in 275 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:17] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:17] [INFO ] Deduced a trap composed of 68 places in 280 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:17] [INFO ] Deduced a trap composed of 68 places in 317 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:18] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:18] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:18] [INFO ] Deduced a trap composed of 63 places in 349 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:19] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:19] [INFO ] Deduced a trap composed of 68 places in 337 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:19] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:20] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:20] [INFO ] Deduced a trap composed of 53 places in 237 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:20] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:21] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:22] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:22] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:23] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:23] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:23] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:23] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:24] [INFO ] Deduced a trap composed of 71 places in 397 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:24] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:25] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:25] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:25] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:25] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:26] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:26] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:26] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:26] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:27] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:27] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:28] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:28] [INFO ] Deduced a trap composed of 81 places in 255 ms of which 20 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/124 constraints. Problems are: Problem set: 6 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:29] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:30] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:30] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:30] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:31] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:32] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:32] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:32] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:32] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:32] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 29 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/754 variables, and 134 constraints, problems are : Problem set: 6 solved, 347 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 347 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 6 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 6 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 6 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 6 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 50/134 constraints. Problems are: Problem set: 6 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:39] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:40] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:40] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:40] [INFO ] Deduced a trap composed of 60 places in 409 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:41] [INFO ] Deduced a trap composed of 34 places in 380 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:42] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:42] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:42] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:42] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:43] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:43] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:43] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:43] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:44] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:44] [INFO ] Deduced a trap composed of 59 places in 222 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:44] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:44] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:45] [INFO ] Deduced a trap composed of 62 places in 300 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:45] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:46] [INFO ] Deduced a trap composed of 60 places in 502 ms of which 267 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/154 constraints. Problems are: Problem set: 8 solved, 345 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:46] [INFO ] Deduced a trap composed of 53 places in 318 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:47] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:48] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:48] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:49] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:49] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:49] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:50] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:50] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:50] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:50] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:50] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:51] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:51] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:51] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:51] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:52] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:52] [INFO ] Deduced a trap composed of 48 places in 351 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:52] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:53] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 44 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/174 constraints. Problems are: Problem set: 17 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:54] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:54] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:55] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:56] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:56] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:56] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:56] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:57] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:57] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:57] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:57] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:58] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:58] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:58] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:58] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:58] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:58] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:58] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:58] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 7 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD266 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:14:59] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 48 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/194 constraints. Problems are: Problem set: 25 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:15:00] [INFO ] Deduced a trap composed of 69 places in 316 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:15:00] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:15:01] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:15:02] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:15:02] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:15:02] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:15:02] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:15:03] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 9 ms to minimize.
SMT process timed out in 60166ms, After SMT, problems are : Problem set: 25 solved, 328 unsolved
Search for dead transitions found 25 dead transitions in 60167ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/443 places, 329/397 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61608 ms. Remains : 400/443 places, 329/397 transitions.
[2025-05-30 01:15:03] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:15:03] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:15:03] [INFO ] Input system was already deterministic with 329 transitions.
[2025-05-30 01:15:03] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:15:03] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:15:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1916812201548954938.gal : 3 ms
[2025-05-30 01:15:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16714661377226818101.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/CTLFireability1916812201548954938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16714661377226818101.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-05-30 01:15:33] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:15:33] [INFO ] Applying decomposition
[2025-05-30 01:15:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10253949686850804681.txt' '-o' '/tmp/graph10253949686850804681.bin' '-w' '/tmp/graph10253949686850804681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10253949686850804681.bin' '-l' '-1' '-v' '-w' '/tmp/graph10253949686850804681.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:15:33] [INFO ] Decomposing Gal with order
[2025-05-30 01:15:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:15:33] [INFO ] Removed a total of 136 redundant transitions.
[2025-05-30 01:15:33] [INFO ] Flatten gal took : 18 ms
[2025-05-30 01:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-05-30 01:15:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16609421862527184920.gal : 6 ms
[2025-05-30 01:15:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1089759563361904837.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/CTLFireability16609421862527184920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1089759563361904837.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.87567e+24,24.1319,432300,28654,56,763705,874,923,1.06262e+06,66,1995,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 397/397 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 416 transition count 370
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 416 transition count 370
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 407 transition count 361
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 407 transition count 361
Applied a total of 72 rules in 21 ms. Remains 407 /443 variables (removed 36) and now considering 361/397 (removed 36) transitions.
// Phase 1: matrix 361 rows 407 cols
[2025-05-30 01:16:03] [INFO ] Computed 84 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:16:03] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-05-30 01:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:16:04] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2025-05-30 01:16:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:19] [INFO ] Deduced a trap composed of 50 places in 347 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:20] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:20] [INFO ] Deduced a trap composed of 69 places in 343 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:20] [INFO ] Deduced a trap composed of 51 places in 313 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:21] [INFO ] Deduced a trap composed of 51 places in 295 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:21] [INFO ] Deduced a trap composed of 51 places in 265 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:21] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:21] [INFO ] Deduced a trap composed of 71 places in 283 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:22] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:22] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:22] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:23] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:23] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:23] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:24] [INFO ] Deduced a trap composed of 56 places in 305 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:24] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:24] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:25] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:25] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:26] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 20 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/104 constraints. Problems are: Problem set: 12 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:27] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:27] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:27] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:28] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:29] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:29] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:29] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:30] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:30] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:30] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:30] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:31] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:32] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:32] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:32] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:33] [INFO ] Deduced a trap composed of 81 places in 261 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:33] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:33] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:34] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:34] [INFO ] Deduced a trap composed of 70 places in 381 ms of which 81 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 20/124 constraints. Problems are: Problem set: 18 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/768 variables, and 124 constraints, problems are : Problem set: 18 solved, 342 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/407 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 342 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 35/35 constraints. Problems are: Problem set: 18 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/35 constraints. Problems are: Problem set: 18 solved, 342 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 45/80 constraints. Problems are: Problem set: 18 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 4/84 constraints. Problems are: Problem set: 18 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 40/124 constraints. Problems are: Problem set: 18 solved, 342 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:40] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:40] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:41] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:41] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:42] [INFO ] Deduced a trap composed of 63 places in 389 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:42] [INFO ] Deduced a trap composed of 63 places in 324 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:43] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:43] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:44] [INFO ] Deduced a trap composed of 64 places in 359 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:44] [INFO ] Deduced a trap composed of 65 places in 360 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:44] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:45] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:45] [INFO ] Deduced a trap composed of 72 places in 275 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:45] [INFO ] Deduced a trap composed of 72 places in 242 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:45] [INFO ] Deduced a trap composed of 72 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:46] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:46] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:46] [INFO ] Deduced a trap composed of 71 places in 216 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:46] [INFO ] Deduced a trap composed of 72 places in 322 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:47] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 37 ms to minimize.
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 20/144 constraints. Problems are: Problem set: 33 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:48] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:48] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:49] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:49] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:49] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:50] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:50] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:50] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:50] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:50] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:51] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:51] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:51] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:52] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:53] [INFO ] Deduced a trap composed of 95 places in 335 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:53] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:53] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:54] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:54] [INFO ] Deduced a trap composed of 63 places in 294 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:54] [INFO ] Deduced a trap composed of 64 places in 377 ms of which 118 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 20/164 constraints. Problems are: Problem set: 33 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:55] [INFO ] Deduced a trap composed of 69 places in 257 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:55] [INFO ] Deduced a trap composed of 64 places in 324 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:56] [INFO ] Deduced a trap composed of 64 places in 340 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:56] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:56] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:56] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:57] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:57] [INFO ] Deduced a trap composed of 70 places in 301 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:57] [INFO ] Deduced a trap composed of 70 places in 276 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:58] [INFO ] Deduced a trap composed of 70 places in 264 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:58] [INFO ] Deduced a trap composed of 70 places in 248 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:58] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:59] [INFO ] Deduced a trap composed of 68 places in 328 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:59] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:00] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:01] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:02] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:02] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:02] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:03] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 35 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 20/184 constraints. Problems are: Problem set: 33 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:03] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:04] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:04] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:04] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:04] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:05] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 77 ms to minimize.
SMT process timed out in 60364ms, After SMT, problems are : Problem set: 33 solved, 327 unsolved
Search for dead transitions found 33 dead transitions in 60365ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 407/443 places, 328/397 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 405 transition count 328
Applied a total of 2 rules in 12 ms. Remains 405 /407 variables (removed 2) and now considering 328/328 (removed 0) transitions.
// Phase 1: matrix 328 rows 405 cols
[2025-05-30 01:17:05] [INFO ] Computed 88 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:17:05] [INFO ] Implicit Places using invariants in 384 ms returned []
[2025-05-30 01:17:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:17:06] [INFO ] Implicit Places using invariants and state equation in 871 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1257 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 404/443 places, 328/397 transitions.
Applied a total of 0 rules in 8 ms. Remains 404 /404 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62953 ms. Remains : 404/443 places, 328/397 transitions.
[2025-05-30 01:17:06] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:17:06] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:17:06] [INFO ] Input system was already deterministic with 328 transitions.
[2025-05-30 01:17:06] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:17:06] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:17:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11380445673072064756.gal : 2 ms
[2025-05-30 01:17:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5718915183706555607.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/CTLFireability11380445673072064756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5718915183706555607.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-05-30 01:17:36] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:17:36] [INFO ] Applying decomposition
[2025-05-30 01:17:36] [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/graph10012434028407909802.txt' '-o' '/tmp/graph10012434028407909802.bin' '-w' '/tmp/graph10012434028407909802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10012434028407909802.bin' '-l' '-1' '-v' '-w' '/tmp/graph10012434028407909802.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:17:36] [INFO ] Decomposing Gal with order
[2025-05-30 01:17:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:17:36] [INFO ] Removed a total of 101 redundant transitions.
[2025-05-30 01:17:36] [INFO ] Flatten gal took : 17 ms
[2025-05-30 01:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-05-30 01:17:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8381300252404339340.gal : 5 ms
[2025-05-30 01:17:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11383803147225039588.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/CTLFireability8381300252404339340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11383803147225039588.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.
Detected timeout of ITS tools.
[2025-05-30 01:18:06] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:18:06] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:18:06] [INFO ] Applying decomposition
[2025-05-30 01:18:06] [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/graph17782567201393239781.txt' '-o' '/tmp/graph17782567201393239781.bin' '-w' '/tmp/graph17782567201393239781.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17782567201393239781.bin' '-l' '-1' '-v' '-w' '/tmp/graph17782567201393239781.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:18:06] [INFO ] Decomposing Gal with order
[2025-05-30 01:18:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:18:06] [INFO ] Removed a total of 252 redundant transitions.
[2025-05-30 01:18:06] [INFO ] Flatten gal took : 20 ms
[2025-05-30 01:18:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-05-30 01:18:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6596152407171118592.gal : 5 ms
[2025-05-30 01:18:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17062842082083561637.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/CTLFireability6596152407171118592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17062842082083561637.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03597e+25,737.739,4867944,161480,44,7.18298e+06,901,1127,1.28056e+07,60,2897,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 01:44:57] [INFO ] Applying decomposition
[2025-05-30 01:44:57] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:44:57] [INFO ] Decomposing Gal with order
[2025-05-30 01:44:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:44:57] [INFO ] Removed a total of 129 redundant transitions.
[2025-05-30 01:44:57] [INFO ] Flatten gal took : 20 ms
[2025-05-30 01:44:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 18 ms.
[2025-05-30 01:44:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13067469137700780650.gal : 6 ms
[2025-05-30 01:44:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15203534096698703046.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/CTLFireability13067469137700780650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15203534096698703046.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 10 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="BusinessProcesses-PT-10"
export BK_EXAMINATION="CTLFireability"
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 BusinessProcesses-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813300074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;