Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100218.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-16-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748869380550

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 13:03:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 13:03:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:03:03] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2025-06-02 13:03:03] [INFO ] Transformed 196 places.
[2025-06-02 13:03:03] [INFO ] Transformed 392 transitions.
[2025-06-02 13:03:03] [INFO ] Found NUPN structural information;
[2025-06-02 13:03:03] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 64 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 169 transition count 350
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 169 transition count 350
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 169 transition count 342
Applied a total of 62 rules in 78 ms. Remains 169 /196 variables (removed 27) and now considering 342/390 (removed 48) transitions.
// Phase 1: matrix 342 rows 169 cols
[2025-06-02 13:03:04] [INFO ] Computed 7 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:03:04] [INFO ] Implicit Places using invariants in 495 ms returned []
[2025-06-02 13:03:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:03:04] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2025-06-02 13:03:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:12] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:12] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:12] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:12] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:12] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:13] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:13] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:13] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:13] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:14] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:14] [INFO ] Deduced a trap composed of 16 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-02 13:03:14] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:14] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:15] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:15] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:15] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:16] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:16] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:16] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:16] [INFO ] Deduced a trap composed of 114 places in 300 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:18] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:23] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:23] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:26] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 341 unsolved
SMT process timed out in 30325ms, After SMT, problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 30357ms
Starting structural reductions in LTL mode, iteration 1 : 169/196 places, 342/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31512 ms. Remains : 169/196 places, 342/390 transitions.
Support contains 64 out of 169 places after structural reductions.
[2025-06-02 13:03:35] [INFO ] Flatten gal took : 121 ms
[2025-06-02 13:03:35] [INFO ] Flatten gal took : 52 ms
[2025-06-02 13:03:36] [INFO ] Input system was already deterministic with 342 transitions.
RANDOM walk for 40000 steps (8 resets) in 2604 ms. (15 steps per ms) remains 43/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 38/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
[2025-06-02 13:03:37] [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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 119/169 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:37] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:38] [INFO ] Deduced a trap composed of 25 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-02 13:03:38] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:38] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:38] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:38] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 6/13 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:38] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 342/511 variables, 169/183 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:40] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 1/184 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/511 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 184 constraints, problems are : Problem set: 1 solved, 37 unsolved in 4275 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 37 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 120/169 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:42] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 342/511 variables, 169/185 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 37/222 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:43] [INFO ] Deduced a trap composed of 108 places in 181 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:43] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 2/224 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:45] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 1/225 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 225 constraints, problems are : Problem set: 1 solved, 37 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 37/38 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9326ms problems are : Problem set: 1 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 342/342 transitions.
Graph (trivial) has 88 edges and 169 vertex of which 4 / 169 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 166 transition count 325
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 153 transition count 323
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 35 place count 152 transition count 318
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 40 place count 147 transition count 318
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 40 place count 147 transition count 312
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 52 place count 141 transition count 312
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 56 place count 137 transition count 305
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 137 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 137 transition count 303
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 94 place count 121 transition count 287
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 120 transition count 283
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 120 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 112 place count 112 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 125 place count 112 transition count 331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 125 place count 112 transition count 330
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 111 transition count 330
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 110 transition count 329
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 110 transition count 329
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 140 place count 110 transition count 316
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 153 place count 99 transition count 314
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 98 transition count 312
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 98 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 160 place count 98 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 97 transition count 306
Applied a total of 161 rules in 178 ms. Remains 97 /169 variables (removed 72) and now considering 306/342 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 97/169 places, 306/342 transitions.
RANDOM walk for 40000 steps (8 resets) in 583 ms. (68 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 27/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 21/23 properties
[2025-06-02 13:03:47] [INFO ] Flow matrix only has 295 transitions (discarded 11 similar events)
// Phase 1: matrix 295 rows 97 cols
[2025-06-02 13:03:47] [INFO ] Computed 7 invariants in 4 ms
[2025-06-02 13:03:47] [INFO ] State equation strengthened by 29 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 68/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:47] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:47] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:47] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 295/392 variables, 97/107 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 136 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 68/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 295/392 variables, 97/107 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 29/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 21/157 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:49] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:50] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:50] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:51] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 13 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/392 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 161 constraints, problems are : Problem set: 0 solved, 21 unsolved in 4761 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6505ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 13 properties in 8561 ms.
Support contains 14 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 306/306 transitions.
Graph (trivial) has 80 edges and 97 vertex of which 4 / 97 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 95 transition count 294
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 87 transition count 293
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 18 place count 87 transition count 286
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 33 place count 79 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 69 edges and 79 vertex of which 5 / 79 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 9 rules applied. Total rules applied 42 place count 76 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 56 place count 76 transition count 264
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 61 place count 71 transition count 255
Iterating global reduction 4 with 5 rules applied. Total rules applied 66 place count 71 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 66 place count 71 transition count 254
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 70 transition count 254
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 69 transition count 251
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 69 transition count 251
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 67 transition count 248
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 88 place count 67 transition count 234
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 112 place count 55 transition count 293
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 139 place count 55 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 6 with 51 rules applied. Total rules applied 190 place count 55 transition count 215
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 197 place count 55 transition count 208
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 204 place count 48 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 219 place count 48 transition count 193
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 48 transition count 193
Applied a total of 220 rules in 57 ms. Remains 48 /97 variables (removed 49) and now considering 193/306 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 48/97 places, 193/306 transitions.
RANDOM walk for 40000 steps (476 resets) in 303 ms. (131 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40001 steps (55 resets) in 95 ms. (416 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (39 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 87 ms. (454 steps per ms) remains 1/2 properties
[2025-06-02 13:04:02] [INFO ] Flow matrix only has 171 transitions (discarded 22 similar events)
// Phase 1: matrix 171 rows 48 cols
[2025-06-02 13:04:02] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 13:04:02] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/156 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/212 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/213 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/219 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/219 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/156 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/212 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/213 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:03] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/213 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/219 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 24/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:03] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/219 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 134 steps, including 20 resets, run visited all 1 properties in 1 ms. (steps per millisecond=134 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-02 13:04:03] [INFO ] Flatten gal took : 33 ms
[2025-06-02 13:04:03] [INFO ] Flatten gal took : 37 ms
[2025-06-02 13:04:03] [INFO ] Input system was already deterministic with 342 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Graph (trivial) has 181 edges and 169 vertex of which 13 / 169 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 158 transition count 299
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 126 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 124 transition count 295
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 71 place count 124 transition count 287
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 87 place count 116 transition count 287
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 102 place count 101 transition count 258
Iterating global reduction 3 with 15 rules applied. Total rules applied 117 place count 101 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 124 place count 101 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 124 place count 101 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 100 transition count 250
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 158 place count 84 transition count 234
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 80 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 80 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 178 place count 80 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 178 place count 80 transition count 209
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 182 place count 78 transition count 209
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 188 place count 75 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 74 transition count 205
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 72 vertex of which 26 / 72 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 192 place count 56 transition count 205
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 234 place count 56 transition count 163
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 236 place count 54 transition count 146
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 54 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 6 with 41 rules applied. Total rules applied 279 place count 54 transition count 105
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 6 rules applied. Total rules applied 285 place count 54 transition count 99
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 291 place count 48 transition count 99
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 293 place count 46 transition count 94
Iterating global reduction 8 with 2 rules applied. Total rules applied 295 place count 46 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 299 place count 44 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 303 place count 44 transition count 88
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 2 rules applied. Total rules applied 305 place count 44 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 307 place count 42 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 307 place count 42 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 311 place count 40 transition count 84
Applied a total of 311 rules in 113 ms. Remains 40 /169 variables (removed 129) and now considering 84/342 (removed 258) transitions.
// Phase 1: matrix 84 rows 40 cols
[2025-06-02 13:04:03] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-02 13:04:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:04:03] [INFO ] Implicit Places using invariants and state equation in 133 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-02 13:04:03] [INFO ] Redundant transitions in 22 ms returned [83]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 80 sub problems to find dead transitions.
// Phase 1: matrix 83 rows 40 cols
[2025-06-02 13:04:03] [INFO ] Computed 5 invariants in 0 ms
[2025-06-02 13:04:03] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:04] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:05] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 82/122 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/123 variables, and 71 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/40 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 82/122 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 80/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/123 variables, and 151 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4140 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8181ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 8182ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/169 places, 83/342 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 81
Applied a total of 4 rules in 7 ms. Remains 38 /40 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 38 cols
[2025-06-02 13:04:12] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 13:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:04:12] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/169 places, 81/342 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8720 ms. Remains : 38/169 places, 81/342 transitions.
[2025-06-02 13:04:12] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:04:12] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:04:12] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-02 13:04:12] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:04:12] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:04:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9294635117393455911.gal : 5 ms
[2025-06-02 13:04:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16768651813865256054.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9294635117393455911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16768651813865256054.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,1819,0.095941,5440,2,714,5,5099,5,0,234,4439,0


Converting to forward existential form...Done !
original formula: E(!(EF(EG((p31==1)))) U (p26==1))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U EG((p31==1))))) * (p26==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t7, t9, t10, t11, t16, t17, t19, t21, t23, t25, t57, t60, t65, t66, Intersection...240
(forward)formula 0,0,0.49874,14400,1,0,188,46651,191,92,1982,32844,196
FORMULA MedleyA-PT-16-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Graph (trivial) has 184 edges and 169 vertex of which 13 / 169 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 158 transition count 301
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 128 transition count 297
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 126 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 125 transition count 296
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 69 place count 125 transition count 288
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 85 place count 117 transition count 288
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 101 place count 101 transition count 257
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 101 transition count 257
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 124 place count 101 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 124 place count 101 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 126 place count 100 transition count 249
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 158 place count 84 transition count 233
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 162 place count 80 transition count 222
Iterating global reduction 5 with 4 rules applied. Total rules applied 166 place count 80 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 179 place count 80 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 179 place count 80 transition count 207
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 78 transition count 207
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 191 place count 74 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 73 transition count 202
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 85 edges and 71 vertex of which 26 / 71 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 195 place count 55 transition count 202
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 237 place count 55 transition count 160
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 239 place count 53 transition count 143
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 53 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 281 place count 53 transition count 103
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 7 with 5 rules applied. Total rules applied 286 place count 53 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 291 place count 48 transition count 98
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 293 place count 46 transition count 93
Iterating global reduction 9 with 2 rules applied. Total rules applied 295 place count 46 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 299 place count 44 transition count 91
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 302 place count 44 transition count 88
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 303 place count 44 transition count 87
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 305 place count 43 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 306 place count 42 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 306 place count 42 transition count 85
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 308 place count 41 transition count 85
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 309 place count 41 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 310 place count 41 transition count 84
Applied a total of 310 rules in 64 ms. Remains 41 /169 variables (removed 128) and now considering 84/342 (removed 258) transitions.
// Phase 1: matrix 84 rows 41 cols
[2025-06-02 13:04:12] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:12] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-02 13:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:13] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:04:13] [INFO ] Redundant transitions in 15 ms returned [83]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 79 sub problems to find dead transitions.
// Phase 1: matrix 83 rows 41 cols
[2025-06-02 13:04:13] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:13] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:14] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 82/123 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/124 variables, and 56 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3762 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 79/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/124 variables, and 135 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3876 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7661ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 7662ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/169 places, 83/342 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 81
Applied a total of 4 rules in 6 ms. Remains 39 /41 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 39 cols
[2025-06-02 13:04:20] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:20] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-02 13:04:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:20] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/169 places, 81/342 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8077 ms. Remains : 39/169 places, 81/342 transitions.
[2025-06-02 13:04:20] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:04:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:04:20] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-02 13:04:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:04:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:04:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10923503611822812084.gal : 14 ms
[2025-06-02 13:04:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9542075271592178300.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/CTLFireability10923503611822812084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9542075271592178300.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,3166,0.116387,6268,2,1025,5,7799,5,0,238,5947,0


Converting to forward existential form...Done !
original formula: EF((EF((p189==1)) * (p167==0)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p167==0)),TRUE) * (p189==1))] != FALSE
(forward)formula 0,1,0.150163,6524,1,0,8,7799,9,2,504,5947,4
FORMULA MedleyA-PT-16-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 155 transition count 318
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 155 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 154 transition count 310
Applied a total of 37 rules in 10 ms. Remains 154 /169 variables (removed 15) and now considering 310/342 (removed 32) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:04:21] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:21] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-02 13:04:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:04:21] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:04:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:27] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:27] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:27] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:27] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:27] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:28] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:28] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:28] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:29] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:29] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:29] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:29] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:30] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:31] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:31] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:32] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:32] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:32] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:32] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:33] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:37] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:37] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:40] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/464 variables, 154/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:48] [INFO ] Deduced a trap composed of 89 places in 179 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:49] [INFO ] Deduced a trap composed of 106 places in 195 ms of which 34 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 186 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:54] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 309/496 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:11] [INFO ] Deduced a trap along path composed of 2 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:11] [INFO ] Deduced a trap along path composed of 17 places in 140 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:12] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:16] [INFO ] Deduced a trap along path composed of 16 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 500 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 154/169 places, 310/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60570 ms. Remains : 154/169 places, 310/342 transitions.
[2025-06-02 13:05:21] [INFO ] Flatten gal took : 24 ms
[2025-06-02 13:05:21] [INFO ] Flatten gal took : 24 ms
[2025-06-02 13:05:21] [INFO ] Input system was already deterministic with 310 transitions.
[2025-06-02 13:05:21] [INFO ] Flatten gal took : 25 ms
[2025-06-02 13:05:21] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:05:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1898555205991569466.gal : 8 ms
[2025-06-02 13:05:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4682052948252060644.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/CTLFireability1898555205991569466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4682052948252060644.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,5.63137e+06,1.44135,32348,2,7615,5,95955,6,0,928,123161,0


Converting to forward existential form...Done !
original formula: EG(((((p18==1)&&(p113==1))&&(p190==1)) + (AX(!(A(((p17==1)&&(p112==1)) U (((p12==1)&&(p51==1))&&(p192==1))))) * EG(EF((p11==1))))))
=> equivalent forward existential formula: [FwdG(Init,((((p18==1)&&(p113==1))&&(p190==1)) + (!(EX(!(!(!((E(!((((p12==1)&&(p51==1))&&(p192==1))) U (!(((p17=...299
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 13:05:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:05:51] [INFO ] Applying decomposition
[2025-06-02 13:05:51] [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/graph14449070931720218404.txt' '-o' '/tmp/graph14449070931720218404.bin' '-w' '/tmp/graph14449070931720218404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14449070931720218404.bin' '-l' '-1' '-v' '-w' '/tmp/graph14449070931720218404.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:05:52] [INFO ] Decomposing Gal with order
[2025-06-02 13:05:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:05:52] [INFO ] Removed a total of 382 redundant transitions.
[2025-06-02 13:05:52] [INFO ] Flatten gal took : 103 ms
[2025-06-02 13:05:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 22 ms.
[2025-06-02 13:05:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18325254822427382544.gal : 11 ms
[2025-06-02 13:05:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16584516651521819984.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/CTLFireability18325254822427382544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16584516651521819984.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,5.63137e+06,0.272815,9544,542,20,9769,225,619,23137,46,580,0


Converting to forward existential form...Done !
original formula: EG(((((i0.u4.p18==1)&&(i5.u36.p113==1))&&(i10.i1.u63.p190==1)) + (AX(!(A(((i0.u6.p17==1)&&(i5.u23.p112==1)) U (((i0.u5.p12==1)&&(i10.i1.u...220
=> equivalent forward existential formula: [FwdG(Init,((((i0.u4.p18==1)&&(i5.u36.p113==1))&&(i10.i1.u63.p190==1)) + (!(EX(!(!(!((E(!((((i0.u5.p12==1)&&(i10...426
Reverse transition relation is NOT exact ! Due to transitions t18, t26, t33, t57, t58, t75, t82, t90, t103, t114, t115, t159, t161, t167, t169, t176, t177,...749
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 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 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
(forward)formula 0,1,3.20612,97224,1,0,104789,225,3802,754750,205,580,221639
FORMULA MedleyA-PT-16-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 155 transition count 318
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 155 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 155 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 154 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 154 transition count 315
Applied a total of 32 rules in 6 ms. Remains 154 /169 variables (removed 15) and now considering 315/342 (removed 27) transitions.
// Phase 1: matrix 315 rows 154 cols
[2025-06-02 13:05:55] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:05:55] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 13:05:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:05:56] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2025-06-02 13:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:01] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:01] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:01] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:01] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:02] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:02] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:02] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:02] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:02] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:03] [INFO ] Deduced a trap composed of 101 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-02 13:06:03] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:04] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:04] [INFO ] Deduced a trap composed of 107 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-02 13:06:04] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:04] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:06] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:07] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:11] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:11] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 315/469 variables, 154/180 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:22] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 36 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:25] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/469 variables, and 182 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:28] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (OVERLAPS) 315/469 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 314/497 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:45] [INFO ] Deduced a trap along path composed of 2 places in 115 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:45] [INFO ] Deduced a trap along path composed of 2 places in 128 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:45] [INFO ] Deduced a trap along path composed of 17 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 500 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 154/169 places, 315/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60491 ms. Remains : 154/169 places, 315/342 transitions.
[2025-06-02 13:06:56] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:06:56] [INFO ] Flatten gal took : 21 ms
[2025-06-02 13:06:56] [INFO ] Input system was already deterministic with 315 transitions.
[2025-06-02 13:06:56] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:06:56] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:06:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10866770000609949777.gal : 5 ms
[2025-06-02 13:06:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9791578499565409835.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/CTLFireability10866770000609949777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9791578499565409835.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.53227e+06,1.18298,30908,2,7322,5,91136,6,0,933,117486,0


Converting to forward existential form...Done !
original formula: (EX(EX(EF((((((p14==1)&&(p178==1))&&((p58==1)&&(p159==1)))||(((p50==1)&&(p181==1))&&(p190==1)))||((p33==1)&&(p178==1)))))) + AF((p136==1)...157
=> equivalent forward existential formula: [FwdG((Init * !(EX(EX(E(TRUE U (((((p14==1)&&(p178==1))&&((p58==1)&&(p159==1)))||(((p50==1)&&(p181==1))&&(p190==...211
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t54, t55, t57, t59, t60,...551
(forward)formula 0,1,14.5843,356292,1,0,651,2.27247e+06,661,316,7162,1.49544e+06,733
FORMULA MedleyA-PT-16-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 155 transition count 318
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 155 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 154 transition count 310
Applied a total of 37 rules in 7 ms. Remains 154 /169 variables (removed 15) and now considering 310/342 (removed 32) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:07:11] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:07:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 13:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:07:11] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:16] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:16] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:16] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:16] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:16] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:16] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:16] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:17] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:17] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:17] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:17] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:17] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:18] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:18] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:18] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:18] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:19] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:20] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:20] [INFO ] Deduced a trap composed of 35 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-02 13:07:20] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:22] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:31] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:34] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:39] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 185 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/185 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/494 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:50] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:50] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 496 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 154/169 places, 310/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60422 ms. Remains : 154/169 places, 310/342 transitions.
[2025-06-02 13:08:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:08:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:08:11] [INFO ] Input system was already deterministic with 310 transitions.
[2025-06-02 13:08:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:08:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:08:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5280653060111813058.gal : 3 ms
[2025-06-02 13:08:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10415826006757015729.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/CTLFireability5280653060111813058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10415826006757015729.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.53244e+06,1.38295,33344,2,8082,5,99377,6,0,928,126328,0


Converting to forward existential form...Done !
original formula: EF(((EX(((p66==0)||(p138==0))) * (p120==0)) * (p158==1)))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * (p158==1)) * (p120==0))) * ((p66==0)||(p138==0)))] != FALSE
(forward)formula 0,1,1.44481,33344,1,0,11,99377,10,3,1501,126328,4
FORMULA MedleyA-PT-16-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 156 transition count 319
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 156 transition count 319
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 156 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 155 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 155 transition count 313
Applied a total of 33 rules in 7 ms. Remains 155 /169 variables (removed 14) and now considering 313/342 (removed 29) transitions.
// Phase 1: matrix 313 rows 155 cols
[2025-06-02 13:08:13] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:08:13] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 13:08:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:08:13] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2025-06-02 13:08:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:19] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:19] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:19] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:19] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:19] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:19] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:20] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:20] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:20] [INFO ] Deduced a trap composed of 88 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:21] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:21] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:21] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:21] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:22] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:22] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:22] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:22] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:24] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:24] [INFO ] Deduced a trap composed of 96 places in 185 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:25] [INFO ] Deduced a trap composed of 100 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:25] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:25] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:26] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:26] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:30] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:30] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:32] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:32] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:33] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 313/468 variables, 155/191 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:42] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 192 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/468 variables, 155/192 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 312/504 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:54] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:07] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 506 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 155/169 places, 313/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60433 ms. Remains : 155/169 places, 313/342 transitions.
[2025-06-02 13:09:13] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:09:13] [INFO ] Flatten gal took : 18 ms
[2025-06-02 13:09:13] [INFO ] Input system was already deterministic with 313 transitions.
[2025-06-02 13:09:13] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:09:13] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:09:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16687684593353687915.gal : 3 ms
[2025-06-02 13:09:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9982831253362058136.ctl : 3 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/CTLFireability16687684593353687915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9982831253362058136.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,7.45282e+06,1.73902,42500,2,8999,5,125449,6,0,935,171469,0


Converting to forward existential form...Done !
original formula: (AG((AX(((AG((p6==1)) * EX(((p58==1)&&(p156==1)))) + (p168==0))) * EF(((p57==1)||((p95==1)&&(p131==1)))))) + EG(AG(AX(((p193==0)&&((p33==...174
=> equivalent forward existential formula: (([(FwdU((EY(FwdU((Init * !(EG(!(E(TRUE U !(!(EX(!(((p193==0)&&((p33==0)||(p178==0)))))))))))),TRUE)) * !((p168=...496
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...565
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,15.8591,380040,1,0,636,2.25048e+06,661,315,7604,1.60017e+06,718
FORMULA MedleyA-PT-16-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Graph (trivial) has 183 edges and 169 vertex of which 13 / 169 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 158 transition count 299
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 126 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 124 transition count 295
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 124 transition count 288
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 117 transition count 288
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 101 place count 101 transition count 257
Iterating global reduction 3 with 16 rules applied. Total rules applied 117 place count 101 transition count 257
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 124 place count 101 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 124 place count 101 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 100 transition count 249
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 4 with 34 rules applied. Total rules applied 160 place count 83 transition count 232
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 79 transition count 221
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 79 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 180 place count 79 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 180 place count 79 transition count 207
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 77 transition count 207
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 192 place count 73 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 72 transition count 202
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 75 edges and 71 vertex of which 13 / 71 are part of one of the 5 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 195 place count 63 transition count 202
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 214 place count 63 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 215 place count 62 transition count 171
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 62 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 221 place count 62 transition count 166
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 222 place count 62 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 223 place count 61 transition count 165
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 224 place count 60 transition count 157
Iterating global reduction 8 with 1 rules applied. Total rules applied 225 place count 60 transition count 157
Applied a total of 225 rules in 44 ms. Remains 60 /169 variables (removed 109) and now considering 157/342 (removed 185) transitions.
[2025-06-02 13:09:29] [INFO ] Flow matrix only has 133 transitions (discarded 24 similar events)
// Phase 1: matrix 133 rows 60 cols
[2025-06-02 13:09:29] [INFO ] Computed 6 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:09:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 13:09:29] [INFO ] Flow matrix only has 133 transitions (discarded 24 similar events)
[2025-06-02 13:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:09:29] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 13:09:29] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:09:29] [INFO ] Redundant transitions in 9 ms returned []
Running 153 sub problems to find dead transitions.
[2025-06-02 13:09:29] [INFO ] Flow matrix only has 133 transitions (discarded 24 similar events)
[2025-06-02 13:09:29] [INFO ] Invariant cache hit.
[2025-06-02 13:09:29] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:30] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:30] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:30] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:30] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:30] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:30] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:31] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:31] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 132/192 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 1/193 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 101 constraints, problems are : Problem set: 0 solved, 153 unsolved in 12623 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 60/60 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 132/192 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 153/253 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:47] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 1/193 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 0/193 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 255 constraints, problems are : Problem set: 0 solved, 153 unsolved in 19712 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 60/60 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32363ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 32364ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/169 places, 157/342 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32665 ms. Remains : 60/169 places, 157/342 transitions.
[2025-06-02 13:10:02] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:10:02] [INFO ] Flatten gal took : 5 ms
[2025-06-02 13:10:02] [INFO ] Input system was already deterministic with 157 transitions.
[2025-06-02 13:10:02] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:10:02] [INFO ] Flatten gal took : 5 ms
[2025-06-02 13:10:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5643944861359032508.gal : 2 ms
[2025-06-02 13:10:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16341918064095452392.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/CTLFireability5643944861359032508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16341918064095452392.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,32758,0.114264,6996,2,1345,5,10607,6,0,394,9241,0


Converting to forward existential form...Done !
original formula: EF(AG(((p74==0)||(p123==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p74==0)||(p123==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t13, t15, t18, t23, t26, t29, t30, t32, t34, t36, t39, t40, t42, t44, t46, t49, t50, ...290
(forward)formula 0,1,0.858941,27044,1,0,290,123763,330,156,3023,85063,336
FORMULA MedleyA-PT-16-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Graph (trivial) has 178 edges and 169 vertex of which 13 / 169 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 158 transition count 300
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 127 transition count 296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 125 transition count 296
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 69 place count 125 transition count 289
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 118 transition count 289
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 99 place count 102 transition count 258
Iterating global reduction 3 with 16 rules applied. Total rules applied 115 place count 102 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 122 place count 102 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 122 place count 102 transition count 250
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 101 transition count 250
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 4 with 34 rules applied. Total rules applied 158 place count 84 transition count 233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 80 transition count 222
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 80 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 177 place count 80 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 177 place count 80 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 181 place count 78 transition count 209
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 189 place count 74 transition count 205
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 74 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 73 transition count 204
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 79 edges and 71 vertex of which 22 / 71 are part of one of the 9 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 194 place count 58 transition count 204
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 223 place count 58 transition count 175
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 57 transition count 164
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 57 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 6 with 49 rules applied. Total rules applied 274 place count 57 transition count 115
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 6 with 4 rules applied. Total rules applied 278 place count 57 transition count 111
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 282 place count 53 transition count 111
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 284 place count 51 transition count 105
Iterating global reduction 8 with 2 rules applied. Total rules applied 286 place count 51 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 290 place count 49 transition count 103
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 292 place count 49 transition count 103
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 294 place count 49 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 296 place count 48 transition count 100
Applied a total of 296 rules in 44 ms. Remains 48 /169 variables (removed 121) and now considering 100/342 (removed 242) transitions.
// Phase 1: matrix 100 rows 48 cols
[2025-06-02 13:10:03] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:03] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 13:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:10:03] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:10:03] [INFO ] Redundant transitions in 25 ms returned [38, 39, 88, 89, 91, 93]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 90 sub problems to find dead transitions.
// Phase 1: matrix 94 rows 48 cols
[2025-06-02 13:10:03] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:10:03] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:03] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:03] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:04] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/48 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:05] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:05] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:05] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:05] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:05] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 93/141 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/142 variables, and 79 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5202 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 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/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 93/141 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 90/169 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:10] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/142 variables, and 170 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5759 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10975ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 10975ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/169 places, 94/342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 48 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 45 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 45 transition count 89
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 2 with 1 rules applied. Total rules applied 9 place count 45 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 44 transition count 88
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 4 with 2 rules applied. Total rules applied 12 place count 43 transition count 87
Applied a total of 12 rules in 12 ms. Remains 43 /48 variables (removed 5) and now considering 87/94 (removed 7) transitions.
// Phase 1: matrix 87 rows 43 cols
[2025-06-02 13:10:14] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 13:10:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:10:14] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 43/169 places, 87/342 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 11388 ms. Remains : 43/169 places, 87/342 transitions.
[2025-06-02 13:10:14] [INFO ] Flatten gal took : 5 ms
[2025-06-02 13:10:14] [INFO ] Flatten gal took : 5 ms
[2025-06-02 13:10:14] [INFO ] Input system was already deterministic with 87 transitions.
[2025-06-02 13:10:14] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:10:14] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:10:14] [INFO ] Time to serialize gal into /tmp/CTLFireability15935786775343165964.gal : 1 ms
[2025-06-02 13:10:14] [INFO ] Time to serialize properties into /tmp/CTLFireability942385543309937334.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/CTLFireability15935786775343165964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability942385543309937334.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,6224,0.094169,5756,2,934,5,6695,5,0,260,5998,0


Converting to forward existential form...Done !
original formula: !(E((p98==1) U !(EF((((p88==1)&&(p159==1))||(((p17==1)&&(p33==1))&&(p195==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,(p98==1)) * !(E(TRUE U (((p88==1)&&(p159==1))||(((p17==1)&&(p33==1))&&(p195==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t8, t10, t12, t14, t17, t18, t20, t22, t24, t27, t28, t29, t60, t61, t64, t65, t76, t...257
Hit Full ! (commute/partial/dont) 84/0/3
(forward)formula 0,1,0.749371,20744,1,0,202,81690,199,98,2090,57786,208
FORMULA MedleyA-PT-16-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Graph (trivial) has 175 edges and 169 vertex of which 8 / 169 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 162 transition count 304
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 131 transition count 300
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 129 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 128 transition count 299
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 71 place count 128 transition count 291
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 87 place count 120 transition count 291
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 103 place count 104 transition count 260
Iterating global reduction 4 with 16 rules applied. Total rules applied 119 place count 104 transition count 260
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 126 place count 104 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 126 place count 104 transition count 252
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 103 transition count 252
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 5 with 34 rules applied. Total rules applied 162 place count 86 transition count 235
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 166 place count 82 transition count 224
Iterating global reduction 5 with 4 rules applied. Total rules applied 170 place count 82 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 183 place count 82 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 183 place count 82 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 187 place count 80 transition count 209
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 195 place count 76 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 75 transition count 204
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 81 edges and 73 vertex of which 26 / 73 are part of one of the 10 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 199 place count 57 transition count 204
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 241 place count 57 transition count 162
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 243 place count 55 transition count 145
Iterating global reduction 7 with 2 rules applied. Total rules applied 245 place count 55 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 285 place count 55 transition count 105
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 6 rules applied. Total rules applied 291 place count 55 transition count 99
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 297 place count 49 transition count 99
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 299 place count 47 transition count 94
Iterating global reduction 9 with 2 rules applied. Total rules applied 301 place count 47 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 305 place count 45 transition count 92
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 309 place count 45 transition count 88
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 311 place count 45 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 313 place count 43 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 313 place count 43 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 317 place count 41 transition count 84
Applied a total of 317 rules in 53 ms. Remains 41 /169 variables (removed 128) and now considering 84/342 (removed 258) transitions.
// Phase 1: matrix 84 rows 41 cols
[2025-06-02 13:10:15] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 13:10:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:10:15] [INFO ] Redundant transitions in 46 ms returned [83]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 78 sub problems to find dead transitions.
// Phase 1: matrix 83 rows 41 cols
[2025-06-02 13:10:15] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:15] [INFO ] Deduced a trap composed of 9 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-02 13:10:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:15] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:15] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:16] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:16] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:16] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:16] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:17] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 82/123 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/124 variables, and 55 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 82/123 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 78/133 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:21] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/124 variables, and 134 constraints, problems are : Problem set: 0 solved, 78 unsolved in 9502 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13783ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 13783ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/169 places, 83/342 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 81
Applied a total of 4 rules in 4 ms. Remains 39 /41 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 39 cols
[2025-06-02 13:10:29] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 13:10:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:29] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/169 places, 81/342 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 14200 ms. Remains : 39/169 places, 81/342 transitions.
[2025-06-02 13:10:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:10:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:10:29] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-02 13:10:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:10:29] [INFO ] Flatten gal took : 3 ms
[2025-06-02 13:10:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4382362771662213748.gal : 1 ms
[2025-06-02 13:10:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7837082131525755688.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/CTLFireability4382362771662213748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7837082131525755688.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,3209,0.086496,5880,2,959,5,6419,5,0,237,4722,0


Converting to forward existential form...Done !
original formula: A((((p18==1)&&(p181==1))&&(p190==1)) U !(AG(EF((p183!=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(E(TRUE U !(E(TRUE U (p183!=1)))))))))) * !(E(!(!(!(E(TRUE U !(E(TRUE U (p183!=1))))))) U (!...249
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t7, t9, t11, t14, t15, t17, t19, t21, t56, t58, t60, t62, Intersection with reachabl...226
(forward)formula 0,0,0.531904,15608,1,0,169,52788,182,81,2071,34909,173
FORMULA MedleyA-PT-16-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 154 transition count 316
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 154 transition count 316
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 37 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 153 transition count 308
Applied a total of 39 rules in 5 ms. Remains 153 /169 variables (removed 16) and now considering 308/342 (removed 34) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:10:30] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:30] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 13:10:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:30] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:10:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:36] [INFO ] Deduced a trap composed of 21 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-02 13:10:36] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:36] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:36] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:36] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:37] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:37] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:37] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:37] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:38] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:38] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:38] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:39] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:39] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:40] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:40] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:41] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:41] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:45] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:45] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:46] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:49] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:58] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:58] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:03] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:03] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:19] [INFO ] Deduced a trap along path composed of 2 places in 96 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:19] [INFO ] Deduced a trap along path composed of 2 places in 105 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:19] [INFO ] Deduced a trap along path composed of 17 places in 113 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:23] [INFO ] Deduced a trap along path composed of 16 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 153/169 places, 308/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 153/169 places, 308/342 transitions.
[2025-06-02 13:11:30] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:11:30] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:11:30] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 13:11:30] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:11:30] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:11:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16794193731821022124.gal : 4 ms
[2025-06-02 13:11:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17984066601119559406.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/CTLFireability16794193731821022124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17984066601119559406.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,5.44045e+06,1.35227,33140,2,8255,5,98462,6,0,922,124395,0


Converting to forward existential form...Done !
original formula: EX(AX((AG((((p50!=1)||(p116!=1))||(p190!=1))) * (EX((p179==0)) + AG(((p66==0)||(p159==0)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((!(E(TRUE U !((((p50!=1)||(p116!=1))||(p190!=1))))) * (EX((p179==0)) + !(E(TRUE U !(((p66==0...187
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
Detected timeout of ITS tools.
[2025-06-02 13:12:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:12:00] [INFO ] Applying decomposition
[2025-06-02 13:12:00] [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/graph12198386011059878716.txt' '-o' '/tmp/graph12198386011059878716.bin' '-w' '/tmp/graph12198386011059878716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12198386011059878716.bin' '-l' '-1' '-v' '-w' '/tmp/graph12198386011059878716.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:12:00] [INFO ] Decomposing Gal with order
[2025-06-02 13:12:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:12:00] [INFO ] Removed a total of 383 redundant transitions.
[2025-06-02 13:12:00] [INFO ] Flatten gal took : 38 ms
[2025-06-02 13:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 27 ms.
[2025-06-02 13:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7006801298675512392.gal : 5 ms
[2025-06-02 13:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15791344886499739770.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/CTLFireability7006801298675512392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15791344886499739770.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,5.44045e+06,0.169073,8516,504,19,8345,222,608,16422,43,730,0


Converting to forward existential form...Done !
original formula: EX(AX((AG((((i0.i1.u15.p50!=1)||(i2.u19.p116!=1))||(i0.i1.u63.p190!=1))) * (EX((i8.u60.p179==0)) + AG(((i3.u21.p66==0)||(i11.i0.u56.p159=...164
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((!(E(TRUE U !((((i0.i1.u15.p50!=1)||(i2.u19.p116!=1))||(i0.i1.u63.p190!=1))))) * (EX((i8.u60...239
Reverse transition relation is NOT exact ! Due to transitions t18, t29, t33, t75, t82, t86, t90, t96, t157, t159, t165, t167, t174, t175, t177, t178, t179,...740
(forward)formula 0,0,1.72723,51908,1,0,88305,222,3622,226706,177,730,209481
FORMULA MedleyA-PT-16-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Graph (trivial) has 184 edges and 169 vertex of which 13 / 169 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 158 transition count 300
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 127 transition count 296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 125 transition count 296
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 69 place count 125 transition count 288
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 85 place count 117 transition count 288
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 101 place count 101 transition count 257
Iterating global reduction 3 with 16 rules applied. Total rules applied 117 place count 101 transition count 257
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 124 place count 101 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 124 place count 101 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 100 transition count 249
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 4 with 34 rules applied. Total rules applied 160 place count 83 transition count 232
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 163 place count 80 transition count 223
Iterating global reduction 4 with 3 rules applied. Total rules applied 166 place count 80 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 177 place count 80 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 177 place count 80 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 181 place count 78 transition count 210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 187 place count 75 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 74 transition count 206
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 89 edges and 72 vertex of which 26 / 72 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 191 place count 56 transition count 206
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 233 place count 56 transition count 164
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 235 place count 54 transition count 147
Iterating global reduction 6 with 2 rules applied. Total rules applied 237 place count 54 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 6 with 43 rules applied. Total rules applied 280 place count 54 transition count 104
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 6 rules applied. Total rules applied 286 place count 54 transition count 98
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 292 place count 48 transition count 98
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 293 place count 47 transition count 95
Iterating global reduction 8 with 1 rules applied. Total rules applied 294 place count 47 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 298 place count 45 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 301 place count 45 transition count 90
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 2 rules applied. Total rules applied 303 place count 45 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 305 place count 43 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 305 place count 43 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 307 place count 42 transition count 87
Applied a total of 307 rules in 47 ms. Remains 42 /169 variables (removed 127) and now considering 87/342 (removed 255) transitions.
// Phase 1: matrix 87 rows 42 cols
[2025-06-02 13:12:02] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:02] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 13:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:12:03] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:12:03] [INFO ] Redundant transitions in 27 ms returned [84, 86]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 81 sub problems to find dead transitions.
// Phase 1: matrix 85 rows 42 cols
[2025-06-02 13:12:03] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:12:03] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:03] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:03] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:03] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:03] [INFO ] Deduced a trap composed of 23 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-02 13:12:03] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:03] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:03] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/127 variables, and 71 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3535 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 84/126 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 81/152 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:08] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/127 variables, and 153 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4867 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8424ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 8424ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/169 places, 85/342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 40 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 39 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 39 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 39 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 38 transition count 80
Applied a total of 9 rules in 18 ms. Remains 38 /42 variables (removed 4) and now considering 80/85 (removed 5) transitions.
// Phase 1: matrix 80 rows 38 cols
[2025-06-02 13:12:11] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:11] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-02 13:12:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:12:11] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/169 places, 80/342 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8915 ms. Remains : 38/169 places, 80/342 transitions.
[2025-06-02 13:12:11] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:12:11] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:12:11] [INFO ] Input system was already deterministic with 80 transitions.
[2025-06-02 13:12:11] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:12:11] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:12:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5523239651134063698.gal : 1 ms
[2025-06-02 13:12:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14883350944602636061.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/ReachabilityCardinality5523239651134063698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14883350944602636061.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 4114 steps (912 resets) in 52 ms. (77 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-16-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 154 transition count 316
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 154 transition count 316
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 37 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 153 transition count 308
Applied a total of 39 rules in 7 ms. Remains 153 /169 variables (removed 16) and now considering 308/342 (removed 34) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:12:11] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:11] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 13:12:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:12] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:12:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:17] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:18] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:18] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:18] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:18] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:18] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:18] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:19] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:19] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:20] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:20] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:20] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:20] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:20] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:22] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:22] [INFO ] Deduced a trap composed of 87 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-02 13:12:22] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:23] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:27] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:27] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:28] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:31] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:39] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:39] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:45] [INFO ] Deduced a trap composed of 93 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:45] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:01] [INFO ] Deduced a trap along path composed of 2 places in 92 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:01] [INFO ] Deduced a trap along path composed of 2 places in 116 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:01] [INFO ] Deduced a trap along path composed of 17 places in 123 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:05] [INFO ] Deduced a trap along path composed of 16 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 153/169 places, 308/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60582 ms. Remains : 153/169 places, 308/342 transitions.
[2025-06-02 13:13:12] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:13:12] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:13:12] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 13:13:12] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:13:12] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:13:12] [INFO ] Time to serialize gal into /tmp/CTLFireability16926699725934514009.gal : 3 ms
[2025-06-02 13:13:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15330267469051719100.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/CTLFireability16926699725934514009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15330267469051719100.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,5.44045e+06,1.58386,33160,2,8255,5,98462,6,0,922,124395,0


Converting to forward existential form...Done !
original formula: EF(AG((EX(EX((((p17==0)||(p33==0))||(p195==0)))) * ((p73==0)||(p149==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EX(EX((((p17==0)||(p33==0))||(p195==0)))) * ((p73==0)||(p149==0)))))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,1,19.9991,429892,1,0,607,2.68868e+06,638,314,6975,1.79327e+06,693
FORMULA MedleyA-PT-16-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Graph (trivial) has 172 edges and 169 vertex of which 13 / 169 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 158 transition count 302
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 129 transition count 298
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 127 transition count 298
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 65 place count 127 transition count 290
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 119 transition count 290
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 95 place count 105 transition count 263
Iterating global reduction 3 with 14 rules applied. Total rules applied 109 place count 105 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 116 place count 105 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 116 place count 105 transition count 255
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 104 transition count 255
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 146 place count 90 transition count 241
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 88 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 88 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 163 place count 88 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 163 place count 88 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 86 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 173 place count 83 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 83 transition count 216
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 82 transition count 215
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 82 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 177 place count 82 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 81 transition count 213
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 85 edges and 79 vertex of which 24 / 79 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 181 place count 64 transition count 213
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 6 with 37 rules applied. Total rules applied 218 place count 64 transition count 176
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 219 place count 63 transition count 166
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 63 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 7 with 45 rules applied. Total rules applied 265 place count 63 transition count 121
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 7 with 4 rules applied. Total rules applied 269 place count 63 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 273 place count 59 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 277 place count 57 transition count 115
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 279 place count 57 transition count 113
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 281 place count 57 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 283 place count 55 transition count 111
Applied a total of 283 rules in 54 ms. Remains 55 /169 variables (removed 114) and now considering 111/342 (removed 231) transitions.
// Phase 1: matrix 111 rows 55 cols
[2025-06-02 13:13:32] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 13:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:13:32] [INFO ] Redundant transitions in 56 ms returned [45, 46, 47, 104, 105, 106, 108, 110]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 99 sub problems to find dead transitions.
// Phase 1: matrix 103 rows 55 cols
[2025-06-02 13:13:32] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:33] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:33] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:33] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:33] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:33] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:34] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 102/157 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:35] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/158 variables, and 68 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4987 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 102/157 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 99/167 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/157 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/158 variables, and 167 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7392 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12408ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 12408ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/169 places, 103/342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 55 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 52 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 52 transition count 99
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 52 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 51 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 51 transition count 98
Applied a total of 10 rules in 11 ms. Remains 51 /55 variables (removed 4) and now considering 98/103 (removed 5) transitions.
// Phase 1: matrix 98 rows 51 cols
[2025-06-02 13:13:45] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 13:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:45] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/169 places, 98/342 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 12895 ms. Remains : 51/169 places, 98/342 transitions.
[2025-06-02 13:13:45] [INFO ] Flatten gal took : 5 ms
[2025-06-02 13:13:45] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:13:45] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-02 13:13:45] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:13:45] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:13:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4760081507605969263.gal : 2 ms
[2025-06-02 13:13:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10881569920923278230.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/CTLFireability4760081507605969263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10881569920923278230.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,12266,0.131537,8264,2,1864,5,14729,5,0,303,12333,0


Converting to forward existential form...Done !
original formula: EF(AG((AG((((p188==1)||(p67==1))||(p142==1))) + EG((((p74==0)||(p131==0))&&(p174==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !((((p188==1)||(p67==1))||(p142==1))))) + EG((((p74==0)||(p131==0))...183
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t9, t15, t16, t18, t20, t22, t25, t26, t28, t30, t32, t39, t40, t41, t77, t78, t81, t...277
(forward)formula 0,0,0.848448,26324,1,0,207,104186,222,105,2438,75792,224
FORMULA MedleyA-PT-16-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 159 transition count 325
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 159 transition count 325
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 27 place count 159 transition count 318
Applied a total of 27 rules in 3 ms. Remains 159 /169 variables (removed 10) and now considering 318/342 (removed 24) transitions.
// Phase 1: matrix 318 rows 159 cols
[2025-06-02 13:13:46] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:46] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 13:13:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:46] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2025-06-02 13:13:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:51] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:51] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:51] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:51] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:52] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:52] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:52] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:52] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:52] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:53] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:53] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:53] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:53] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:54] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:54] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:54] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:54] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:56] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:57] [INFO ] Deduced a trap composed of 109 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-02 13:13:57] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:02] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:02] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:04] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 318/477 variables, 159/189 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:14] [INFO ] Deduced a trap composed of 95 places in 203 ms of which 35 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/477 variables, and 190 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/477 variables, 159/190 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 317/507 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:28] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:44] [INFO ] Deduced a trap along path composed of 2 places in 109 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:44] [INFO ] Deduced a trap along path composed of 16 places in 125 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:45] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 511 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 159/169 places, 318/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60377 ms. Remains : 159/169 places, 318/342 transitions.
[2025-06-02 13:14:46] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:14:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:14:46] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 13:14:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:14:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:14:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8951000107058871542.gal : 2 ms
[2025-06-02 13:14:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7311708574132138231.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/CTLFireability8951000107058871542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7311708574132138231.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,6.42709e+06,1.11581,28488,2,6441,5,79020,6,0,956,105581,0


Converting to forward existential form...Done !
original formula: EF(((p171==1) * (!(E((A(((p73==1)&&(p131==1)) U (p7==1)) * (p161==1)) U EG((p146==1)))) + A(AX((p24!=1)) U ((EG((p106==1)) + ((p101==1)&&...196
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (p171==1)) * !(E((!((E(!((p7==1)) U (!(((p73==1)&&(p131==1))) * !((p7==1)))) + EG(!((p7==1...643
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64,...605
(forward)formula 0,1,5.52181,124632,1,0,625,641622,673,305,7004,530166,687
FORMULA MedleyA-PT-16-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 154 transition count 316
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 154 transition count 316
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 37 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 153 transition count 308
Applied a total of 39 rules in 3 ms. Remains 153 /169 variables (removed 16) and now considering 308/342 (removed 34) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:14:52] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:14:52] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 13:14:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:14:52] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:14: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/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:58] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:58] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:58] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:58] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:59] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:59] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:59] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:59] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:00] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:00] [INFO ] Deduced a trap composed of 23 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-02 13:15:00] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:01] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:01] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:01] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:02] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:03] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:03] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:03] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:07] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:07] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:08] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:11] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:20] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:20] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:25] [INFO ] Deduced a trap composed of 93 places in 183 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:26] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:41] [INFO ] Deduced a trap along path composed of 2 places in 91 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:41] [INFO ] Deduced a trap along path composed of 2 places in 114 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:41] [INFO ] Deduced a trap along path composed of 17 places in 127 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:45] [INFO ] Deduced a trap along path composed of 16 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 153/169 places, 308/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60381 ms. Remains : 153/169 places, 308/342 transitions.
[2025-06-02 13:15:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:15:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:15:52] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 13:15:52] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:15:52] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:15:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4940280134439076769.gal : 2 ms
[2025-06-02 13:15:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1333342152116653983.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/CTLFireability4940280134439076769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1333342152116653983.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,5.44045e+06,1.3498,33208,2,8255,5,98462,6,0,922,124395,0


Converting to forward existential form...Done !
original formula: AG(E((EX((E((((p43==1)&&(p116==1))&&(p190==1)) U (((p12==1)&&(p35==1))&&(p192==1))) * E((p159==1) U (p193==1)))) + (p176==1)) U (!(EF((((...215
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EX((E((((p43==1)&&(p116==1))&&(p190==1)) U (((p12==1)&&(p35==1))&&(p192==1))) * E((p159...275
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,0,22.8657,521784,1,0,757,3.42717e+06,652,400,6976,2.35922e+06,844
FORMULA MedleyA-PT-16-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 342/342 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 155 transition count 318
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 155 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 154 transition count 310
Applied a total of 37 rules in 5 ms. Remains 154 /169 variables (removed 15) and now considering 310/342 (removed 32) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:16:15] [INFO ] Computed 7 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:16] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 13:16:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:16] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:16:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:21] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:22] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:22] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:22] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:22] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:22] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:22] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:23] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:23] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:23] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:23] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:24] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:24] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:24] [INFO ] Deduced a trap composed of 101 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:25] [INFO ] Deduced a trap composed of 31 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-02 13:16:25] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:25] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/178 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:34] [INFO ] Deduced a trap composed of 107 places in 164 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 179 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:49] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:49] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:51] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 309/491 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:14] [INFO ] Deduced a trap along path composed of 2 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:14] [INFO ] Deduced a trap along path composed of 17 places in 73 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:14] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 494 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 154/169 places, 310/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60390 ms. Remains : 154/169 places, 310/342 transitions.
[2025-06-02 13:17:16] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:17:16] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:17:16] [INFO ] Input system was already deterministic with 310 transitions.
[2025-06-02 13:17:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:17:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:17:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5642397572373857265.gal : 2 ms
[2025-06-02 13:17:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12223511952109504223.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/CTLFireability5642397572373857265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12223511952109504223.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.53227e+06,1.39262,33368,2,8114,5,98783,6,0,928,125365,0


Converting to forward existential form...Done !
original formula: EX(A(E(EF((p111==1)) U (p75==1)) U AG(EF(((p73==1)&&(p131==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(E(TRUE U ((p73==1)&&(p131==1)))))))))) * !(E(!(!(E(TRUE U !(E(TRUE U ((p73==1)...279
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...553
Detected timeout of ITS tools.
[2025-06-02 13:17:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:17:46] [INFO ] Applying decomposition
[2025-06-02 13:17:46] [INFO ] Flatten gal took : 5 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/graph11681045838351036740.txt' '-o' '/tmp/graph11681045838351036740.bin' '-w' '/tmp/graph11681045838351036740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11681045838351036740.bin' '-l' '-1' '-v' '-w' '/tmp/graph11681045838351036740.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:17:46] [INFO ] Decomposing Gal with order
[2025-06-02 13:17:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:17:46] [INFO ] Removed a total of 384 redundant transitions.
[2025-06-02 13:17:46] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:17:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 7 ms.
[2025-06-02 13:17:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15433867053486528301.gal : 3 ms
[2025-06-02 13:17:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8329520915700629320.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/CTLFireability15433867053486528301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8329520915700629320.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,5.53227e+06,0.487294,15028,796,20,20623,265,649,40450,46,769,0


Converting to forward existential form...Done !
original formula: EX(A(E(EF((i2.u26.p111==1)) U (i2.u24.p75==1)) U AG(EF(((i2.u23.p73==1)&&(i5.u43.p131==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(E(TRUE U ((i2.u23.p73==1)&&(i5.u43.p131==1)))))))))) * !(E(!(!(E(TRUE U !(E(TR...335
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t29, t33, t57, t58, t83, t86, t96, t103, t116, t117, t159, t161, t167, t169, t176, ...770
(forward)formula 0,0,10.8363,295216,1,0,406625,265,3535,1.91807e+06,184,769,738525
FORMULA MedleyA-PT-16-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2025-06-02 13:17:57] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:17:57] [INFO ] Flatten gal took : 6 ms
Total runtime 894353 ms.

BK_STOP 1748870277564

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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