Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 175K 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 HealthRecord-PT-17-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2023-15
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-00
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-01
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-02
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-03
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-04
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-05
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-06
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-07
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-08
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-09
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-10
FORMULA_NAME HealthRecord-PT-17-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749009027308

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 03:50:29] [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-06-04 03:50:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 03:50:30] [INFO ] Load time of PNML (sax parser for PT used): 423 ms
[2025-06-04 03:50:30] [INFO ] Transformed 624 places.
[2025-06-04 03:50:30] [INFO ] Transformed 828 transitions.
[2025-06-04 03:50:30] [INFO ] Found NUPN structural information;
[2025-06-04 03:50:30] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 657 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 91 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 111 places :
Symmetric choice reduction at 0 with 111 rule applications. Total rules 111 place count 513 transition count 696
Iterating global reduction 0 with 111 rules applied. Total rules applied 222 place count 513 transition count 696
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 265 place count 470 transition count 641
Iterating global reduction 0 with 43 rules applied. Total rules applied 308 place count 470 transition count 641
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 311 place count 470 transition count 638
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 325 place count 456 transition count 615
Iterating global reduction 1 with 14 rules applied. Total rules applied 339 place count 456 transition count 615
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 347 place count 448 transition count 602
Iterating global reduction 1 with 8 rules applied. Total rules applied 355 place count 448 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 356 place count 447 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 357 place count 447 transition count 599
Applied a total of 357 rules in 359 ms. Remains 447 /624 variables (removed 177) and now considering 599/828 (removed 229) transitions.
// Phase 1: matrix 599 rows 447 cols
[2025-06-04 03:50:31] [INFO ] Computed 18 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:50:31] [INFO ] Implicit Places using invariants in 873 ms returned []
[2025-06-04 03:50:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:50:32] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2025-06-04 03:50:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:50:56] [INFO ] Deduced a trap composed of 43 places in 559 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:50:57] [INFO ] Deduced a trap composed of 124 places in 403 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:50:57] [INFO ] Deduced a trap composed of 132 places in 374 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:50:57] [INFO ] Deduced a trap composed of 145 places in 492 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:50:58] [INFO ] Deduced a trap composed of 146 places in 426 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:50:59] [INFO ] Deduced a trap composed of 115 places in 372 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:50:59] [INFO ] Deduced a trap composed of 43 places in 385 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:00] [INFO ] Deduced a trap composed of 82 places in 472 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:00] [INFO ] Deduced a trap composed of 84 places in 389 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:01] [INFO ] Deduced a trap composed of 83 places in 426 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:01] [INFO ] Deduced a trap composed of 157 places in 472 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:02] [INFO ] Deduced a trap composed of 60 places in 468 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:02] [INFO ] Deduced a trap composed of 229 places in 422 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:03] [INFO ] Deduced a trap composed of 46 places in 486 ms of which 78 ms to minimize.
SMT process timed out in 30424ms, After SMT, problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 30472ms
Starting structural reductions in LTL mode, iteration 1 : 447/624 places, 599/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32799 ms. Remains : 447/624 places, 599/828 transitions.
Support contains 91 out of 447 places after structural reductions.
[2025-06-04 03:51:03] [INFO ] Flatten gal took : 140 ms
[2025-06-04 03:51:04] [INFO ] Flatten gal took : 73 ms
[2025-06-04 03:51:04] [INFO ] Input system was already deterministic with 599 transitions.
RANDOM walk for 40000 steps (344 resets) in 2794 ms. (14 steps per ms) remains 38/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
[2025-06-04 03:51:05] [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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/174 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 3 (OVERLAPS) 273/447 variables, 8/18 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:06] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:06] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:07] [INFO ] Deduced a trap composed of 82 places in 256 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:07] [INFO ] Deduced a trap composed of 89 places in 288 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:07] [INFO ] Deduced a trap composed of 91 places in 327 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:08] [INFO ] Deduced a trap composed of 92 places in 259 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:08] [INFO ] Deduced a trap composed of 43 places in 400 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:08] [INFO ] Deduced a trap composed of 56 places in 296 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:09] [INFO ] Deduced a trap composed of 91 places in 357 ms of which 68 ms to minimize.
Problem AtomicPropp36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:09] [INFO ] Deduced a trap composed of 78 places in 467 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:10] [INFO ] Deduced a trap composed of 50 places in 482 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:10] [INFO ] Deduced a trap composed of 52 places in 475 ms of which 83 ms to minimize.
SMT process timed out in 5490ms, After SMT, problems are : Problem set: 4 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 599/599 transitions.
Graph (trivial) has 402 edges and 447 vertex of which 26 / 447 are part of one of the 13 SCC in 7 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 953 edges and 434 vertex of which 427 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 427 transition count 431
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 147 rules applied. Total rules applied 290 place count 286 transition count 425
Reduce places removed 3 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 25 rules applied. Total rules applied 315 place count 283 transition count 403
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 26 rules applied. Total rules applied 341 place count 261 transition count 399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 343 place count 259 transition count 399
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 343 place count 259 transition count 393
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 355 place count 253 transition count 393
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 361 place count 247 transition count 382
Iterating global reduction 5 with 6 rules applied. Total rules applied 367 place count 247 transition count 382
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 369 place count 247 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 371 place count 245 transition count 380
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 373 place count 243 transition count 376
Iterating global reduction 7 with 2 rules applied. Total rules applied 375 place count 243 transition count 376
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 376 place count 242 transition count 375
Iterating global reduction 7 with 1 rules applied. Total rules applied 377 place count 242 transition count 375
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 378 place count 241 transition count 373
Iterating global reduction 7 with 1 rules applied. Total rules applied 379 place count 241 transition count 373
Performed 65 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 509 place count 176 transition count 301
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 518 place count 176 transition count 292
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 525 place count 169 transition count 278
Iterating global reduction 8 with 7 rules applied. Total rules applied 532 place count 169 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 534 place count 168 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 535 place count 168 transition count 276
Performed 12 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 559 place count 156 transition count 347
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 569 place count 156 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 574 place count 156 transition count 332
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 575 place count 155 transition count 331
Iterating global reduction 10 with 1 rules applied. Total rules applied 576 place count 155 transition count 331
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 587 place count 155 transition count 320
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 598 place count 144 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 601 place count 144 transition count 317
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 607 place count 144 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 608 place count 144 transition count 316
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 611 place count 144 transition count 316
Applied a total of 611 rules in 430 ms. Remains 144 /447 variables (removed 303) and now considering 316/599 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 144/447 places, 316/599 transitions.
RANDOM walk for 40000 steps (2456 resets) in 855 ms. (46 steps per ms) remains 25/34 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (29 resets) in 11 ms. (333 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (38 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (38 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (44 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (32 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (36 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (39 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (38 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (38 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (35 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
[2025-06-04 03:51:11] [INFO ] Flow matrix only has 310 transitions (discarded 6 similar events)
// Phase 1: matrix 310 rows 144 cols
[2025-06-04 03:51:11] [INFO ] Computed 12 invariants in 4 ms
[2025-06-04 03:51:11] [INFO ] State equation strengthened by 4 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 42/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 69/144 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:12] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:12] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:12] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:12] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:12] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:12] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:12] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:13] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:13] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:13] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:13] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 310/454 variables, 144/167 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/454 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 171 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3370 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 144/144 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 42/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 4 (OVERLAPS) 69/144 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 7/23 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 310/454 variables, 144/167 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 4/171 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 21/192 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:16] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 1/193 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:17] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 1/194 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:17] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 1/195 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:18] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:18] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:18] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 3/198 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:19] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 22 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/199 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 0/454 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 199 constraints, problems are : Problem set: 1 solved, 21 unsolved in 8519 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 144/144 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 21/22 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 11923ms problems are : Problem set: 1 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 5 properties in 1014 ms.
Support contains 27 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 316/316 transitions.
Graph (trivial) has 77 edges and 144 vertex of which 2 / 144 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 550 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 142 transition count 307
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 135 transition count 303
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 132 transition count 303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 23 place count 132 transition count 300
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 129 transition count 300
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 35 place count 123 transition count 288
Iterating global reduction 3 with 6 rules applied. Total rules applied 41 place count 123 transition count 288
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 41 place count 123 transition count 287
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 122 transition count 287
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 46 place count 119 transition count 283
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 119 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 119 transition count 281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 67 place count 111 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 111 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 110 transition count 270
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 110 transition count 270
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 78 place count 106 transition count 291
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 80 place count 104 transition count 284
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 104 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 104 transition count 282
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 88 place count 104 transition count 278
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 92 place count 100 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 95 place count 100 transition count 275
Applied a total of 95 rules in 81 ms. Remains 100 /144 variables (removed 44) and now considering 275/316 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 100/144 places, 275/316 transitions.
RANDOM walk for 40000 steps (3396 resets) in 412 ms. (96 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40004 steps (541 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (529 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (529 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (519 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (545 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (446 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (530 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (536 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (538 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (531 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (534 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
[2025-06-04 03:51:25] [INFO ] Flow matrix only has 264 transitions (discarded 11 similar events)
// Phase 1: matrix 264 rows 100 cols
[2025-06-04 03:51:25] [INFO ] Computed 11 invariants in 3 ms
[2025-06-04 03:51:25] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 37/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 41/100 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:25] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:25] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:25] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:26] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:26] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 264/364 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/364 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 123 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1622 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 37/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 41/100 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 264/364 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:27] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:28] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 16 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:28] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/364 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 137 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3412 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5053ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 1 properties in 2999 ms.
Support contains 21 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 275/275 transitions.
Graph (trivial) has 26 edges and 100 vertex of which 6 / 100 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 442 edges and 97 vertex of which 93 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 93 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 92 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 91 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 10 place count 91 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 90 transition count 262
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 17 place count 90 transition count 262
Graph (complete) has 370 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 89 transition count 262
Applied a total of 18 rules in 28 ms. Remains 89 /100 variables (removed 11) and now considering 262/275 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 89/100 places, 262/275 transitions.
RANDOM walk for 40000 steps (4162 resets) in 654 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (545 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (542 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (541 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (552 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (435 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (544 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (522 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (538 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (532 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (529 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 438043 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :4 out of 10
Probabilistic random walk after 438043 steps, saw 94109 distinct states, run finished after 3018 ms. (steps per millisecond=145 ) properties seen :4
[2025-06-04 03:51:36] [INFO ] Flow matrix only has 251 transitions (discarded 11 similar events)
// Phase 1: matrix 251 rows 89 cols
[2025-06-04 03:51:36] [INFO ] Computed 7 invariants in 5 ms
[2025-06-04 03:51:36] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 44/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 205/265 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 75/340 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 10/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:37] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 107 constraints, problems are : Problem set: 0 solved, 6 unsolved in 857 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 44/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 205/265 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 75/340 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:51:38] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 114 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1199 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2073ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1258 ms.
Support contains 14 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 262/262 transitions.
Graph (trivial) has 44 edges and 89 vertex of which 6 / 89 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 254
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 84 transition count 253
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 82 transition count 249
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 82 transition count 249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 80 transition count 257
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 78 transition count 253
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 78 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 78 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 29 place count 78 transition count 242
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 38 place count 78 transition count 233
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 69 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 69 transition count 232
Applied a total of 48 rules in 30 ms. Remains 69 /89 variables (removed 20) and now considering 232/262 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 69/89 places, 232/262 transitions.
RANDOM walk for 40000 steps (4237 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (620 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (618 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (506 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (598 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (606 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (625 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1128569 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :5 out of 6
Probabilistic random walk after 1128569 steps, saw 194800 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :5
[2025-06-04 03:51:43] [INFO ] Flow matrix only has 216 transitions (discarded 16 similar events)
// Phase 1: matrix 216 rows 69 cols
[2025-06-04 03:51:43] [INFO ] Computed 7 invariants in 3 ms
[2025-06-04 03:51:43] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/36 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/181 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 33/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 91/272 variables, 27/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/285 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/36 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/181 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 33/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/272 variables, 27/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/285 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/285 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 232/232 transitions.
Graph (trivial) has 42 edges and 69 vertex of which 2 / 69 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 287 edges and 68 vertex of which 56 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 56 transition count 177
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 50 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 50 transition count 176
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 59 place count 49 transition count 176
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 45 transition count 172
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 45 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 43 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 43 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 42 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 42 transition count 162
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 37 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 37 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 37 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 36 transition count 155
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 90 place count 36 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 36 transition count 147
Applied a total of 98 rules in 43 ms. Remains 36 /69 variables (removed 33) and now considering 147/232 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 36/69 places, 147/232 transitions.
RANDOM walk for 40000 steps (5283 resets) in 1464 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (384 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 23737 steps, run visited all 1 properties in 81 ms. (steps per millisecond=293 )
Probabilistic random walk after 23737 steps, saw 6411 distinct states, run finished after 88 ms. (steps per millisecond=269 ) properties seen :1
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-06-04 03:51:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-04 03:51:44] [INFO ] Flatten gal took : 57 ms
FORMULA HealthRecord-PT-17-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 03:51:44] [INFO ] Flatten gal took : 56 ms
[2025-06-04 03:51:44] [INFO ] Input system was already deterministic with 599 transitions.
Support contains 66 out of 447 places (down from 74) after GAL structural reductions.
FORMULA HealthRecord-PT-17-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 120 stabilizing places and 132 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 420 transition count 566
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 420 transition count 566
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 70 place count 404 transition count 544
Iterating global reduction 0 with 16 rules applied. Total rules applied 86 place count 404 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 90 place count 404 transition count 540
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 99 place count 395 transition count 523
Iterating global reduction 1 with 9 rules applied. Total rules applied 108 place count 395 transition count 523
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 391 transition count 516
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 391 transition count 516
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 121 place count 386 transition count 509
Iterating global reduction 1 with 5 rules applied. Total rules applied 126 place count 386 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 383 transition count 505
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 383 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 382 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 382 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 381 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 381 transition count 503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 137 place count 381 transition count 502
Applied a total of 137 rules in 74 ms. Remains 381 /447 variables (removed 66) and now considering 502/599 (removed 97) transitions.
// Phase 1: matrix 502 rows 381 cols
[2025-06-04 03:51:44] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:51:44] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-04 03:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:51:45] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2025-06-04 03:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:01] [INFO ] Deduced a trap composed of 31 places in 300 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:02] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:02] [INFO ] Deduced a trap composed of 137 places in 445 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:03] [INFO ] Deduced a trap composed of 110 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:03] [INFO ] Deduced a trap composed of 100 places in 220 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:04] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:04] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:04] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:05] [INFO ] Deduced a trap composed of 206 places in 271 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:05] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:05] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:06] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:06] [INFO ] Deduced a trap composed of 70 places in 219 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:06] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:07] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:07] [INFO ] Deduced a trap composed of 70 places in 219 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:08] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:08] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:09] [INFO ] Deduced a trap composed of 71 places in 285 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:10] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:15] [INFO ] Deduced a trap composed of 140 places in 373 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/883 variables, and 39 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:22] [INFO ] Deduced a trap composed of 43 places in 379 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:22] [INFO ] Deduced a trap composed of 65 places in 389 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:22] [INFO ] Deduced a trap composed of 71 places in 266 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:23] [INFO ] Deduced a trap composed of 73 places in 269 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:24] [INFO ] Deduced a trap composed of 66 places in 419 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:24] [INFO ] Deduced a trap composed of 71 places in 431 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:24] [INFO ] Deduced a trap composed of 72 places in 384 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:25] [INFO ] Deduced a trap composed of 74 places in 380 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:28] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:28] [INFO ] Deduced a trap composed of 74 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:32] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:32] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:32] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:32] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:40] [INFO ] Deduced a trap composed of 45 places in 392 ms of which 70 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:42] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:43] [INFO ] Deduced a trap composed of 71 places in 299 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:43] [INFO ] Deduced a trap composed of 67 places in 308 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:44] [INFO ] Deduced a trap composed of 59 places in 265 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:44] [INFO ] Deduced a trap composed of 61 places in 267 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:52:45] [INFO ] Deduced a trap composed of 59 places in 306 ms of which 34 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/883 variables, and 60 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 0/501 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 381/447 places, 502/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61075 ms. Remains : 381/447 places, 502/599 transitions.
[2025-06-04 03:52:45] [INFO ] Flatten gal took : 37 ms
[2025-06-04 03:52:45] [INFO ] Flatten gal took : 36 ms
[2025-06-04 03:52:45] [INFO ] Input system was already deterministic with 502 transitions.
[2025-06-04 03:52:45] [INFO ] Flatten gal took : 34 ms
[2025-06-04 03:52:45] [INFO ] Flatten gal took : 34 ms
[2025-06-04 03:52:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4725326637691052952.gal : 22 ms
[2025-06-04 03:52:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7174827533096095891.ctl : 10 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/CTLFireability4725326637691052952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7174827533096095891.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.07644e+14,8.95859,196396,2,20141,5,572775,6,0,2028,1.24118e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 03:53:16] [INFO ] Flatten gal took : 20 ms
[2025-06-04 03:53:16] [INFO ] Applying decomposition
[2025-06-04 03:53:16] [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/graph12527134300955776766.txt' '-o' '/tmp/graph12527134300955776766.bin' '-w' '/tmp/graph12527134300955776766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12527134300955776766.bin' '-l' '-1' '-v' '-w' '/tmp/graph12527134300955776766.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:53:16] [INFO ] Decomposing Gal with order
[2025-06-04 03:53:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:53:16] [INFO ] Removed a total of 190 redundant transitions.
[2025-06-04 03:53:16] [INFO ] Flatten gal took : 158 ms
[2025-06-04 03:53:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 38 ms.
[2025-06-04 03:53:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17506215792259472422.gal : 32 ms
[2025-06-04 03:53:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8978822206902460774.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/CTLFireability17506215792259472422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8978822206902460774.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 : 447/447 places, 599/599 transitions.
Graph (trivial) has 524 edges and 447 vertex of which 80 / 447 are part of one of the 21 SCC in 2 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 387 transition count 363
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 185 rules applied. Total rules applied 353 place count 220 transition count 345
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 361 place count 212 transition count 345
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 361 place count 212 transition count 339
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 373 place count 206 transition count 339
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 408 place count 171 transition count 275
Iterating global reduction 3 with 35 rules applied. Total rules applied 443 place count 171 transition count 275
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 449 place count 171 transition count 269
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 455 place count 165 transition count 269
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 469 place count 151 transition count 246
Iterating global reduction 5 with 14 rules applied. Total rules applied 483 place count 151 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 487 place count 151 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 488 place count 150 transition count 242
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 493 place count 145 transition count 235
Iterating global reduction 7 with 5 rules applied. Total rules applied 498 place count 145 transition count 235
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 501 place count 145 transition count 232
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 502 place count 144 transition count 230
Iterating global reduction 8 with 1 rules applied. Total rules applied 503 place count 144 transition count 230
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 506 place count 141 transition count 227
Iterating global reduction 8 with 3 rules applied. Total rules applied 509 place count 141 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 512 place count 141 transition count 224
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 554 place count 120 transition count 203
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 564 place count 120 transition count 193
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 576 place count 108 transition count 169
Iterating global reduction 10 with 12 rules applied. Total rules applied 588 place count 108 transition count 169
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 594 place count 102 transition count 163
Iterating global reduction 10 with 6 rules applied. Total rules applied 600 place count 102 transition count 163
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 603 place count 99 transition count 157
Iterating global reduction 10 with 3 rules applied. Total rules applied 606 place count 99 transition count 157
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 609 place count 96 transition count 151
Iterating global reduction 10 with 3 rules applied. Total rules applied 612 place count 96 transition count 151
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 615 place count 93 transition count 145
Iterating global reduction 10 with 3 rules applied. Total rules applied 618 place count 93 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 624 place count 93 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 626 place count 93 transition count 137
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 627 place count 93 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 628 place count 92 transition count 136
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 629 place count 91 transition count 134
Iterating global reduction 13 with 1 rules applied. Total rules applied 630 place count 91 transition count 134
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 631 place count 90 transition count 132
Iterating global reduction 13 with 1 rules applied. Total rules applied 632 place count 90 transition count 132
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 635 place count 87 transition count 129
Iterating global reduction 13 with 3 rules applied. Total rules applied 638 place count 87 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 640 place count 86 transition count 128
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 641 place count 85 transition count 127
Iterating global reduction 13 with 1 rules applied. Total rules applied 642 place count 85 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 646 place count 85 transition count 123
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 647 place count 85 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 648 place count 84 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 649 place count 83 transition count 121
Applied a total of 649 rules in 122 ms. Remains 83 /447 variables (removed 364) and now considering 121/599 (removed 478) transitions.
[2025-06-04 03:53:46] [INFO ] Flow matrix only has 111 transitions (discarded 10 similar events)
// Phase 1: matrix 111 rows 83 cols
[2025-06-04 03:53:46] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:53:47] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-04 03:53:47] [INFO ] Flow matrix only has 111 transitions (discarded 10 similar events)
[2025-06-04 03:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:53:47] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:53:47] [INFO ] Redundant transitions in 5 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-04 03:53:47] [INFO ] Flow matrix only has 111 transitions (discarded 10 similar events)
[2025-06-04 03:53:47] [INFO ] Invariant cache hit.
[2025-06-04 03:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:53:48] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:53:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:53:48] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:53:48] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 110/193 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:53:50] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/194 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 98 constraints, problems are : Problem set: 0 solved, 105 unsolved in 9174 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:53:56] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:53:57] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 110/193 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 105/204 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/194 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 205 constraints, problems are : Problem set: 0 solved, 105 unsolved in 9605 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18809ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 18811ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/447 places, 121/599 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19224 ms. Remains : 83/447 places, 121/599 transitions.
[2025-06-04 03:54:06] [INFO ] Flatten gal took : 9 ms
[2025-06-04 03:54:06] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:54:06] [INFO ] Input system was already deterministic with 121 transitions.
[2025-06-04 03:54:06] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:54:06] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:54:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3414242963390224993.gal : 2 ms
[2025-06-04 03:54:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11131802153930238084.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/CTLFireability3414242963390224993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11131802153930238084.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,5.5296e+08,0.388291,11092,2,1839,5,35377,6,0,442,29045,0


Converting to forward existential form...Done !
original formula: AG(EF((p87==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p87==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t12, t14, t66, t109, t113, t115, t117, t119, Intersection with reach...231
(forward)formula 0,1,1.42654,31688,1,0,180,155569,252,92,2790,114666,244
FORMULA HealthRecord-PT-17-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 417 transition count 561
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 417 transition count 561
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 76 place count 401 transition count 539
Iterating global reduction 0 with 16 rules applied. Total rules applied 92 place count 401 transition count 539
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 401 transition count 535
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 107 place count 390 transition count 515
Iterating global reduction 1 with 11 rules applied. Total rules applied 118 place count 390 transition count 515
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 383 transition count 503
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 383 transition count 503
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 375 transition count 492
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 375 transition count 492
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 367 transition count 480
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 367 transition count 480
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 168 place count 363 transition count 475
Iterating global reduction 1 with 4 rules applied. Total rules applied 172 place count 363 transition count 475
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 175 place count 363 transition count 472
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 178 place count 360 transition count 469
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 360 transition count 469
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 184 place count 360 transition count 466
Applied a total of 184 rules in 54 ms. Remains 360 /447 variables (removed 87) and now considering 466/599 (removed 133) transitions.
// Phase 1: matrix 466 rows 360 cols
[2025-06-04 03:54:07] [INFO ] Computed 18 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:54:07] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-04 03:54:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:54:08] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-04 03:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:23] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:23] [INFO ] Deduced a trap composed of 134 places in 316 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:24] [INFO ] Deduced a trap composed of 107 places in 346 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:24] [INFO ] Deduced a trap composed of 85 places in 329 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:25] [INFO ] Deduced a trap composed of 43 places in 372 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:25] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:26] [INFO ] Deduced a trap composed of 46 places in 333 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:26] [INFO ] Deduced a trap composed of 40 places in 316 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:27] [INFO ] Deduced a trap composed of 192 places in 331 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:27] [INFO ] Deduced a trap composed of 71 places in 291 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:27] [INFO ] Deduced a trap composed of 135 places in 340 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:28] [INFO ] Deduced a trap composed of 70 places in 351 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:29] [INFO ] Deduced a trap composed of 135 places in 328 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:29] [INFO ] Deduced a trap composed of 135 places in 283 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:32] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:32] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:32] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:33] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:34] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:34] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/826 variables, and 38 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:45] [INFO ] Deduced a trap composed of 40 places in 326 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:45] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:45] [INFO ] Deduced a trap composed of 60 places in 310 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:47] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:47] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:49] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:50] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:51] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:52] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:53] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:54:57] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:55:02] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 33 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/826 variables, and 50 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 0/465 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 360/447 places, 466/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 360/447 places, 466/599 transitions.
[2025-06-04 03:55:08] [INFO ] Flatten gal took : 20 ms
[2025-06-04 03:55:08] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:55:08] [INFO ] Input system was already deterministic with 466 transitions.
[2025-06-04 03:55:08] [INFO ] Flatten gal took : 17 ms
[2025-06-04 03:55:08] [INFO ] Flatten gal took : 17 ms
[2025-06-04 03:55:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17966222153536128296.gal : 4 ms
[2025-06-04 03:55:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16590865316700537086.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/CTLFireability17966222153536128296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16590865316700537086.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07811e+14,7.68834,156600,2,15481,5,475510,6,0,1908,940848,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 03:55:38] [INFO ] Flatten gal took : 25 ms
[2025-06-04 03:55:38] [INFO ] Applying decomposition
[2025-06-04 03:55:38] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15807818103971360256.txt' '-o' '/tmp/graph15807818103971360256.bin' '-w' '/tmp/graph15807818103971360256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15807818103971360256.bin' '-l' '-1' '-v' '-w' '/tmp/graph15807818103971360256.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:55:38] [INFO ] Decomposing Gal with order
[2025-06-04 03:55:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:55:38] [INFO ] Removed a total of 173 redundant transitions.
[2025-06-04 03:55:38] [INFO ] Flatten gal took : 54 ms
[2025-06-04 03:55:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 20 ms.
[2025-06-04 03:55:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2227576346140368550.gal : 11 ms
[2025-06-04 03:55:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6845994190921459515.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/CTLFireability2227576346140368550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6845994190921459515.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,1.07811e+14,1.72114,35980,1766,121,51651,1057,921,157933,111,4583,0


Converting to forward existential form...Done !
original formula: AF(EG((AX((i1.i0.u12.p82==1)) + EX((i18.i1.u110.p509==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EX(!((i1.i0.u12.p82==1)))) + EX((i18.i1.u110.p509==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t88, t417, t422, i1.i0.t357, i1.i0.t359, i1.i0.t361, i1.i0.t369, i1.i0.t374, i1.i0.t376, i1.i...1869
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
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 a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Graph (trivial) has 522 edges and 447 vertex of which 78 / 447 are part of one of the 20 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 388 transition count 364
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 185 rules applied. Total rules applied 353 place count 221 transition count 346
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 361 place count 213 transition count 346
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 361 place count 213 transition count 340
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 373 place count 207 transition count 340
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 408 place count 172 transition count 274
Iterating global reduction 3 with 35 rules applied. Total rules applied 443 place count 172 transition count 274
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 449 place count 172 transition count 268
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 455 place count 166 transition count 268
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 469 place count 152 transition count 245
Iterating global reduction 5 with 14 rules applied. Total rules applied 483 place count 152 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 487 place count 152 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 488 place count 151 transition count 241
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 493 place count 146 transition count 234
Iterating global reduction 7 with 5 rules applied. Total rules applied 498 place count 146 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 501 place count 146 transition count 231
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 502 place count 145 transition count 229
Iterating global reduction 8 with 1 rules applied. Total rules applied 503 place count 145 transition count 229
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 506 place count 142 transition count 226
Iterating global reduction 8 with 3 rules applied. Total rules applied 509 place count 142 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 512 place count 142 transition count 223
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 554 place count 121 transition count 202
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 564 place count 121 transition count 192
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 576 place count 109 transition count 168
Iterating global reduction 10 with 12 rules applied. Total rules applied 588 place count 109 transition count 168
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 595 place count 102 transition count 161
Iterating global reduction 10 with 7 rules applied. Total rules applied 602 place count 102 transition count 161
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 605 place count 99 transition count 155
Iterating global reduction 10 with 3 rules applied. Total rules applied 608 place count 99 transition count 155
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 611 place count 96 transition count 149
Iterating global reduction 10 with 3 rules applied. Total rules applied 614 place count 96 transition count 149
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 617 place count 93 transition count 143
Iterating global reduction 10 with 3 rules applied. Total rules applied 620 place count 93 transition count 143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 626 place count 93 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 628 place count 93 transition count 135
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 629 place count 93 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 630 place count 92 transition count 134
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 631 place count 91 transition count 132
Iterating global reduction 13 with 1 rules applied. Total rules applied 632 place count 91 transition count 132
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 633 place count 90 transition count 130
Iterating global reduction 13 with 1 rules applied. Total rules applied 634 place count 90 transition count 130
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 637 place count 87 transition count 127
Iterating global reduction 13 with 3 rules applied. Total rules applied 640 place count 87 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 642 place count 86 transition count 126
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 643 place count 85 transition count 125
Iterating global reduction 13 with 1 rules applied. Total rules applied 644 place count 85 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 648 place count 85 transition count 121
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 649 place count 85 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 650 place count 84 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 651 place count 83 transition count 119
Applied a total of 651 rules in 58 ms. Remains 83 /447 variables (removed 364) and now considering 119/599 (removed 480) transitions.
[2025-06-04 03:56:08] [INFO ] Flow matrix only has 109 transitions (discarded 10 similar events)
// Phase 1: matrix 109 rows 83 cols
[2025-06-04 03:56:08] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:56:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 03:56:09] [INFO ] Flow matrix only has 109 transitions (discarded 10 similar events)
[2025-06-04 03:56:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:56:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:56:09] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:56:09] [INFO ] Redundant transitions in 6 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-04 03:56:09] [INFO ] Flow matrix only has 109 transitions (discarded 10 similar events)
[2025-06-04 03:56:09] [INFO ] Invariant cache hit.
[2025-06-04 03:56:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 2/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:10] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:10] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:10] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 6/83 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 108/191 variables, 83/97 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 104 unsolved in 7073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 6/83 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:17] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:17] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 108/191 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 104/203 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:19] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (OVERLAPS) 1/192 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 15 (OVERLAPS) 0/192 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 205 constraints, problems are : Problem set: 0 solved, 104 unsolved in 12071 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19166ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 19169ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/447 places, 119/599 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19482 ms. Remains : 83/447 places, 119/599 transitions.
[2025-06-04 03:56:28] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:56:28] [INFO ] Flatten gal took : 3 ms
[2025-06-04 03:56:28] [INFO ] Input system was already deterministic with 119 transitions.
[2025-06-04 03:56:28] [INFO ] Flatten gal took : 3 ms
[2025-06-04 03:56:28] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:56:28] [INFO ] Time to serialize gal into /tmp/CTLFireability18360721997697955471.gal : 16 ms
[2025-06-04 03:56:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2548821225118297852.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/CTLFireability18360721997697955471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2548821225118297852.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.65789e+08,0.41837,11796,2,2838,5,38606,6,0,439,37381,0


Converting to forward existential form...Done !
original formula: AF(((p520==0) * AF((p103==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((p520==0) * !(EG(!((p103==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t12, t13, t15, t17, t58, t63, t68, t72, t73, t74, t75, t76, t77, t92,...282
(forward)formula 0,0,10.3014,256036,1,0,538,1.47504e+06,255,294,2760,1.64571e+06,586
FORMULA HealthRecord-PT-17-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 419 transition count 563
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 419 transition count 563
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 405 transition count 544
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 405 transition count 544
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 86 place count 405 transition count 542
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 96 place count 395 transition count 525
Iterating global reduction 1 with 10 rules applied. Total rules applied 106 place count 395 transition count 525
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 390 transition count 515
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 390 transition count 515
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 384 transition count 509
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 384 transition count 509
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 378 transition count 500
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 378 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 375 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 375 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 372 transition count 494
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 372 transition count 494
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 155 place count 372 transition count 491
Applied a total of 155 rules in 72 ms. Remains 372 /447 variables (removed 75) and now considering 491/599 (removed 108) transitions.
// Phase 1: matrix 491 rows 372 cols
[2025-06-04 03:56:38] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:56:39] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-04 03:56:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:56:39] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2025-06-04 03:56:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:57] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:58] [INFO ] Deduced a trap composed of 43 places in 372 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:58] [INFO ] Deduced a trap composed of 192 places in 358 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:59] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:56:59] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:00] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:00] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:01] [INFO ] Deduced a trap composed of 47 places in 329 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:01] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:01] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:02] [INFO ] Deduced a trap composed of 85 places in 253 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:02] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:02] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:03] [INFO ] Deduced a trap composed of 57 places in 270 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:03] [INFO ] Deduced a trap composed of 66 places in 221 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:04] [INFO ] Deduced a trap composed of 59 places in 273 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:04] [INFO ] Deduced a trap composed of 54 places in 280 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:04] [INFO ] Deduced a trap composed of 59 places in 297 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:05] [INFO ] Deduced a trap composed of 66 places in 285 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:06] [INFO ] Deduced a trap composed of 135 places in 346 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/863 variables, and 38 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/372 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:17] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:17] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:18] [INFO ] Deduced a trap composed of 52 places in 297 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:18] [INFO ] Deduced a trap composed of 139 places in 280 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:19] [INFO ] Deduced a trap composed of 140 places in 346 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:22] [INFO ] Deduced a trap composed of 70 places in 274 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:22] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:23] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:24] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:25] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:25] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:25] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:25] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:27] [INFO ] Deduced a trap composed of 45 places in 311 ms of which 67 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:28] [INFO ] Deduced a trap composed of 140 places in 325 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:30] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:57:39] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/863 variables, and 55 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/372 constraints, PredecessorRefiner: 0/490 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 372/447 places, 491/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61084 ms. Remains : 372/447 places, 491/599 transitions.
[2025-06-04 03:57:39] [INFO ] Flatten gal took : 19 ms
[2025-06-04 03:57:39] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:57:39] [INFO ] Input system was already deterministic with 491 transitions.
[2025-06-04 03:57:39] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:57:39] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:57:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2045523640728799775.gal : 2 ms
[2025-06-04 03:57:39] [INFO ] Time to serialize properties into /tmp/CTLFireability18138965890235468397.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/CTLFireability2045523640728799775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18138965890235468397.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.49706e+14,8.89772,163288,2,13862,5,485592,6,0,1981,1.0202e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 03:58:10] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:58:10] [INFO ] Applying decomposition
[2025-06-04 03:58:10] [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/graph13404640431782311307.txt' '-o' '/tmp/graph13404640431782311307.bin' '-w' '/tmp/graph13404640431782311307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13404640431782311307.bin' '-l' '-1' '-v' '-w' '/tmp/graph13404640431782311307.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:58:10] [INFO ] Decomposing Gal with order
[2025-06-04 03:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:58:10] [INFO ] Removed a total of 193 redundant transitions.
[2025-06-04 03:58:10] [INFO ] Flatten gal took : 44 ms
[2025-06-04 03:58:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 17 ms.
[2025-06-04 03:58:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16205480789573592446.gal : 10 ms
[2025-06-04 03:58:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12448071840906286693.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/CTLFireability16205480789573592446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12448071840906286693.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,1.49706e+14,25.1394,428224,2819,135,619771,12166,951,2.32666e+06,109,76156,0


Converting to forward existential form...Done !
original formula: (EG(((i4.i0.u19.p144==1) + EX(EG((i4.i0.u28.p175==0))))) * (AF(((i1.i1.u16.p96==1) * AX((i12.i0.u63.p322==0)))) + AF(((((i13.i3.u71.p347=...397
=> equivalent forward existential formula: ([(Init * !(EG(((i4.i0.u19.p144==1) + EX(EG((i4.i0.u28.p175==0)))))))] = FALSE * [FwdG((Init * !(!(EG(!(((i1.i1....479
Reverse transition relation is NOT exact ! Due to transitions t90, t310, t360, t361, t432, t433, t434, t435, t436, t441, i1.i0.u4.t416, i3.i0.t377, i3.i0.t...1978
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Graph (trivial) has 524 edges and 447 vertex of which 80 / 447 are part of one of the 21 SCC in 2 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 387 transition count 362
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 186 rules applied. Total rules applied 355 place count 219 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 363 place count 211 transition count 344
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 363 place count 211 transition count 338
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 205 transition count 338
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 410 place count 170 transition count 273
Iterating global reduction 3 with 35 rules applied. Total rules applied 445 place count 170 transition count 273
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 451 place count 170 transition count 267
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 457 place count 164 transition count 267
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 471 place count 150 transition count 244
Iterating global reduction 5 with 14 rules applied. Total rules applied 485 place count 150 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 488 place count 150 transition count 241
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 492 place count 146 transition count 236
Iterating global reduction 6 with 4 rules applied. Total rules applied 496 place count 146 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 499 place count 146 transition count 233
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 543 place count 124 transition count 211
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 553 place count 124 transition count 201
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 566 place count 111 transition count 175
Iterating global reduction 8 with 13 rules applied. Total rules applied 579 place count 111 transition count 175
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 587 place count 103 transition count 166
Iterating global reduction 8 with 8 rules applied. Total rules applied 595 place count 103 transition count 166
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 601 place count 97 transition count 157
Iterating global reduction 8 with 6 rules applied. Total rules applied 607 place count 97 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 610 place count 97 transition count 154
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 613 place count 94 transition count 148
Iterating global reduction 9 with 3 rules applied. Total rules applied 616 place count 94 transition count 148
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 618 place count 92 transition count 144
Iterating global reduction 9 with 2 rules applied. Total rules applied 620 place count 92 transition count 144
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 626 place count 92 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 628 place count 92 transition count 136
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 629 place count 92 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 630 place count 91 transition count 135
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 631 place count 90 transition count 133
Iterating global reduction 12 with 1 rules applied. Total rules applied 632 place count 90 transition count 133
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 633 place count 89 transition count 131
Iterating global reduction 12 with 1 rules applied. Total rules applied 634 place count 89 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 636 place count 88 transition count 130
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 637 place count 87 transition count 129
Iterating global reduction 12 with 1 rules applied. Total rules applied 638 place count 87 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 639 place count 87 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 639 place count 87 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 641 place count 86 transition count 127
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 642 place count 86 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 643 place count 85 transition count 126
Applied a total of 643 rules in 69 ms. Remains 85 /447 variables (removed 362) and now considering 126/599 (removed 473) transitions.
[2025-06-04 03:58:40] [INFO ] Flow matrix only has 116 transitions (discarded 10 similar events)
// Phase 1: matrix 116 rows 85 cols
[2025-06-04 03:58:40] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:58:40] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-04 03:58:40] [INFO ] Flow matrix only has 116 transitions (discarded 10 similar events)
[2025-06-04 03:58:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:58:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:58:40] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:58:40] [INFO ] Redundant transitions in 5 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-04 03:58:40] [INFO ] Flow matrix only has 116 transitions (discarded 10 similar events)
[2025-06-04 03:58:40] [INFO ] Invariant cache hit.
[2025-06-04 03:58:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 8/85 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:58:42] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:58:42] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:58:42] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 115/200 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 98 constraints, problems are : Problem set: 0 solved, 110 unsolved in 9727 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 8/85 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:58:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:58:51] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:58:51] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 115/200 variables, 85/100 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 110/210 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/201 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 211 constraints, problems are : Problem set: 0 solved, 110 unsolved in 10687 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20446ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 20446ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/447 places, 126/599 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20988 ms. Remains : 85/447 places, 126/599 transitions.
[2025-06-04 03:59:01] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:59:01] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:59:01] [INFO ] Input system was already deterministic with 126 transitions.
[2025-06-04 03:59:01] [INFO ] Flatten gal took : 9 ms
[2025-06-04 03:59:01] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:59:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12216901003616235210.gal : 5 ms
[2025-06-04 03:59:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4330217002318003056.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12216901003616235210.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4330217002318003056.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4330217002318003056.prop.
RANDOM walk for 38869 steps (2298 resets) in 481 ms. (80 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-17-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 294
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Graph (trivial) has 511 edges and 447 vertex of which 64 / 447 are part of one of the 19 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 401 transition count 379
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 186 rules applied. Total rules applied 355 place count 233 transition count 361
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 367 place count 225 transition count 357
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 371 place count 221 transition count 357
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 371 place count 221 transition count 351
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 383 place count 215 transition count 351
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 416 place count 182 transition count 291
Iterating global reduction 4 with 33 rules applied. Total rules applied 449 place count 182 transition count 291
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 455 place count 182 transition count 285
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 461 place count 176 transition count 285
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 473 place count 164 transition count 263
Iterating global reduction 6 with 12 rules applied. Total rules applied 485 place count 164 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 488 place count 164 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 489 place count 163 transition count 260
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 494 place count 158 transition count 253
Iterating global reduction 8 with 5 rules applied. Total rules applied 499 place count 158 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 501 place count 158 transition count 251
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 503 place count 156 transition count 247
Iterating global reduction 9 with 2 rules applied. Total rules applied 505 place count 156 transition count 247
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 549 place count 134 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 558 place count 134 transition count 216
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 569 place count 123 transition count 194
Iterating global reduction 10 with 11 rules applied. Total rules applied 580 place count 123 transition count 194
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 586 place count 117 transition count 188
Iterating global reduction 10 with 6 rules applied. Total rules applied 592 place count 117 transition count 188
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 595 place count 114 transition count 182
Iterating global reduction 10 with 3 rules applied. Total rules applied 598 place count 114 transition count 182
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 601 place count 111 transition count 176
Iterating global reduction 10 with 3 rules applied. Total rules applied 604 place count 111 transition count 176
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 607 place count 108 transition count 170
Iterating global reduction 10 with 3 rules applied. Total rules applied 610 place count 108 transition count 170
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 616 place count 108 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 620 place count 108 transition count 160
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 621 place count 108 transition count 159
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 623 place count 107 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 624 place count 106 transition count 158
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 625 place count 105 transition count 156
Iterating global reduction 14 with 1 rules applied. Total rules applied 626 place count 105 transition count 156
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 627 place count 104 transition count 154
Iterating global reduction 14 with 1 rules applied. Total rules applied 628 place count 104 transition count 154
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 631 place count 101 transition count 151
Iterating global reduction 14 with 3 rules applied. Total rules applied 634 place count 101 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 636 place count 100 transition count 150
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 637 place count 99 transition count 149
Iterating global reduction 14 with 1 rules applied. Total rules applied 638 place count 99 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 641 place count 99 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 641 place count 99 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 643 place count 98 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 644 place count 97 transition count 144
Applied a total of 644 rules in 96 ms. Remains 97 /447 variables (removed 350) and now considering 144/599 (removed 455) transitions.
[2025-06-04 03:59:01] [INFO ] Flow matrix only has 135 transitions (discarded 9 similar events)
// Phase 1: matrix 135 rows 97 cols
[2025-06-04 03:59:01] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:59:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 03:59:01] [INFO ] Flow matrix only has 135 transitions (discarded 9 similar events)
[2025-06-04 03:59:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:59:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:59:01] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:59:01] [INFO ] Redundant transitions in 8 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-04 03:59:01] [INFO ] Flow matrix only has 135 transitions (discarded 9 similar events)
[2025-06-04 03:59:01] [INFO ] Invariant cache hit.
[2025-06-04 03:59:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 2/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:03] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:03] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:03] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:03] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:04] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 6/97 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 134/231 variables, 97/113 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/232 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 114 constraints, problems are : Problem set: 0 solved, 128 unsolved in 10953 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 2/91 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:13] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 6/97 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 134/231 variables, 97/114 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 128/242 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:17] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 13 (OVERLAPS) 1/232 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 15 (OVERLAPS) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 244 constraints, problems are : Problem set: 0 solved, 128 unsolved in 18371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29345ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 29347ms
Starting structural reductions in SI_CTL mode, iteration 1 : 97/447 places, 144/599 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29704 ms. Remains : 97/447 places, 144/599 transitions.
[2025-06-04 03:59:31] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:59:31] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:59:31] [INFO ] Input system was already deterministic with 144 transitions.
[2025-06-04 03:59:31] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:59:31] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:59:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1949716996952463353.gal : 2 ms
[2025-06-04 03:59:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13652402856174807144.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/CTLFireability1949716996952463353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13652402856174807144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((((p278==1)||(p457==1))||((p170==1)&&(p254==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((p278==1)||(p457==1))||((p170==1)&&(p254==1)))))] = FALSE
Hit Full ! (commute/partial/dont) 129/10/15
(forward)formula 0,0,1.90704,39168,1,0,8,187042,20,4,2590,130888,8
FORMULA HealthRecord-PT-17-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 416 transition count 559
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 416 transition count 559
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 77 place count 401 transition count 538
Iterating global reduction 0 with 15 rules applied. Total rules applied 92 place count 401 transition count 538
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 401 transition count 534
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 107 place count 390 transition count 514
Iterating global reduction 1 with 11 rules applied. Total rules applied 118 place count 390 transition count 514
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 383 transition count 502
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 383 transition count 502
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 375 transition count 491
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 375 transition count 491
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 367 transition count 479
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 367 transition count 479
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 168 place count 363 transition count 474
Iterating global reduction 1 with 4 rules applied. Total rules applied 172 place count 363 transition count 474
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 175 place count 363 transition count 471
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 178 place count 360 transition count 468
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 360 transition count 468
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 184 place count 360 transition count 465
Applied a total of 184 rules in 46 ms. Remains 360 /447 variables (removed 87) and now considering 465/599 (removed 134) transitions.
// Phase 1: matrix 465 rows 360 cols
[2025-06-04 03:59:33] [INFO ] Computed 18 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:59:33] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-04 03:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:59:33] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-04 03:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:50] [INFO ] Deduced a trap composed of 30 places in 407 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:51] [INFO ] Deduced a trap composed of 43 places in 370 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:51] [INFO ] Deduced a trap composed of 191 places in 328 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:51] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:52] [INFO ] Deduced a trap composed of 45 places in 379 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:52] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:53] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:53] [INFO ] Deduced a trap composed of 113 places in 341 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:54] [INFO ] Deduced a trap composed of 135 places in 338 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:54] [INFO ] Deduced a trap composed of 48 places in 301 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:55] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:55] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:56] [INFO ] Deduced a trap composed of 68 places in 283 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:56] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:57] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:57] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:57] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:57] [INFO ] Deduced a trap composed of 69 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:58] [INFO ] Deduced a trap composed of 54 places in 295 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:59:58] [INFO ] Deduced a trap composed of 55 places in 308 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/825 variables, and 38 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:11] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:11] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:11] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:11] [INFO ] Deduced a trap composed of 85 places in 244 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:12] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:12] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:13] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:14] [INFO ] Deduced a trap composed of 48 places in 308 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:14] [INFO ] Deduced a trap composed of 49 places in 304 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:14] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:15] [INFO ] Deduced a trap composed of 47 places in 314 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:15] [INFO ] Deduced a trap composed of 52 places in 355 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:16] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:16] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:16] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:17] [INFO ] Deduced a trap composed of 71 places in 265 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:18] [INFO ] Deduced a trap composed of 70 places in 289 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:18] [INFO ] Deduced a trap composed of 72 places in 347 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:19] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:19] [INFO ] Deduced a trap composed of 71 places in 293 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:20] [INFO ] Deduced a trap composed of 44 places in 358 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:22] [INFO ] Deduced a trap composed of 135 places in 320 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:22] [INFO ] Deduced a trap composed of 135 places in 249 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:22] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:23] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:24] [INFO ] Deduced a trap composed of 59 places in 266 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:24] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:25] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:25] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:26] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:26] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:26] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:26] [INFO ] Deduced a trap composed of 71 places in 222 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:27] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:27] [INFO ] Deduced a trap composed of 67 places in 217 ms of which 30 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:31] [INFO ] Deduced a trap composed of 70 places in 357 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:33] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:33] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:00:34] [INFO ] Deduced a trap composed of 70 places in 284 ms of which 44 ms to minimize.
SMT process timed out in 60236ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 360/447 places, 465/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61085 ms. Remains : 360/447 places, 465/599 transitions.
[2025-06-04 04:00:34] [INFO ] Flatten gal took : 14 ms
[2025-06-04 04:00:34] [INFO ] Flatten gal took : 14 ms
[2025-06-04 04:00:34] [INFO ] Input system was already deterministic with 465 transitions.
[2025-06-04 04:00:34] [INFO ] Flatten gal took : 14 ms
[2025-06-04 04:00:34] [INFO ] Flatten gal took : 13 ms
[2025-06-04 04:00:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4918023116628547317.gal : 4 ms
[2025-06-04 04:00:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15288000213424700965.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/CTLFireability4918023116628547317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15288000213424700965.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.11706e+14,12.0434,231032,2,17844,5,718510,6,0,1907,1.4559e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 04:01:04] [INFO ] Flatten gal took : 9 ms
[2025-06-04 04:01:04] [INFO ] Applying decomposition
[2025-06-04 04:01:04] [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/graph13174678707466079071.txt' '-o' '/tmp/graph13174678707466079071.bin' '-w' '/tmp/graph13174678707466079071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13174678707466079071.bin' '-l' '-1' '-v' '-w' '/tmp/graph13174678707466079071.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:01:04] [INFO ] Decomposing Gal with order
[2025-06-04 04:01:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:01:04] [INFO ] Removed a total of 184 redundant transitions.
[2025-06-04 04:01:04] [INFO ] Flatten gal took : 26 ms
[2025-06-04 04:01:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2025-06-04 04:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3429363781670868644.gal : 7 ms
[2025-06-04 04:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7918515527599791782.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/CTLFireability3429363781670868644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7918515527599791782.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,1.11706e+14,3.75348,71904,2087,64,110762,859,878,283064,86,3239,0


Converting to forward existential form...Done !
original formula: EX((EF(EG(E((i17.i2.u100.p448==1) U (i4.i0.u25.p138==1)))) + ((i22.u141.p619==1) * EX((AX((i6.i0.u42.p257==1)) + (i19.u114.p486==0))))))
=> equivalent forward existential formula: ([FwdG(FwdU(EY(Init),TRUE),E((i17.i2.u100.p448==1) U (i4.i0.u25.p138==1)))] != FALSE + ([(EY((EY(Init) * (i22.u1...285
Reverse transition relation is NOT exact ! Due to transitions t400, t401, t402, t403, t404, t416, t420, t421, t422, t429, i0.i1.t396, i2.i0.t359, i2.i0.t36...1813
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,22.4557,388064,1,0,721830,1391,7062,1.34458e+06,436,4226,1195721
FORMULA HealthRecord-PT-17-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Graph (trivial) has 495 edges and 447 vertex of which 36 / 447 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 428 transition count 404
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 193 rules applied. Total rules applied 370 place count 252 transition count 387
Reduce places removed 8 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 20 rules applied. Total rules applied 390 place count 244 transition count 375
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 402 place count 232 transition count 375
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 402 place count 232 transition count 369
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 414 place count 226 transition count 369
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 450 place count 190 transition count 309
Iterating global reduction 4 with 36 rules applied. Total rules applied 486 place count 190 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 7 rules applied. Total rules applied 493 place count 190 transition count 302
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 499 place count 184 transition count 302
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 513 place count 170 transition count 275
Iterating global reduction 6 with 14 rules applied. Total rules applied 527 place count 170 transition count 275
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 528 place count 170 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 529 place count 169 transition count 274
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 534 place count 164 transition count 267
Iterating global reduction 8 with 5 rules applied. Total rules applied 539 place count 164 transition count 267
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 543 place count 160 transition count 259
Iterating global reduction 8 with 4 rules applied. Total rules applied 547 place count 160 transition count 259
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 550 place count 157 transition count 256
Iterating global reduction 8 with 3 rules applied. Total rules applied 553 place count 157 transition count 256
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 556 place count 154 transition count 250
Iterating global reduction 8 with 3 rules applied. Total rules applied 559 place count 154 transition count 250
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 562 place count 154 transition count 247
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 604 place count 133 transition count 226
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 614 place count 133 transition count 216
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 626 place count 121 transition count 192
Iterating global reduction 10 with 12 rules applied. Total rules applied 638 place count 121 transition count 192
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 644 place count 115 transition count 186
Iterating global reduction 10 with 6 rules applied. Total rules applied 650 place count 115 transition count 186
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 653 place count 112 transition count 180
Iterating global reduction 10 with 3 rules applied. Total rules applied 656 place count 112 transition count 180
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 659 place count 109 transition count 174
Iterating global reduction 10 with 3 rules applied. Total rules applied 662 place count 109 transition count 174
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 665 place count 106 transition count 168
Iterating global reduction 10 with 3 rules applied. Total rules applied 668 place count 106 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 674 place count 106 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 681 place count 106 transition count 155
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 11 with 3 rules applied. Total rules applied 684 place count 106 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 687 place count 103 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 689 place count 102 transition count 151
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 690 place count 101 transition count 150
Iterating global reduction 13 with 1 rules applied. Total rules applied 691 place count 101 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 692 place count 101 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 693 place count 101 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 694 place count 100 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 695 place count 99 transition count 147
Applied a total of 695 rules in 91 ms. Remains 99 /447 variables (removed 348) and now considering 147/599 (removed 452) transitions.
[2025-06-04 04:01:27] [INFO ] Flow matrix only has 140 transitions (discarded 7 similar events)
// Phase 1: matrix 140 rows 99 cols
[2025-06-04 04:01:27] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:01:27] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-04 04:01:27] [INFO ] Flow matrix only has 140 transitions (discarded 7 similar events)
[2025-06-04 04:01:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:01:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 04:01:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:01:27] [INFO ] Redundant transitions in 2 ms returned []
Running 131 sub problems to find dead transitions.
[2025-06-04 04:01:27] [INFO ] Flow matrix only has 140 transitions (discarded 7 similar events)
[2025-06-04 04:01:27] [INFO ] Invariant cache hit.
[2025-06-04 04:01:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 8/99 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:01:28] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:01:28] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 139/238 variables, 99/110 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 1/239 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 111 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11861 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 8/99 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:01:40] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:01:40] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 139/238 variables, 99/112 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 131/243 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:01:43] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 1/239 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/239 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 245 constraints, problems are : Problem set: 0 solved, 131 unsolved in 15799 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 99/99 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27677ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 27678ms
Starting structural reductions in SI_CTL mode, iteration 1 : 99/447 places, 147/599 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28078 ms. Remains : 99/447 places, 147/599 transitions.
[2025-06-04 04:01:55] [INFO ] Flatten gal took : 3 ms
[2025-06-04 04:01:55] [INFO ] Flatten gal took : 3 ms
[2025-06-04 04:01:55] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-04 04:01:55] [INFO ] Flatten gal took : 3 ms
[2025-06-04 04:01:55] [INFO ] Flatten gal took : 3 ms
[2025-06-04 04:01:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4306098725575056349.gal : 1 ms
[2025-06-04 04:01:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17409248846988456325.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/CTLFireability4306098725575056349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17409248846988456325.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.42082e+09,0.437501,16632,2,1828,5,57630,6,0,535,56470,0


Converting to forward existential form...Done !
original formula: EF(AG((((p85==1)&&(p170==1))&&((p252==1)&&(p553==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p85==1)&&(p170==1))&&((p252==1)&&(p553==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t17, t19, t61, t63, t64, t69, t71, t72, t75, t79, t80, t83,...304
(forward)formula 0,0,1.34464,34704,1,0,228,173164,308,109,3374,110406,296
FORMULA HealthRecord-PT-17-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 417 transition count 560
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 417 transition count 560
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 76 place count 401 transition count 537
Iterating global reduction 0 with 16 rules applied. Total rules applied 92 place count 401 transition count 537
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 401 transition count 533
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 106 place count 391 transition count 516
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 391 transition count 516
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 385 transition count 505
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 385 transition count 505
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 378 transition count 496
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 378 transition count 496
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 149 place count 371 transition count 486
Iterating global reduction 1 with 7 rules applied. Total rules applied 156 place count 371 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 159 place count 368 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 162 place count 368 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 165 place count 365 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 168 place count 365 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 171 place count 365 transition count 477
Applied a total of 171 rules in 83 ms. Remains 365 /447 variables (removed 82) and now considering 477/599 (removed 122) transitions.
// Phase 1: matrix 477 rows 365 cols
[2025-06-04 04:01:56] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:01:56] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-04 04:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:01:57] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2025-06-04 04:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (OVERLAPS) 1/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:14] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:14] [INFO ] Deduced a trap composed of 136 places in 366 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:15] [INFO ] Deduced a trap composed of 108 places in 377 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:15] [INFO ] Deduced a trap composed of 85 places in 363 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:16] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:16] [INFO ] Deduced a trap composed of 191 places in 365 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:17] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:18] [INFO ] Deduced a trap composed of 45 places in 376 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:18] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:18] [INFO ] Deduced a trap composed of 65 places in 317 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:19] [INFO ] Deduced a trap composed of 65 places in 310 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:19] [INFO ] Deduced a trap composed of 66 places in 318 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:22] [INFO ] Deduced a trap composed of 64 places in 304 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:23] [INFO ] Deduced a trap composed of 64 places in 300 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:23] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:24] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:24] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:25] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:27] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:02:27] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 22 ms to minimize.
SMT process timed out in 30262ms, After SMT, problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 30264ms
Starting structural reductions in LTL mode, iteration 1 : 365/447 places, 477/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31069 ms. Remains : 365/447 places, 477/599 transitions.
[2025-06-04 04:02:27] [INFO ] Flatten gal took : 16 ms
[2025-06-04 04:02:27] [INFO ] Flatten gal took : 15 ms
[2025-06-04 04:02:27] [INFO ] Input system was already deterministic with 477 transitions.
[2025-06-04 04:02:27] [INFO ] Flatten gal took : 15 ms
[2025-06-04 04:02:27] [INFO ] Flatten gal took : 15 ms
[2025-06-04 04:02:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7076447677950462032.gal : 4 ms
[2025-06-04 04:02:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3345334681793251995.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/CTLFireability7076447677950462032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3345334681793251995.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25135e+14,8.75201,158032,2,13220,5,471987,6,0,1939,967024,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 04:02:57] [INFO ] Flatten gal took : 8 ms
[2025-06-04 04:02:57] [INFO ] Applying decomposition
[2025-06-04 04:02:57] [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/graph649245429798428081.txt' '-o' '/tmp/graph649245429798428081.bin' '-w' '/tmp/graph649245429798428081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph649245429798428081.bin' '-l' '-1' '-v' '-w' '/tmp/graph649245429798428081.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:02:57] [INFO ] Decomposing Gal with order
[2025-06-04 04:02:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:02:57] [INFO ] Removed a total of 172 redundant transitions.
[2025-06-04 04:02:57] [INFO ] Flatten gal took : 24 ms
[2025-06-04 04:02:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2025-06-04 04:02:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17267818004949797989.gal : 5 ms
[2025-06-04 04:02:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2561194749174695195.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/CTLFireability17267818004949797989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2561194749174695195.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25135e+14,11.8566,195036,3019,268,281357,6126,909,1.12212e+06,131,29856,0


Converting to forward existential form...Done !
original formula: EF(!(E((EF(EG((i9.i0.u44.p290==1))) * ((i7.i0.u31.p224!=1)||(!((i10.i1.u77.p378==1)||(i16.i1.u84.p392==1))))) U !(AF(AX((i9.i2.u49.p298==...163
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((E(TRUE U EG((i9.i0.u44.p290==1))) * ((i7.i0.u31.p224!=1)||(!((i10.i1.u77.p378==1)||(i16...233
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t90, t170, t307, t423, t428, i1.i0.u4.t403, i3.i0.u8.t366, i3.i0.u8.t368, i3.i0.u8....1852
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Graph (trivial) has 524 edges and 447 vertex of which 80 / 447 are part of one of the 21 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 387 transition count 363
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 185 rules applied. Total rules applied 353 place count 220 transition count 345
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 361 place count 212 transition count 345
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 361 place count 212 transition count 339
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 373 place count 206 transition count 339
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 409 place count 170 transition count 272
Iterating global reduction 3 with 36 rules applied. Total rules applied 445 place count 170 transition count 272
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 451 place count 170 transition count 266
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 457 place count 164 transition count 266
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 471 place count 150 transition count 243
Iterating global reduction 5 with 14 rules applied. Total rules applied 485 place count 150 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 489 place count 150 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 490 place count 149 transition count 239
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 495 place count 144 transition count 232
Iterating global reduction 7 with 5 rules applied. Total rules applied 500 place count 144 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 503 place count 144 transition count 229
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 504 place count 143 transition count 227
Iterating global reduction 8 with 1 rules applied. Total rules applied 505 place count 143 transition count 227
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 508 place count 140 transition count 224
Iterating global reduction 8 with 3 rules applied. Total rules applied 511 place count 140 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 514 place count 140 transition count 221
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 556 place count 119 transition count 200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 565 place count 119 transition count 191
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 576 place count 108 transition count 169
Iterating global reduction 10 with 11 rules applied. Total rules applied 587 place count 108 transition count 169
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 593 place count 102 transition count 163
Iterating global reduction 10 with 6 rules applied. Total rules applied 599 place count 102 transition count 163
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 602 place count 99 transition count 157
Iterating global reduction 10 with 3 rules applied. Total rules applied 605 place count 99 transition count 157
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 608 place count 96 transition count 151
Iterating global reduction 10 with 3 rules applied. Total rules applied 611 place count 96 transition count 151
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 614 place count 93 transition count 145
Iterating global reduction 10 with 3 rules applied. Total rules applied 617 place count 93 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 623 place count 93 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 625 place count 93 transition count 137
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 626 place count 93 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 627 place count 92 transition count 136
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 628 place count 91 transition count 134
Iterating global reduction 13 with 1 rules applied. Total rules applied 629 place count 91 transition count 134
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 630 place count 90 transition count 132
Iterating global reduction 13 with 1 rules applied. Total rules applied 631 place count 90 transition count 132
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 634 place count 87 transition count 129
Iterating global reduction 13 with 3 rules applied. Total rules applied 637 place count 87 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 639 place count 86 transition count 128
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 640 place count 85 transition count 127
Iterating global reduction 13 with 1 rules applied. Total rules applied 641 place count 85 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 645 place count 85 transition count 123
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 646 place count 85 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 647 place count 84 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 648 place count 83 transition count 121
Applied a total of 648 rules in 59 ms. Remains 83 /447 variables (removed 364) and now considering 121/599 (removed 478) transitions.
[2025-06-04 04:03:28] [INFO ] Flow matrix only has 111 transitions (discarded 10 similar events)
// Phase 1: matrix 111 rows 83 cols
[2025-06-04 04:03:28] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:03:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-04 04:03:28] [INFO ] Flow matrix only has 111 transitions (discarded 10 similar events)
[2025-06-04 04:03:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 04:03:28] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:03:28] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-04 04:03:28] [INFO ] Flow matrix only has 111 transitions (discarded 10 similar events)
[2025-06-04 04:03:28] [INFO ] Invariant cache hit.
[2025-06-04 04:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:03:29] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:03:29] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:03:29] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 110/193 variables, 83/95 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:03:31] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/194 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 97 constraints, problems are : Problem set: 0 solved, 105 unsolved in 8816 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:03:37] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:03:37] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:03:38] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 110/193 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 105/204 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/194 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 205 constraints, problems are : Problem set: 0 solved, 105 unsolved in 12068 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20902ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 20902ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/447 places, 121/599 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21205 ms. Remains : 83/447 places, 121/599 transitions.
[2025-06-04 04:03:49] [INFO ] Flatten gal took : 4 ms
[2025-06-04 04:03:49] [INFO ] Flatten gal took : 2 ms
[2025-06-04 04:03:49] [INFO ] Input system was already deterministic with 121 transitions.
[2025-06-04 04:03:49] [INFO ] Flatten gal took : 2 ms
[2025-06-04 04:03:49] [INFO ] Flatten gal took : 2 ms
[2025-06-04 04:03:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17824742736963879135.gal : 0 ms
[2025-06-04 04:03:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2022904410016358956.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/CTLFireability17824742736963879135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2022904410016358956.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,5.92282e+08,0.266818,11864,2,2183,5,39264,6,0,441,32052,0


Converting to forward existential form...Done !
original formula: EG((p104==0))
=> equivalent forward existential formula: [FwdG(Init,(p104==0))] != FALSE
Hit Full ! (commute/partial/dont) 119/0/2
(forward)formula 0,1,1.04751,26016,1,0,8,115795,19,4,2210,78343,8
FORMULA HealthRecord-PT-17-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 420 transition count 565
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 420 transition count 565
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 69 place count 405 transition count 544
Iterating global reduction 0 with 15 rules applied. Total rules applied 84 place count 405 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 88 place count 405 transition count 540
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 399 transition count 528
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 399 transition count 528
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 396 transition count 522
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 396 transition count 522
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 392 transition count 518
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 392 transition count 518
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 388 transition count 511
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 388 transition count 511
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 385 transition count 508
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 385 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 383 transition count 506
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 383 transition count 506
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 134 place count 383 transition count 504
Applied a total of 134 rules in 52 ms. Remains 383 /447 variables (removed 64) and now considering 504/599 (removed 95) transitions.
// Phase 1: matrix 504 rows 383 cols
[2025-06-04 04:03:50] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:03:50] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-04 04:03:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:03:50] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2025-06-04 04:03:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:09] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:09] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:10] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:10] [INFO ] Deduced a trap composed of 201 places in 257 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:10] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:11] [INFO ] Deduced a trap composed of 46 places in 272 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:11] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:14] [INFO ] Deduced a trap composed of 43 places in 328 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:15] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:15] [INFO ] Deduced a trap composed of 95 places in 360 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:15] [INFO ] Deduced a trap composed of 71 places in 282 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:16] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:16] [INFO ] Deduced a trap composed of 69 places in 281 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:16] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:17] [INFO ] Deduced a trap composed of 71 places in 345 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:17] [INFO ] Deduced a trap composed of 71 places in 325 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:18] [INFO ] Deduced a trap composed of 80 places in 285 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:19] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:04:21] [INFO ] Deduced a trap composed of 54 places in 325 ms of which 33 ms to minimize.
SMT process timed out in 30184ms, After SMT, problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Starting structural reductions in LTL mode, iteration 1 : 383/447 places, 504/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30862 ms. Remains : 383/447 places, 504/599 transitions.
[2025-06-04 04:04:21] [INFO ] Flatten gal took : 16 ms
[2025-06-04 04:04:21] [INFO ] Flatten gal took : 21 ms
[2025-06-04 04:04:21] [INFO ] Input system was already deterministic with 504 transitions.
[2025-06-04 04:04:21] [INFO ] Flatten gal took : 15 ms
[2025-06-04 04:04:21] [INFO ] Flatten gal took : 14 ms
[2025-06-04 04:04:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13553468547254897271.gal : 3 ms
[2025-06-04 04:04:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13252304999526926638.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/CTLFireability13553468547254897271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13252304999526926638.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.00049e+14,11.6104,249788,2,19089,5,719975,6,0,2038,1.6382e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 04:04:51] [INFO ] Flatten gal took : 8 ms
[2025-06-04 04:04:51] [INFO ] Applying decomposition
[2025-06-04 04:04:51] [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/graph5997472406785138713.txt' '-o' '/tmp/graph5997472406785138713.bin' '-w' '/tmp/graph5997472406785138713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5997472406785138713.bin' '-l' '-1' '-v' '-w' '/tmp/graph5997472406785138713.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:04:51] [INFO ] Decomposing Gal with order
[2025-06-04 04:04:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:04:51] [INFO ] Removed a total of 184 redundant transitions.
[2025-06-04 04:04:51] [INFO ] Flatten gal took : 25 ms
[2025-06-04 04:04:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2025-06-04 04:04:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15837053430814105070.gal : 4 ms
[2025-06-04 04:04:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8167069338005530055.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/CTLFireability15837053430814105070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8167069338005530055.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 : 447/447 places, 599/599 transitions.
Graph (trivial) has 524 edges and 447 vertex of which 78 / 447 are part of one of the 20 SCC in 0 ms
Free SCC test removed 58 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 170 place count 388 transition count 362
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 187 rules applied. Total rules applied 357 place count 219 transition count 344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 365 place count 211 transition count 344
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 365 place count 211 transition count 338
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 377 place count 205 transition count 338
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 412 place count 170 transition count 272
Iterating global reduction 3 with 35 rules applied. Total rules applied 447 place count 170 transition count 272
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 453 place count 170 transition count 266
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 459 place count 164 transition count 266
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 473 place count 150 transition count 243
Iterating global reduction 5 with 14 rules applied. Total rules applied 487 place count 150 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 491 place count 150 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 492 place count 149 transition count 239
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 497 place count 144 transition count 232
Iterating global reduction 7 with 5 rules applied. Total rules applied 502 place count 144 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 505 place count 144 transition count 229
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 506 place count 143 transition count 227
Iterating global reduction 8 with 1 rules applied. Total rules applied 507 place count 143 transition count 227
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 510 place count 140 transition count 224
Iterating global reduction 8 with 3 rules applied. Total rules applied 513 place count 140 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 516 place count 140 transition count 221
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 558 place count 119 transition count 200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 568 place count 119 transition count 190
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 580 place count 107 transition count 166
Iterating global reduction 10 with 12 rules applied. Total rules applied 592 place count 107 transition count 166
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 599 place count 100 transition count 159
Iterating global reduction 10 with 7 rules applied. Total rules applied 606 place count 100 transition count 159
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 609 place count 97 transition count 153
Iterating global reduction 10 with 3 rules applied. Total rules applied 612 place count 97 transition count 153
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 615 place count 94 transition count 147
Iterating global reduction 10 with 3 rules applied. Total rules applied 618 place count 94 transition count 147
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 621 place count 91 transition count 141
Iterating global reduction 10 with 3 rules applied. Total rules applied 624 place count 91 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 630 place count 91 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 632 place count 91 transition count 133
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 633 place count 91 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 634 place count 90 transition count 132
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 635 place count 89 transition count 130
Iterating global reduction 13 with 1 rules applied. Total rules applied 636 place count 89 transition count 130
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 637 place count 88 transition count 128
Iterating global reduction 13 with 1 rules applied. Total rules applied 638 place count 88 transition count 128
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 641 place count 85 transition count 125
Iterating global reduction 13 with 3 rules applied. Total rules applied 644 place count 85 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 646 place count 84 transition count 124
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 647 place count 83 transition count 123
Iterating global reduction 13 with 1 rules applied. Total rules applied 648 place count 83 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 652 place count 83 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 653 place count 83 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 654 place count 82 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 655 place count 81 transition count 117
Applied a total of 655 rules in 36 ms. Remains 81 /447 variables (removed 366) and now considering 117/599 (removed 482) transitions.
[2025-06-04 04:05:21] [INFO ] Flow matrix only has 107 transitions (discarded 10 similar events)
// Phase 1: matrix 107 rows 81 cols
[2025-06-04 04:05:21] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:05:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-04 04:05:21] [INFO ] Flow matrix only has 107 transitions (discarded 10 similar events)
[2025-06-04 04:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:05:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 04:05:21] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 04:05:21] [INFO ] Redundant transitions in 0 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-04 04:05:21] [INFO ] Flow matrix only has 107 transitions (discarded 10 similar events)
[2025-06-04 04:05:21] [INFO ] Invariant cache hit.
[2025-06-04 04:05:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 2/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:05:22] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 6/81 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:05:24] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 106/187 variables, 81/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 1/188 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 94 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9414 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 2/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:05:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 6/81 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 106/187 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 101/195 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:05:34] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 1/188 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (OVERLAPS) 0/188 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 197 constraints, problems are : Problem set: 0 solved, 101 unsolved in 10868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20294ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 20294ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/447 places, 117/599 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20530 ms. Remains : 81/447 places, 117/599 transitions.
[2025-06-04 04:05:42] [INFO ] Flatten gal took : 3 ms
[2025-06-04 04:05:42] [INFO ] Flatten gal took : 3 ms
[2025-06-04 04:05:42] [INFO ] Input system was already deterministic with 117 transitions.
[2025-06-04 04:05:42] [INFO ] Flatten gal took : 3 ms
[2025-06-04 04:05:42] [INFO ] Flatten gal took : 2 ms
[2025-06-04 04:05:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2306506981089554506.gal : 1 ms
[2025-06-04 04:05:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13916368497882685942.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/ReachabilityCardinality2306506981089554506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13916368497882685942.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13916368497882685942.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 96
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :96 after 12288
RANDOM walk for 40000 steps (2333 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (240 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12288 after 7.44415e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.44415e+06 after 1.37626e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.37626e+07 after 8.94566e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.56352e+08,2.06562,5144,2,433,12,5303,7,0,432,3432,0
Total reachable state count : 356352006

Verifying 1 reachability properties.
Reachability property HealthRecord-PT-17-CTLFireability-2023-14 is true.
FORMULA HealthRecord-PT-17-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-CTLFireability-2023-14,2,2.06617,5144,2,85,12,5303,7,0,434,3432,0
Interrupted probabilistic random walk after 2549838 steps, run timeout after 3001 ms. (steps per millisecond=849 ) properties seen :0 out of 1
Probabilistic random walk after 2549838 steps, saw 386478 distinct states, run finished after 3001 ms. (steps per millisecond=849 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 599/599 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 416 transition count 559
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 416 transition count 559
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 79 place count 399 transition count 535
Iterating global reduction 0 with 17 rules applied. Total rules applied 96 place count 399 transition count 535
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 399 transition count 531
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 388 transition count 511
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 388 transition count 511
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 381 transition count 499
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 381 transition count 499
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 143 place count 374 transition count 491
Iterating global reduction 1 with 7 rules applied. Total rules applied 150 place count 374 transition count 491
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 157 place count 367 transition count 480
Iterating global reduction 1 with 7 rules applied. Total rules applied 164 place count 367 transition count 480
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 168 place count 363 transition count 475
Iterating global reduction 1 with 4 rules applied. Total rules applied 172 place count 363 transition count 475
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 175 place count 363 transition count 472
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 178 place count 360 transition count 469
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 360 transition count 469
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 184 place count 360 transition count 466
Applied a total of 184 rules in 46 ms. Remains 360 /447 variables (removed 87) and now considering 466/599 (removed 133) transitions.
// Phase 1: matrix 466 rows 360 cols
[2025-06-04 04:05:45] [INFO ] Computed 18 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:05:45] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-04 04:05:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 04:05:45] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-04 04:05:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:01] [INFO ] Deduced a trap composed of 29 places in 330 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:02] [INFO ] Deduced a trap composed of 43 places in 367 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:02] [INFO ] Deduced a trap composed of 40 places in 348 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:03] [INFO ] Deduced a trap composed of 191 places in 340 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:03] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:04] [INFO ] Deduced a trap composed of 45 places in 359 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:04] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:05] [INFO ] Deduced a trap composed of 114 places in 412 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:05] [INFO ] Deduced a trap composed of 71 places in 349 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:05] [INFO ] Deduced a trap composed of 49 places in 274 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:06] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:06] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:07] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:08] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:09] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:10] [INFO ] Deduced a trap composed of 29 places in 358 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:10] [INFO ] Deduced a trap composed of 71 places in 235 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:11] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:13] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/826 variables, and 37 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:22] [INFO ] Deduced a trap composed of 134 places in 298 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:23] [INFO ] Deduced a trap composed of 136 places in 326 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:23] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:23] [INFO ] Deduced a trap composed of 62 places in 316 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:24] [INFO ] Deduced a trap composed of 61 places in 315 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:24] [INFO ] Deduced a trap composed of 61 places in 298 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:24] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:25] [INFO ] Deduced a trap composed of 85 places in 332 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:25] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:26] [INFO ] Deduced a trap composed of 66 places in 355 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:29] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:30] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:30] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:30] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:31] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:36] [INFO ] Deduced a trap composed of 42 places in 345 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:37] [INFO ] Deduced a trap composed of 72 places in 330 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:38] [INFO ] Deduced a trap composed of 136 places in 343 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:40] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 30 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:45] [INFO ] Deduced a trap composed of 53 places in 328 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 04:06:45] [INFO ] Deduced a trap composed of 53 places in 327 ms of which 40 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/826 variables, and 58 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 0/465 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 360/447 places, 466/599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60883 ms. Remains : 360/447 places, 466/599 transitions.
[2025-06-04 04:06:46] [INFO ] Flatten gal took : 13 ms
[2025-06-04 04:06:46] [INFO ] Flatten gal took : 13 ms
[2025-06-04 04:06:46] [INFO ] Input system was already deterministic with 466 transitions.
[2025-06-04 04:06:46] [INFO ] Flatten gal took : 13 ms
[2025-06-04 04:06:46] [INFO ] Flatten gal took : 13 ms
[2025-06-04 04:06:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11146365667063842708.gal : 4 ms
[2025-06-04 04:06:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3391092861604231955.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/CTLFireability11146365667063842708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3391092861604231955.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.08332e+14,7.68085,140580,2,13210,5,436853,6,0,1908,847506,0


Converting to forward existential form...Done !
original formula: (EX(AX((p134==1))) + (AF(AG((p386==1))) * !(A(AG(AX((p404==1))) U (p387==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(EX(!(EX(!((p134==1))))))),!(!(E(TRUE U !((p386==1))))))] = FALSE * [(((Init * !(EX(!(EX(!((p134...278
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t39, t40, t41, t44, t49...904
Detected timeout of ITS tools.
[2025-06-04 04:07:16] [INFO ] Flatten gal took : 10 ms
[2025-06-04 04:07:16] [INFO ] Applying decomposition
[2025-06-04 04:07:16] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10723013664214413147.txt' '-o' '/tmp/graph10723013664214413147.bin' '-w' '/tmp/graph10723013664214413147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10723013664214413147.bin' '-l' '-1' '-v' '-w' '/tmp/graph10723013664214413147.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:07:16] [INFO ] Decomposing Gal with order
[2025-06-04 04:07:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:07:16] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-04 04:07:16] [INFO ] Flatten gal took : 25 ms
[2025-06-04 04:07:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 8 ms.
[2025-06-04 04:07:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5165936416042327421.gal : 6 ms
[2025-06-04 04:07:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11965361858455101567.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/CTLFireability5165936416042327421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11965361858455101567.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08332e+14,2.71412,50584,1972,177,76775,2792,928,183155,113,14264,0


Converting to forward existential form...Done !
original formula: (EX(AX((i5.i0.u20.p134==1))) + (AF(AG((u86.p386==1))) * !(A(AG(AX((i9.i0.u93.p404==1))) U (u86.p387==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(EX(!(EX(!((i5.i0.u20.p134==1))))))),!(!(E(TRUE U !((u86.p386==1))))))] = FALSE * [(((Init * !(E...324
Reverse transition relation is NOT exact ! Due to transitions t198, t230, t416, t421, u86.t157, i1.i0.t359, i1.i0.t361, i1.i0.t373, i1.i0.t375, i1.i0.t377,...1875
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,17.4275,303512,1,0,594504,5893,7570,900116,612,26906,1212794
FORMULA HealthRecord-PT-17-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2025-06-04 04:07:33] [INFO ] Flatten gal took : 10 ms
[2025-06-04 04:07:33] [INFO ] Flatten gal took : 12 ms
[2025-06-04 04:07:33] [INFO ] Applying decomposition
[2025-06-04 04:07:33] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7050860304453423176.txt' '-o' '/tmp/graph7050860304453423176.bin' '-w' '/tmp/graph7050860304453423176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7050860304453423176.bin' '-l' '-1' '-v' '-w' '/tmp/graph7050860304453423176.weights' '-q' '0' '-e' '0.001'
[2025-06-04 04:07:33] [INFO ] Decomposing Gal with order
[2025-06-04 04:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:07:33] [INFO ] Removed a total of 232 redundant transitions.
[2025-06-04 04:07:33] [INFO ] Flatten gal took : 29 ms
[2025-06-04 04:07:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 4 ms.
[2025-06-04 04:07:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12860030789185486909.gal : 6 ms
[2025-06-04 04:07:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11000599506756867443.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/CTLFireability12860030789185486909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11000599506756867443.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 5 CTL formulae.
Detected timeout of ITS tools.
[2025-06-04 04:33:15] [INFO ] Applying decomposition
[2025-06-04 04:33:15] [INFO ] Flatten gal took : 18 ms
[2025-06-04 04:33:15] [INFO ] Decomposing Gal with order
[2025-06-04 04:33:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 04:33:15] [INFO ] Removed a total of 55 redundant transitions.
[2025-06-04 04:33:15] [INFO ] Flatten gal took : 31 ms
[2025-06-04 04:33:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 7 ms.
[2025-06-04 04:33:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9116799351773889517.gal : 5 ms
[2025-06-04 04:33:15] [INFO ] Time to serialize properties into /tmp/CTLFireability297714435433219910.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/CTLFireability9116799351773889517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability297714435433219910.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.19304e+14,17.2163,383300,1683,7322,468718,152154,567,2.35245e+06,714,1.2862e+06,0


Converting to forward existential form...Done !
original formula: E((A((!(EG((i0.i1.i0.u14.p388==1))) + EF(((i0.i0.i0.u4.p30==1)||(i0.i0.u6.p205==1)))) U !((!(E((i1.u17.p467==1) U (i0.i1.i0.i0.u13.p362==...411
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!(!((!(E((i1.u17.p467==1) U (i0.i1.i0.i0.u13.p362==1))) * E((i0.i0.u6.p252==1) U (i0.i0.i0.u4....799
Reverse transition relation is NOT exact ! Due to transitions t527, t531, t538, t565, i0.i0.u6.t312, i0.i0.u6.t315, i0.i0.u6.t317, i0.i0.u6.t318, i0.i0.u6....3158
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 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,0,176.772,2214304,1,0,2.22445e+06,1.67995e+06,1349,1.17177e+07,2512,9.55062e+06,98955
FORMULA HealthRecord-PT-17-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EG((AX((i0.i0.i0.u4.p82==1)) + EX((i1.u17.p509==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EX(!((i0.i0.i0.u4.p82==1)))) + EX((i1.u17.p509==1))))))] = FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

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="HealthRecord-PT-17"
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 HealthRecord-PT-17, 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 r100-smll-174867008300666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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