Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m06-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d0m06-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748552051924

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 20:54:14] [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-05-29 20:54:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:54:15] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2025-05-29 20:54:15] [INFO ] Transformed 553 places.
[2025-05-29 20:54:15] [INFO ] Transformed 150 transitions.
[2025-05-29 20:54:15] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Support contains 76 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 100 transition count 136
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 100 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 99 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 99 transition count 135
Applied a total of 24 rules in 41 ms. Remains 99 /109 variables (removed 10) and now considering 135/150 (removed 15) transitions.
// Phase 1: matrix 135 rows 99 cols
[2025-05-29 20:54:15] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:15] [INFO ] Implicit Places using invariants in 321 ms returned []
[2025-05-29 20:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:54:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-29 20:54:16] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-05-29 20:54:16] [INFO ] Invariant cache hit.
[2025-05-29 20:54:16] [INFO ] State equation strengthened by 60 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, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/234 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 60/161 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:25] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:25] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 16 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/234 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:29] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:29] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:29] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:30] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:30] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:33] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:33] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:33] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:33] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:33] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:39] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:54:40] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 20 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/234 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/234 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 60/175 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 134/309 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/234 variables, and 309 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 60484ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 135/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61280 ms. Remains : 99/109 places, 135/150 transitions.
Support contains 76 out of 99 places after structural reductions.
[2025-05-29 20:55:17] [INFO ] Flatten gal took : 76 ms
[2025-05-29 20:55:17] [INFO ] Flatten gal took : 35 ms
[2025-05-29 20:55:17] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 40000 steps (9135 resets) in 3466 ms. (11 steps per ms) remains 30/68 properties
BEST_FIRST walk for 4002 steps (189 resets) in 75 ms. (52 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (183 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (372 resets) in 86 ms. (46 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (404 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (194 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (215 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (394 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (200 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (187 resets) in 22 ms. (174 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (398 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (421 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (198 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (220 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (500 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (216 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (423 resets) in 64 ms. (61 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (193 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (427 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (242 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (198 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (224 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (194 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (187 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (800 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (202 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (800 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (417 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (400 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (389 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
[2025-05-29 20:55:18] [INFO ] Invariant cache hit.
[2025-05-29 20:55:18] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/67 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 15/82 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/84 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 43/127 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 34/234 variables, 17/144 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 17/161 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 161 constraints, problems are : Problem set: 4 solved, 25 unsolved in 3807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 25 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 27/63 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:22] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 18/81 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:23] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:23] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:23] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 116/197 variables, 81/87 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 41/128 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 2/130 constraints. Problems are: Problem set: 4 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:24] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:24] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:24] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:24] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:24] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:24] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:24] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:25] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:26] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:26] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:26] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 20/150 constraints. Problems are: Problem set: 4 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:26] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:26] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:26] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:26] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:27] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:27] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:27] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:27] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:27] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:27] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:27] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 5 ms to minimize.
SMT process timed out in 8869ms, After SMT, problems are : Problem set: 4 solved, 25 unsolved
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 89 transition count 119
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 89 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 87 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 87 transition count 117
Applied a total of 24 rules in 33 ms. Remains 87 /99 variables (removed 12) and now considering 117/135 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 87/99 places, 117/135 transitions.
RANDOM walk for 40000 steps (9188 resets) in 668 ms. (59 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (233 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (212 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (412 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (383 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (219 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (196 resets) in 25 ms. (154 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4003 steps (173 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (188 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (403 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (385 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (217 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (500 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (193 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (396 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (185 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (192 resets) in 43 ms. (91 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (196 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (166 resets) in 69 ms. (57 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4000 steps (800 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (387 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (424 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (356 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
// Phase 1: matrix 117 rows 87 cols
[2025-05-29 20:55:28] [INFO ] Computed 2 invariants in 4 ms
[2025-05-29 20:55:28] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 19/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 106/178 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 38/112 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 26/204 variables, 15/127 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 138 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:30] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 19/72 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 106/178 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 38/113 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:31] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:31] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:31] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:31] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:31] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:31] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:31] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:55:32] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 26/204 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 18/167 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/204 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 167 constraints, problems are : Problem set: 0 solved, 20 unsolved in 6371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8628ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 3 properties in 1159 ms.
Support contains 28 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 84 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 84 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 83 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 83 transition count 111
Applied a total of 8 rules in 17 ms. Remains 83 /87 variables (removed 4) and now considering 111/117 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 83/87 places, 111/117 transitions.
RANDOM walk for 40000 steps (9117 resets) in 287 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (192 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (394 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (392 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (190 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (202 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (203 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (424 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (500 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (220 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (404 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (182 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (192 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (193 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (800 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (800 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (415 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (432 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
Probabilistic random walk after 1000001 steps, saw 378355 distinct states, run finished after 1585 ms. (steps per millisecond=630 ) properties seen :16
// Phase 1: matrix 111 rows 83 cols
[2025-05-29 20:55:40] [INFO ] Computed 2 invariants in 3 ms
[2025-05-29 20:55:40] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/128 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/184 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/194 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/194 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/128 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/184 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/194 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/194 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 696ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 111/111 transitions.
Graph (complete) has 246 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 82 transition count 109
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 73 transition count 91
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 73 transition count 90
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 30 place count 65 transition count 82
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 65 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 49 place count 60 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 59 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 55 place count 59 transition count 67
Applied a total of 55 rules in 56 ms. Remains 59 /83 variables (removed 24) and now considering 67/111 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 59/83 places, 67/111 transitions.
RANDOM walk for 40000 steps (9142 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (5000 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Probably explored full state space saw : 182278 states, properties seen :0
Probabilistic random walk after 457338 steps, saw 182278 distinct states, run finished after 744 ms. (steps per millisecond=614 ) properties seen :0
Explored full state space saw : 182315 states, properties seen :0
Exhaustive walk after 457385 steps, saw 182315 distinct states, run finished after 628 ms. (steps per millisecond=728 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-05-29 20:55:42] [INFO ] Flatten gal took : 23 ms
[2025-05-29 20:55:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:55:42] [INFO ] Flatten gal took : 19 ms
[2025-05-29 20:55:42] [INFO ] Input system was already deterministic with 135 transitions.
Support contains 67 out of 99 places (down from 70) after GAL structural reductions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 332 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 100
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 100
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 78 transition count 99
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 67 transition count 88
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 63 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 62 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 61 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 73
Applied a total of 82 rules in 18 ms. Remains 61 /99 variables (removed 38) and now considering 73/135 (removed 62) transitions.
// Phase 1: matrix 73 rows 61 cols
[2025-05-29 20:55:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:55:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-29 20:55:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:55:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 20:55:42] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-05-29 20:55:42] [INFO ] Invariant cache hit.
[2025-05-29 20:55:42] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 89 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 72/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 161 constraints, problems are : Problem set: 0 solved, 72 unsolved in 9041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11584ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 11584ms
Starting structural reductions in LTL mode, iteration 1 : 61/99 places, 73/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11863 ms. Remains : 61/99 places, 73/135 transitions.
[2025-05-29 20:55:54] [INFO ] Flatten gal took : 11 ms
[2025-05-29 20:55:54] [INFO ] Flatten gal took : 10 ms
[2025-05-29 20:55:54] [INFO ] Input system was already deterministic with 73 transitions.
[2025-05-29 20:55:54] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:55:54] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:55:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15249345518452580391.gal : 5 ms
[2025-05-29 20:55:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13951314886298242822.ctl : 4 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/CTLFireability15249345518452580391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13951314886298242822.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,193510,0.737114,16956,2,5199,5,53765,6,0,317,42634,0


Converting to forward existential form...Done !
original formula: AX(AF(E(EX(((s1>=1)&&(l150>=1))) U ((s1>=1)&&(l340>=1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(EX(((s1>=1)&&(l150>=1))) U ((s1>=1)&&(l340>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t53, t54, t55, t5...336
(forward)formula 0,0,6.24157,133272,1,0,374,543351,172,210,2181,721367,330
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 99
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 80 transition count 97
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 71 transition count 88
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 70 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 69 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 69 transition count 83
Applied a total of 64 rules in 20 ms. Remains 69 /99 variables (removed 30) and now considering 83/135 (removed 52) transitions.
// Phase 1: matrix 83 rows 69 cols
[2025-05-29 20:56:00] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:56:00] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-05-29 20:56:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:56:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 20:56:01] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-05-29 20:56:01] [INFO ] Invariant cache hit.
[2025-05-29 20:56:01] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/152 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 95 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/152 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 82/177 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 177 constraints, problems are : Problem set: 0 solved, 82 unsolved in 20510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24902ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 24904ms
Starting structural reductions in LTL mode, iteration 1 : 69/99 places, 83/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25328 ms. Remains : 69/99 places, 83/135 transitions.
[2025-05-29 20:56:26] [INFO ] Flatten gal took : 12 ms
[2025-05-29 20:56:26] [INFO ] Flatten gal took : 12 ms
[2025-05-29 20:56:26] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 20:56:26] [INFO ] Flatten gal took : 11 ms
[2025-05-29 20:56:26] [INFO ] Flatten gal took : 11 ms
[2025-05-29 20:56:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10651852525254861323.gal : 4 ms
[2025-05-29 20:56:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6889530987447767048.ctl : 2 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/CTLFireability10651852525254861323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6889530987447767048.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,377608,2.55156,54180,2,9035,5,191343,6,0,359,178909,0


Converting to forward existential form...Done !
original formula: (AX(!(A(E(AF(((s1>=1)&&(l342>=1))) U AG(((s1>=1)&&(l486>=1)))) U (!(((p29>=1)&&(l0>=1))) + AX(((s1>=1)&&(l124>=1))))))) + AF(AX((((((AX((...352
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(!(!((E(!((!(((p29>=1)&&(l0>=1))) + !(EX(!(((s1>=1)&&(l124>=1))))))) U (!(E(!(EG(!(((s1>=1...591
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t50, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t7...316
Using saturation style SCC detection
(forward)formula 0,0,14.7805,322320,1,0,467,1.62414e+06,221,250,2599,1.52517e+06,474
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 97
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 79 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 71 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 70 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 69 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 69 transition count 83
Applied a total of 63 rules in 22 ms. Remains 69 /99 variables (removed 30) and now considering 83/135 (removed 52) transitions.
// Phase 1: matrix 83 rows 69 cols
[2025-05-29 20:56:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:56:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-29 20:56:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:56:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 20:56:41] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:56:41] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2025-05-29 20:56:41] [INFO ] Invariant cache hit.
[2025-05-29 20:56:41] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/152 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 96 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/152 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 178 constraints, problems are : Problem set: 0 solved, 82 unsolved in 12736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16262ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 16263ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/99 places, 83/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16532 ms. Remains : 69/99 places, 83/135 transitions.
[2025-05-29 20:56:57] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:56:57] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:56:57] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 20:56:57] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:56:57] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:56:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17458704851212423089.gal : 2 ms
[2025-05-29 20:56:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4662087809258249122.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/CTLFireability17458704851212423089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4662087809258249122.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,486470,1.08439,27200,2,5817,5,89341,6,0,359,88871,0


Converting to forward existential form...Done !
original formula: EG((EG(EF(((s1>=1)&&(l3>=1)))) + (A(!(((s1>=1)&&(l505>=1))) U EG(((s1>=1)&&(l110>=1)))) * EF(((s1>=1)&&(l490>=1))))))
=> equivalent forward existential formula: [FwdG(Init,(EG(E(TRUE U ((s1>=1)&&(l3>=1)))) + (!((E(!(EG(((s1>=1)&&(l110>=1)))) U (!(!(((s1>=1)&&(l505>=1)))) *...267
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t49, t50, t52, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t6...321
Using saturation style SCC detection
(forward)formula 0,0,10.4159,229872,1,0,378,1.23405e+06,207,176,2582,1.01804e+06,461
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 84 transition count 114
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 84 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 84 transition count 113
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 76 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 76 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 76 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 74 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 74 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 74 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 73 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 73 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 72 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 72 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 72 transition count 95
Applied a total of 58 rules in 37 ms. Remains 72 /99 variables (removed 27) and now considering 95/135 (removed 40) transitions.
// Phase 1: matrix 95 rows 72 cols
[2025-05-29 20:57:08] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:08] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-29 20:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-29 20:57:08] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:57:08] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2025-05-29 20:57:08] [INFO ] Invariant cache hit.
[2025-05-29 20:57:08] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/167 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 41/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 115 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/167 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 41/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 94/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 209 constraints, problems are : Problem set: 0 solved, 94 unsolved in 16638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19874ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 19875ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/99 places, 95/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20580 ms. Remains : 72/99 places, 95/135 transitions.
[2025-05-29 20:57:28] [INFO ] Flatten gal took : 18 ms
[2025-05-29 20:57:28] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:57:28] [INFO ] Input system was already deterministic with 95 transitions.
[2025-05-29 20:57:28] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:57:28] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:57:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4202531995112852511.gal : 4 ms
[2025-05-29 20:57:28] [INFO ] Time to serialize properties into /tmp/CTLFireability121604630993779370.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/CTLFireability4202531995112852511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability121604630993779370.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,656321,1.47503,34616,2,6197,5,126536,6,0,383,101047,0


Converting to forward existential form...Done !
original formula: AG(((AF(((s1<1)||(l91<1))) + ((s1>=1)&&(l110>=1))) * (AF((((s1>=1)&&(l488>=1)) + !(E(((s1>=1)&&(l502>=1)) U ((p15>=1)&&(l0>=1)))))) + ((A...285
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(((s1>=1)&&(l110>=1)))),!(((s1<1)||(l91<1))))] = FALSE * (([(FwdU((FwdU(Init,TRUE) * ...701
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t49, t50,...419
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 1/90/94
(forward)formula 0,1,8.08555,173176,1,0,377,926548,244,159,2911,813345,420
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 100
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 80 transition count 99
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 69 transition count 88
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 68 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 67 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 83
Applied a total of 67 rules in 11 ms. Remains 67 /99 variables (removed 32) and now considering 83/135 (removed 52) transitions.
// Phase 1: matrix 83 rows 67 cols
[2025-05-29 20:57:37] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-29 20:57:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:57:37] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 20:57:37] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-05-29 20:57:37] [INFO ] Invariant cache hit.
[2025-05-29 20:57:37] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/150 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:39] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:39] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:41] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:41] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:41] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:41] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 7 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/150 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:42] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:42] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:43] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:57:43] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/150 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 105 constraints, problems are : Problem set: 0 solved, 82 unsolved in 7602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/150 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 26/105 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 82/187 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 187 constraints, problems are : Problem set: 0 solved, 82 unsolved in 12490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20140ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 20141ms
Starting structural reductions in LTL mode, iteration 1 : 67/99 places, 83/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20454 ms. Remains : 67/99 places, 83/135 transitions.
[2025-05-29 20:57:57] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:57:57] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:57:57] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 20:57:57] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:57:57] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:57:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6002965903849173496.gal : 2 ms
[2025-05-29 20:57:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14324259583867510328.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/CTLFireability6002965903849173496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14324259583867510328.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,390570,0.917621,28008,2,6402,5,92104,6,0,351,92129,0


Converting to forward existential form...Done !
original formula: EG(((EX((((((s1>=1)&&(l337>=1))&&((s1>=1)&&(l355>=1)))||(p29<1))||(l0<1))) + EX(AF(((p24<1)||(l0<1))))) + ((!(A(((s1>=1)&&(l510>=1)) U ((...200
=> equivalent forward existential formula: [FwdG(Init,((EX((((((s1>=1)&&(l337>=1))&&((s1>=1)&&(l355>=1)))||(p29<1))||(l0<1))) + EX(!(EG(!(((p24<1)||(l0<1))...316
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t46, t47, t48, t52, t60, t61, t62, t63, t64, t65, t66, t67,...329
(forward)formula 0,1,9.45075,226872,1,0,446,1.11392e+06,206,231,2456,1.19897e+06,442
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 99
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 79 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 69 transition count 88
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 66 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 64 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 61 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 61 transition count 70
Applied a total of 83 rules in 35 ms. Remains 61 /99 variables (removed 38) and now considering 70/135 (removed 65) transitions.
// Phase 1: matrix 70 rows 61 cols
[2025-05-29 20:58:07] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:07] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-05-29 20:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:07] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 20:58:07] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:58:07] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2025-05-29 20:58:07] [INFO ] Invariant cache hit.
[2025-05-29 20:58:07] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:09] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:09] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:10] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:10] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:10] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:10] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:10] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/131 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:11] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:13] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 12 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/131 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:58:13] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (OVERLAPS) 0/131 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 97 constraints, problems are : Problem set: 0 solved, 69 unsolved in 8688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 70/131 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 24/97 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 69/166 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 166 constraints, problems are : Problem set: 0 solved, 69 unsolved in 10719 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19432ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 19433ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/99 places, 70/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19746 ms. Remains : 61/99 places, 70/135 transitions.
[2025-05-29 20:58:26] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:58:26] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:58:26] [INFO ] Input system was already deterministic with 70 transitions.
[2025-05-29 20:58:26] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:58:26] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:58:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16160092994933547461.gal : 1 ms
[2025-05-29 20:58:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11826550126736024643.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/CTLFireability16160092994933547461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11826550126736024643.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,195054,1.37471,30488,2,6756,5,113441,6,0,314,96127,0


Converting to forward existential form...Done !
original formula: A(AF(AG(((p24<1)||(l0<1)))) U E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&(l3>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&(l3>=1))))))) * !(E(!(E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&(l3...276
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t42, t43, t44, t45, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...306
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,9.09087,186476,1,0,326,988335,178,183,2188,857595,381
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 100
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 80 transition count 99
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 72 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 72 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 72 transition count 89
Applied a total of 57 rules in 3 ms. Remains 72 /99 variables (removed 27) and now considering 89/135 (removed 46) transitions.
// Phase 1: matrix 89 rows 72 cols
[2025-05-29 20:58:36] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:36] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-29 20:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:36] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-29 20:58:36] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-05-29 20:58:36] [INFO ] Invariant cache hit.
[2025-05-29 20:58:36] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/161 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 29/103 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 103 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/161 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 29/103 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 88/191 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 191 constraints, problems are : Problem set: 0 solved, 88 unsolved in 12915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16771ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 16772ms
Starting structural reductions in LTL mode, iteration 1 : 72/99 places, 89/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17130 ms. Remains : 72/99 places, 89/135 transitions.
[2025-05-29 20:58:53] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:58:53] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:58:53] [INFO ] Input system was already deterministic with 89 transitions.
[2025-05-29 20:58:53] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:58:53] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:58:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9066267786368636293.gal : 2 ms
[2025-05-29 20:58:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8009479171948526186.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/CTLFireability9066267786368636293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8009479171948526186.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,707235,1.1543,31388,2,5635,5,110493,6,0,377,108170,0


Converting to forward existential form...Done !
original formula: AF(((EX(((((s9<1)||(l152<1))&&((s1<1)||(l487<1))) + AX((((s1>=1)&&(l335>=1))||((s1>=1)&&(l502>=1)))))) * (s1>=1)) * (l503>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((((s9<1)||(l152<1))&&((s1<1)||(l487<1))) + !(EX(!((((s1>=1)&&(l335>=1))||((s1>=1)&&(l502>=1))...196
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t51, t52, t55, t56, t57, t58, t65, t66, t67, t68, t69, t70, t71, t7...336
(forward)formula 0,0,6.18384,134228,1,0,355,570661,204,199,2656,750042,326
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
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 77 transition count 94
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 66 transition count 83
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 62 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 61 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 70
Applied a total of 82 rules in 22 ms. Remains 61 /99 variables (removed 38) and now considering 70/135 (removed 65) transitions.
// Phase 1: matrix 70 rows 61 cols
[2025-05-29 20:58:59] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:59] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-29 20:58:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:58:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 20:58:59] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:58:59] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2025-05-29 20:58:59] [INFO ] Invariant cache hit.
[2025-05-29 20:58:59] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:01] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:01] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:01] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:03] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 12 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/131 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 88 constraints, problems are : Problem set: 0 solved, 69 unsolved in 6392 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 70/131 variables, 61/67 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 69/157 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 157 constraints, problems are : Problem set: 0 solved, 69 unsolved in 9546 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15960ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 15961ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/99 places, 70/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16254 ms. Remains : 61/99 places, 70/135 transitions.
[2025-05-29 20:59:15] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:59:15] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:59:15] [INFO ] Input system was already deterministic with 70 transitions.
[2025-05-29 20:59:15] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:59:15] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:59:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7002473334974875698.gal : 2 ms
[2025-05-29 20:59:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3656586439111047829.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/CTLFireability7002473334974875698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3656586439111047829.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,223128,0.792591,18248,2,4452,5,59996,6,0,314,53700,0


Converting to forward existential form...Done !
original formula: AF(((s1>=1)&&(l335>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((s1>=1)&&(l335>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 1/0/69
(forward)formula 0,0,3.33205,76032,1,0,20,331983,20,4,1662,263515,16
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 98
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 98
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 78 transition count 97
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 68 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 63 transition count 75
Applied a total of 77 rules in 17 ms. Remains 63 /99 variables (removed 36) and now considering 75/135 (removed 60) transitions.
// Phase 1: matrix 75 rows 63 cols
[2025-05-29 20:59:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:59:19] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-29 20:59:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:59:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 20:59:19] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:59:19] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2025-05-29 20:59:19] [INFO ] Invariant cache hit.
[2025-05-29 20:59:19] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2788 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 11525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14344ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 14344ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/99 places, 75/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14637 ms. Remains : 63/99 places, 75/135 transitions.
[2025-05-29 20:59:33] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:59:33] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:59:33] [INFO ] Input system was already deterministic with 75 transitions.
[2025-05-29 20:59:33] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:59:33] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:59:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12242453695727335711.gal : 3 ms
[2025-05-29 20:59:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16773325285150772898.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/CTLFireability12242453695727335711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16773325285150772898.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,299180,1.28544,30728,2,6540,5,111228,6,0,327,99633,0


Converting to forward existential form...Done !
original formula: (EG(EF(((s1>=1)&&(l491>=1)))) * !(A(((p13>=1)&&(l155>=1)) U AF(((s1>=1)&&(l338>=1))))))
=> equivalent forward existential formula: ([FwdG((FwdU((Init * EG(E(TRUE U ((s1>=1)&&(l491>=1))))),!(!(EG(!(((s1>=1)&&(l338>=1))))))) * !(((p13>=1)&&(l155...295
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t48, t49, t50, t55, t56, t57, t58, t59, t60, t61, t62, t63, t6...306
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 1/0/74
(forward)formula 0,1,13.3982,296632,1,0,531,1.54353e+06,198,299,2376,1.52879e+06,619
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 110
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 76 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 76 transition count 103
Applied a total of 46 rules in 2 ms. Remains 76 /99 variables (removed 23) and now considering 103/135 (removed 32) transitions.
// Phase 1: matrix 103 rows 76 cols
[2025-05-29 20:59:47] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:59:47] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-29 20:59:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:59:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-29 20:59:47] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-05-29 20:59:47] [INFO ] Invariant cache hit.
[2025-05-29 20:59:47] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/179 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 39/117 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:51] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 14 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:53] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 9 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/179 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:55] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:59:56] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/179 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 121 constraints, problems are : Problem set: 0 solved, 102 unsolved in 11745 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/179 variables, 76/82 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 39/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 223 constraints, problems are : Problem set: 0 solved, 102 unsolved in 21412 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33215ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 33216ms
Starting structural reductions in LTL mode, iteration 1 : 76/99 places, 103/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33598 ms. Remains : 76/99 places, 103/135 transitions.
[2025-05-29 21:00:20] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:00:20] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:00:20] [INFO ] Input system was already deterministic with 103 transitions.
[2025-05-29 21:00:20] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:00:20] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:00:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9373343643432697158.gal : 2 ms
[2025-05-29 21:00:20] [INFO ] Time to serialize properties into /tmp/CTLFireability14348751347842394915.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/CTLFireability9373343643432697158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14348751347842394915.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,719893,2.77781,69392,2,10385,5,257813,6,0,407,211618,0


Converting to forward existential form...Done !
original formula: ((AX(((!(A(((s1>=1)&&(l116>=1)) U ((s1>=1)&&(l342>=1)))) + EF(((s1>=1)&&(l345>=1)))) + E(A(((s1>=1)&&(l149>=1)) U ((s1>=1)&&(l149>=1))) U...542
=> equivalent forward existential formula: (([((((EY(Init) * !(E(!((E(!(((s1>=1)&&(l149>=1))) U (!(((s1>=1)&&(l149>=1))) * !(((s1>=1)&&(l149>=1))))) + EG(!...889
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54, t55, t5...415
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,15.3824,332744,1,0,448,1.70321e+06,263,211,2878,1.48298e+06,514
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 101
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 101
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 70 transition count 91
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 70 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 67 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 65 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 65 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 63 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 62 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 62 transition count 74
Applied a total of 79 rules in 7 ms. Remains 62 /99 variables (removed 37) and now considering 74/135 (removed 61) transitions.
// Phase 1: matrix 74 rows 62 cols
[2025-05-29 21:00:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:00:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-29 21:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:00:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 21:00:36] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-05-29 21:00:36] [INFO ] Invariant cache hit.
[2025-05-29 21:00:36] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/136 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 27/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:00:38] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:00:40] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 10 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/136 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:00:40] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:00:40] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:00:41] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:00:42] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:00:42] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 11 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/136 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/136 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/136 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 98 constraints, problems are : Problem set: 0 solved, 73 unsolved in 7881 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 74/136 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 73/171 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 171 constraints, problems are : Problem set: 0 solved, 73 unsolved in 9769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17681ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 17682ms
Starting structural reductions in LTL mode, iteration 1 : 62/99 places, 74/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17942 ms. Remains : 62/99 places, 74/135 transitions.
[2025-05-29 21:00:54] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:00:54] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:00:54] [INFO ] Input system was already deterministic with 74 transitions.
[2025-05-29 21:00:54] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:00:54] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:00:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8977217485972980577.gal : 2 ms
[2025-05-29 21:00:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14347841780655780530.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/CTLFireability8977217485972980577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14347841780655780530.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,171796,0.983209,23640,2,6143,5,73609,6,0,322,65441,0


Converting to forward existential form...Done !
original formula: EF((AF((((s2<1)||(l497<1)) * EX(((s1>=1)&&(l37>=1))))) * EG(((s1<1)||(l354<1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(!((((s2<1)||(l497<1)) * EX(((s1>=1)&&(l37>=1)))))))),((s1<1)||(l354<1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t38, t39, t40, t47, t53, t54, t55, t56, t57, t58, t59, t6...321
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 2/0/72
(forward)formula 0,1,10.1548,194760,1,0,280,885740,181,132,2286,878432,293
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 106
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 82 transition count 105
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 75 transition count 98
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 75 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 75 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 74 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 74 transition count 93
Applied a total of 54 rules in 3 ms. Remains 74 /99 variables (removed 25) and now considering 93/135 (removed 42) transitions.
// Phase 1: matrix 93 rows 74 cols
[2025-05-29 21:01:04] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-05-29 21:01:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:04] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-29 21:01:05] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-05-29 21:01:05] [INFO ] Invariant cache hit.
[2025-05-29 21:01:05] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/167 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:07] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:08] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:08] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:09] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:09] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:10] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:10] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:10] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:11] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:14] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 13 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/167 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (OVERLAPS) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 120 constraints, problems are : Problem set: 0 solved, 92 unsolved in 13586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 93/167 variables, 74/86 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 92/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 212 constraints, problems are : Problem set: 0 solved, 92 unsolved in 20611 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34244ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 34245ms
Starting structural reductions in LTL mode, iteration 1 : 74/99 places, 93/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34575 ms. Remains : 74/99 places, 93/135 transitions.
[2025-05-29 21:01:39] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:01:39] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:01:39] [INFO ] Input system was already deterministic with 93 transitions.
[2025-05-29 21:01:39] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:01:39] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:01:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15713697342442050127.gal : 1 ms
[2025-05-29 21:01:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16826658487320774244.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/CTLFireability15713697342442050127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16826658487320774244.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,717140,2.52133,55668,2,10491,5,217009,6,0,389,156071,0


Converting to forward existential form...Done !
original formula: A(E(!((((E(((s1>=1)&&(l488>=1)) U ((p12>=1)&&(l0>=1))) * AX(((s1>=1)&&(l509>=1)))) * (E(((s6>=1)&&(l0>=1)) U ((s1>=1)&&(l33>=1))) * (s1>=...284
=> equivalent forward existential formula: [((Init * !(EG(!(((s5>=1)&&(l0>=1)))))) * !(E(!(((s5>=1)&&(l0>=1))) U (!(E(!((((E(((s1>=1)&&(l488>=1)) U ((p12>=...415
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t29, t46, t47, t48, t53, t54, t55, t56, t59, t60, t61,...379
(forward)formula 0,0,14.3168,303140,1,0,366,1.70033e+06,235,151,2713,1.34657e+06,419
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
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 77 transition count 94
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 68 transition count 85
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 67 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 82
Applied a total of 67 rules in 3 ms. Remains 67 /99 variables (removed 32) and now considering 82/135 (removed 53) transitions.
// Phase 1: matrix 82 rows 67 cols
[2025-05-29 21:01:53] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-29 21:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:01:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:01:54] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2025-05-29 21:01:54] [INFO ] Invariant cache hit.
[2025-05-29 21:01:54] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:56] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:56] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:56] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:57] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:57] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:58] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:58] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:59] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:01:59] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 102 constraints, problems are : Problem set: 0 solved, 81 unsolved in 8125 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/149 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 23/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 81/183 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 183 constraints, problems are : Problem set: 0 solved, 81 unsolved in 13216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21391ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 21392ms
Starting structural reductions in LTL mode, iteration 1 : 67/99 places, 82/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21714 ms. Remains : 67/99 places, 82/135 transitions.
[2025-05-29 21:02:15] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:02:15] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:02:15] [INFO ] Input system was already deterministic with 82 transitions.
[2025-05-29 21:02:15] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:02:15] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:02:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10790083617621617106.gal : 0 ms
[2025-05-29 21:02:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16889114829220640494.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/CTLFireability10790083617621617106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16889114829220640494.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,420375,0.728518,25248,2,5275,5,86607,6,0,350,76825,0


Converting to forward existential form...Done !
original formula: EX(!(A(AF(AX(((p20>=1)&&(l115>=1)))) U ((!(EX(((p10>=1)&&(l153>=1)))) * !(((s1>=1)&&(l337>=1)))) * ((p35>=1)&&(l136>=1))))))
=> equivalent forward existential formula: ((([(EY((FwdU(EY(Init),!(((!(EX(((p10>=1)&&(l153>=1)))) * !(((s1>=1)&&(l337>=1)))) * ((p35>=1)&&(l136>=1))))) * ...733
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t51, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t7...306
Using saturation style SCC detection
(forward)formula 0,1,8.65962,200288,1,0,388,971625,197,235,2472,958938,451
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2023-13 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 : 99/99 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
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 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 67 transition count 84
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 59 transition count 65
Applied a total of 88 rules in 16 ms. Remains 59 /99 variables (removed 40) and now considering 65/135 (removed 70) transitions.
// Phase 1: matrix 65 rows 59 cols
[2025-05-29 21:02:24] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:02:24] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-29 21:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:02:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 21:02:24] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:02:24] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2025-05-29 21:02:24] [INFO ] Invariant cache hit.
[2025-05-29 21:02:24] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:26] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:26] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:26] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:27] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:27] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:27] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:02:28] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/124 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 64/152 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 152 constraints, problems are : Problem set: 0 solved, 64 unsolved in 9243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14957ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 14957ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/99 places, 65/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15230 ms. Remains : 59/99 places, 65/135 transitions.
[2025-05-29 21:02:39] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:02:39] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:02:39] [INFO ] Input system was already deterministic with 65 transitions.
[2025-05-29 21:02:39] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:02:39] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:02:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12461911897664779160.gal : 1 ms
[2025-05-29 21:02:39] [INFO ] Time to serialize properties into /tmp/CTLFireability408306666747778843.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/CTLFireability12461911897664779160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability408306666747778843.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,134054,0.771476,16968,2,5817,5,48008,6,0,301,48180,0


Converting to forward existential form...Done !
original formula: EF(AG(((s6>=1)&&(l0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((s6>=1)&&(l0>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...291
(forward)formula 0,0,2.43944,49072,1,0,132,191488,152,54,2016,151947,143
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 108
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 82 transition count 107
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 74 transition count 99
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 71 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 71 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 69 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 69 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 67 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 67 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 66 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 66 transition count 83
Applied a total of 71 rules in 6 ms. Remains 66 /99 variables (removed 33) and now considering 83/135 (removed 52) transitions.
// Phase 1: matrix 83 rows 66 cols
[2025-05-29 21:02:41] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:02:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-05-29 21:02:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:02:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-29 21:02:42] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-05-29 21:02:42] [INFO ] Invariant cache hit.
[2025-05-29 21:02:42] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 101 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/149 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 82/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 183 constraints, problems are : Problem set: 0 solved, 82 unsolved in 12286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15437ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 15437ms
Starting structural reductions in LTL mode, iteration 1 : 66/99 places, 83/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15717 ms. Remains : 66/99 places, 83/135 transitions.
[2025-05-29 21:02:57] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:02:57] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:02:57] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 21:02:57] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:02:57] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:02:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1738449477293477789.gal : 1 ms
[2025-05-29 21:02:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17158950823099887506.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/CTLFireability1738449477293477789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17158950823099887506.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,263867,1.83787,44660,2,9537,5,164540,6,0,347,130934,0


Converting to forward existential form...Done !
original formula: (EX((((!(A((((s1>=1)&&(l491>=1))||((s1>=1)&&(l114>=1))) U !(((s1>=1)&&(l1>=1))))) * AG(((s1<1)||(l36<1)))) + AG(((p29>=1)&&(l0>=1)))) + A...226
=> equivalent forward existential formula: ((([((EY(Init) * !(!((E(!(!(((s1>=1)&&(l1>=1)))) U (!((((s1>=1)&&(l491>=1))||((s1>=1)&&(l114>=1)))) * !(!(((s1>=...444
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t44,...394
Hit Full ! (commute/partial/dont) 1/0/82
(forward)formula 0,1,11.3233,237128,1,0,247,1.07474e+06,211,100,2488,956806,272
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-29 21:03:09] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:03:09] [INFO ] Flatten gal took : 5 ms
Total runtime 534329 ms.

BK_STOP 1748552589212

--------------------
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="DBSingleClientW-PT-d0m06"
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 DBSingleClientW-PT-d0m06, 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 r058-smll-174854063400018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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