Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 110K 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-15-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-15-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-15-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748867661925

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 12:34:24] [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 12:34:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:34:25] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2025-06-02 12:34:25] [INFO ] Transformed 192 places.
[2025-06-02 12:34:25] [INFO ] Transformed 475 transitions.
[2025-06-02 12:34:25] [INFO ] Found NUPN structural information;
[2025-06-02 12:34:25] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 374 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 89 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 166 transition count 434
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 166 transition count 434
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 63 place count 166 transition count 423
Applied a total of 63 rules in 73 ms. Remains 166 /192 variables (removed 26) and now considering 423/473 (removed 50) transitions.
// Phase 1: matrix 423 rows 166 cols
[2025-06-02 12:34:25] [INFO ] Computed 7 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:34:25] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-06-02 12:34:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:34:26] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-06-02 12:34:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:33] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:33] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:33] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:34] [INFO ] Deduced a trap composed of 89 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:34] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:34] [INFO ] Deduced a trap composed of 90 places in 238 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:35] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:36] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:36] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:36] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:37] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:37] [INFO ] Deduced a trap composed of 112 places in 217 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:37] [INFO ] Deduced a trap composed of 113 places in 206 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:38] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:41] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:41] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:42] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:42] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:42] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:47] [INFO ] Deduced a trap composed of 94 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:49] [INFO ] Deduced a trap composed of 111 places in 352 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:49] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 166/589 variables, and 29 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:01] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 423/589 variables, 166/196 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 422/618 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:15] [INFO ] Deduced a trap composed of 87 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:15] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 620 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Starting structural reductions in LTL mode, iteration 1 : 166/192 places, 423/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61535 ms. Remains : 166/192 places, 423/473 transitions.
Support contains 89 out of 166 places after structural reductions.
[2025-06-02 12:35:27] [INFO ] Flatten gal took : 75 ms
[2025-06-02 12:35:27] [INFO ] Flatten gal took : 53 ms
[2025-06-02 12:35:27] [INFO ] Input system was already deterministic with 423 transitions.
RANDOM walk for 40000 steps (8 resets) in 2562 ms. (15 steps per ms) remains 68/81 properties
BEST_FIRST walk for 4001 steps (8 resets) in 98 ms. (40 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 96 ms. (41 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 66/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 162 ms. (24 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 115 ms. (34 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 55 ms. (71 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 66 ms. (59 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
[2025-06-02 12:35:29] [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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 91/166 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:30] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:30] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 2/9 constraints. Problems are: Problem set: 5 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:30] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:31] [INFO ] Deduced a trap composed of 23 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 12:35:31] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/12 constraints. Problems are: Problem set: 5 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 423/589 variables, 166/178 constraints. Problems are: Problem set: 5 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 0/178 constraints. Problems are: Problem set: 5 solved, 60 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 178 constraints, problems are : Problem set: 5 solved, 60 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 60 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 60 unsolved
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 1 (OVERLAPS) 97/166 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 5/12 constraints. Problems are: Problem set: 7 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:35] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/13 constraints. Problems are: Problem set: 7 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 423/589 variables, 166/179 constraints. Problems are: Problem set: 7 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 58/237 constraints. Problems are: Problem set: 7 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:38] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:39] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 239 constraints, problems are : Problem set: 7 solved, 58 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 58/65 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10150ms problems are : Problem set: 7 solved, 58 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 423/423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 166 transition count 413
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 15 rules applied. Total rules applied 25 place count 156 transition count 408
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 151 transition count 408
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 30 place count 151 transition count 403
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 146 transition count 403
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 140 transition count 394
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 140 transition count 394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 140 transition count 393
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 139 transition count 393
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 76 place count 128 transition count 382
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 125 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 101 place count 125 transition count 375
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 123 transition count 386
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 123 transition count 381
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 115 place count 118 transition count 381
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 118 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 117 transition count 380
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 116 transition count 378
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 116 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 116 transition count 377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 115 transition count 376
Applied a total of 121 rules in 176 ms. Remains 115 /166 variables (removed 51) and now considering 376/423 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 115/166 places, 376/423 transitions.
RANDOM walk for 40000 steps (8 resets) in 878 ms. (45 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 81 ms. (48 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 55/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 53/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 49/52 properties
// Phase 1: matrix 376 rows 115 cols
[2025-06-02 12:35:40] [INFO ] Computed 7 invariants in 5 ms
[2025-06-02 12:35:40] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 58/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:41] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:41] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:41] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 376/491 variables, 115/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 128 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2767 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 58/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:44] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 376/491 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 49/178 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:35:46] [INFO ] Deduced a trap composed of 93 places in 197 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/491 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 179 constraints, problems are : Problem set: 0 solved, 49 unsolved in 10641 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13440ms problems are : Problem set: 0 solved, 49 unsolved
Parikh walk visited 29 properties in 12078 ms.
Support contains 28 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 376/376 transitions.
Graph (trivial) has 77 edges and 115 vertex of which 4 / 115 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 113 transition count 368
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 109 transition count 368
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 109 transition count 366
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 106 transition count 366
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 28 place count 92 transition count 337
Iterating global reduction 2 with 14 rules applied. Total rules applied 42 place count 92 transition count 337
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 51 edges and 92 vertex of which 4 / 92 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 50 place count 90 transition count 330
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 54 place count 90 transition count 326
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 56 place count 88 transition count 307
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 88 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 88 transition count 306
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 5 with 4 rules applied. Total rules applied 63 place count 86 transition count 304
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 87 place count 74 transition count 392
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 74 transition count 391
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 119 place count 74 transition count 360
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 121 place count 74 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 123 place count 72 transition count 358
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 124 place count 72 transition count 358
Applied a total of 124 rules in 77 ms. Remains 72 /115 variables (removed 43) and now considering 358/376 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 72/115 places, 358/376 transitions.
RANDOM walk for 40000 steps (8 resets) in 603 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
[2025-06-02 12:36:06] [INFO ] Flow matrix only has 343 transitions (discarded 15 similar events)
// Phase 1: matrix 343 rows 72 cols
[2025-06-02 12:36:06] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 12:36:06] [INFO ] State equation strengthened by 46 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 46/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 343/415 variables, 72/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 46/124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/415 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 124 constraints, problems are : Problem set: 0 solved, 17 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 46/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:07] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:07] [INFO ] Deduced a trap composed of 6 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 12:36:07] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 343/415 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 46/127 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 17/144 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:08] [INFO ] Deduced a trap composed of 17 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 12:36:08] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 146 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3533 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4115ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 884 ms.
Support contains 26 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 358/358 transitions.
Graph (trivial) has 18 edges and 72 vertex of which 2 / 72 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 70 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 70 transition count 354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 69 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 24 place count 69 transition count 334
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 69 transition count 334
Applied a total of 25 rules in 43 ms. Remains 69 /72 variables (removed 3) and now considering 334/358 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 69/72 places, 334/358 transitions.
RANDOM walk for 40000 steps (8 resets) in 286 ms. (139 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 11799 steps, run visited all 17 properties in 84 ms. (steps per millisecond=140 )
Probabilistic random walk after 11799 steps, saw 2377 distinct states, run finished after 90 ms. (steps per millisecond=131 ) properties seen :17
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-15-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 12:36:12] [INFO ] Flatten gal took : 25 ms
[2025-06-02 12:36:12] [INFO ] Flatten gal took : 28 ms
[2025-06-02 12:36:12] [INFO ] Input system was already deterministic with 423 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 385
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 385
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 59 place count 144 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 142 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 142 transition count 366
Applied a total of 63 rules in 19 ms. Remains 142 /166 variables (removed 24) and now considering 366/423 (removed 57) transitions.
// Phase 1: matrix 366 rows 142 cols
[2025-06-02 12:36:12] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:36:12] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 12:36:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:36:12] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 12:36: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/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:18] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:18] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:18] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:18] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:19] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:19] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:19] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:19] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:20] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:20] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:21] [INFO ] Deduced a trap composed of 40 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 12:36:21] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:21] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:21] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:21] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:24] [INFO ] Deduced a trap composed of 97 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 12:36:24] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:29] [INFO ] Deduced a trap composed of 95 places in 190 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:32] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:34] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 32 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:38] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:38] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 142/508 variables, and 29 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:36:46] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/508 variables, 142/172 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 365/537 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:07] [INFO ] Deduced a trap along path composed of 2 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:08] [INFO ] Deduced a trap along path composed of 15 places in 165 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:08] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 540 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 142/166 places, 366/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60445 ms. Remains : 142/166 places, 366/423 transitions.
[2025-06-02 12:37:12] [INFO ] Flatten gal took : 33 ms
[2025-06-02 12:37:12] [INFO ] Flatten gal took : 34 ms
[2025-06-02 12:37:12] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 12:37:12] [INFO ] Flatten gal took : 33 ms
[2025-06-02 12:37:13] [INFO ] Flatten gal took : 31 ms
[2025-06-02 12:37:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16951924965511569471.gal : 24 ms
[2025-06-02 12:37:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12155065906723873844.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16951924965511569471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12155065906723873844.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88658e+06,0.933939,22088,2,4568,5,51140,6,0,936,72307,0


Converting to forward existential form...Done !
original formula: AG(((A(((EF((p23==1)) + EX(((p94==1)&&(p134==1)))) + ((((p13==1)&&(p51==1))&&(p188==1))||((p71==1)&&(p157==1)))) U (p34==1)) + EX(AF((p16...189
=> equivalent forward existential formula: ([((((FwdU(((FwdU(Init,TRUE) * !(((p94==1)&&(p159==1)))) * !(EX(!(EG(!((p167==0))))))),!((p34==1))) * !((p34==1)...395
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t59,...542
(forward)formula 0,1,7.50185,181348,1,0,704,1.05739e+06,777,362,7906,665453,819
FORMULA MedleyA-PT-15-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 143 transition count 383
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 143 transition count 383
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 61 place count 143 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 141 transition count 364
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 141 transition count 364
Applied a total of 65 rules in 12 ms. Remains 141 /166 variables (removed 25) and now considering 364/423 (removed 59) transitions.
// Phase 1: matrix 364 rows 141 cols
[2025-06-02 12:37:20] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:37:20] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 12:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:37:21] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2025-06-02 12:37: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/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:27] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:27] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:27] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:27] [INFO ] Deduced a trap composed of 81 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 12:37:27] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:28] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:28] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:28] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:28] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:29] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:29] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:30] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:30] [INFO ] Deduced a trap composed of 17 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 12:37:30] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/162 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:40] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 3.0)
(t3 2.0)
(t4 3.0)
(t5 5.0)
(t6 1.0)
(t7 1.0)
(t8 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 163 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:54] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:37:57] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 364/505 variables, 141/165 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 363/528 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:08] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:08] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 530 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 141/166 places, 364/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60464 ms. Remains : 141/166 places, 364/423 transitions.
[2025-06-02 12:38:21] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:38:21] [INFO ] Flatten gal took : 28 ms
[2025-06-02 12:38:21] [INFO ] Input system was already deterministic with 364 transitions.
[2025-06-02 12:38:21] [INFO ] Flatten gal took : 22 ms
[2025-06-02 12:38:21] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:38:21] [INFO ] Time to serialize gal into /tmp/CTLFireability16301009739363016508.gal : 7 ms
[2025-06-02 12:38:21] [INFO ] Time to serialize properties into /tmp/CTLFireability46448411029978463.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/CTLFireability16301009739363016508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability46448411029978463.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.81482e+06,0.593531,20600,2,4314,5,47091,6,0,930,65677,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(((p61==0)||(p140==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(((p61==0)||(p140==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...508
(forward)formula 0,1,2.56728,68244,1,0,646,297937,750,334,7588,245642,758
FORMULA MedleyA-PT-15-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 384
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 384
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 58 place count 144 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 143 transition count 368
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 143 transition count 368
Applied a total of 60 rules in 14 ms. Remains 143 /166 variables (removed 23) and now considering 368/423 (removed 55) transitions.
// Phase 1: matrix 368 rows 143 cols
[2025-06-02 12:38:23] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:38:24] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 12:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:38:24] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-02 12:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:29] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:29] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:29] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:29] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:29] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:30] [INFO ] Deduced a trap composed of 39 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 12:38:30] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:30] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:30] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:31] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:31] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:31] [INFO ] Deduced a trap composed of 99 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:31] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:32] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:32] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:33] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:33] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:34] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:38] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/511 variables, 143/169 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 169 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:38:57] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:00] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:00] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/511 variables, 143/172 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 367/539 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:20] [INFO ] Deduced a trap along path composed of 2 places in 108 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:20] [INFO ] Deduced a trap along path composed of 6 places in 129 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:20] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 542 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 143/166 places, 368/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60505 ms. Remains : 143/166 places, 368/423 transitions.
[2025-06-02 12:39:24] [INFO ] Flatten gal took : 22 ms
[2025-06-02 12:39:24] [INFO ] Flatten gal took : 22 ms
[2025-06-02 12:39:24] [INFO ] Input system was already deterministic with 368 transitions.
[2025-06-02 12:39:24] [INFO ] Flatten gal took : 18 ms
[2025-06-02 12:39:24] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:39:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15167123353850852083.gal : 6 ms
[2025-06-02 12:39:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14946664011976029246.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/CTLFireability15167123353850852083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14946664011976029246.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88152e+06,0.908885,21220,2,4323,5,49031,6,0,942,69072,0


Converting to forward existential form...Done !
original formula: EX(EX((AG((((p71==0)||(p130==0))&&((p9==0)||(p113==0)))) * AF(EG((p146==0))))))
=> equivalent forward existential formula: [((EY(EY(Init)) * !(E(TRUE U !((((p71==0)||(p130==0))&&((p9==0)||(p113==0))))))) * !(EG(!(EG((p146==0))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t21, t22, t25, t26, t33, t34, t36, t38, t39, t41, t42, t45, t48, t50, t54, t58,...524
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.6663,238184,1,0,703,1.4613e+06,771,365,8031,911287,833
FORMULA MedleyA-PT-15-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 146 transition count 389
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 146 transition count 389
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 52 place count 146 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 144 transition count 373
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 144 transition count 373
Applied a total of 56 rules in 9 ms. Remains 144 /166 variables (removed 22) and now considering 373/423 (removed 50) transitions.
// Phase 1: matrix 373 rows 144 cols
[2025-06-02 12:39:36] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:39:36] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-02 12:39:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:39:36] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2025-06-02 12:39:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:43] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:43] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:43] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:43] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:44] [INFO ] Deduced a trap composed of 81 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 12:39:44] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:44] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:44] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:44] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:45] [INFO ] Deduced a trap composed of 95 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 12:39:45] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:45] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:46] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:46] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:46] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:46] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:48] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:49] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/517 variables, 144/169 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:39:58] [INFO ] Deduced a trap composed of 100 places in 198 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/517 variables, and 170 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:10] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/517 variables, 144/171 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 372/543 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:29] [INFO ] Deduced a trap along path composed of 2 places in 165 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:29] [INFO ] Deduced a trap along path composed of 2 places in 122 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:30] [INFO ] Deduced a trap along path composed of 6 places in 134 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:34] [INFO ] Deduced a trap along path composed of 14 places in 121 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 547 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 144/166 places, 373/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60626 ms. Remains : 144/166 places, 373/423 transitions.
[2025-06-02 12:40:36] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:40:36] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:40:37] [INFO ] Input system was already deterministic with 373 transitions.
[2025-06-02 12:40:37] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:40:37] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:40:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14629517196221320724.gal : 5 ms
[2025-06-02 12:40:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18439555313334182999.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/CTLFireability14629517196221320724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18439555313334182999.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91487e+06,1.17662,24692,2,4867,5,58595,6,0,951,81502,0


Converting to forward existential form...Done !
original formula: EF(((EF((p164==1)) + (AG(((p85==1)&&(p157==1))) * AX(((p100==1)&&(p156==1))))) + ((EX(E((p155==1) U (p132==1))) * EX(((p87==1)&&(p141==1)...173
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,TRUE),TRUE) * (p164==1))] != FALSE + [((FwdU(Init,TRUE) * !(E(TRUE U !(((p85==1)&&(p157==1)))...312
(forward)formula 0,1,1.29095,24692,1,0,6,58595,9,1,1820,81502,3
FORMULA MedleyA-PT-15-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 385
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 385
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 59 place count 144 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 142 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 142 transition count 366
Applied a total of 63 rules in 7 ms. Remains 142 /166 variables (removed 24) and now considering 366/423 (removed 57) transitions.
// Phase 1: matrix 366 rows 142 cols
[2025-06-02 12:40:38] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:40:38] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-02 12:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:40:38] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 12:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:46] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:46] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:47] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:47] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:47] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:47] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/161 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:57] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 162 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:11] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:12] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:12] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:15] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/508 variables, 142/166 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 365/531 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:34] [INFO ] Deduced a trap along path composed of 2 places in 151 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:35] [INFO ] Deduced a trap along path composed of 2 places in 120 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:35] [INFO ] Deduced a trap along path composed of 18 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 534 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 142/166 places, 366/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60559 ms. Remains : 142/166 places, 366/423 transitions.
[2025-06-02 12:41:38] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:41:39] [INFO ] Flatten gal took : 18 ms
[2025-06-02 12:41:39] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 12:41:39] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:41:39] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:41:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3220246360344437871.gal : 5 ms
[2025-06-02 12:41:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13148499778730595488.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/CTLFireability3220246360344437871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13148499778730595488.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(!(EX((p158==1))) U ((p100==1)&&(p124==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EX((p158==1)))) * ((p100==1)&&(p124==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t25, t26, t33, t34, t36, t39, t40, t43, t46, t48, t52, t56, t58, t64,...514
(forward)formula 0,1,7.23813,165204,1,0,852,653080,753,506,7632,877125,999
FORMULA MedleyA-PT-15-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Graph (trivial) has 180 edges and 166 vertex of which 9 / 166 are part of one of the 3 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 159 transition count 394
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 137 transition count 394
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 45 place count 137 transition count 387
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 59 place count 130 transition count 387
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 81 place count 108 transition count 347
Iterating global reduction 2 with 22 rules applied. Total rules applied 103 place count 108 transition count 347
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 117 place count 108 transition count 333
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 117 place count 108 transition count 331
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 106 transition count 331
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 145 place count 94 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 94 transition count 318
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 150 place count 90 transition count 307
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 90 transition count 307
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 165 place count 90 transition count 296
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 4 with 4 rules applied. Total rules applied 169 place count 88 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 87 transition count 293
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 104 edges and 85 vertex of which 31 / 85 are part of one of the 12 SCC in 1 ms
Free SCC test removed 19 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 173 place count 66 transition count 293
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 5 with 68 rules applied. Total rules applied 241 place count 66 transition count 225
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 245 place count 62 transition count 178
Iterating global reduction 6 with 4 rules applied. Total rules applied 249 place count 62 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 250 place count 62 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 252 place count 61 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 7 with 54 rules applied. Total rules applied 306 place count 61 transition count 122
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 310 place count 61 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 314 place count 57 transition count 118
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 315 place count 56 transition count 113
Iterating global reduction 9 with 1 rules applied. Total rules applied 316 place count 56 transition count 113
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 320 place count 54 transition count 111
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 322 place count 54 transition count 109
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 323 place count 54 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 324 place count 53 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 325 place count 53 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 327 place count 52 transition count 106
Applied a total of 327 rules in 130 ms. Remains 52 /166 variables (removed 114) and now considering 106/423 (removed 317) transitions.
// Phase 1: matrix 106 rows 52 cols
[2025-06-02 12:41:46] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:41:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 12:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:41:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 12:41:46] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:41:46] [INFO ] Redundant transitions in 36 ms returned [45, 46, 95, 96, 97, 101]
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 94 sub problems to find dead transitions.
// Phase 1: matrix 100 rows 52 cols
[2025-06-02 12:41:46] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 12:41:46] [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/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:47] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:47] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:47] [INFO ] Deduced a trap composed of 24 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 12:41:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:41:47] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 99/151 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/152 variables, and 80 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3659 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 99/151 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 94/174 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/152 variables, and 174 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5095 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8787ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 8788ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/166 places, 100/423 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 52 transition count 97
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 49 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 49 transition count 96
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 8 place count 48 transition count 96
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 10 place count 48 transition count 94
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 2 with 2 rules applied. Total rules applied 12 place count 48 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 14 place count 46 transition count 92
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 15 place count 46 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 45 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 45 transition count 91
Applied a total of 17 rules in 21 ms. Remains 45 /52 variables (removed 7) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 45 cols
[2025-06-02 12:41:55] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:41:55] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 12:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:41:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 12:41:55] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 45/166 places, 91/423 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 9424 ms. Remains : 45/166 places, 91/423 transitions.
[2025-06-02 12:41:55] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:41:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:41:55] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-02 12:41:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:41:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:41:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17400475545339628247.gal : 2 ms
[2025-06-02 12:41:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10740868069727473069.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/CTLFireability17400475545339628247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10740868069727473069.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,6310,0.153085,6696,2,1077,5,8453,5,0,272,8954,0


Converting to forward existential form...Done !
original formula: EF(AG(EF(((p161==1)||((p77==1)&&(p130==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U ((p161==1)||((p77==1)&&(p130==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t11, t13, t15, t17, t21, t22, t24, t26, t28, t35, t36, t37, t67, t68, t71, t72, t83,...264
(forward)formula 0,0,1.48165,31204,1,0,213,142334,200,105,2201,96033,228
FORMULA MedleyA-PT-15-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 146 transition count 389
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 146 transition count 389
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 55 place count 146 transition count 374
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 144 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 144 transition count 370
Applied a total of 59 rules in 10 ms. Remains 144 /166 variables (removed 22) and now considering 370/423 (removed 53) transitions.
// Phase 1: matrix 370 rows 144 cols
[2025-06-02 12:41:57] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:41:57] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-02 12:41:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:41:57] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-02 12:41:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:03] [INFO ] Deduced a trap composed of 20 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 12:42:03] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:03] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:03] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:03] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:03] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:03] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:04] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:04] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:05] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:05] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:05] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:05] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:06] [INFO ] Deduced a trap composed of 99 places in 188 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:06] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:08] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/514 variables, 144/167 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:18] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:19] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:20] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 170 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 370/514 variables, 144/170 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 369/539 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:40] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 540 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 144/166 places, 370/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60643 ms. Remains : 144/166 places, 370/423 transitions.
[2025-06-02 12:42:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:42:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:42:58] [INFO ] Input system was already deterministic with 370 transitions.
[2025-06-02 12:42:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:42:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:42:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13802686614189368358.gal : 3 ms
[2025-06-02 12:42:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6189138681318480160.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/CTLFireability13802686614189368358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6189138681318480160.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (A((E(E(AX(((p93==1)&&(p141==1))) U ((p100==1)&&(p162==1))) U ((AX((p14==1)) * (p106==1)) * (p157==1))) * (AX(!(((p99==1)&&(p163==1)))) +...320
=> equivalent forward existential formula: ((([((FwdU(Init,!(!(((p44==1)&&(p174==1))))) * !(!(((p44==1)&&(p174==1))))) * !(E(E(!(EX(!(((p93==1)&&(p141==1))...652
(forward)formula 0,0,1.20067,21984,1,0,13,52548,12,4,1937,71976,6
FORMULA MedleyA-PT-15-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 9 / 166 are part of one of the 3 SCC in 1 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 159 transition count 396
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 139 transition count 396
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 41 place count 139 transition count 389
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 132 transition count 389
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 79 place count 108 transition count 346
Iterating global reduction 2 with 24 rules applied. Total rules applied 103 place count 108 transition count 346
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 118 place count 108 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 118 place count 108 transition count 329
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 106 transition count 329
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 105 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 105 transition count 327
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 144 place count 95 transition count 317
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 93 transition count 310
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 93 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 162 place count 93 transition count 296
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 3 with 4 rules applied. Total rules applied 166 place count 91 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 90 transition count 293
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 100 edges and 88 vertex of which 27 / 88 are part of one of the 11 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 170 place count 72 transition count 293
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 227 place count 72 transition count 236
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 232 place count 67 transition count 179
Iterating global reduction 5 with 5 rules applied. Total rules applied 237 place count 67 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 239 place count 67 transition count 177
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 6 with 4 rules applied. Total rules applied 243 place count 65 transition count 175
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 284 place count 65 transition count 134
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 6 with 2 rules applied. Total rules applied 286 place count 65 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 288 place count 63 transition count 132
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 290 place count 61 transition count 126
Iterating global reduction 8 with 2 rules applied. Total rules applied 292 place count 61 transition count 126
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 296 place count 59 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 297 place count 59 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 298 place count 59 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 299 place count 58 transition count 122
Applied a total of 299 rules in 50 ms. Remains 58 /166 variables (removed 108) and now considering 122/423 (removed 301) transitions.
// Phase 1: matrix 122 rows 58 cols
[2025-06-02 12:42:59] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:42:59] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 12:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:42:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 12:42:59] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:42:59] [INFO ] Redundant transitions in 49 ms returned [53, 54, 56, 109, 111, 113, 115, 117, 119, 120]
Found 10 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 10 transitions
Redundant transitions reduction (with SMT) removed 10 transitions.
Running 105 sub problems to find dead transitions.
// Phase 1: matrix 112 rows 58 cols
[2025-06-02 12:42:59] [INFO ] Computed 5 invariants in 2 ms
[2025-06-02 12:42:59] [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/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:00] [INFO ] Deduced a trap composed of 10 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 12:43:00] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:00] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:00] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:01] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:01] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 111/169 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:04] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:04] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/169 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/169 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/170 variables, and 87 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7401 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 111/169 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 105/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/170 variables, and 192 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6675 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14096ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 14096ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/166 places, 112/423 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 55 transition count 109
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 55 transition count 107
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 55 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 54 transition count 106
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 53 transition count 105
Applied a total of 12 rules in 7 ms. Remains 53 /58 variables (removed 5) and now considering 105/112 (removed 7) transitions.
// Phase 1: matrix 105 rows 53 cols
[2025-06-02 12:43:13] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:43:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 12:43:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:43:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 12:43:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/166 places, 105/423 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 14610 ms. Remains : 53/166 places, 105/423 transitions.
[2025-06-02 12:43:13] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:43:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:43:13] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-02 12:43:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:43:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:43:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2023802009088205984.gal : 1 ms
[2025-06-02 12:43:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1037063855042701053.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/CTLFireability2023802009088205984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1037063855042701053.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,12966,0.104601,6636,2,1159,5,9499,5,0,317,9289,0


Converting to forward existential form...Done !
original formula: AF(EG((!(E((p182!=1) U ((p100==1)&&(p169==1)))) + EF(((p87==1)&&(p141==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E((p182!=1) U ((p100==1)&&(p169==1)))) + E(TRUE U ((p87==1)&&(p141==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t10, t13, t17, t20, t21, t23, t25, t27, t31, t32, t34, t36, t38, t45, t46, t47, t78, ...299
Fast SCC detection found an SCC at level 0
(forward)formula 0,1,2.45871,60604,1,0,382,317218,244,217,2485,270921,454
FORMULA MedleyA-PT-15-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 385
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 385
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 59 place count 144 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 142 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 142 transition count 366
Applied a total of 63 rules in 11 ms. Remains 142 /166 variables (removed 24) and now considering 366/423 (removed 57) transitions.
// Phase 1: matrix 366 rows 142 cols
[2025-06-02 12:43:16] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:43:16] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 12:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:43:16] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 12:43: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/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:23] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:23] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:23] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:23] [INFO ] Deduced a trap composed of 81 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 12:43:23] [INFO ] Deduced a trap composed of 81 places in 174 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:24] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:24] [INFO ] Deduced a trap composed of 92 places in 207 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:24] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:25] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:25] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:25] [INFO ] Deduced a trap composed of 95 places in 216 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:26] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:26] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:26] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:28] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:29] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:29] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:34] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:34] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:36] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:43:37] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/508 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 170 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 365/535 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:07] [INFO ] Deduced a trap along path composed of 2 places in 122 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:07] [INFO ] Deduced a trap along path composed of 2 places in 94 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:07] [INFO ] Deduced a trap along path composed of 6 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 538 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 142/166 places, 366/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60577 ms. Remains : 142/166 places, 366/423 transitions.
[2025-06-02 12:44:17] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:44:17] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:44:17] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 12:44:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:44:17] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:44:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8449114813884952066.gal : 2 ms
[2025-06-02 12:44:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4714975065018646919.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/CTLFireability8449114813884952066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4714975065018646919.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88172e+06,0.704376,22728,2,4683,5,52305,6,0,936,73211,0


Converting to forward existential form...Done !
original formula: A((AX(((p99==1)&&(p156==1))) * ((p103==1) + ((AG((p56==1)) * EX(((p85==1)&&(p134==1)))) * A((p30!=1) U (((p106==1)&&(p156==1))||(p43==1))...175
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p81==1)))))) * !(E(!(E(TRUE U (p81==1))) U (!((!(EX(!(((p99==1)&&(p156==1))))) * ((p1...409
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t59,...530
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,10.9,244580,1,0,719,1.48084e+06,777,381,8042,938118,875
FORMULA MedleyA-PT-15-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 385
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 385
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 59 place count 144 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 142 transition count 366
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 142 transition count 366
Applied a total of 63 rules in 7 ms. Remains 142 /166 variables (removed 24) and now considering 366/423 (removed 57) transitions.
// Phase 1: matrix 366 rows 142 cols
[2025-06-02 12:44:28] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:44:28] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 12:44:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:44:28] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 12:44:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:34] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:34] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:35] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:35] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:35] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:35] [INFO ] Deduced a trap composed of 82 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 12:44:35] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:36] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:36] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:36] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:37] [INFO ] Deduced a trap composed of 92 places in 203 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:37] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:37] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:37] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:38] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:38] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:44:38] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/166 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 166 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:02] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:05] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/508 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 365/533 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:20] [INFO ] Deduced a trap along path composed of 2 places in 99 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:20] [INFO ] Deduced a trap along path composed of 2 places in 102 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:20] [INFO ] Deduced a trap along path composed of 18 places in 96 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:23] [INFO ] Deduced a trap along path composed of 14 places in 53 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 537 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 142/166 places, 366/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60558 ms. Remains : 142/166 places, 366/423 transitions.
[2025-06-02 12:45:28] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:45:28] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:45:28] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 12:45:28] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:45:28] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:45:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12653706228788821008.gal : 4 ms
[2025-06-02 12:45:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1904347729556464929.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/CTLFireability12653706228788821008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1904347729556464929.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((((AG(AF(EG(((p100==1)&&(p130==1))))) + EX(TRUE)) + (!(E((p26==1) U ((p9==1)&&(p113==1)))) * ((p96==0)||(p130==0)))) * (AF((p14==1)) +...201
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((!(E(TRUE U !(!(EG(!(EG(((p100==1)&&(p130==1))))))))) + EX(TRUE)) + (!(E((p26==1) U ((p9=...464
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...520
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.00202,92824,1,0,664,439620,777,347,8066,319315,793
FORMULA MedleyA-PT-15-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 385
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 385
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 59 place count 144 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 143 transition count 368
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 143 transition count 368
Applied a total of 61 rules in 5 ms. Remains 143 /166 variables (removed 23) and now considering 368/423 (removed 55) transitions.
// Phase 1: matrix 368 rows 143 cols
[2025-06-02 12:45:32] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:45:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-02 12:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:45:33] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-02 12:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:37] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:37] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:37] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:37] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:37] [INFO ] Deduced a trap composed of 81 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 12:45:37] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:37] [INFO ] Deduced a trap composed of 37 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 12:45:38] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:38] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:38] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:39] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:39] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:39] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:39] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:42] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:42] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:42] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:43] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:47] [INFO ] Deduced a trap composed of 97 places in 185 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:48] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:48] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:50] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:45:51] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 368/511 variables, 143/173 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:02] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 174 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/511 variables, 143/174 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 367/541 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:16] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 542 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 143/166 places, 368/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60563 ms. Remains : 143/166 places, 368/423 transitions.
[2025-06-02 12:46:33] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:46:33] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:46:33] [INFO ] Input system was already deterministic with 368 transitions.
[2025-06-02 12:46:33] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:46:33] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:46:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10074038022388295754.gal : 7 ms
[2025-06-02 12:46:33] [INFO ] Time to serialize properties into /tmp/CTLFireability17505725572332725838.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/CTLFireability10074038022388295754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17505725572332725838.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.92166e+06,1.02128,22232,2,4656,5,51689,6,0,942,71940,0


Converting to forward existential form...Done !
original formula: E(((p84!=1) + AX((((EG((p74==1)) + !(EF((p36==1)))) + ((((p71==1)&&(p130==1))&&(p186==1))||((p71==1)&&(p134==1)))) + ((p166==1)||(((p67==...214
=> equivalent forward existential formula: [(FwdU(Init,((p84!=1) + !(EX(!((((EG((p74==1)) + !(E(TRUE U (p36==1)))) + ((((p71==1)&&(p130==1))&&(p186==1))||(...278
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t59,...553
(forward)formula 0,0,3.39398,68368,1,0,645,309201,753,336,7465,231723,743
FORMULA MedleyA-PT-15-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 385
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 385
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 56 place count 144 transition count 373
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 142 transition count 369
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 142 transition count 369
Applied a total of 60 rules in 5 ms. Remains 142 /166 variables (removed 24) and now considering 369/423 (removed 54) transitions.
// Phase 1: matrix 369 rows 142 cols
[2025-06-02 12:46:36] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:46:37] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-02 12:46:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:46:37] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-02 12:46:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:43] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:43] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:44] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:44] [INFO ] Deduced a trap composed of 81 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 12:46:44] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:44] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:44] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:45] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:45] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:46] [INFO ] Deduced a trap composed of 17 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 12:46:46] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:49] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:49] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:49] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:53] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:54] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:54] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:46:54] [INFO ] Deduced a trap composed of 98 places in 190 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 369/511 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:06] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 168 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 369/511 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 368/536 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:16] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:17] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 538 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 142/166 places, 369/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 142/166 places, 369/423 transitions.
[2025-06-02 12:47:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:47:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:47:37] [INFO ] Input system was already deterministic with 369 transitions.
[2025-06-02 12:47:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:47:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:47:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13234181437747624146.gal : 3 ms
[2025-06-02 12:47:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18058499432540344977.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/CTLFireability13234181437747624146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18058499432540344977.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84817e+06,0.855813,23836,2,4745,5,56105,6,0,939,77674,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(AX(E((p65==1) U (((p25==1)&&(p48==1))&&(p188==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!(EX(!(E((p65==1) U (((p25==1)&&(p48==1))&&(p188==1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...514
(forward)formula 0,0,5.36456,130352,1,0,903,764463,761,471,7635,525137,1027
FORMULA MedleyA-PT-15-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 145 transition count 386
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 145 transition count 386
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 57 place count 145 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 143 transition count 367
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 143 transition count 367
Applied a total of 61 rules in 6 ms. Remains 143 /166 variables (removed 23) and now considering 367/423 (removed 56) transitions.
// Phase 1: matrix 367 rows 143 cols
[2025-06-02 12:47:42] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:47:43] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 12:47:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:47:43] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 12:47:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:49] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:49] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:50] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:50] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:50] [INFO ] Deduced a trap composed of 81 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 12:47:50] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:51] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:51] [INFO ] Deduced a trap composed of 86 places in 199 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:51] [INFO ] Deduced a trap composed of 92 places in 194 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:51] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:52] [INFO ] Deduced a trap composed of 97 places in 191 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:52] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:52] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:47:55] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:48:00] [INFO ] Deduced a trap composed of 24 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 12:48:00] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/166 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 166 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/510 variables, 143/166 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 366/532 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:48:25] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:48:25] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:48:26] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 535 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 143/166 places, 367/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 143/166 places, 367/423 transitions.
[2025-06-02 12:48:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:48:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:48:43] [INFO ] Input system was already deterministic with 367 transitions.
[2025-06-02 12:48:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:48:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:48:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14968999152588822395.gal : 3 ms
[2025-06-02 12:48:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5639082423375932985.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/CTLFireability14968999152588822395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5639082423375932985.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((E((EX(((p31==1)&&(p117==1))) + !(EG((p38==1)))) U EX(EF((p167==1)))) + EG(AG(AX(((p85==1)&&(p130==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(E(TRUE U !(!(EX(!(((p85==1)&&(p130==1))))))))))) * !(E((EX(((p31==1)&&(p117==1))) + ...209
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...508
(forward)formula 0,0,10.329,207080,1,0,696,1.24406e+06,773,366,7894,811152,834
FORMULA MedleyA-PT-15-CTLFireability-2024-13 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 : 166/166 places, 423/423 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 145 transition count 386
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 145 transition count 386
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 57 place count 145 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 143 transition count 367
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 143 transition count 367
Applied a total of 61 rules in 6 ms. Remains 143 /166 variables (removed 23) and now considering 367/423 (removed 56) transitions.
// Phase 1: matrix 367 rows 143 cols
[2025-06-02 12:48:53] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:48:54] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 12:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:48:54] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 12:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:48:59] [INFO ] Deduced a trap composed of 20 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 12:48:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:00] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:00] [INFO ] Deduced a trap composed of 81 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 12:49:00] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:00] [INFO ] Deduced a trap composed of 39 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 12:49:00] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:01] [INFO ] Deduced a trap composed of 93 places in 205 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:01] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:01] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:02] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:02] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:04] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:05] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:09] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 367/510 variables, 143/165 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:21] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 166 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/510 variables, 143/166 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 366/532 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:49:37] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 533 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 143/166 places, 367/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60637 ms. Remains : 143/166 places, 367/423 transitions.
[2025-06-02 12:49:54] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:49:54] [INFO ] Flatten gal took : 24 ms
[2025-06-02 12:49:54] [INFO ] Input system was already deterministic with 367 transitions.
[2025-06-02 12:49:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:49:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:49:54] [INFO ] Time to serialize gal into /tmp/CTLFireability559402501205364435.gal : 3 ms
[2025-06-02 12:49:54] [INFO ] Time to serialize properties into /tmp/CTLFireability388163514051209122.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/CTLFireability559402501205364435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability388163514051209122.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84817e+06,0.825723,22868,2,4604,5,54907,6,0,941,74938,0


Converting to forward existential form...Done !
original formula: EF((A((p30!=1) U EX(AG(((p78==1)&&(p162==1))))) * ((AX(EF((p29==1))) + (p30==1)) + (((AX(E((p106==1) U (p164==1))) * (p78==1)) * ((p130==...235
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((E(!(EX(!(E(TRUE U !(((p78==1)&&(p162==1))))))) U (!((p30!=1)) * !(EX(!(E(TRUE U !(((p7...832
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t21, t22, t23, t25, t26, t33, t34, t36, t39, t40, t43, t46, t48, t52, t56, t58,...519
(forward)formula 0,0,6.93189,147848,1,0,972,845419,770,499,7912,597200,1096
FORMULA MedleyA-PT-15-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 423/423 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 148 transition count 391
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 148 transition count 391
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 48 place count 148 transition count 379
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 147 transition count 377
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 147 transition count 377
Applied a total of 50 rules in 6 ms. Remains 147 /166 variables (removed 19) and now considering 377/423 (removed 46) transitions.
// Phase 1: matrix 377 rows 147 cols
[2025-06-02 12:50:01] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:50:01] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 12:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:50:02] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2025-06-02 12:50:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:08] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:08] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:08] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:08] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:08] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:08] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:09] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:09] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:09] [INFO ] Deduced a trap composed of 83 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 12:50:10] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:10] [INFO ] Deduced a trap composed of 97 places in 210 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:10] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:11] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:11] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:11] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 377/524 variables, 147/169 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:22] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 33 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 2.0)
(t3 1.0)
(t4 1.0)
(t5 2.0)
(t6 1.0)
(t7 1.0)
(t8 1.0)
(t9 1.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 1.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 1.0)
(t57 1.0)
(t58 1.0)
(t59 0.0)
(t60 1.0)
(t61 1.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 1.0)
(t93 1.0)
(t94 0.0)
(t95 1.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 1.0)
(t110 1.0)
(t111 1.0)
(t112 1.0)
(t113 1.0)
(t114 1.0)
(t115 0.0)
(t116 1.0)
(t117 0.0)
(t118 2.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 1.0)
(t131 1.0)
(t132 1.0)
(t133 1.0)
(t134 0.0)
(t135 0.0)
(t136 1.0)
(t137 1.0)
(t138 1.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 1.0)
(t144 0.0)
(t145 1.0)
(t146 0.0)
(t147 1.0)
(t148 0.0)
(t149 0.0)
(t150 1.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 1.0)
(t180 0.0)
(t181 0.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 1.0)
(t189 1.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 1.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 0.0)
(t288 0.0)
(t289 0.0)
(t290 0.0)
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 0.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 0.0)
(t308 0.0)
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 0.0)
(t315 0.0)
(t316 0.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 0.0)
(t342 0.0)
(t343 0.0)
(t344 0.0)
(t345 0.0)
(t346 0.0)
(t347 0.0)
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 0.0)
(t353 0.0)
(t354 0.0)
(t355 0.0)
(t356 0.0)
(t357 0.0)
(t358 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/524 variables, and 170 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:35] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (OVERLAPS) 377/524 variables, 147/171 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 376/547 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:47] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:50:48] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 2/549 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 147/166 places, 377/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60459 ms. Remains : 147/166 places, 377/423 transitions.
[2025-06-02 12:51:02] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:51:02] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:51:02] [INFO ] Input system was already deterministic with 377 transitions.
[2025-06-02 12:51:02] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:51:02] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:51:02] [INFO ] Time to serialize gal into /tmp/CTLFireability163075413116890261.gal : 2 ms
[2025-06-02 12:51:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16526402400582003745.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/CTLFireability163075413116890261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16526402400582003745.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98158e+06,0.693708,21644,2,4369,5,50485,6,0,967,68234,0


Converting to forward existential form...Done !
original formula: !(E(((!(AF((((p71==1)&&(p124==1))||(p29==1)))) * (E((p97!=1) U (p107==1)) + AX((p70==1)))) + EG(((((((p11==1)&&(p39==1))&&((p188==1)&&(p1...269
=> equivalent forward existential formula: [(FwdU(Init,((!(!(EG(!((((p71==1)&&(p124==1))||(p29==1)))))) * (E((p97!=1) U (p107==1)) + !(EX(!((p70==1)))))) +...329
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t64,...541
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 12:51:32] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:51:32] [INFO ] Applying decomposition
[2025-06-02 12:51:32] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6050320198916498705.txt' '-o' '/tmp/graph6050320198916498705.bin' '-w' '/tmp/graph6050320198916498705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6050320198916498705.bin' '-l' '-1' '-v' '-w' '/tmp/graph6050320198916498705.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:51:32] [INFO ] Decomposing Gal with order
[2025-06-02 12:51:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:51:32] [INFO ] Removed a total of 534 redundant transitions.
[2025-06-02 12:51:32] [INFO ] Flatten gal took : 99 ms
[2025-06-02 12:51:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 27 ms.
[2025-06-02 12:51:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14374209164676091815.gal : 11 ms
[2025-06-02 12:51:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7732206213132886971.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/CTLFireability14374209164676091815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7732206213132886971.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98158e+06,0.467933,13820,547,30,17162,730,670,44158,65,2184,0


Converting to forward existential form...Done !
original formula: !(E(((!(AF((((i1.u22.p71==1)&&(i1.u39.p124==1))||(i11.i2.u2.p29==1)))) * (E((i4.u31.p97!=1) U (i6.u35.p107==1)) + AX((i1.u22.p70==1)))) +...431
=> equivalent forward existential formula: [(FwdU(Init,((!(!(EG(!((((i1.u22.p71==1)&&(i1.u39.p124==1))||(i11.i2.u2.p29==1)))))) * (E((i4.u31.p97!=1) U (i6....491
Reverse transition relation is NOT exact ! Due to transitions t8, t20, t23, t31, t34, t46, t56, t71, t76, t84, t87, t101, t107, t149, t151, t157, t159, i0....775
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,5.64013,151164,1,0,158942,730,4321,1.23768e+06,311,2184,328993
FORMULA MedleyA-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2025-06-02 12:51:38] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:51:38] [INFO ] Flatten gal took : 10 ms
Total runtime 1033727 ms.

BK_STOP 1748868698593

--------------------
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-15"
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-15, 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-174876524100210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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