Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 125K 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-16-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2023-15
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-00
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-01
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-02
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-03
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-04
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-05
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-06
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-07
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-08
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-09
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-10
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749006284947

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 03:04:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 03:04:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 03:04:47] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2025-06-04 03:04:47] [INFO ] Transformed 453 places.
[2025-06-04 03:04:47] [INFO ] Transformed 594 transitions.
[2025-06-04 03:04:47] [INFO ] Found NUPN structural information;
[2025-06-04 03:04:47] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Support contains 80 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 391 transition count 520
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 391 transition count 520
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 154 place count 361 transition count 481
Iterating global reduction 0 with 30 rules applied. Total rules applied 184 place count 361 transition count 481
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 186 place count 361 transition count 479
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 199 place count 348 transition count 456
Iterating global reduction 1 with 13 rules applied. Total rules applied 212 place count 348 transition count 456
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 217 place count 343 transition count 447
Iterating global reduction 1 with 5 rules applied. Total rules applied 222 place count 343 transition count 447
Applied a total of 222 rules in 250 ms. Remains 343 /453 variables (removed 110) and now considering 447/594 (removed 147) transitions.
// Phase 1: matrix 447 rows 343 cols
[2025-06-04 03:04:48] [INFO ] Computed 14 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:04:48] [INFO ] Implicit Places using invariants in 700 ms returned []
[2025-06-04 03:04:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:04:49] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2025-06-04 03:04:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:03] [INFO ] Deduced a trap composed of 40 places in 425 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:03] [INFO ] Deduced a trap composed of 45 places in 312 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:04] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:04] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:04] [INFO ] Deduced a trap composed of 49 places in 245 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:05] [INFO ] Deduced a trap composed of 69 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:05:05] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:06] [INFO ] Deduced a trap composed of 48 places in 423 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:06] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:11] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:17] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:18] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:18] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:19] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:19] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/790 variables, and 29 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/343 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:26] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:26] [INFO ] Deduced a trap composed of 146 places in 377 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:27] [INFO ] Deduced a trap composed of 151 places in 258 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:28] [INFO ] Deduced a trap composed of 148 places in 426 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:28] [INFO ] Deduced a trap composed of 153 places in 303 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:28] [INFO ] Deduced a trap composed of 153 places in 274 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:30] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:31] [INFO ] Deduced a trap composed of 86 places in 388 ms of which 84 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:36] [INFO ] Deduced a trap composed of 84 places in 363 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:36] [INFO ] Deduced a trap composed of 66 places in 367 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:36] [INFO ] Deduced a trap composed of 85 places in 384 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:37] [INFO ] Deduced a trap composed of 66 places in 359 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:39] [INFO ] Deduced a trap composed of 44 places in 351 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:41] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:42] [INFO ] Deduced a trap composed of 44 places in 326 ms of which 55 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/790 variables, and 44 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/343 constraints, PredecessorRefiner: 0/446 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Starting structural reductions in LTL mode, iteration 1 : 343/453 places, 447/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62111 ms. Remains : 343/453 places, 447/594 transitions.
Support contains 80 out of 343 places after structural reductions.
[2025-06-04 03:05:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-04 03:05:50] [INFO ] Flatten gal took : 120 ms
[2025-06-04 03:05:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-16-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 03:05:50] [INFO ] Flatten gal took : 57 ms
[2025-06-04 03:05:50] [INFO ] Input system was already deterministic with 447 transitions.
Support contains 65 out of 343 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (210 resets) in 2715 ms. (14 steps per ms) remains 23/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
[2025-06-04 03:05:51] [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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 114/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 195/343 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 447/790 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/790 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 790/790 variables, and 357 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 114/148 variables, 8/8 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:05:54] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:54] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:54] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:54] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 4/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:05:55] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:55] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:55] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:55] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:55] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:55] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:55] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 195/343 variables, 6/25 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:05:56] [INFO ] Deduced a trap composed of 49 places in 345 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:56] [INFO ] Deduced a trap composed of 65 places in 296 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:57] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:57] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:58] [INFO ] Deduced a trap composed of 66 places in 327 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:58] [INFO ] Deduced a trap composed of 61 places in 303 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:58] [INFO ] Deduced a trap composed of 66 places in 317 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:59] [INFO ] Deduced a trap composed of 73 places in 276 ms of which 50 ms to minimize.
SMT process timed out in 7080ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 447/447 transitions.
Graph (trivial) has 326 edges and 343 vertex of which 42 / 343 are part of one of the 14 SCC in 5 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (complete) has 629 edges and 315 vertex of which 307 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 307 transition count 292
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 120 rules applied. Total rules applied 231 place count 198 transition count 281
Reduce places removed 5 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 244 place count 193 transition count 273
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 254 place count 185 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 184 transition count 271
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 255 place count 184 transition count 266
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 265 place count 179 transition count 266
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 272 place count 172 transition count 253
Iterating global reduction 5 with 7 rules applied. Total rules applied 279 place count 172 transition count 253
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 1 rules applied. Total rules applied 280 place count 172 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 281 place count 171 transition count 252
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 284 place count 168 transition count 247
Iterating global reduction 7 with 3 rules applied. Total rules applied 287 place count 168 transition count 247
Performed 44 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 375 place count 124 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 376 place count 124 transition count 200
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 378 place count 122 transition count 196
Iterating global reduction 8 with 2 rules applied. Total rules applied 380 place count 122 transition count 196
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 381 place count 121 transition count 194
Iterating global reduction 8 with 1 rules applied. Total rules applied 382 place count 121 transition count 194
Performed 11 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 404 place count 110 transition count 264
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 414 place count 110 transition count 254
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 415 place count 109 transition count 252
Iterating global reduction 9 with 1 rules applied. Total rules applied 416 place count 109 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 420 place count 109 transition count 248
Free-agglomeration rule applied 12 times.
Iterating global reduction 9 with 12 rules applied. Total rules applied 432 place count 109 transition count 236
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 444 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 450 place count 97 transition count 230
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 451 place count 97 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 452 place count 96 transition count 230
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 453 place count 96 transition count 230
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 456 place count 96 transition count 230
Applied a total of 456 rules in 250 ms. Remains 96 /343 variables (removed 247) and now considering 230/447 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 96/343 places, 230/447 transitions.
RANDOM walk for 40000 steps (8 resets) in 711 ms. (56 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 65 ms. (60 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 58 ms. (67 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 79 ms. (50 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 61 ms. (64 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 67 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 550611 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :5 out of 20
Probabilistic random walk after 550611 steps, saw 89341 distinct states, run finished after 3008 ms. (steps per millisecond=183 ) properties seen :5
[2025-06-04 03:06:02] [INFO ] Flow matrix only has 227 transitions (discarded 3 similar events)
// Phase 1: matrix 227 rows 96 cols
[2025-06-04 03:06:02] [INFO ] Computed 7 invariants in 3 ms
[2025-06-04 03:06:02] [INFO ] State equation strengthened by 26 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 71/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 227/323 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 26/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 129 constraints, problems are : Problem set: 0 solved, 15 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 71/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:03] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 227/323 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 26/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 15/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:06] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 12 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/323 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/323 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 153 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4505 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5287ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 14 properties in 1349 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 230/230 transitions.
Graph (trivial) has 90 edges and 96 vertex of which 6 / 96 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 296 edges and 93 vertex of which 81 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 81 transition count 171
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 62 place count 71 transition count 171
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 62 place count 71 transition count 164
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 76 place count 64 transition count 164
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 55 transition count 147
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 55 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 54 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 54 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 54 transition count 143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 110 place count 48 transition count 137
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 122 place count 48 transition count 125
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 45 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 45 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 44 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 44 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 43 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 43 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 43 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
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 142 place count 39 transition count 129
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 154 place count 39 transition count 117
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 155 place count 38 transition count 113
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 38 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 158 place count 38 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 166 place count 38 transition count 103
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 167 place count 37 transition count 101
Iterating global reduction 7 with 1 rules applied. Total rules applied 168 place count 37 transition count 101
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 172 place count 37 transition count 97
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 178 place count 33 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 180 place count 33 transition count 93
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 181 place count 33 transition count 93
Applied a total of 181 rules in 47 ms. Remains 33 /96 variables (removed 63) and now considering 93/230 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 33/96 places, 93/230 transitions.
RANDOM walk for 40000 steps (5095 resets) in 899 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (605 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1664 steps, run visited all 1 properties in 13 ms. (steps per millisecond=128 )
Probabilistic random walk after 1664 steps, saw 600 distinct states, run finished after 21 ms. (steps per millisecond=79 ) properties seen :1
[2025-06-04 03:06:09] [INFO ] Flatten gal took : 24 ms
[2025-06-04 03:06:09] [INFO ] Flatten gal took : 24 ms
[2025-06-04 03:06:10] [INFO ] Input system was already deterministic with 447 transitions.
Computed a total of 100 stabilizing places and 110 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Graph (trivial) has 391 edges and 343 vertex of which 48 / 343 are part of one of the 17 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 311 transition count 275
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 156 rules applied. Total rules applied 294 place count 174 transition count 256
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 303 place count 165 transition count 256
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 303 place count 165 transition count 251
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 313 place count 160 transition count 251
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 339 place count 134 transition count 206
Iterating global reduction 3 with 26 rules applied. Total rules applied 365 place count 134 transition count 206
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 369 place count 134 transition count 202
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 373 place count 130 transition count 202
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 384 place count 119 transition count 182
Iterating global reduction 5 with 11 rules applied. Total rules applied 395 place count 119 transition count 182
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 1 rules applied. Total rules applied 396 place count 119 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 397 place count 118 transition count 181
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 400 place count 115 transition count 177
Iterating global reduction 7 with 3 rules applied. Total rules applied 403 place count 115 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 405 place count 115 transition count 175
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 406 place count 114 transition count 173
Iterating global reduction 8 with 1 rules applied. Total rules applied 407 place count 114 transition count 173
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 408 place count 113 transition count 172
Iterating global reduction 8 with 1 rules applied. Total rules applied 409 place count 113 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 410 place count 113 transition count 171
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 440 place count 98 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 444 place count 98 transition count 152
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 450 place count 92 transition count 140
Iterating global reduction 10 with 6 rules applied. Total rules applied 456 place count 92 transition count 140
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 460 place count 88 transition count 136
Iterating global reduction 10 with 4 rules applied. Total rules applied 464 place count 88 transition count 136
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 467 place count 85 transition count 130
Iterating global reduction 10 with 3 rules applied. Total rules applied 470 place count 85 transition count 130
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 473 place count 82 transition count 124
Iterating global reduction 10 with 3 rules applied. Total rules applied 476 place count 82 transition count 124
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 479 place count 79 transition count 118
Iterating global reduction 10 with 3 rules applied. Total rules applied 482 place count 79 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 484 place count 79 transition count 116
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 486 place count 79 transition count 114
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 487 place count 79 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 488 place count 78 transition count 113
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 489 place count 77 transition count 111
Iterating global reduction 13 with 1 rules applied. Total rules applied 490 place count 77 transition count 111
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 491 place count 76 transition count 109
Iterating global reduction 13 with 1 rules applied. Total rules applied 492 place count 76 transition count 109
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 493 place count 75 transition count 108
Iterating global reduction 13 with 1 rules applied. Total rules applied 494 place count 75 transition count 108
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 496 place count 74 transition count 107
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 497 place count 73 transition count 106
Iterating global reduction 13 with 1 rules applied. Total rules applied 498 place count 73 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 500 place count 73 transition count 104
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 501 place count 73 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 502 place count 72 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 503 place count 71 transition count 102
Applied a total of 503 rules in 88 ms. Remains 71 /343 variables (removed 272) and now considering 102/447 (removed 345) transitions.
[2025-06-04 03:06:10] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
// Phase 1: matrix 94 rows 71 cols
[2025-06-04 03:06:10] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:06:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-04 03:06:10] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2025-06-04 03:06:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:06:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:06:10] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:06:10] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-04 03:06:10] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2025-06-04 03:06:10] [INFO ] Invariant cache hit.
[2025-06-04 03:06:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 7/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:11] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:11] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:11] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 93/164 variables, 71/81 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:12] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/165 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/165 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 83 constraints, problems are : Problem set: 0 solved, 88 unsolved in 7221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 7/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:18] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:18] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 93/164 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 88/172 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/165 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 173 constraints, problems are : Problem set: 0 solved, 88 unsolved in 8591 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15832ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 15834ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/343 places, 102/447 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16095 ms. Remains : 71/343 places, 102/447 transitions.
[2025-06-04 03:06:26] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:06:26] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:06:26] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 86 steps (2 resets) in 7 ms. (10 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-16-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 03:06:26] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:06:26] [INFO ] Flatten gal took : 9 ms
[2025-06-04 03:06:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality758142786181764745.gal : 4 ms
[2025-06-04 03:06:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13655512802065538021.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/ReachabilityCardinality758142786181764745.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13655512802065538021.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Graph (trivial) has 376 edges and 343 vertex of which 47 / 343 are part of one of the 17 SCC in 2 ms
Free SCC test removed 30 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 313 transition count 281
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 153 rules applied. Total rules applied 288 place count 179 transition count 262
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 298 place count 170 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 299 place count 169 transition count 261
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 299 place count 169 transition count 256
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 309 place count 164 transition count 256
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 333 place count 140 transition count 215
Iterating global reduction 4 with 24 rules applied. Total rules applied 357 place count 140 transition count 215
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 4 with 3 rules applied. Total rules applied 360 place count 140 transition count 212
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 363 place count 137 transition count 212
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 372 place count 128 transition count 196
Iterating global reduction 6 with 9 rules applied. Total rules applied 381 place count 128 transition count 196
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 382 place count 127 transition count 195
Iterating global reduction 6 with 1 rules applied. Total rules applied 383 place count 127 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 384 place count 127 transition count 194
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 418 place count 110 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 421 place count 110 transition count 174
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 428 place count 103 transition count 160
Iterating global reduction 8 with 7 rules applied. Total rules applied 435 place count 103 transition count 160
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 440 place count 98 transition count 154
Iterating global reduction 8 with 5 rules applied. Total rules applied 445 place count 98 transition count 154
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 447 place count 96 transition count 151
Iterating global reduction 8 with 2 rules applied. Total rules applied 449 place count 96 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 450 place count 96 transition count 150
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 451 place count 95 transition count 148
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 95 transition count 148
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 453 place count 94 transition count 146
Iterating global reduction 9 with 1 rules applied. Total rules applied 454 place count 94 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 457 place count 94 transition count 143
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 458 place count 94 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 459 place count 93 transition count 142
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 460 place count 92 transition count 140
Iterating global reduction 11 with 1 rules applied. Total rules applied 461 place count 92 transition count 140
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 462 place count 91 transition count 138
Iterating global reduction 11 with 1 rules applied. Total rules applied 463 place count 91 transition count 138
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 464 place count 90 transition count 137
Iterating global reduction 11 with 1 rules applied. Total rules applied 465 place count 90 transition count 137
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 466 place count 90 transition count 136
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 470 place count 90 transition count 136
Applied a total of 470 rules in 97 ms. Remains 90 /343 variables (removed 253) and now considering 136/447 (removed 311) transitions.
[2025-06-04 03:06:26] [INFO ] Flow matrix only has 128 transitions (discarded 8 similar events)
// Phase 1: matrix 128 rows 90 cols
[2025-06-04 03:06:26] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:06:26] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-04 03:06:26] [INFO ] Flow matrix only has 128 transitions (discarded 8 similar events)
[2025-06-04 03:06:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:06:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 03:06:26] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:06:26] [INFO ] Redundant transitions in 8 ms returned []
Running 135 sub problems to find dead transitions.
[2025-06-04 03:06:26] [INFO ] Flow matrix only has 128 transitions (discarded 8 similar events)
[2025-06-04 03:06:26] [INFO ] Invariant cache hit.
[2025-06-04 03:06:26] [INFO ] State equation strengthened by 2 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, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:28] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:28] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:28] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:29] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 127/217 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 1/218 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/218 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 103 constraints, problems are : Problem set: 0 solved, 135 unsolved in 12966 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
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, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:40] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:40] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 127/217 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 135/239 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 1/218 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 240 constraints, problems are : Problem set: 0 solved, 135 unsolved in 20555 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33565ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 33567ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/343 places, 136/447 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33982 ms. Remains : 90/343 places, 136/447 transitions.
[2025-06-04 03:07:00] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:07:00] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:07:00] [INFO ] Input system was already deterministic with 136 transitions.
[2025-06-04 03:07:00] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:07:00] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:07:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1776498333511872475.gal : 5 ms
[2025-06-04 03:07:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality4230783042165707911.ctl : 9 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/CTLCardinality1776498333511872475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4230783042165707911.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,7.02464e+07,0.317509,11492,2,1571,5,33240,6,0,487,35227,0


Converting to forward existential form...Done !
original formula: E(AF((!(AG(((p122==1)&&(p4==0)))) * E(!(((p183==0)||(p338==1))) U EG(((p13==0)||(p59==1)))))) U ((p391==1) * EF(!(AF((p285==1))))))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,!(EG(!((!(!(E(TRUE U !(((p122==1)&&(p4==0)))))) * E(!(((p183==0)||(p338==1))) U EG(((p13==...218
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t7, t8, t10, t12, t13, t16, t17, t20, t21, t26, t28, t96, t122, t124, t126, t129,...286
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 133/0/3
(forward)formula 0,1,9.0904,231664,1,0,677,1.27866e+06,318,385,3559,1.39994e+06,796
FORMULA HealthRecord-PT-16-CTLCardinality-2025-01 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 : 343/343 places, 447/447 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 314 transition count 411
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 314 transition count 411
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 301 transition count 390
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 301 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 301 transition count 387
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 295 transition count 377
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 295 transition count 377
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 290 transition count 368
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 290 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 287 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 287 transition count 364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 284 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 284 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 284 transition count 359
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 283 transition count 357
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 283 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 283 transition count 356
Applied a total of 125 rules in 66 ms. Remains 283 /343 variables (removed 60) and now considering 356/447 (removed 91) transitions.
// Phase 1: matrix 356 rows 283 cols
[2025-06-04 03:07:09] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:07:09] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-04 03:07:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:07:10] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2025-06-04 03:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:20] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:20] [INFO ] Deduced a trap composed of 134 places in 282 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:21] [INFO ] Deduced a trap composed of 107 places in 274 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:21] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:22] [INFO ] Deduced a trap composed of 136 places in 287 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:22] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:23] [INFO ] Deduced a trap composed of 45 places in 290 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:23] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:23] [INFO ] Deduced a trap composed of 133 places in 256 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:24] [INFO ] Deduced a trap composed of 135 places in 260 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:24] [INFO ] Deduced a trap composed of 70 places in 279 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:25] [INFO ] Deduced a trap composed of 133 places in 244 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:32] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:37] [INFO ] Deduced a trap composed of 113 places in 278 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:37] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:38] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/639 variables, and 30 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:46] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:46] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:47] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:47] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:48] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:49] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:49] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:50] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (OVERLAPS) 356/639 variables, 283/321 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 355/676 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:01] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:01] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:02] [INFO ] Deduced a trap composed of 53 places in 231 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:02] [INFO ] Deduced a trap composed of 72 places in 255 ms of which 31 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 4/680 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 680 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 283/343 places, 356/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60865 ms. Remains : 283/343 places, 356/447 transitions.
[2025-06-04 03:08:10] [INFO ] Flatten gal took : 23 ms
[2025-06-04 03:08:10] [INFO ] Flatten gal took : 14 ms
[2025-06-04 03:08:10] [INFO ] Input system was already deterministic with 356 transitions.
[2025-06-04 03:08:10] [INFO ] Flatten gal took : 13 ms
[2025-06-04 03:08:10] [INFO ] Flatten gal took : 14 ms
[2025-06-04 03:08:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality2247005080723168862.gal : 7 ms
[2025-06-04 03:08:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality4653672771891714588.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/CTLCardinality2247005080723168862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4653672771891714588.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.44695e+11,3.29186,71644,2,9342,5,208164,6,0,1490,440851,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(AX((p69==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(!(EX(!((p69==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...638
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-04 03:08:40] [INFO ] Flatten gal took : 22 ms
[2025-06-04 03:08:40] [INFO ] Applying decomposition
[2025-06-04 03:08:40] [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/graph30169662487394900.txt' '-o' '/tmp/graph30169662487394900.bin' '-w' '/tmp/graph30169662487394900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph30169662487394900.bin' '-l' '-1' '-v' '-w' '/tmp/graph30169662487394900.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:08:40] [INFO ] Decomposing Gal with order
[2025-06-04 03:08:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:08:40] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-04 03:08:41] [INFO ] Flatten gal took : 88 ms
[2025-06-04 03:08:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 20 ms.
[2025-06-04 03:08:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality5330007545476266926.gal : 11 ms
[2025-06-04 03:08:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9485503729571149631.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/CTLCardinality5330007545476266926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9485503729571149631.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.44695e+11,1.11901,28080,1247,93,37384,3110,709,94738,118,12299,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(AX((i2.i1.u7.p69==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(!(EX(!((i2.i1.u7.p69==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t229, t321, i2.i0.u9.t267, i2.i0.u9.t269, i2.i0.u9.t270, i2.i0.u9.t276, i2.i0.u9.t277, i2.i0....1256
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
(forward)formula 0,0,2.87763,60208,1,0,96768,3110,5120,174376,618,12299,343731
FORMULA HealthRecord-PT-16-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 316 transition count 413
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 316 transition count 413
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 305 transition count 395
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 305 transition count 395
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 305 transition count 393
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 299 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 299 transition count 383
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 294 transition count 374
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 294 transition count 374
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 291 transition count 370
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 291 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 288 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 288 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 113 place count 288 transition count 365
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 287 transition count 363
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 287 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 287 transition count 362
Applied a total of 116 rules in 41 ms. Remains 287 /343 variables (removed 56) and now considering 362/447 (removed 85) transitions.
// Phase 1: matrix 362 rows 287 cols
[2025-06-04 03:08:44] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:08:44] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-04 03:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:08:44] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2025-06-04 03:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:53] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:53] [INFO ] Deduced a trap composed of 134 places in 252 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:54] [INFO ] Deduced a trap composed of 107 places in 250 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:54] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:54] [INFO ] Deduced a trap composed of 136 places in 256 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:55] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:55] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:55] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:56] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:56] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:56] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:57] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:57] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:57] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:58] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:58] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:58] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:59] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:59] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:08:59] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:03] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:05] [INFO ] Deduced a trap composed of 135 places in 261 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:07] [INFO ] Deduced a trap composed of 135 places in 221 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:08] [INFO ] Deduced a trap composed of 59 places in 259 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:10] [INFO ] Deduced a trap composed of 72 places in 294 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:11] [INFO ] Deduced a trap composed of 68 places in 242 ms of which 34 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/649 variables, and 40 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/287 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:22] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 362/649 variables, 287/328 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 361/689 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:35] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:36] [INFO ] Deduced a trap composed of 76 places in 235 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 691 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 287/343 places, 362/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60631 ms. Remains : 287/343 places, 362/447 transitions.
[2025-06-04 03:09:44] [INFO ] Flatten gal took : 13 ms
[2025-06-04 03:09:44] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:09:44] [INFO ] Input system was already deterministic with 362 transitions.
[2025-06-04 03:09:44] [INFO ] Flatten gal took : 24 ms
[2025-06-04 03:09:44] [INFO ] Flatten gal took : 16 ms
[2025-06-04 03:09:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1262964842982380986.gal : 4 ms
[2025-06-04 03:09:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality13642106908880634219.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/CTLCardinality1262964842982380986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13642106908880634219.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.61393e+11,3.46052,73740,2,9814,5,212854,6,0,1512,451555,0


Converting to forward existential form...Done !
original formula: EX((((p425==0)&&(p104==0)) * (AG(AF(((p424==0)||(p98==1)))) + AX(AF((p451==1))))))
=> equivalent forward existential formula: ([((EY(Init) * ((p425==0)&&(p104==0))) * !(E(TRUE U !(!(EG(!(((p424==0)||(p98==1)))))))))] != FALSE + [((EY(Init...226
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t32, t33, t34, t36, t37, t38, t39, t42, t43...642
Detected timeout of ITS tools.
[2025-06-04 03:10:14] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:10:14] [INFO ] Applying decomposition
[2025-06-04 03:10:14] [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/graph8377568431520012611.txt' '-o' '/tmp/graph8377568431520012611.bin' '-w' '/tmp/graph8377568431520012611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8377568431520012611.bin' '-l' '-1' '-v' '-w' '/tmp/graph8377568431520012611.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:10:14] [INFO ] Decomposing Gal with order
[2025-06-04 03:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:10:14] [INFO ] Removed a total of 108 redundant transitions.
[2025-06-04 03:10:14] [INFO ] Flatten gal took : 28 ms
[2025-06-04 03:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 8 ms.
[2025-06-04 03:10:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3487101665616147250.gal : 6 ms
[2025-06-04 03:10:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality13328737567118385852.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/CTLCardinality3487101665616147250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13328737567118385852.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.61393e+11,0.699271,17140,966,58,23895,936,745,47119,99,2368,0


Converting to forward existential form...Done !
original formula: EX((((i19.i2.u101.p425==0)&&(i7.i0.u17.p104==0)) * (AG(AF(((i19.i2.u101.p424==0)||(i17.i1.u14.p98==1)))) + AX(AF((i16.i2.u110.p451==1))))...157
=> equivalent forward existential formula: ([((EY(Init) * ((i19.i2.u101.p425==0)&&(i7.i0.u17.p104==0))) * !(E(TRUE U !(!(EG(!(((i19.i2.u101.p424==0)||(i17....305
Reverse transition relation is NOT exact ! Due to transitions t235, i1.i1.t300, i1.i1.u3.t273, i1.i1.u3.t275, i1.i1.u3.t276, i1.i1.u3.t282, i1.i1.u3.t283, ...1260
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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 a local SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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
(forward)formula 0,0,3.48472,78324,1,0,134772,1721,5304,302701,530,4041,311079
FORMULA HealthRecord-PT-16-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 316 transition count 413
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 316 transition count 413
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 66 place count 304 transition count 393
Iterating global reduction 0 with 12 rules applied. Total rules applied 78 place count 304 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 304 transition count 391
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 298 transition count 381
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 298 transition count 381
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 293 transition count 372
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 293 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 290 transition count 368
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 290 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 287 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 287 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 287 transition count 363
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 286 transition count 361
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 286 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 286 transition count 360
Applied a total of 118 rules in 41 ms. Remains 286 /343 variables (removed 57) and now considering 360/447 (removed 87) transitions.
// Phase 1: matrix 360 rows 286 cols
[2025-06-04 03:10:18] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:10:18] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-04 03:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:10:18] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2025-06-04 03:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:25] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:26] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:26] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:26] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:27] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:27] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:27] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:28] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:28] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:28] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:28] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:29] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:29] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:29] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:30] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:30] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:30] [INFO ] Deduced a trap composed of 60 places in 247 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:31] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:31] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:35] [INFO ] Deduced a trap composed of 134 places in 210 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:35] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:36] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:36] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:36] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:40] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:40] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:41] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:41] [INFO ] Deduced a trap composed of 135 places in 207 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:41] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:42] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:42] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:43] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/646 variables, and 46 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/286 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:53] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (OVERLAPS) 360/646 variables, 286/333 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 359/692 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:08] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:08] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:09] [INFO ] Deduced a trap composed of 111 places in 279 ms of which 63 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 695 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 286/343 places, 360/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60519 ms. Remains : 286/343 places, 360/447 transitions.
[2025-06-04 03:11:19] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:11:19] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:11:19] [INFO ] Input system was already deterministic with 360 transitions.
[2025-06-04 03:11:19] [INFO ] Flatten gal took : 22 ms
[2025-06-04 03:11:19] [INFO ] Flatten gal took : 13 ms
[2025-06-04 03:11:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality1975433055320316214.gal : 5 ms
[2025-06-04 03:11:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17429928772972338540.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/CTLCardinality1975433055320316214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17429928772972338540.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.55409e+11,3.26826,73024,2,9528,5,209895,6,0,1506,446081,0


Converting to forward existential form...Done !
original formula: A(!((AF(AX((p120==1))) + EG(((p406==0)||(p104==1))))) U !(EG(EX((p249!=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(EX((p249!=1)))))))) * !(E(!(!(EG(EX((p249!=1))))) U (!(!((!(EG(!(!(EX(!((p120==1))))))) + ...224
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...644
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-04 03:11:49] [INFO ] Flatten gal took : 15 ms
[2025-06-04 03:11:49] [INFO ] Applying decomposition
[2025-06-04 03:11:49] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2419804842335514295.txt' '-o' '/tmp/graph2419804842335514295.bin' '-w' '/tmp/graph2419804842335514295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2419804842335514295.bin' '-l' '-1' '-v' '-w' '/tmp/graph2419804842335514295.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:11:49] [INFO ] Decomposing Gal with order
[2025-06-04 03:11:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:11:49] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-04 03:11:49] [INFO ] Flatten gal took : 38 ms
[2025-06-04 03:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 9 ms.
[2025-06-04 03:11:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13472159699272954624.gal : 8 ms
[2025-06-04 03:11:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1390936026090291316.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/CTLCardinality13472159699272954624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1390936026090291316.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.55409e+11,0.82359,18424,1034,74,25188,1859,703,52308,121,4711,0


Converting to forward existential form...Done !
original formula: A(!((AF(AX((i4.u21.p120==1))) + EG(((i19.u97.p406==0)||(i5.u16.p104==1))))) U !(EG(EX((u65.p249!=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(EX((u65.p249!=1)))))))) * !(E(!(!(EG(EX((u65.p249!=1))))) U (!(!((!(EG(!(!(EX(!((i4.u21.p1...258
Reverse transition relation is NOT exact ! Due to transitions t198, t325, u65.t127, i2.i0.u9.t271, i2.i0.u9.t273, i2.i0.u9.t274, i2.i0.u9.t280, i2.i0.u9.t2...1203
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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 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 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,6.93945,154744,1,0,260382,3782,5083,553080,656,8377,471370
FORMULA HealthRecord-PT-16-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Graph (trivial) has 380 edges and 343 vertex of which 46 / 343 are part of one of the 16 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 138 place count 312 transition count 276
Reduce places removed 137 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 154 rules applied. Total rules applied 292 place count 175 transition count 259
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 301 place count 167 transition count 258
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 304 place count 166 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 305 place count 165 transition count 256
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 305 place count 165 transition count 251
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 315 place count 160 transition count 251
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 339 place count 136 transition count 210
Iterating global reduction 5 with 24 rules applied. Total rules applied 363 place count 136 transition count 210
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 5 with 3 rules applied. Total rules applied 366 place count 136 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 369 place count 133 transition count 207
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 376 place count 126 transition count 193
Iterating global reduction 7 with 7 rules applied. Total rules applied 383 place count 126 transition count 193
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 385 place count 124 transition count 191
Iterating global reduction 7 with 2 rules applied. Total rules applied 387 place count 124 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 389 place count 124 transition count 189
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 423 place count 107 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 427 place count 107 transition count 168
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 435 place count 99 transition count 152
Iterating global reduction 9 with 8 rules applied. Total rules applied 443 place count 99 transition count 152
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 448 place count 94 transition count 146
Iterating global reduction 9 with 5 rules applied. Total rules applied 453 place count 94 transition count 146
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 457 place count 90 transition count 139
Iterating global reduction 9 with 4 rules applied. Total rules applied 461 place count 90 transition count 139
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 464 place count 87 transition count 133
Iterating global reduction 9 with 3 rules applied. Total rules applied 467 place count 87 transition count 133
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 468 place count 86 transition count 131
Iterating global reduction 9 with 1 rules applied. Total rules applied 469 place count 86 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 471 place count 86 transition count 129
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 472 place count 86 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 473 place count 85 transition count 128
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 474 place count 84 transition count 126
Iterating global reduction 11 with 1 rules applied. Total rules applied 475 place count 84 transition count 126
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 476 place count 83 transition count 124
Iterating global reduction 11 with 1 rules applied. Total rules applied 477 place count 83 transition count 124
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 478 place count 82 transition count 123
Iterating global reduction 11 with 1 rules applied. Total rules applied 479 place count 82 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 481 place count 81 transition count 122
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 482 place count 80 transition count 121
Iterating global reduction 11 with 1 rules applied. Total rules applied 483 place count 80 transition count 121
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 485 place count 80 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 485 place count 80 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 487 place count 79 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 488 place count 79 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 489 place count 78 transition count 117
Applied a total of 489 rules in 61 ms. Remains 78 /343 variables (removed 265) and now considering 117/447 (removed 330) transitions.
[2025-06-04 03:11:56] [INFO ] Flow matrix only has 109 transitions (discarded 8 similar events)
// Phase 1: matrix 109 rows 78 cols
[2025-06-04 03:11:56] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:11:56] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 03:11:56] [INFO ] Flow matrix only has 109 transitions (discarded 8 similar events)
[2025-06-04 03:11:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:11:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:11:56] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:11:56] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2025-06-04 03:11:56] [INFO ] Flow matrix only has 109 transitions (discarded 8 similar events)
[2025-06-04 03:11:56] [INFO ] Invariant cache hit.
[2025-06-04 03:11:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 2/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:57] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:57] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:57] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:58] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 5/78 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:59] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 108/186 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 1/187 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 92 constraints, problems are : Problem set: 0 solved, 103 unsolved in 8390 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 5/78 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 108/186 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 103/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:08] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 1/187 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 196 constraints, problems are : Problem set: 0 solved, 103 unsolved in 9860 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18263ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 18263ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/343 places, 117/447 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18542 ms. Remains : 78/343 places, 117/447 transitions.
[2025-06-04 03:12:14] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:12:14] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:12:14] [INFO ] Input system was already deterministic with 117 transitions.
[2025-06-04 03:12:14] [INFO ] Flatten gal took : 3 ms
[2025-06-04 03:12:14] [INFO ] Flatten gal took : 3 ms
[2025-06-04 03:12:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality999107940278960948.gal : 1 ms
[2025-06-04 03:12:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality3625746614655146380.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/CTLCardinality999107940278960948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3625746614655146380.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.61274e+07,0.228486,7944,2,854,5,18207,6,0,423,19288,0


Converting to forward existential form...Done !
original formula: (EG((p178==0)) * (A(EF(!(EF(((p261==0)||(p308==1))))) U ((p417==0)||(p195==1))) + EG(AF(((p76==0)||(p144==1))))))
=> equivalent forward existential formula: ([(((Init * EG((p178==0))) * !(EG(!(((p417==0)||(p195==1)))))) * !(E(!(((p417==0)||(p195==1))) U (!(E(TRUE U !(E...306
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t14, t15, t41, t81, t105, t107, t111, t112, Intersection w...240
(forward)formula 0,1,2.88007,69396,1,0,370,429559,259,193,2770,339903,499
FORMULA HealthRecord-PT-16-CTLCardinality-2025-06 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 : 343/343 places, 447/447 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 315 transition count 412
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 315 transition count 412
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 302 transition count 391
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 302 transition count 391
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 85 place count 302 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 91 place count 296 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 97 place count 296 transition count 378
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 292 transition count 371
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 292 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 290 transition count 368
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 290 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 288 transition count 365
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 288 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 287 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 287 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 116 place count 287 transition count 362
Applied a total of 116 rules in 40 ms. Remains 287 /343 variables (removed 56) and now considering 362/447 (removed 85) transitions.
// Phase 1: matrix 362 rows 287 cols
[2025-06-04 03:12:17] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:12:17] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-04 03:12:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:12:18] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2025-06-04 03:12:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:27] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:27] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:27] [INFO ] Deduced a trap composed of 107 places in 233 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:27] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:28] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:28] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:28] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:29] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:29] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:32] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:35] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:36] [INFO ] Deduced a trap composed of 113 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:36] [INFO ] Deduced a trap composed of 140 places in 274 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:37] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:41] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:41] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:41] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:41] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:42] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:42] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:42] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:43] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:43] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/649 variables, and 37 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/287 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/649 variables, 287/324 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 361/685 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:08] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 686 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 287/343 places, 362/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60529 ms. Remains : 287/343 places, 362/447 transitions.
[2025-06-04 03:13:18] [INFO ] Flatten gal took : 13 ms
[2025-06-04 03:13:18] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:13:18] [INFO ] Input system was already deterministic with 362 transitions.
[2025-06-04 03:13:18] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:13:18] [INFO ] Flatten gal took : 13 ms
[2025-06-04 03:13:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2486904007389445074.gal : 5 ms
[2025-06-04 03:13:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17819559745064811567.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/CTLCardinality2486904007389445074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17819559745064811567.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.6749e+11,3.60212,71828,2,9386,5,208385,6,0,1512,441349,0


Converting to forward existential form...Done !
original formula: AF((AF(AX(FALSE)) + EX(((p195==0)&&(p29==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(!(EX(!(FALSE)))))) + EX(((p195==0)&&(p29==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...638
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-04 03:13:48] [INFO ] Flatten gal took : 8 ms
[2025-06-04 03:13:48] [INFO ] Applying decomposition
[2025-06-04 03:13:48] [INFO ] Flatten gal took : 23 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/graph4222619453460391500.txt' '-o' '/tmp/graph4222619453460391500.bin' '-w' '/tmp/graph4222619453460391500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4222619453460391500.bin' '-l' '-1' '-v' '-w' '/tmp/graph4222619453460391500.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:13:48] [INFO ] Decomposing Gal with order
[2025-06-04 03:13:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:13:48] [INFO ] Removed a total of 112 redundant transitions.
[2025-06-04 03:13:48] [INFO ] Flatten gal took : 22 ms
[2025-06-04 03:13:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2025-06-04 03:13:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17337721492130376280.gal : 5 ms
[2025-06-04 03:13:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3313915963148563626.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/CTLCardinality17337721492130376280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3313915963148563626.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.6749e+11,0.680402,20916,999,36,28787,470,707,73007,75,1530,0


Converting to forward existential form...Done !
original formula: AF((AF(AX(FALSE)) + EX(((i10.i3.u52.p195==0)&&(i1.i0.u8.p29==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(!(EX(!(FALSE)))))) + EX(((i10.i3.u52.p195==0)&&(i1.i0.u8.p29==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t131, t197, t229, t327, i1.i0.t267, i1.i0.t269, i1.i0.t281, i1.i0.t283, i1.i0.t285, i1.i0.t30...1166
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 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
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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Graph (trivial) has 387 edges and 343 vertex of which 48 / 343 are part of one of the 17 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 311 transition count 277
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 154 rules applied. Total rules applied 290 place count 176 transition count 258
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 301 place count 167 transition count 256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 303 place count 165 transition count 256
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 303 place count 165 transition count 251
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 313 place count 160 transition count 251
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 339 place count 134 transition count 206
Iterating global reduction 4 with 26 rules applied. Total rules applied 365 place count 134 transition count 206
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 369 place count 134 transition count 202
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 373 place count 130 transition count 202
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 384 place count 119 transition count 182
Iterating global reduction 6 with 11 rules applied. Total rules applied 395 place count 119 transition count 182
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 396 place count 119 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 397 place count 118 transition count 181
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 400 place count 115 transition count 177
Iterating global reduction 8 with 3 rules applied. Total rules applied 403 place count 115 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 405 place count 115 transition count 175
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 406 place count 114 transition count 173
Iterating global reduction 9 with 1 rules applied. Total rules applied 407 place count 114 transition count 173
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 408 place count 113 transition count 172
Iterating global reduction 9 with 1 rules applied. Total rules applied 409 place count 113 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 410 place count 113 transition count 171
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 440 place count 98 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 444 place count 98 transition count 152
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 450 place count 92 transition count 140
Iterating global reduction 11 with 6 rules applied. Total rules applied 456 place count 92 transition count 140
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 461 place count 87 transition count 135
Iterating global reduction 11 with 5 rules applied. Total rules applied 466 place count 87 transition count 135
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 469 place count 84 transition count 129
Iterating global reduction 11 with 3 rules applied. Total rules applied 472 place count 84 transition count 129
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 475 place count 81 transition count 123
Iterating global reduction 11 with 3 rules applied. Total rules applied 478 place count 81 transition count 123
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 480 place count 79 transition count 119
Iterating global reduction 11 with 2 rules applied. Total rules applied 482 place count 79 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 483 place count 79 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 485 place count 79 transition count 116
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 486 place count 79 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 487 place count 78 transition count 115
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 488 place count 77 transition count 113
Iterating global reduction 14 with 1 rules applied. Total rules applied 489 place count 77 transition count 113
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 490 place count 76 transition count 111
Iterating global reduction 14 with 1 rules applied. Total rules applied 491 place count 76 transition count 111
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 492 place count 75 transition count 110
Iterating global reduction 14 with 1 rules applied. Total rules applied 493 place count 75 transition count 110
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 495 place count 74 transition count 109
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 496 place count 73 transition count 108
Iterating global reduction 14 with 1 rules applied. Total rules applied 497 place count 73 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 499 place count 73 transition count 106
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 14 with 1 rules applied. Total rules applied 500 place count 73 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 501 place count 72 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 502 place count 71 transition count 104
Applied a total of 502 rules in 93 ms. Remains 71 /343 variables (removed 272) and now considering 104/447 (removed 343) transitions.
[2025-06-04 03:14:18] [INFO ] Flow matrix only has 96 transitions (discarded 8 similar events)
// Phase 1: matrix 96 rows 71 cols
[2025-06-04 03:14:18] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:14:18] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-04 03:14:18] [INFO ] Flow matrix only has 96 transitions (discarded 8 similar events)
[2025-06-04 03:14:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:14:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:14:19] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:14:19] [INFO ] Redundant transitions in 2 ms returned []
Running 90 sub problems to find dead transitions.
[2025-06-04 03:14:19] [INFO ] Flow matrix only has 96 transitions (discarded 8 similar events)
[2025-06-04 03:14:19] [INFO ] Invariant cache hit.
[2025-06-04 03:14:19] [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/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 7/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:19] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:19] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 95/166 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/167 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 81 constraints, problems are : Problem set: 0 solved, 90 unsolved in 7263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 7/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:27] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:27] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 95/166 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 90/172 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 1/167 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 173 constraints, problems are : Problem set: 0 solved, 90 unsolved in 8992 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16265ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 16266ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/343 places, 104/447 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16589 ms. Remains : 71/343 places, 104/447 transitions.
[2025-06-04 03:14:35] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:14:35] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:14:35] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-04 03:14:35] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:14:35] [INFO ] Flatten gal took : 3 ms
[2025-06-04 03:14:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality1709163682126910557.gal : 1 ms
[2025-06-04 03:14:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2949896389286310351.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/CTLCardinality1709163682126910557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2949896389286310351.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.65888e+07,0.076894,5332,2,528,5,7390,6,0,380,5935,0


Converting to forward existential form...Done !
original formula: AF(EG(((p417==0)||((p161==0)&&(p262==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p417==0)||((p161==0)&&(p262==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t13, t15, t97, t99, Intersection with reachable at each step en...210
(forward)formula 0,1,1.40914,48616,1,0,310,292581,225,153,2322,252333,402
FORMULA HealthRecord-PT-16-CTLCardinality-2025-09 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 : 343/343 places, 447/447 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 319 transition count 416
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 319 transition count 416
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 308 transition count 397
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 308 transition count 397
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 308 transition count 395
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 303 transition count 388
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 303 transition count 388
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 299 transition count 380
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 299 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 297 transition count 378
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 297 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 295 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 295 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 295 transition count 375
Applied a total of 99 rules in 29 ms. Remains 295 /343 variables (removed 48) and now considering 375/447 (removed 72) transitions.
// Phase 1: matrix 375 rows 295 cols
[2025-06-04 03:14:36] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:14:36] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-04 03:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:14:37] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2025-06-04 03:14:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:47] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:48] [INFO ] Deduced a trap composed of 136 places in 249 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:48] [INFO ] Deduced a trap composed of 108 places in 261 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:48] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:49] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:49] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:50] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:50] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:50] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:54] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:58] [INFO ] Deduced a trap composed of 74 places in 293 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:59] [INFO ] Deduced a trap composed of 140 places in 315 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:59] [INFO ] Deduced a trap composed of 116 places in 309 ms of which 70 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:05] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:06] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:06] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:06] [INFO ] Deduced a trap composed of 56 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:07] [INFO ] Deduced a trap composed of 48 places in 257 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/670 variables, and 32 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/295 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:13] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:13] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:14] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:14] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:15] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (OVERLAPS) 375/670 variables, 295/332 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 374/706 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:35] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 707 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 295/343 places, 375/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 295/343 places, 375/447 transitions.
[2025-06-04 03:15:37] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:15:37] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:15:37] [INFO ] Input system was already deterministic with 375 transitions.
[2025-06-04 03:15:37] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:15:37] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:15:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality13624056816656962646.gal : 3 ms
[2025-06-04 03:15:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality10877536307850130108.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/CTLCardinality13624056816656962646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10877536307850130108.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.92451e+11,3.43536,79032,2,9637,5,228951,6,0,1557,488351,0


Converting to forward existential form...Done !
original formula: EX((A(((((p7==0)||(p209==1)) * AF((p53==1))) + EG((p92==0))) U EF(!(A(((p264==0)||(p384==1)) U (p153==0))))) + AG(EX(((p343==0)||(p98==1)...160
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(E(TRUE U !(!((E(!((p153==0)) U (!(((p264==0)||(p384==1))) * !((p153==0)))) + EG(!((p153==0...526
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...665
Detected timeout of ITS tools.
[2025-06-04 03:16:07] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:16:07] [INFO ] Applying decomposition
[2025-06-04 03:16:07] [INFO ] Flatten gal took : 7 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/graph15965327521704568289.txt' '-o' '/tmp/graph15965327521704568289.bin' '-w' '/tmp/graph15965327521704568289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15965327521704568289.bin' '-l' '-1' '-v' '-w' '/tmp/graph15965327521704568289.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:16:07] [INFO ] Decomposing Gal with order
[2025-06-04 03:16:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:16:07] [INFO ] Removed a total of 117 redundant transitions.
[2025-06-04 03:16:07] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:16:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 7 ms.
[2025-06-04 03:16:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4598658681579991459.gal : 5 ms
[2025-06-04 03:16:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality11409088284456440212.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/CTLCardinality4598658681579991459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11409088284456440212.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.92451e+11,1.76962,39028,1296,72,57862,2857,783,144978,91,13946,0


Converting to forward existential form...Done !
original formula: EX((A(((((i0.i0.u3.p7==0)||(i8.i1.u59.p209==1)) * AF((i2.i0.u10.p53==1))) + EG((i0.i0.u2.p92==0))) U EF(!(A(((i13.i2.u78.p264==0)||(i18.i...252
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(E(TRUE U !(!((E(!((i9.i1.u40.p153==0)) U (!(((i13.i2.u78.p264==0)||(i18.i0.u105.p384==1)))...744
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t25, t54, t57, t91, t337, i2.i0.t278, i2.i0.t287, i2.i0.t290, i2.i0.t291, i2.i...1254
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 318 transition count 417
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 318 transition count 417
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 306 transition count 398
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 306 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 77 place count 306 transition count 395
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 300 transition count 385
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 300 transition count 385
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 296 transition count 377
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 296 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 294 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 294 transition count 375
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 292 transition count 373
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 292 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 292 transition count 372
Applied a total of 106 rules in 27 ms. Remains 292 /343 variables (removed 51) and now considering 372/447 (removed 75) transitions.
// Phase 1: matrix 372 rows 292 cols
[2025-06-04 03:16:37] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:16:37] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-04 03:16:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:16:38] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-04 03:16:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:48] [INFO ] Deduced a trap composed of 28 places in 292 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:48] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:48] [INFO ] Deduced a trap composed of 136 places in 266 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:49] [INFO ] Deduced a trap composed of 108 places in 261 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:49] [INFO ] Deduced a trap composed of 53 places in 257 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:50] [INFO ] Deduced a trap composed of 53 places in 276 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:50] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:50] [INFO ] Deduced a trap composed of 137 places in 267 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:51] [INFO ] Deduced a trap composed of 46 places in 292 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:51] [INFO ] Deduced a trap composed of 118 places in 263 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:52] [INFO ] Deduced a trap composed of 142 places in 266 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:55] [INFO ] Deduced a trap composed of 70 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:55] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:00] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:01] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:02] [INFO ] Deduced a trap composed of 52 places in 285 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:02] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:02] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:02] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:03] [INFO ] Deduced a trap composed of 58 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:03] [INFO ] Deduced a trap composed of 58 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 03:17:04] [INFO ] Deduced a trap composed of 53 places in 215 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:04] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:07] [INFO ] Deduced a trap composed of 76 places in 239 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/664 variables, and 38 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:13] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:13] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:18] [INFO ] Deduced a trap composed of 140 places in 273 ms of which 58 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 372/664 variables, 292/333 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 371/704 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:36] [INFO ] Deduced a trap composed of 75 places in 256 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:36] [INFO ] Deduced a trap composed of 76 places in 233 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:37] [INFO ] Deduced a trap composed of 77 places in 235 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 707 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 292/343 places, 372/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60710 ms. Remains : 292/343 places, 372/447 transitions.
[2025-06-04 03:17:38] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:17:38] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:17:38] [INFO ] Input system was already deterministic with 372 transitions.
[2025-06-04 03:17:38] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:17:38] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:17:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality15982568130211596608.gal : 3 ms
[2025-06-04 03:17:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality1422171007603182889.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/CTLCardinality15982568130211596608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1422171007603182889.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.76259e+11,3.52327,79964,2,10429,5,230842,6,0,1542,499544,0


Converting to forward existential form...Done !
original formula: E((EX(((p42==1) * AG(AX((p82==0))))) * AX(AX(((p251!=0) * A((p123==1) U ((p165==0)||(p2==1))))))) U ((AF(EG((p183==1))) * EF(EG(((p276==0...211
=> equivalent forward existential formula: [FwdG(FwdU(((FwdU(Init,(EX(((p42==1) * !(E(TRUE U !(!(EX(!((p82==0))))))))) * !(EX(!(!(EX(!(((p251!=0) * !((E(!(...367
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...704
Detected timeout of ITS tools.
[2025-06-04 03:18:08] [INFO ] Flatten gal took : 8 ms
[2025-06-04 03:18:08] [INFO ] Applying decomposition
[2025-06-04 03:18:08] [INFO ] Flatten gal took : 6 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/graph6828255916440053166.txt' '-o' '/tmp/graph6828255916440053166.bin' '-w' '/tmp/graph6828255916440053166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6828255916440053166.bin' '-l' '-1' '-v' '-w' '/tmp/graph6828255916440053166.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:18:08] [INFO ] Decomposing Gal with order
[2025-06-04 03:18:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:18:08] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-04 03:18:08] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:18:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 5 ms.
[2025-06-04 03:18:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality5092335380325305333.gal : 4 ms
[2025-06-04 03:18:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality11174093242757414324.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/CTLCardinality5092335380325305333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11174093242757414324.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.76259e+11,0.761971,19932,1126,69,26104,1126,738,75227,105,3633,0


Converting to forward existential form...Done !
original formula: E((EX(((i1.i0.u8.p42==1) * AG(AX((i1.i0.u11.p82==0))))) * AX(AX(((i13.i0.u76.p251!=0) * A((i5.i1.u21.p123==1) U ((i8.i2.u40.p165==0)||(i1...333
=> equivalent forward existential formula: [FwdG(FwdU(((FwdU(Init,(EX(((i1.i0.u8.p42==1) * !(E(TRUE U !(!(EX(!((i1.i0.u11.p82==0))))))))) * !(EX(!(!(EX(!((...529
Reverse transition relation is NOT exact ! Due to transitions t93, t328, t329, t330, t331, t333, i1.i0.t278, i1.i0.t281, i1.i0.t287, i1.i0.t295, i1.i0.t297...1321
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
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
(forward)formula 0,0,24.6111,398428,1,0,593432,2805,5536,1.43297e+06,553,8636,752097
FORMULA HealthRecord-PT-16-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 316 transition count 414
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 316 transition count 414
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 66 place count 304 transition count 395
Iterating global reduction 0 with 12 rules applied. Total rules applied 78 place count 304 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 81 place count 304 transition count 392
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 298 transition count 382
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 298 transition count 382
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 294 transition count 374
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 294 transition count 374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 292 transition count 372
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 292 transition count 372
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 290 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 290 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 290 transition count 369
Applied a total of 110 rules in 29 ms. Remains 290 /343 variables (removed 53) and now considering 369/447 (removed 78) transitions.
// Phase 1: matrix 369 rows 290 cols
[2025-06-04 03:18:33] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:18:33] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-04 03:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:18:33] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-04 03:18: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/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:44] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:44] [INFO ] Deduced a trap composed of 135 places in 302 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:45] [INFO ] Deduced a trap composed of 108 places in 295 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:45] [INFO ] Deduced a trap composed of 53 places in 300 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:45] [INFO ] Deduced a trap composed of 65 places in 320 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:46] [INFO ] Deduced a trap composed of 136 places in 333 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:46] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:47] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:47] [INFO ] Deduced a trap composed of 43 places in 285 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:48] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:48] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:49] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:50] [INFO ] Deduced a trap composed of 58 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:18:50] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:50] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:50] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:51] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:51] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:51] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:52] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:56] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:57] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:57] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:57] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:58] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:59] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:00] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:00] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:00] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/659 variables, and 43 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/290 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:08] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:09] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:09] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:14] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 369/659 variables, 290/337 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 368/705 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:28] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:29] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:30] [INFO ] Deduced a trap composed of 71 places in 262 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:30] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:31] [INFO ] Deduced a trap composed of 77 places in 245 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:31] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 711 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 290/343 places, 369/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 290/343 places, 369/447 transitions.
[2025-06-04 03:19:34] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:19:34] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:19:34] [INFO ] Input system was already deterministic with 369 transitions.
[2025-06-04 03:19:34] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:19:34] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:19:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality458859418587110322.gal : 3 ms
[2025-06-04 03:19:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality14892573391907437796.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/CTLCardinality458859418587110322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14892573391907437796.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.62297e+11,4.02265,75552,2,10314,5,218087,6,0,1531,465386,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(((p396==0)&&(p143==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(((p396==0)&&(p143==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...680
(forward)formula 0,1,17.9823,300212,1,0,597,835440,759,332,8532,1.04815e+06,751
FORMULA HealthRecord-PT-16-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 317 transition count 415
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 317 transition count 415
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 306 transition count 397
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 306 transition count 397
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 76 place count 306 transition count 395
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 301 transition count 386
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 301 transition count 386
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 297 transition count 379
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 297 transition count 379
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 295 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 295 transition count 376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 294 transition count 374
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 294 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 293 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 293 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 103 place count 293 transition count 371
Applied a total of 103 rules in 53 ms. Remains 293 /343 variables (removed 50) and now considering 371/447 (removed 76) transitions.
// Phase 1: matrix 371 rows 293 cols
[2025-06-04 03:19:52] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:19:52] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-04 03:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:19:52] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-04 03:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:04] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:04] [INFO ] Deduced a trap composed of 43 places in 297 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:05] [INFO ] Deduced a trap composed of 142 places in 269 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:05] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:05] [INFO ] Deduced a trap composed of 45 places in 279 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:06] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:06] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:06] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:07] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:09] [INFO ] Deduced a trap composed of 136 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:09] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:10] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:14] [INFO ] Deduced a trap composed of 136 places in 268 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:15] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:16] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:16] [INFO ] Deduced a trap composed of 134 places in 206 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:16] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:17] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:17] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:18] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:18] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/664 variables, and 35 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/293 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:27] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:29] [INFO ] Deduced a trap composed of 54 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:20:29] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:29] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:31] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 31 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 371/664 variables, 293/333 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 370/703 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:46] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:46] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:46] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:47] [INFO ] Deduced a trap composed of 72 places in 258 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:48] [INFO ] Deduced a trap composed of 73 places in 223 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:48] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:49] [INFO ] Deduced a trap composed of 136 places in 236 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 710 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 293/343 places, 371/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 293/343 places, 371/447 transitions.
[2025-06-04 03:20:53] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:20:53] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:20:53] [INFO ] Input system was already deterministic with 371 transitions.
[2025-06-04 03:20:53] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:20:53] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:20:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality18008314617393483856.gal : 2 ms
[2025-06-04 03:20:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14661768398723375731.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/CTLCardinality18008314617393483856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14661768398723375731.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.02814e+11,4.6938,86864,2,10771,5,251968,6,0,1545,540852,0


Converting to forward existential form...Done !
original formula: (E(EX(!(((p288==0)||(p236==1)))) U ((!(EX(AG(((p184==0)||(p120==1))))) * AG((((p19==0)||(p269==1)) + A(((p432==0)||(p212==1)) U ((p98==0)...230
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(EX(!(((p288==0)||(p236==1)))) U ((!(EX(!(E(TRUE U !(((p184==0)||(p120==1))))))) * !(E(TRUE...406
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...689
Detected timeout of ITS tools.
[2025-06-04 03:21:23] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:21:23] [INFO ] Applying decomposition
[2025-06-04 03:21:23] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18150666532181609922.txt' '-o' '/tmp/graph18150666532181609922.bin' '-w' '/tmp/graph18150666532181609922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18150666532181609922.bin' '-l' '-1' '-v' '-w' '/tmp/graph18150666532181609922.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:21:23] [INFO ] Decomposing Gal with order
[2025-06-04 03:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:21:23] [INFO ] Removed a total of 104 redundant transitions.
[2025-06-04 03:21:23] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:21:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 7 ms.
[2025-06-04 03:21:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8366455242057992521.gal : 6 ms
[2025-06-04 03:21:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality3390975617182270405.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/CTLCardinality8366455242057992521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3390975617182270405.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02814e+11,3.09714,79528,1791,105,92701,1900,761,510937,94,10952,0


Converting to forward existential form...Done !
original formula: (E(EX(!(((i17.u86.p288==0)||(i12.i2.u69.p236==1)))) U ((!(EX(AG(((i9.i1.u50.p184==0)||(i4.i1.u28.p120==1))))) * AG((((i1.i0.u7.p19==0)||(...350
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(EX(!(((i17.u86.p288==0)||(i12.i2.u69.p236==1)))) U ((!(EX(!(E(TRUE U !(((i9.i1.u50.p184==0...562
Reverse transition relation is NOT exact ! Due to transitions t12, t170, t306, t318, t319, t320, t321, t322, t334, i2.i0.t273, i2.i0.t282, i2.i0.t287, i2.i...1288
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 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
(forward)formula 0,1,8.60431,187048,1,0,256804,3753,5205,1.24229e+06,450,16794,610296
FORMULA HealthRecord-PT-16-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 315 transition count 412
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 315 transition count 412
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 302 transition count 391
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 302 transition count 391
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 85 place count 302 transition count 388
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 297 transition count 381
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 297 transition count 381
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 99 place count 293 transition count 373
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 293 transition count 373
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 291 transition count 371
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 291 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 289 transition count 369
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 289 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 289 transition count 368
Applied a total of 112 rules in 44 ms. Remains 289 /343 variables (removed 54) and now considering 368/447 (removed 79) transitions.
// Phase 1: matrix 368 rows 289 cols
[2025-06-04 03:21:31] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:21:32] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-04 03:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:21:32] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-04 03:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:40] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:40] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:40] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:41] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:41] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:41] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:42] [INFO ] Deduced a trap composed of 40 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 03:21:42] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:42] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:42] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:43] [INFO ] Deduced a trap composed of 56 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:43] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:44] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:44] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:44] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:45] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:45] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:45] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:46] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:50] [INFO ] Deduced a trap composed of 139 places in 274 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:51] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:51] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:52] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:52] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:53] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:53] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
SMT process timed out in 30040ms, After SMT, problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 30043ms
Starting structural reductions in LTL mode, iteration 1 : 289/343 places, 368/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30671 ms. Remains : 289/343 places, 368/447 transitions.
[2025-06-04 03:22:02] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:22:02] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:22:02] [INFO ] Input system was already deterministic with 368 transitions.
[2025-06-04 03:22:02] [INFO ] Flatten gal took : 13 ms
[2025-06-04 03:22:02] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:22:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality4507036968915583033.gal : 3 ms
[2025-06-04 03:22:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality264779563623315855.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/CTLCardinality4507036968915583033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality264779563623315855.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62247e+11,4.08686,79816,2,9408,5,228236,6,0,1526,501019,0


Converting to forward existential form...Done !
original formula: !(A(!(AF(E((p201!=1) U EX((p81==1))))) U AG(E(!(((p161==1)||(p163==0))) U (((p48==0)||(p159==1))||((p161==0)&&(p357==0)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(!(((p161==1)||(p163==0))) U (((p48==0)||(p159==1))||((p161==0)&&(p357==0))))...431
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...671
Detected timeout of ITS tools.
[2025-06-04 03:22:32] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:22:32] [INFO ] Applying decomposition
[2025-06-04 03:22:32] [INFO ] Flatten gal took : 6 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/graph2562994062280217136.txt' '-o' '/tmp/graph2562994062280217136.bin' '-w' '/tmp/graph2562994062280217136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2562994062280217136.bin' '-l' '-1' '-v' '-w' '/tmp/graph2562994062280217136.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:22:32] [INFO ] Decomposing Gal with order
[2025-06-04 03:22:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:22:32] [INFO ] Removed a total of 117 redundant transitions.
[2025-06-04 03:22:32] [INFO ] Flatten gal took : 17 ms
[2025-06-04 03:22:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 3 ms.
[2025-06-04 03:22:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11871574327048451544.gal : 5 ms
[2025-06-04 03:22:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality11972843488043397784.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/CTLCardinality11871574327048451544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11972843488043397784.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.62247e+11,1.10633,26896,968,56,40630,1754,723,103116,89,7440,0


Converting to forward existential form...Done !
original formula: !(A(!(AF(E((i8.i3.u54.p201!=1) U EX((i0.u8.p81==1))))) U AG(E(!(((i6.i0.u40.p161==1)||(i6.i2.u42.p163==0))) U (((i0.u9.p48==0)||(i6.i1.u3...216
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(!(((i6.i0.u40.p161==1)||(i6.i2.u42.p163==0))) U (((i0.u9.p48==0)||(i6.i1.u39...618
Reverse transition relation is NOT exact ! Due to transitions t90, t304, t330, i0.t294, i0.t292, i0.t290, i0.t285, i0.t284, i0.t281, i0.t272, i0.u4.t275, i...1244
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 447/447 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 317 transition count 414
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 317 transition count 414
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 305 transition count 394
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 305 transition count 394
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 79 place count 305 transition count 391
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 300 transition count 383
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 300 transition count 383
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 296 transition count 376
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 296 transition count 376
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 293 transition count 372
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 293 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 106 place count 290 transition count 368
Iterating global reduction 1 with 3 rules applied. Total rules applied 109 place count 290 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 290 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 289 transition count 365
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 289 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 289 transition count 364
Applied a total of 113 rules in 33 ms. Remains 289 /343 variables (removed 54) and now considering 364/447 (removed 83) transitions.
// Phase 1: matrix 364 rows 289 cols
[2025-06-04 03:23:02] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:23:03] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-04 03:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:23:03] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2025-06-04 03:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:13] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:13] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:13] [INFO ] Deduced a trap composed of 137 places in 266 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:14] [INFO ] Deduced a trap composed of 110 places in 232 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:14] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:15] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:15] [INFO ] Deduced a trap composed of 45 places in 295 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:15] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:16] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:16] [INFO ] Deduced a trap composed of 135 places in 283 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:17] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:17] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:17] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:17] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:17] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:17] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:18] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:18] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:19] [INFO ] Deduced a trap composed of 56 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:23:19] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:23] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:24] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:25] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:25] [INFO ] Deduced a trap composed of 115 places in 241 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:25] [INFO ] Deduced a trap composed of 136 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:27] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:28] [INFO ] Deduced a trap composed of 56 places in 238 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:28] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:30] [INFO ] Deduced a trap composed of 137 places in 257 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/653 variables, and 43 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/653 variables, 289/332 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 363/695 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:24:00] [INFO ] Deduced a trap along path composed of 2 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:24:00] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:24:00] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:24:00] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:24:00] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:24:01] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/653 variables, and 701 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 289/343 places, 364/447 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60543 ms. Remains : 289/343 places, 364/447 transitions.
[2025-06-04 03:24:03] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:24:03] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:24:03] [INFO ] Input system was already deterministic with 364 transitions.
[2025-06-04 03:24:03] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:24:03] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:24:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality857902660830161770.gal : 3 ms
[2025-06-04 03:24:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14255942823381567640.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/CTLCardinality857902660830161770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14255942823381567640.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.64179e+11,4.92176,113568,2,13378,5,305643,6,0,1522,753895,0


Converting to forward existential form...Done !
original formula: AX(EG(((p410==0) * EF(((p143==0)&&(p319==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((p410==0) * E(TRUE U ((p143==0)&&(p319==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t34, t36, t37, t38, t41, t42, t43...706
Detected timeout of ITS tools.
[2025-06-04 03:24:33] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:24:33] [INFO ] Applying decomposition
[2025-06-04 03:24:33] [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/graph11691339999861970284.txt' '-o' '/tmp/graph11691339999861970284.bin' '-w' '/tmp/graph11691339999861970284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11691339999861970284.bin' '-l' '-1' '-v' '-w' '/tmp/graph11691339999861970284.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:24:33] [INFO ] Decomposing Gal with order
[2025-06-04 03:24:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:24:33] [INFO ] Removed a total of 85 redundant transitions.
[2025-06-04 03:24:33] [INFO ] Flatten gal took : 16 ms
[2025-06-04 03:24:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2025-06-04 03:24:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality13558872573083539791.gal : 3 ms
[2025-06-04 03:24:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality14751827433490221772.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/CTLCardinality13558872573083539791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14751827433490221772.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.64179e+11,2.57808,55840,2355,309,81278,9360,603,174604,169,34454,0


Converting to forward existential form...Done !
original formula: AX(EG(((i20.u98.p410==0) * EF(((u31.p143==0)&&(i17.u83.p319==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((i20.u98.p410==0) * E(TRUE U ((u31.p143==0)&&(i17.u83.p319==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t203, t236, t312, t313, t314, t315, t316, t328, t346, u31.t229, i2.u4.t274, i2.u4.t276, i2.u4...1217
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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 a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
(forward)formula 0,1,7.53295,137376,1,0,219455,11861,4749,453854,949,45989,834011
FORMULA HealthRecord-PT-16-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-04 03:24:41] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:24:41] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:24:41] [INFO ] Applying decomposition
[2025-06-04 03:24:41] [INFO ] Flatten gal took : 7 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/graph17990075308722224844.txt' '-o' '/tmp/graph17990075308722224844.bin' '-w' '/tmp/graph17990075308722224844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17990075308722224844.bin' '-l' '-1' '-v' '-w' '/tmp/graph17990075308722224844.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:24:41] [INFO ] Decomposing Gal with order
[2025-06-04 03:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:24:41] [INFO ] Removed a total of 112 redundant transitions.
[2025-06-04 03:24:41] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2025-06-04 03:24:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality10091344737874067126.gal : 4 ms
[2025-06-04 03:24:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4706947676056751915.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/CTLCardinality10091344737874067126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4706947676056751915.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 3 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.44251e+11,4.44389,79636,2009,661,107051,22596,848,284582,223,106150,0


Converting to forward existential form...Done !
original formula: AF((AF(AX(FALSE)) + EX(((i11.i1.u54.p195==0)&&(i2.i3.u11.p29==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(!(EX(!(FALSE)))))) + EX(((i11.i1.u54.p195==0)&&(i2.i3.u11.p29==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t92, t93, t372, t384, t385, t386, t387, t388, t395, t396, t397, t398, t406, u39.t274, u5...1832
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
(forward)formula 0,0,450.465,2486152,1,0,3.66897e+06,88968,1731,5.71058e+06,550,586564,2212342
FORMULA HealthRecord-PT-16-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((A(((((i4.i0.u3.p7==0)||(i11.i0.u63.p209==1)) * AF((i2.i2.u13.p53==1))) + EG((i4.i0.u2.p92==0))) U EF(!(A(((i14.i0.u83.p264==0)||(i19....250
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(E(TRUE U !(!((E(!((i9.i1.u41.p153==0)) U (!(((i14.i0.u83.p264==0)||(i19.u108.p384==1))) * ...736
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
(forward)formula 1,1,527.865,2658560,1,0,3.96461e+06,149269,3340,7.00915e+06,734,835816,3959113
FORMULA HealthRecord-PT-16-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(A(!(AF(E((i11.i1.u59.p201!=1) U EX((i2.i2.u13.p81==1))))) U AG(E(!(((i9.i2.u46.p161==1)||(i9.i3.u47.p163==0))) U (((i2.i2.u13.p48==0)||...226
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(!(((i9.i2.u46.p161==1)||(i9.i3.u47.p163==0))) U (((i2.i2.u13.p48==0)||(i9.i3...638
Fast SCC detection found an SCC at level 20
(forward)formula 2,1,682.938,3089792,1,0,4.61565e+06,172568,3972,8.16655e+06,800,980385,2868807
FORMULA HealthRecord-PT-16-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1878254 ms.

BK_STOP 1749008165671

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-16, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867008300657"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;