Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 27K 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 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 84K 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 FireWire-PT-16-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-16-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748886659141

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 17:51:01] [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 17:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:51:02] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2025-06-02 17:51:02] [INFO ] Transformed 254 places.
[2025-06-02 17:51:02] [INFO ] Transformed 368 transitions.
[2025-06-02 17:51:02] [INFO ] Found NUPN structural information;
[2025-06-02 17:51:02] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 72 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 208 transition count 325
Iterating global reduction 1 with 43 rules applied. Total rules applied 89 place count 208 transition count 325
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 99 place count 198 transition count 315
Iterating global reduction 1 with 10 rules applied. Total rules applied 109 place count 198 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 198 transition count 314
Applied a total of 110 rules in 126 ms. Remains 198 /254 variables (removed 56) and now considering 314/368 (removed 54) transitions.
// Phase 1: matrix 314 rows 198 cols
[2025-06-02 17:51:02] [INFO ] Computed 4 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:51:03] [INFO ] Implicit Places using invariants in 554 ms returned []
[2025-06-02 17:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:51:03] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-02 17:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:12] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:12] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:12] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:13] [INFO ] Deduced a trap composed of 81 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:13] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:14] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 20 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:15] [INFO ] Deduced a trap composed of 95 places in 212 ms of which 32 ms to minimize.
Problem TDEAD297 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 7/11 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 314/512 variables, 198/209 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:25] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:25] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:25] [INFO ] Deduced a trap composed of 102 places in 226 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 3/212 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:29] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 40 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 1/213 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 213 constraints, problems are : Problem set: 11 solved, 302 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 11/15 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:37] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/16 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/16 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 314/512 variables, 198/214 constraints. Problems are: Problem set: 11 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 302/516 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 85 places in 190 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 95 places in 206 ms of which 29 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 3/519 constraints. Problems are: Problem set: 11 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:56] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:59] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 521 constraints, problems are : Problem set: 11 solved, 302 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 302/313 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 11 solved, 302 unsolved
Search for dead transitions found 11 dead transitions in 60392ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/254 places, 303/368 transitions.
Applied a total of 0 rules in 14 ms. Remains 198 /198 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61835 ms. Remains : 198/254 places, 303/368 transitions.
Support contains 72 out of 198 places after structural reductions.
[2025-06-02 17:52:04] [INFO ] Flatten gal took : 106 ms
[2025-06-02 17:52:04] [INFO ] Flatten gal took : 49 ms
[2025-06-02 17:52:04] [INFO ] Input system was already deterministic with 303 transitions.
Support contains 71 out of 198 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3399 ms. (11 steps per ms) remains 60/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 121 ms. (32 steps per ms) remains 56/60 properties
BEST_FIRST walk for 4002 steps (12 resets) in 74 ms. (53 steps per ms) remains 54/56 properties
BEST_FIRST walk for 4002 steps (10 resets) in 98 ms. (40 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 135 ms. (29 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (10 resets) in 95 ms. (41 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 51 ms. (76 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (10 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 57 ms. (68 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 49 ms. (80 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 45 ms. (86 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (10 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (12 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (10 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 60 ms. (65 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (11 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 45 ms. (87 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 100 ms. (39 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (9 resets) in 128 ms. (31 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (10 resets) in 43 ms. (90 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (10 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (13 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (9 resets) in 39 ms. (100 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (10 resets) in 38 ms. (102 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (8 resets) in 67 ms. (58 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (9 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (11 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (10 resets) in 50 ms. (78 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (10 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (9 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (11 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (9 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (9 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (10 resets) in 38 ms. (102 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (12 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (10 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (10 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (9 resets) in 72 ms. (54 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (9 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
// Phase 1: matrix 303 rows 198 cols
[2025-06-02 17:52:07] [INFO ] Computed 4 invariants in 10 ms
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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/165 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 12/177 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 285/462 variables, 177/181 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 12/474 variables, 7/188 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 8/482 variables, 4/192 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 8/490 variables, 4/196 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 9/499 variables, 4/200 constraints. Problems are: Problem set: 1 solved, 52 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 499/501 variables, and 200 constraints, problems are : Problem set: 1 solved, 52 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/198 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 52 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 115/165 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:12] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:12] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 11 ms to minimize.
Problem AtomicPropp4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:13] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:13] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 41 ms to minimize.
Problem AtomicPropp19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:13] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:13] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 47 ms to minimize.
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 6/9 constraints. Problems are: Problem set: 6 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:14] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/10 constraints. Problems are: Problem set: 6 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 12/177 variables, 1/11 constraints. Problems are: Problem set: 6 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:16] [INFO ] Deduced a trap composed of 85 places in 240 ms of which 40 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/12 constraints. Problems are: Problem set: 6 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 47 unsolved
SMT process timed out in 10067ms, After SMT, problems are : Problem set: 6 solved, 47 unsolved
Fused 47 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 303/303 transitions.
Graph (trivial) has 108 edges and 198 vertex of which 15 / 198 are part of one of the 3 SCC in 4 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 186 transition count 261
Reduce places removed 27 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 159 transition count 258
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 156 transition count 258
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 61 place count 156 transition count 248
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 81 place count 146 transition count 248
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 86 place count 141 transition count 242
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 141 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 141 transition count 241
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 140 transition count 241
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 125 place count 124 transition count 225
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 137 place count 118 transition count 263
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 148 place count 118 transition count 252
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 159 place count 107 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 107 transition count 251
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 107 transition count 251
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 107 transition count 251
Applied a total of 163 rules in 168 ms. Remains 107 /198 variables (removed 91) and now considering 251/303 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 107/198 places, 251/303 transitions.
RANDOM walk for 40000 steps (3734 resets) in 870 ms. (45 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4001 steps (108 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (112 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (120 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (108 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (113 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (120 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (112 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (115 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (108 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (108 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (116 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (114 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (106 resets) in 49 ms. (80 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (115 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (114 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (27 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (106 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (106 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (112 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (74 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (121 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (110 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (112 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (120 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (109 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (114 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (109 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (100 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (109 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (110 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (113 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (26 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (110 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (110 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (107 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (121 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (115 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (25 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (114 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (118 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (119 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (117 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (112 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (115 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (111 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
Finished probabilistic random walk after 51216 steps, run visited all 46 properties in 368 ms. (steps per millisecond=139 )
Probabilistic random walk after 51216 steps, saw 14939 distinct states, run finished after 376 ms. (steps per millisecond=136 ) properties seen :46
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-16-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 17:52:18] [INFO ] Flatten gal took : 34 ms
[2025-06-02 17:52:18] [INFO ] Flatten gal took : 36 ms
[2025-06-02 17:52:18] [INFO ] Input system was already deterministic with 303 transitions.
Support contains 57 out of 198 places (down from 64) after GAL structural reductions.
Computed a total of 28 stabilizing places and 30 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 184 transition count 288
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 184 transition count 288
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 178 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 178 transition count 270
Applied a total of 40 rules in 17 ms. Remains 178 /198 variables (removed 20) and now considering 270/303 (removed 33) transitions.
// Phase 1: matrix 270 rows 178 cols
[2025-06-02 17:52:18] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:52:18] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-02 17:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:52:19] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 17:52:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:24] [INFO ] Deduced a trap composed of 74 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 17:52:24] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:25] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 12 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:26] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 28 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:26] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 33 ms to minimize.
Problem TDEAD252 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:27] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/10 constraints. Problems are: Problem set: 15 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 270/448 variables, 178/188 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:35] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 36 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 1/189 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:42] [INFO ] Deduced a trap composed of 92 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 17:52:43] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:43] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 3/192 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 1.0)
(t18 1.0)
(t19 1.0)
(t20 1.0)
(t21 1.0)
(t22 2.0)
(t23 2.0)
(t24 0.0)
(t25 1.0)
(t26 1.0)
(t27 1.0)
(t28 1.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 1.0)
(t35 1.0)
(t36 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/448 variables, and 192 constraints, problems are : Problem set: 15 solved, 254 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:52] [INFO ] Deduced a trap composed of 57 places in 209 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:52] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/16 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:54] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:54] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/18 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:56] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:56] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 2/20 constraints. Problems are: Problem set: 15 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 270/448 variables, 178/198 constraints. Problems are: Problem set: 15 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 254/452 constraints. Problems are: Problem set: 15 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/452 constraints. Problems are: Problem set: 15 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 452 constraints, problems are : Problem set: 15 solved, 254 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 254/269 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 15 solved, 254 unsolved
Search for dead transitions found 15 dead transitions in 60078ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 178/198 places, 255/303 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60670 ms. Remains : 178/198 places, 255/303 transitions.
[2025-06-02 17:53:19] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:53:19] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:53:19] [INFO ] Input system was already deterministic with 255 transitions.
[2025-06-02 17:53:19] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:53:19] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:53:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17774029441040342294.gal : 12 ms
[2025-06-02 17:53:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9166244836927805425.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17774029441040342294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9166244836927805425.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.64552e+06,0.352811,11840,2,2096,5,22241,6,0,968,31963,0


Converting to forward existential form...Done !
original formula: AG((EG(((AX(((p32==0)||(p122==0))) + (p246==0)) + (p40==0))) + AG((p135==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG(((!(EX(!(((p32==0)||(p122==0))))) + (p246==0)) + (p40==0))))),TRUE) * !((p135==1)...166
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t28, t30, t36, t41, t46, t54, t67, t70, t83, t88, t92, t96, t98, t114, t121, t125, ...303
(forward)formula 0,1,8.0956,221924,1,0,577,1.41992e+06,538,321,6388,1.17291e+06,700
FORMULA FireWire-PT-16-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 182 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 182 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 174 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 173 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 173 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 172 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 172 transition count 263
Applied a total of 53 rules in 18 ms. Remains 172 /198 variables (removed 26) and now considering 263/303 (removed 40) transitions.
// Phase 1: matrix 263 rows 172 cols
[2025-06-02 17:53:27] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:53:27] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-02 17:53:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:53:28] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-02 17:53: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/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:33] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:33] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:34] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:34] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:34] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 12 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:35] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 27 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:36] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 33 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:36] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:37] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:37] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/186 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:45] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:46] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 188 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:01] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/189 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 247/436 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:11] [INFO ] Deduced a trap along path composed of 11 places in 61 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 1/437 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:24] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 438 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60089ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 60093ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/198 places, 248/303 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60550 ms. Remains : 172/198 places, 248/303 transitions.
[2025-06-02 17:54:28] [INFO ] Flatten gal took : 23 ms
[2025-06-02 17:54:28] [INFO ] Flatten gal took : 22 ms
[2025-06-02 17:54:28] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-02 17:54:28] [INFO ] Flatten gal took : 22 ms
[2025-06-02 17:54:28] [INFO ] Flatten gal took : 22 ms
[2025-06-02 17:54:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14066554451598985050.gal : 7 ms
[2025-06-02 17:54:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14231424983885386802.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/CTLFireability14066554451598985050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14231424983885386802.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.5349e+06,0.458932,11840,2,2040,5,21898,6,0,937,30031,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.485559,11840,1,0,6,21898,7,1,1226,30031,1
FORMULA FireWire-PT-16-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 185 transition count 289
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 185 transition count 289
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 179 transition count 282
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 179 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 179 transition count 281
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 178 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 178 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 177 transition count 279
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 177 transition count 279
Applied a total of 43 rules in 24 ms. Remains 177 /198 variables (removed 21) and now considering 279/303 (removed 24) transitions.
// Phase 1: matrix 279 rows 177 cols
[2025-06-02 17:54:28] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:54:29] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-02 17:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:54:29] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2025-06-02 17:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:34] [INFO ] Deduced a trap composed of 74 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 17:54:34] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:34] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:35] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:35] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 12 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:36] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 16 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:36] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 33 ms to minimize.
Problem TDEAD261 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/11 constraints. Problems are: Problem set: 18 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 18 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 279/456 variables, 177/188 constraints. Problems are: Problem set: 18 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:43] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:44] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 2/190 constraints. Problems are: Problem set: 18 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/190 constraints. Problems are: Problem set: 18 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/456 variables, and 190 constraints, problems are : Problem set: 18 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 9/13 constraints. Problems are: Problem set: 18 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:02] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/14 constraints. Problems are: Problem set: 18 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:05] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/15 constraints. Problems are: Problem set: 18 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/15 constraints. Problems are: Problem set: 18 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 279/456 variables, 177/192 constraints. Problems are: Problem set: 18 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 260/452 constraints. Problems are: Problem set: 18 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:12] [INFO ] Deduced a trap composed of 47 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 17:55:13] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 2/454 constraints. Problems are: Problem set: 18 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:24] [INFO ] Deduced a trap along path composed of 72 places in 111 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 455 constraints, problems are : Problem set: 18 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 260/278 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60060ms problems are : Problem set: 18 solved, 260 unsolved
Search for dead transitions found 18 dead transitions in 60062ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 177/198 places, 261/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60483 ms. Remains : 177/198 places, 261/303 transitions.
[2025-06-02 17:55:29] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:55:29] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:55:29] [INFO ] Input system was already deterministic with 261 transitions.
[2025-06-02 17:55:29] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:55:29] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:55:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2492023156645196936.gal : 4 ms
[2025-06-02 17:55:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17765302692249758785.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/CTLFireability2492023156645196936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17765302692249758785.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.64202e+06,0.369752,13652,2,2388,5,26154,6,0,970,38394,0


Converting to forward existential form...Done !
original formula: (A(!((E(((p62==1)&&(p125==1)) U !(((p153==1)||(p33==1)))) * (p170==1))) U EG((p63==1))) + ((AX(AG(((p62==0)||(p149==0)))) * EF(((A(((p70=...315
=> equivalent forward existential formula: (([(FwdU(EY((Init * !(!((E(!(EG((p63==1))) U (!(!((E(((p62==1)&&(p125==1)) U !(((p153==1)||(p33==1)))) * (p170==...1166
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t47, t51, t54, t65, t68, t81, t82, t91, t95, t97, t98, t113, t1...301
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 17:55:59] [INFO ] Flatten gal took : 11 ms
[2025-06-02 17:55:59] [INFO ] Applying decomposition
[2025-06-02 17:55:59] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13478475142306235365.txt' '-o' '/tmp/graph13478475142306235365.bin' '-w' '/tmp/graph13478475142306235365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13478475142306235365.bin' '-l' '-1' '-v' '-w' '/tmp/graph13478475142306235365.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:55:59] [INFO ] Decomposing Gal with order
[2025-06-02 17:55:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:55:59] [INFO ] Removed a total of 191 redundant transitions.
[2025-06-02 17:55:59] [INFO ] Flatten gal took : 78 ms
[2025-06-02 17:55:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 18 ms.
[2025-06-02 17:55:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17245853241011915737.gal : 7 ms
[2025-06-02 17:55:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13608445871773012376.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/CTLFireability17245853241011915737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13608445871773012376.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64202e+06,0.292991,9124,420,186,7548,3379,633,14183,155,10110,0


Converting to forward existential form...Done !
original formula: (A(!((E(((i3.u2.p62==1)&&(i3.u28.p125==1)) U !(((i8.u40.p153==1)||(i4.i0.u9.p33==1)))) * (i7.u39.p170==1))) U EG((i3.u2.p63==1))) + ((AX(...476
=> equivalent forward existential formula: (([(FwdU(EY((Init * !(!((E(!(EG((i3.u2.p63==1))) U (!(!((E(((i3.u2.p62==1)&&(i3.u28.p125==1)) U !(((i8.u40.p153=...1635
Reverse transition relation is NOT exact ! Due to transitions t82, t121, t142, t150, t250, t257, i2.t127, i2.i0.u3.t140, i3.u13.t113, i4.t126, i4.i1.u30.t9...444
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 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
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 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.24066,133412,1,0,201412,5325,3663,374575,796,17280,420817
FORMULA FireWire-PT-16-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Graph (trivial) has 165 edges and 198 vertex of which 18 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 182 transition count 240
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 136 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 135 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 97 place count 135 transition count 224
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 123 place count 122 transition count 224
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 131 place count 114 transition count 214
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 114 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 139 place count 114 transition count 213
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 113 transition count 213
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 112 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 112 transition count 210
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 165 place count 101 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 100 transition count 189
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 100 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 100 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 99 transition count 187
Applied a total of 169 rules in 40 ms. Remains 99 /198 variables (removed 99) and now considering 187/303 (removed 116) transitions.
[2025-06-02 17:56:05] [INFO ] Flow matrix only has 184 transitions (discarded 3 similar events)
// Phase 1: matrix 184 rows 99 cols
[2025-06-02 17:56:05] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:56:05] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 17:56:05] [INFO ] Flow matrix only has 184 transitions (discarded 3 similar events)
[2025-06-02 17:56:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:56:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-02 17:56:05] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:56:05] [INFO ] Redundant transitions in 15 ms returned []
Running 182 sub problems to find dead transitions.
[2025-06-02 17:56:05] [INFO ] Flow matrix only has 184 transitions (discarded 3 similar events)
[2025-06-02 17:56:05] [INFO ] Invariant cache hit.
[2025-06-02 17:56:05] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:06] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:06] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:07] [INFO ] Deduced a trap composed of 22 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 17:56:07] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 10 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:07] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 8 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:07] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 13 ms to minimize.
Problem TDEAD147 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:07] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:08] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:08] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 183/281 variables, 98/111 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 11/122 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 1/282 variables, 1/123 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/123 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/123 constraints. Problems are: Problem set: 15 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/283 variables, and 123 constraints, problems are : Problem set: 15 solved, 167 unsolved in 16644 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 183/281 variables, 98/111 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 11/122 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 167/289 constraints. Problems are: Problem set: 15 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:27] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 1/290 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/290 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 1/282 variables, 1/291 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/291 constraints. Problems are: Problem set: 15 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/291 constraints. Problems are: Problem set: 15 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/283 variables, and 291 constraints, problems are : Problem set: 15 solved, 167 unsolved in 23699 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 167/182 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40414ms problems are : Problem set: 15 solved, 167 unsolved
Search for dead transitions found 15 dead transitions in 40416ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 99/198 places, 172/303 transitions.
Applied a total of 0 rules in 12 ms. Remains 99 /99 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:56:46] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 40891 ms. Remains : 99/198 places, 172/303 transitions.
[2025-06-02 17:56:46] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:56:46] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:56:46] [INFO ] Input system was already deterministic with 172 transitions.
[2025-06-02 17:56:46] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:56:46] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:56:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15761551363267012907.gal : 1 ms
[2025-06-02 17:56:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality701382213295660927.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15761551363267012907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality701382213295660927.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (3897 resets) in 393 ms. (101 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality701382213295660927.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
BEST_FIRST walk for 40003 steps (1251 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 40
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :40 after 94
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :717 after 1475
Reachability property FireWire-PT-16-CTLFireability-2025-04 is true.
FORMULA FireWire-PT-16-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2510,0.117442,5316,2,582,14,3675,6,0,566,2598,0
Total reachable state count : 2510

Verifying 1 reachability properties.
Reachability property FireWire-PT-16-CTLFireability-2025-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-16-CTLFireability-2025-04,1,0.11872,5316,2,100,14,3675,7,0,572,2598,0
Finished probabilistic random walk after 17848 steps, run visited all 1 properties in 103 ms. (steps per millisecond=173 )
Probabilistic random walk after 17848 steps, saw 5062 distinct states, run finished after 104 ms. (steps per millisecond=171 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 183 transition count 287
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 183 transition count 287
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 176 transition count 268
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 176 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 176 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 175 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 175 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 174 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 174 transition count 265
Applied a total of 49 rules in 17 ms. Remains 174 /198 variables (removed 24) and now considering 265/303 (removed 38) transitions.
// Phase 1: matrix 265 rows 174 cols
[2025-06-02 17:56:46] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:56:46] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-02 17:56:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:56:46] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-02 17:56:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:52] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:52] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:53] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:53] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 39 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:54] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 28 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:54] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 30 ms to minimize.
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/184 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:01] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:01] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:02] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:02] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 4/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:14] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:14] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 190 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:20] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 265/439 variables, 174/191 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 249/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:26] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:27] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:27] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 3/443 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:39] [INFO ] Deduced a trap along path composed of 11 places in 47 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 444 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60065ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 60066ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/198 places, 250/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60638 ms. Remains : 174/198 places, 250/303 transitions.
[2025-06-02 17:57:47] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:57:47] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:57:47] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 17:57:47] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:57:47] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:57:47] [INFO ] Time to serialize gal into /tmp/CTLFireability4330264421242718364.gal : 3 ms
[2025-06-02 17:57:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6627654535667852742.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/CTLFireability4330264421242718364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6627654535667852742.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.55904e+06,0.448934,11624,2,2248,5,22177,6,0,947,33292,0


Converting to forward existential form...Done !
original formula: EX(((p60==1) + EF((AX(((p57==1)&&(p169==1))) + AX((p47==1))))))
=> equivalent forward existential formula: ([(EY(Init) * (p60==1))] != FALSE + ([(FwdU(EY(Init),TRUE) * !(EX(!(((p57==1)&&(p169==1))))))] != FALSE + [(FwdU...204
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t59, t63, t66, t79, t84, t88, t92, t94, t99, t111, t1...307
(forward)formula 0,1,2.3619,55580,1,0,410,200379,518,229,6307,224495,510
FORMULA FireWire-PT-16-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 182 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 182 transition count 286
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 175 transition count 276
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 175 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 175 transition count 275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 174 transition count 274
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 174 transition count 274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 173 transition count 273
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 173 transition count 273
Applied a total of 51 rules in 11 ms. Remains 173 /198 variables (removed 25) and now considering 273/303 (removed 30) transitions.
// Phase 1: matrix 273 rows 173 cols
[2025-06-02 17:57:49] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:57:49] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 17:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:57:49] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-06-02 17:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:55] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:56] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:56] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:56] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:56] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 33 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/9 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 273/446 variables, 173/182 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:04] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:05] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 2/184 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/184 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/446 variables, and 184 constraints, problems are : Problem set: 15 solved, 257 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:23] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/12 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:25] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 273/446 variables, 173/186 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 257/443 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:32] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:32] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 24 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 2/445 constraints. Problems are: Problem set: 15 solved, 257 unsolved
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 446/446 variables, and 445 constraints, problems are : Problem set: 15 solved, 257 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 257/272 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 15 solved, 257 unsolved
Search for dead transitions found 15 dead transitions in 60085ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/198 places, 258/303 transitions.
Applied a total of 0 rules in 4 ms. Remains 173 /173 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60543 ms. Remains : 173/198 places, 258/303 transitions.
[2025-06-02 17:58:50] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:58:50] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:58:50] [INFO ] Input system was already deterministic with 258 transitions.
[2025-06-02 17:58:50] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:58:50] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:58:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15653927001187225713.gal : 4 ms
[2025-06-02 17:58:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13424271893451767186.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/CTLFireability15653927001187225713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13424271893451767186.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.56262e+06,0.423641,10788,2,2013,5,19218,6,0,951,25151,0


Converting to forward existential form...Done !
original formula: EF(((((p70==1)&&(p101==1)) + ((AG(((p232==1)||((p74==1)&&(p187==1)))) * (p57==1)) * (p149==1))) + ((EX(((p54==1)&&(p169==1))) * (p62==1))...170
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * ((p70==1)&&(p101==1)))] != FALSE + [(((FwdU(Init,TRUE) * (p149==1)) * (p57==1)) * !(E(TRUE...296
(forward)formula 0,1,0.427492,11044,1,0,7,19218,8,1,957,25151,1
FORMULA FireWire-PT-16-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 182 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 182 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 174 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 173 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 173 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 172 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 172 transition count 263
Applied a total of 53 rules in 16 ms. Remains 172 /198 variables (removed 26) and now considering 263/303 (removed 40) transitions.
// Phase 1: matrix 263 rows 172 cols
[2025-06-02 17:58:50] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:58:50] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-06-02 17:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:58:51] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-02 17:58:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:56] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:56] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:57] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:57] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:57] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 12 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:58] [INFO ] Deduced a trap composed of 74 places in 158 ms of which 27 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:59] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 33 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:59] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:00] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:00] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/186 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:08] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:09] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 188 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:24] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/189 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 247/436 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:36] [INFO ] Deduced a trap along path composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 1/437 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:48] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 438 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60076ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 60078ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/198 places, 248/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60673 ms. Remains : 172/198 places, 248/303 transitions.
[2025-06-02 17:59:51] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:59:51] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:59:51] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-02 17:59:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:59:51] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:59:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5307639282810487195.gal : 3 ms
[2025-06-02 17:59:51] [INFO ] Time to serialize properties into /tmp/CTLFireability10055763841758277402.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/CTLFireability5307639282810487195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10055763841758277402.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.5349e+06,0.466439,11852,2,2040,5,21898,6,0,937,30031,0


Converting to forward existential form...Done !
original formula: (AG((E(!(((p32==1)&&(p136==1))) U EX(((p32==1)&&(p140==1)))) + AG(!(A((p142==1) U ((p50==1)&&(p136==1))))))) + AF(AG(((p32==1)&&(p128==1)...159
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !((E(!(((p32==1)&&(p136==1))) U EX(((p32==1)&&(p140==1)))) + !(E(TRUE U !(!(!((E(!(((...314
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t84, t88, t92, t94, t110, t118, t123, ...297
Detected timeout of ITS tools.
[2025-06-02 18:00:21] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:00:21] [INFO ] Applying decomposition
[2025-06-02 18:00:21] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16151402525010887081.txt' '-o' '/tmp/graph16151402525010887081.bin' '-w' '/tmp/graph16151402525010887081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16151402525010887081.bin' '-l' '-1' '-v' '-w' '/tmp/graph16151402525010887081.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:00:21] [INFO ] Decomposing Gal with order
[2025-06-02 18:00:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:00:21] [INFO ] Removed a total of 159 redundant transitions.
[2025-06-02 18:00:21] [INFO ] Flatten gal took : 33 ms
[2025-06-02 18:00:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 10 ms.
[2025-06-02 18:00:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7486843163549978369.gal : 6 ms
[2025-06-02 18:00:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8537132551664377257.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/CTLFireability7486843163549978369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8537132551664377257.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5349e+06,0.18898,9528,395,224,7540,4499,595,13481,163,15434,0


Converting to forward existential form...Done !
original formula: (AG((E(!(((i1.i0.u5.p32==1)&&(i5.u29.p136==1))) U EX(((i1.i0.u5.p32==1)&&(i5.u30.p140==1)))) + AG(!(A((i5.u31.p142==1) U ((i4.u10.p50==1)...228
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !((E(!(((i1.i0.u5.p32==1)&&(i5.u29.p136==1))) U EX(((i1.i0.u5.p32==1)&&(i5.u30.p140==...411
Reverse transition relation is NOT exact ! Due to transitions t50, t118, t124, t137, t149, t237, t241, t244, i1.t123, i1.i1.u28.t92, i2.u13.t139, i2.u20.t8...419
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,2.76189,82232,1,0,117112,17633,4010,278796,990,52591,265712
FORMULA FireWire-PT-16-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 184 transition count 288
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 184 transition count 288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 179 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 179 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 179 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 178 transition count 279
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 178 transition count 279
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 177 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 177 transition count 278
Applied a total of 43 rules in 8 ms. Remains 177 /198 variables (removed 21) and now considering 278/303 (removed 25) transitions.
// Phase 1: matrix 278 rows 177 cols
[2025-06-02 18:00:24] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:00:24] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-02 18:00:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:00:24] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2025-06-02 18:00: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/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:30] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:30] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:31] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:31] [INFO ] Deduced a trap composed of 49 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 18:00:32] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 39 ms to minimize.
Problem TDEAD150 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:33] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 23 ms to minimize.
Problem TDEAD260 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:34] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:34] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/12 constraints. Problems are: Problem set: 15 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 278/455 variables, 177/189 constraints. Problems are: Problem set: 15 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:43] [INFO ] Deduced a trap composed of 60 places in 167 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:44] [INFO ] Deduced a trap composed of 94 places in 177 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 2/191 constraints. Problems are: Problem set: 15 solved, 262 unsolved
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: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/455 variables, and 191 constraints, problems are : Problem set: 15 solved, 262 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:57] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/15 constraints. Problems are: Problem set: 15 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 278/455 variables, 177/192 constraints. Problems are: Problem set: 15 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 262/454 constraints. Problems are: Problem set: 15 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:06] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:06] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:06] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:07] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 4/458 constraints. Problems are: Problem set: 15 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:13] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/459 constraints. Problems are: Problem set: 15 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 459 constraints, problems are : Problem set: 15 solved, 262 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 262/277 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 15 solved, 262 unsolved
Search for dead transitions found 15 dead transitions in 60070ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 177/198 places, 263/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60655 ms. Remains : 177/198 places, 263/303 transitions.
[2025-06-02 18:01:25] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:01:25] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:01:25] [INFO ] Input system was already deterministic with 263 transitions.
[2025-06-02 18:01:25] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:01:25] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:01:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17270292454857815246.gal : 3 ms
[2025-06-02 18:01:25] [INFO ] Time to serialize properties into /tmp/CTLFireability18125243421037259181.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/CTLFireability17270292454857815246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18125243421037259181.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.60117e+06,0.566889,13856,2,2260,5,28560,6,0,972,36840,0


Converting to forward existential form...Done !
original formula: E((EF((p221==1)) + AG(((((AF((p209==1)) + ((p10==1)&&(p103==1))) + (p233==1)) * (p139==1)) + A(((p232==1)&&(p135==1)) U (p151!=1))))) U (...296
=> equivalent forward existential formula: ([(EY(FwdU((FwdU(Init,(E(TRUE U (p221==1)) + !(E(TRUE U !(((((!(EG(!((p209==1)))) + ((p10==1)&&(p103==1))) + (p2...748
Reverse transition relation is NOT exact ! Due to transitions t18, t21, t22, t26, t28, t34, t38, t39, t44, t48, t53, t54, t55, t68, t71, t84, t89, t93, t97...322
Using saturation style SCC detection
(forward)formula 0,0,16.7977,448676,1,0,892,2.87565e+06,556,476,6489,2.77431e+06,1068
FORMULA FireWire-PT-16-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 183 transition count 287
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 183 transition count 287
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 177 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 177 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 177 transition count 277
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 176 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 176 transition count 276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 175 transition count 275
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 175 transition count 275
Applied a total of 47 rules in 8 ms. Remains 175 /198 variables (removed 23) and now considering 275/303 (removed 28) transitions.
// Phase 1: matrix 275 rows 175 cols
[2025-06-02 18:01:42] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:01:42] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 18:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:01:42] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-02 18:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:48] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:48] [INFO ] Deduced a trap composed of 74 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 18:01:48] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:49] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 10 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:50] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 23 ms to minimize.
Problem TDEAD257 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:51] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/10 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:55] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/11 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 275/450 variables, 175/186 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:02] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 1/187 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:06] [INFO ] Deduced a trap composed of 94 places in 195 ms of which 32 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 1/188 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 188 constraints, problems are : Problem set: 15 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:14] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:15] [INFO ] Deduced a trap composed of 58 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 18:02:16] [INFO ] Deduced a trap composed of 77 places in 203 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 3/16 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 275/450 variables, 175/191 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 259/450 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:23] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:24] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 2/452 constraints. Problems are: Problem set: 15 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:35] [INFO ] Deduced a trap along path composed of 10 places in 45 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 453 constraints, problems are : Problem set: 15 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 259/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60071ms problems are : Problem set: 15 solved, 259 unsolved
Search for dead transitions found 15 dead transitions in 60073ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/198 places, 260/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60462 ms. Remains : 175/198 places, 260/303 transitions.
[2025-06-02 18:02:42] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:02:42] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:02:42] [INFO ] Input system was already deterministic with 260 transitions.
[2025-06-02 18:02:42] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:02:42] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:02:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8964607132197673391.gal : 4 ms
[2025-06-02 18:02:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5622928968577318521.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/CTLFireability8964607132197673391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5622928968577318521.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.63679e+06,0.411725,10908,2,2027,5,19804,6,0,961,25684,0


Converting to forward existential form...Done !
original formula: EX((AX(EF((p19==1))) + A(EX((p94==1)) U EG(EF(((p49==1)&&(p125==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(E(TRUE U (p19==1))))))] != FALSE + [((EY(Init) * !(EG(!(EG(E(TRUE U ((p49==1)&&(p125==1))))...279
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t46, t50, t63, t66, t79, t84, t88, t92, t94, t110, t118, t...302
(forward)formula 0,1,6.13347,145760,1,0,442,843555,540,252,6458,623166,563
FORMULA FireWire-PT-16-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Graph (trivial) has 157 edges and 198 vertex of which 18 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 182 transition count 245
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 141 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 140 transition count 243
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 86 place count 140 transition count 230
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 112 place count 127 transition count 230
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 120 place count 119 transition count 212
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 119 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 128 place count 119 transition count 211
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 118 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 117 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 117 transition count 208
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 154 place count 106 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 105 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 105 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 105 transition count 186
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 158 place count 105 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 104 transition count 185
Applied a total of 159 rules in 40 ms. Remains 104 /198 variables (removed 94) and now considering 185/303 (removed 118) transitions.
[2025-06-02 18:02:48] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
// Phase 1: matrix 182 rows 104 cols
[2025-06-02 18:02:48] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:02:48] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 18:02:48] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
[2025-06-02 18:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:02:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-02 18:02:49] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:02:49] [INFO ] Redundant transitions in 2 ms returned []
Running 180 sub problems to find dead transitions.
[2025-06-02 18:02:49] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
[2025-06-02 18:02:49] [INFO ] Invariant cache hit.
[2025-06-02 18:02:49] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:50] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:50] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:50] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 8 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:50] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 11 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:51] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 15 ms to minimize.
Problem TDEAD143 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:51] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:51] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:51] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:52] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 181/284 variables, 103/116 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 11/127 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/127 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 1/285 variables, 1/128 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/128 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/128 constraints. Problems are: Problem set: 15 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/286 variables, and 128 constraints, problems are : Problem set: 15 solved, 165 unsolved in 19146 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 181/284 variables, 103/116 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 11/127 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 165/292 constraints. Problems are: Problem set: 15 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:11] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:11] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 2/294 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/294 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/295 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/295 constraints. Problems are: Problem set: 15 solved, 165 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/295 constraints. Problems are: Problem set: 15 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/286 variables, and 295 constraints, problems are : Problem set: 15 solved, 165 unsolved in 25268 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 165/180 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44434ms problems are : Problem set: 15 solved, 165 unsolved
Search for dead transitions found 15 dead transitions in 44435ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/198 places, 170/303 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:03:33] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 44791 ms. Remains : 104/198 places, 170/303 transitions.
[2025-06-02 18:03:33] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:03:33] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:03:33] [INFO ] Input system was already deterministic with 170 transitions.
[2025-06-02 18:03:33] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:03:33] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:03:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1424991958257967049.gal : 1 ms
[2025-06-02 18:03:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13167797942935799054.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/CTLFireability1424991958257967049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13167797942935799054.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,91979,0.201228,7128,2,956,5,9536,6,0,584,12044,0


Converting to forward existential form...Done !
original formula: A(!((E(!(EG((p41==1))) U (p158!=1)) + AG((p166==1)))) U EF((p85==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p85==1)))))) * !(E(!(E(TRUE U (p85==1))) U (!(!((E(!(EG((p41==1))) U (p158!=1)) + !(E...218
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t18, t20, t38, t40, t42, t107, t111, t114, t130, t132, t134, t146, t148, t149, t150, ...291
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.22739,181608,1,0,579,1.16123e+06,373,320,4310,1.06895e+06,674
FORMULA FireWire-PT-16-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Graph (trivial) has 163 edges and 198 vertex of which 15 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 185 transition count 244
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 139 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 138 transition count 241
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 97 place count 138 transition count 229
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 121 place count 126 transition count 229
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 129 place count 118 transition count 219
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 118 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 137 place count 118 transition count 218
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 117 transition count 218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 115 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 115 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 144 place count 115 transition count 204
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 168 place count 103 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 102 transition count 182
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 102 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 101 transition count 181
Applied a total of 171 rules in 36 ms. Remains 101 /198 variables (removed 97) and now considering 181/303 (removed 122) transitions.
[2025-06-02 18:03:40] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
// Phase 1: matrix 179 rows 101 cols
[2025-06-02 18:03:40] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:03:41] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-02 18:03:41] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
[2025-06-02 18:03:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:03:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 18:03:41] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:03:41] [INFO ] Redundant transitions in 2 ms returned []
Running 176 sub problems to find dead transitions.
[2025-06-02 18:03:41] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
[2025-06-02 18:03:41] [INFO ] Invariant cache hit.
[2025-06-02 18:03:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:42] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:42] [INFO ] Deduced a trap composed of 33 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 18:03:42] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:42] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 5 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:42] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 13 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:43] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 13 ms to minimize.
Problem TDEAD140 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:43] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:43] [INFO ] Deduced a trap composed of 44 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 18:03:43] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:44] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:45] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/15 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 178/278 variables, 100/115 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/116 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/116 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/117 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/117 constraints. Problems are: Problem set: 15 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/280 variables, and 117 constraints, problems are : Problem set: 15 solved, 161 unsolved in 18583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 178/278 variables, 100/115 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 1/116 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 161/277 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/277 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/278 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/278 constraints. Problems are: Problem set: 15 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:14] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/279 variables, 1/279 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/279 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 0/279 variables, 0/279 constraints. Problems are: Problem set: 15 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/280 variables, and 279 constraints, problems are : Problem set: 15 solved, 161 unsolved in 29141 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/176 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47751ms problems are : Problem set: 15 solved, 161 unsolved
Search for dead transitions found 15 dead transitions in 47752ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 101/198 places, 166/303 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:04:29] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 48228 ms. Remains : 101/198 places, 166/303 transitions.
[2025-06-02 18:04:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:04:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:04:29] [INFO ] Input system was already deterministic with 166 transitions.
[2025-06-02 18:04:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:04:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:04:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10700434465132628980.gal : 1 ms
[2025-06-02 18:04:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6003162092429873230.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/CTLFireability10700434465132628980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6003162092429873230.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,87467,0.129103,7236,2,937,5,9226,6,0,568,13020,0


Converting to forward existential form...Done !
original formula: EF(EG(((p54==1)&&(p128==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p54==1)&&(p128==1)))] != FALSE
Hit Full ! (commute/partial/dont) 150/15/16
(forward)formula 0,0,0.32905,11204,1,0,8,34686,19,2,3005,16288,8
FORMULA FireWire-PT-16-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 182 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 182 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 174 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 174 transition count 265
Applied a total of 49 rules in 5 ms. Remains 174 /198 variables (removed 24) and now considering 265/303 (removed 38) transitions.
// Phase 1: matrix 265 rows 174 cols
[2025-06-02 18:04:29] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:04:29] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 18:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:04:29] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-02 18:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:35] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:35] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:36] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 12 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:37] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 27 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:37] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 32 ms to minimize.
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:38] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:38] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 2/11 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 265/439 variables, 174/185 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:46] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:47] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/187 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:53] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:53] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 2/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 189 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 249/438 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:09] [INFO ] Deduced a trap composed of 74 places in 203 ms of which 37 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 1/439 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/439 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 439 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 60063ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/198 places, 250/303 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60449 ms. Remains : 174/198 places, 250/303 transitions.
[2025-06-02 18:05:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:05:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:05:29] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 18:05:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:05:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:05:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3756027544726488436.gal : 2 ms
[2025-06-02 18:05:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15806340465310697461.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/CTLFireability3756027544726488436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15806340465310697461.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.55374e+06,0.421997,12016,2,2094,5,22272,6,0,947,31829,0


Converting to forward existential form...Done !
original formula: EF(((EX(((p242==0) * !(A((p141==1) U (p24==1))))) * (p167==1)) * EX(TRUE)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (EX(((p242==0) * !(!((E(!((p24==1)) U (!((p141==1)) * !((p24==1)))) + EG(!((p24==1))))))...190
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t26, t28, t34, t39, t44, t52, t65, t68, t81, t86, t90, t94, t96, t112, t120, t125, ...297
(forward)formula 0,1,19.1868,486932,1,0,833,3.14241e+06,528,429,6015,3.19528e+06,994
FORMULA FireWire-PT-16-CTLFireability-2024-12 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 : 198/198 places, 303/303 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 182 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 182 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 174 transition count 266
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 173 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 173 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 172 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 172 transition count 263
Applied a total of 53 rules in 7 ms. Remains 172 /198 variables (removed 26) and now considering 263/303 (removed 40) transitions.
// Phase 1: matrix 263 rows 172 cols
[2025-06-02 18:05:49] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:05:49] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 18:05:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:05:49] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-02 18:05:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:54] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:55] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:55] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:55] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:56] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 11 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:57] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 27 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:57] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 32 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:58] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:58] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:59] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/186 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:06] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:07] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 188 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:22] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/189 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 247/436 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:34] [INFO ] Deduced a trap along path composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 1/437 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:47] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 438 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60058ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 60059ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/198 places, 248/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60475 ms. Remains : 172/198 places, 248/303 transitions.
[2025-06-02 18:06:49] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:06:49] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:06:49] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-02 18:06:49] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:06:49] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:06:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11198797292383464090.gal : 2 ms
[2025-06-02 18:06:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15222624634311040871.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/CTLFireability11198797292383464090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15222624634311040871.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.5349e+06,0.465002,11724,2,2040,5,21898,6,0,937,30031,0


Converting to forward existential form...Done !
original formula: EX(AF(AG((p224==0))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !((p224==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t84, t88, t92, t94, t110, t118, t123, ...297
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.2017,230200,1,0,584,1.4165e+06,525,350,6491,1.04225e+06,746
FORMULA FireWire-PT-16-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 183 transition count 287
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 183 transition count 287
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 175 transition count 267
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 175 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 175 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 174 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 173 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 173 transition count 264
Applied a total of 51 rules in 7 ms. Remains 173 /198 variables (removed 25) and now considering 264/303 (removed 39) transitions.
// Phase 1: matrix 264 rows 173 cols
[2025-06-02 18:07:00] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:00] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-02 18:07:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:00] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2025-06-02 18:07:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:05] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:05] [INFO ] Deduced a trap composed of 75 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 18:07:06] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:06] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:06] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 37 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:07] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 18 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:08] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 21 ms to minimize.
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 264/437 variables, 173/184 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:14] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:15] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 2/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 186 constraints, problems are : Problem set: 15 solved, 248 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:33] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 264/437 variables, 173/187 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 248/435 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:41] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:42] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 2/437 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:47] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:48] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:48] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 37 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 3/440 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:59] [INFO ] Deduced a trap along path composed of 11 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 441 constraints, problems are : Problem set: 15 solved, 248 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 248/263 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60064ms problems are : Problem set: 15 solved, 248 unsolved
Search for dead transitions found 15 dead transitions in 60064ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/198 places, 249/303 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60449 ms. Remains : 173/198 places, 249/303 transitions.
[2025-06-02 18:08:00] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:08:00] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:08:00] [INFO ] Input system was already deterministic with 249 transitions.
[2025-06-02 18:08:00] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:08:00] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10928220318519402851.gal : 2 ms
[2025-06-02 18:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5876065913440015825.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/CTLFireability10928220318519402851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5876065913440015825.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.5595e+06,0.45495,11732,2,2067,5,21844,6,0,942,30121,0


Converting to forward existential form...Done !
original formula: EX((EF(((EX((p209==1)) + ((p32==1)&&(p169==1))) + ((p50==1)&&(p125==1)))) * EX(((AF((p126==0)) + (p148==0)) * EG((p151==0))))))
=> equivalent forward existential formula: [FwdG((EY((EY(Init) * E(TRUE U ((EX((p209==1)) + ((p32==1)&&(p169==1))) + ((p50==1)&&(p125==1)))))) * (!(EG(!((p...200
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t80, t85, t89, t93, t95, t111, t119, t124, ...297
Hit Full ! (commute/partial/dont) 242/0/7
(forward)formula 0,1,9.12844,209456,1,0,552,1.23466e+06,537,299,6559,885255,700
FORMULA FireWire-PT-16-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 303/303 transitions.
Graph (trivial) has 164 edges and 198 vertex of which 18 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 182 transition count 241
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 137 transition count 238
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 136 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 135 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 97 place count 135 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 123 place count 122 transition count 224
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 131 place count 114 transition count 206
Iterating global reduction 4 with 8 rules applied. Total rules applied 139 place count 114 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 139 place count 114 transition count 205
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 141 place count 113 transition count 205
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 112 transition count 202
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 112 transition count 202
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 165 place count 101 transition count 191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 100 transition count 181
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 100 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 100 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 99 transition count 179
Applied a total of 169 rules in 26 ms. Remains 99 /198 variables (removed 99) and now considering 179/303 (removed 124) transitions.
[2025-06-02 18:08:09] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
// Phase 1: matrix 176 rows 99 cols
[2025-06-02 18:08:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:10] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 18:08:10] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2025-06-02 18:08:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:08:10] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-02 18:08:10] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:08:10] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2025-06-02 18:08:10] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2025-06-02 18:08:10] [INFO ] Invariant cache hit.
[2025-06-02 18:08:10] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:11] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:11] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:11] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 11 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:12] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 13 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:12] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 15 ms to minimize.
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:12] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:12] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:12] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 175/273 variables, 98/110 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 11/121 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/121 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/122 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/275 variables, and 122 constraints, problems are : Problem set: 15 solved, 159 unsolved in 16419 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 175/273 variables, 98/110 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 11/121 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 159/280 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/280 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/281 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/281 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/281 constraints. Problems are: Problem set: 15 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/275 variables, and 281 constraints, problems are : Problem set: 15 solved, 159 unsolved in 21997 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 159/174 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38445ms problems are : Problem set: 15 solved, 159 unsolved
Search for dead transitions found 15 dead transitions in 38446ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 99/198 places, 164/303 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:08:48] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 38887 ms. Remains : 99/198 places, 164/303 transitions.
[2025-06-02 18:08:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:08:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:08:48] [INFO ] Input system was already deterministic with 164 transitions.
[2025-06-02 18:08:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:08:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:08:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13890996844942549182.gal : 1 ms
[2025-06-02 18:08:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9526966464546514252.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13890996844942549182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9526966464546514252.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9526966464546514252.prop.
RANDOM walk for 40000 steps (3878 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 40
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :40 after 94
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :690 after 1444
BEST_FIRST walk for 40003 steps (1255 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Reachability property FireWire-PT-16-CTLFireability-2024-15 is true.
FORMULA FireWire-PT-16-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2612,0.060676,5456,2,705,14,4106,6,0,558,2897,0
Total reachable state count : 2612

Verifying 1 reachability properties.
Reachability property FireWire-PT-16-CTLFireability-2024-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-16-CTLFireability-2024-15,13,0.061362,5584,2,157,14,4106,7,0,561,2897,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 8967 steps, run visited all 1 properties in 33 ms. (steps per millisecond=271 )
Probabilistic random walk after 8967 steps, saw 2325 distinct states, run finished after 34 ms. (steps per millisecond=263 ) properties seen :1
[2025-06-02 18:08:48] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:08:48] [INFO ] Flatten gal took : 11 ms
Total runtime 1067175 ms.

BK_STOP 1748887728965

--------------------
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="FireWire-PT-16"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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