Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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-d0m05-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748551473994

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-d0m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 20:44:36] [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:44:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:44:36] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2025-05-29 20:44:36] [INFO ] Transformed 553 places.
[2025-05-29 20:44:36] [INFO ] Transformed 150 transitions.
[2025-05-29 20:44:36] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Deduced a syphon composed of 444 places in 4 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 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 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 99 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 99 transition count 136
Applied a total of 24 rules in 38 ms. Remains 99 /109 variables (removed 10) and now considering 136/150 (removed 14) transitions.
// Phase 1: matrix 136 rows 99 cols
[2025-05-29 20:44:37] [INFO ] Computed 2 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:44:37] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-05-29 20:44:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:44:37] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-29 20:44:38] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2025-05-29 20:44:38] [INFO ] Invariant cache hit.
[2025-05-29 20:44:38] [INFO ] State equation strengthened by 61 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, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/235 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 61/162 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:45] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:45] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:45] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:45] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:45] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:46] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:49] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:49] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:53] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:53] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:54] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:54] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:54] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:54] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:54] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:55] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:55] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 14 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/235 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:44:58] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:01] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:01] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:01] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:01] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:01] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:02] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:02] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:02] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 18 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/235 variables, and 188 constraints, problems are : Problem set: 0 solved, 135 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: 61/61 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 136/235 variables, 99/127 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 61/188 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 135/323 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/235 variables, and 323 constraints, problems are : Problem set: 0 solved, 135 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: 61/61 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 136/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61604 ms. Remains : 99/109 places, 136/150 transitions.
Support contains 62 out of 99 places after structural reductions.
[2025-05-29 20:45:38] [INFO ] Flatten gal took : 46 ms
[2025-05-29 20:45:39] [INFO ] Flatten gal took : 24 ms
[2025-05-29 20:45:39] [INFO ] Input system was already deterministic with 136 transitions.
Reduction of identical properties reduced properties to check from 63 to 58
RANDOM walk for 40000 steps (9136 resets) in 2950 ms. (13 steps per ms) remains 37/58 properties
BEST_FIRST walk for 4003 steps (193 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (220 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (191 resets) in 43 ms. (91 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (228 resets) in 114 ms. (34 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (193 resets) in 86 ms. (46 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (131 resets) in 73 ms. (54 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (408 resets) in 127 ms. (31 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (211 resets) in 50 ms. (78 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (193 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (416 resets) in 45 ms. (87 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (422 resets) in 41 ms. (95 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (220 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (206 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (389 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (381 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (429 resets) in 39 ms. (100 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (188 resets) in 93 ms. (42 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (417 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (221 resets) in 45 ms. (87 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (208 resets) in 41 ms. (95 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (204 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (202 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (200 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (191 resets) in 56 ms. (70 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4003 steps (193 resets) in 27 ms. (142 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4003 steps (420 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (193 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (389 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (397 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (178 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (197 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (204 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (181 resets) in 63 ms. (62 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (407 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
[2025-05-29 20:45:40] [INFO ] Invariant cache hit.
[2025-05-29 20:45:40] [INFO ] State equation strengthened by 61 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, 32 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/69 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 30 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/85 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 128/213 variables, 85/87 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 53/140 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 22/235 variables, 14/154 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 8/162 constraints. Problems are: Problem set: 2 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:42] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/163 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/163 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/235 variables, 0/163 constraints. Problems are: Problem set: 2 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 163 constraints, problems are : Problem set: 2 solved, 30 unsolved in 3907 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 30 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 26/68 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 17/85 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 128/213 variables, 85/87 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 53/140 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 3/143 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 22/235 variables, 14/157 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 8/165 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 27/192 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 1/193 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/235 variables, and 193 constraints, problems are : Problem set: 2 solved, 30 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 30/32 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8963ms problems are : Problem set: 2 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 95 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 95 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 94 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 94 transition count 131
Applied a total of 10 rules in 35 ms. Remains 94 /99 variables (removed 5) and now considering 131/136 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 94/99 places, 131/136 transitions.
RANDOM walk for 40000 steps (9227 resets) in 546 ms. (73 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (193 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (201 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (195 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (199 resets) in 23 ms. (166 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (118 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (456 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (187 resets) in 48 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (197 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (389 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (441 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (198 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (397 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (428 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (433 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (188 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (421 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (202 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (194 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (201 resets) in 30 ms. (129 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4003 steps (190 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (210 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (401 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (411 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (385 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (202 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (188 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (199 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
// Phase 1: matrix 131 rows 94 cols
[2025-05-29 20:45:50] [INFO ] Computed 2 invariants in 6 ms
[2025-05-29 20:45:50] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 23/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 17/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 118/197 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 47/128 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 28/225 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 13/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:52] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:45:52] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/225 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/225 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 158 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3935 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 23/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 17/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 118/197 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 47/128 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 28/225 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 13/159 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 24/183 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/225 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 185 constraints, problems are : Problem set: 0 solved, 27 unsolved in 8750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12738ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 1138 ms.
Support contains 39 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 131/131 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 92 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 92 transition count 125
Applied a total of 4 rules in 24 ms. Remains 92 /94 variables (removed 2) and now considering 125/131 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 92/94 places, 125/131 transitions.
RANDOM walk for 40000 steps (9134 resets) in 498 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (203 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (192 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (212 resets) in 40 ms. (97 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (191 resets) in 42 ms. (93 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (121 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (435 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (201 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (194 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (394 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (402 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (206 resets) in 37 ms. (105 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (402 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (397 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (414 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (188 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (422 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (224 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (207 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (209 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (206 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (203 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (382 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (397 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (412 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (184 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (185 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (213 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 41181 steps, run visited all 26 properties in 337 ms. (steps per millisecond=122 )
Probabilistic random walk after 41181 steps, saw 17969 distinct states, run finished after 346 ms. (steps per millisecond=119 ) properties seen :26
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2025-05-29 20:46:04] [INFO ] Flatten gal took : 18 ms
[2025-05-29 20:46:05] [INFO ] Flatten gal took : 24 ms
[2025-05-29 20:46:05] [INFO ] Input system was already deterministic with 136 transitions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 330 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 104
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 79 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 73 transition count 94
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 73 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 72 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 72 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 71 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 71 transition count 92
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 90
Applied a total of 60 rules in 23 ms. Remains 71 /99 variables (removed 28) and now considering 90/136 (removed 46) transitions.
// Phase 1: matrix 90 rows 71 cols
[2025-05-29 20:46:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:46:05] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-05-29 20:46:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:46:05] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-29 20:46:05] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-05-29 20:46:05] [INFO ] Invariant cache hit.
[2025-05-29 20:46:05] [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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/161 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 33/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:46:08] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:46:08] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:46:08] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:46:08] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 110 constraints, problems are : Problem set: 0 solved, 89 unsolved in 6009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/161 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 89/199 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 199 constraints, problems are : Problem set: 0 solved, 89 unsolved in 11721 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17823ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 17828ms
Starting structural reductions in LTL mode, iteration 1 : 71/99 places, 90/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18153 ms. Remains : 71/99 places, 90/136 transitions.
[2025-05-29 20:46:23] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:46:23] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:46:23] [INFO ] Input system was already deterministic with 90 transitions.
[2025-05-29 20:46:23] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:46:23] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:46:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12049439354927888235.gal : 4 ms
[2025-05-29 20:46:23] [INFO ] Time to serialize properties into /tmp/CTLFireability18171517010235170823.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12049439354927888235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18171517010235170823.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,61042,0.347767,14268,2,3148,5,41904,6,0,374,27128,0


Converting to forward existential form...Done !
original formula: AX((AX(((EX(((s1<1)||(l124<1))) + (((s1<1)||(l355<1)) * EF(((s1>=1)&&(l91>=1))))) + EF(((s1>=1)&&(l353>=1))))) + !(E(!(EX(((s1>=1)&&(l504...239
=> equivalent forward existential formula: [(FwdU(FwdU((EY(Init) * !(!(EX(!(((EX(((s1<1)||(l124<1))) + (((s1<1)||(l355<1)) * E(TRUE U ((s1>=1)&&(l91>=1))))...303
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t45, t46, t47, t48, t49, t50, t57, t60, t61, t62, t66, t67,...364
Hit Full ! (commute/partial/dont) 1/172/89
(forward)formula 0,0,2.78518,74800,1,0,425,337655,217,232,2831,316700,481
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-00 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, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 98
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 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 47 place count 76 transition count 97
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 66 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 66 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 69 place count 66 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 63 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 63 transition count 79
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 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 61 transition count 75
Iterating global reduction 3 with 2 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
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 59 transition count 71
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 69
Applied a total of 88 rules in 30 ms. Remains 59 /99 variables (removed 40) and now considering 69/136 (removed 67) transitions.
// Phase 1: matrix 69 rows 59 cols
[2025-05-29 20:46:26] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:46:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-29 20:46:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:46:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 20:46:26] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:46:26] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2025-05-29 20:46:26] [INFO ] Invariant cache hit.
[2025-05-29 20:46:26] [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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2668 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
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, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 9563 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12255ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 12255ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/99 places, 69/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12572 ms. Remains : 59/99 places, 69/136 transitions.
[2025-05-29 20:46:38] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:46:38] [INFO ] Flatten gal took : 13 ms
[2025-05-29 20:46:38] [INFO ] Input system was already deterministic with 69 transitions.
[2025-05-29 20:46:38] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:46:38] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:46:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8436043417382904288.gal : 2 ms
[2025-05-29 20:46:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16401076866071138180.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/CTLFireability8436043417382904288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16401076866071138180.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,19724,0.145411,8656,2,2850,5,18392,6,0,305,13869,0


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l150<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l150<1)))] != FALSE
Hit Full ! (commute/partial/dont) 1/0/68
(forward)formula 0,1,0.916012,26156,1,0,20,92815,19,4,1600,61888,16
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-01 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, 136/136 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 101
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 101
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 100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 72 transition count 93
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 72 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 70 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 70 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 69 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 68 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 67 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 67 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 67 transition count 83
Applied a total of 68 rules in 25 ms. Remains 67 /99 variables (removed 32) and now considering 83/136 (removed 53) transitions.
// Phase 1: matrix 83 rows 67 cols
[2025-05-29 20:46:39] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:46:39] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-29 20:46:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:46:40] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-29 20:46:40] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:46:40] [INFO ] Redundant transitions in 3 ms returned []
Running 82 sub problems to find dead transitions.
[2025-05-29 20:46:40] [INFO ] Invariant cache hit.
[2025-05-29 20:46:40] [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/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, 29/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 98 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2837 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 29/29 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/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, 29/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 82/180 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 180 constraints, problems are : Problem set: 0 solved, 82 unsolved in 15409 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18301ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 18303ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/99 places, 83/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18707 ms. Remains : 67/99 places, 83/136 transitions.
[2025-05-29 20:46:58] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:46:58] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:46:58] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 20:46:58] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:46:58] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:46:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11109312144076623382.gal : 2 ms
[2025-05-29 20:46:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1907644813798208718.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/CTLFireability11109312144076623382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1907644813798208718.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,45282,0.409575,16644,2,4748,5,53994,6,0,351,36068,0


Converting to forward existential form...Done !
original formula: AG(EF((E(((s1>=1)&&(l353>=1)) U ((s1>=1)&&(l509>=1))) + ((AG(((s1<1)||(l36<1))) * ((s1<1)||(l491<1))) * (((s1<1)||(l37<1))||((s6<1)||(l0<...163
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(((s1>=1)&&(l353>=1)) U ((s1>=1)&&(l509>=1))) + ((!(E(TRUE U !(((s1<1)||(l36<1)...235
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t41, t42, t43, t49, t51, t52, t53, t61, t62, t63, t64, t6...341
(forward)formula 0,1,1.57269,44616,1,0,190,188462,195,80,2421,122337,211
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 103
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 103
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 102
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 71 transition count 94
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 71 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 69 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 69 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 62 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 68 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 68 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 67 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 67 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 66 transition count 84
Applied a total of 70 rules in 36 ms. Remains 66 /99 variables (removed 33) and now considering 84/136 (removed 52) transitions.
// Phase 1: matrix 84 rows 66 cols
[2025-05-29 20:47:00] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:47:00] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-29 20:47:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:47:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-29 20:47:00] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:47:00] [INFO ] Redundant transitions in 2 ms returned []
Running 83 sub problems to find dead transitions.
[2025-05-29 20:47:00] [INFO ] Invariant cache hit.
[2025-05-29 20:47:00] [INFO ] State equation strengthened by 30 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, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/150 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 98 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3419 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 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, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/150 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 83/181 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 181 constraints, problems are : Problem set: 0 solved, 83 unsolved in 10365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13843ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 13843ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/99 places, 84/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14249 ms. Remains : 66/99 places, 84/136 transitions.
[2025-05-29 20:47:14] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:47:14] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:47:14] [INFO ] Input system was already deterministic with 84 transitions.
[2025-05-29 20:47:14] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:47:14] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:47:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9781607859510259385.gal : 2 ms
[2025-05-29 20:47:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16800234352951401946.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/CTLFireability9781607859510259385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16800234352951401946.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,36787,0.465196,15500,2,4018,5,42950,6,0,348,34441,0


Converting to forward existential form...Done !
original formula: A(!((EG(E(AF(((s1>=1)&&(l353>=1))) U ((s1>=1)&&(l127>=1)))) * EG(EF(!(((s1>=1)&&(l149>=1))))))) U EG(AG(!(EG(((p38>=1)&&(l136>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(E(TRUE U !(!(EG(((p38>=1)&&(l136>=1)))))))))))) * !(E(!(EG(!(E(TRUE U !(!(EG(((p38>=1)&&(l...350
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t46, t47, t4...371
(forward)formula 0,1,2.75601,68300,1,0,232,333885,203,94,2449,248373,254
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 81 transition count 110
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 transition count 110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 75 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 75 transition count 104
Applied a total of 48 rules in 4 ms. Remains 75 /99 variables (removed 24) and now considering 104/136 (removed 32) transitions.
// Phase 1: matrix 104 rows 75 cols
[2025-05-29 20:47:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:47:17] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-29 20:47:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:47:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-29 20:47:17] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-05-29 20:47:17] [INFO ] Invariant cache hit.
[2025-05-29 20:47:17] [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/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/179 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 41/118 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:47:20] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:47:20] [INFO ] Deduced a trap composed of 12 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:47:20] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:47:21] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:47:22] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:47:25] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:47:25] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 13 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/179 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:47:26] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 126 constraints, problems are : Problem set: 0 solved, 103 unsolved in 13576 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/179 variables, 75/85 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 41/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 103/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 229 constraints, problems are : Problem set: 0 solved, 103 unsolved in 15534 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29172ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 29173ms
Starting structural reductions in LTL mode, iteration 1 : 75/99 places, 104/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29479 ms. Remains : 75/99 places, 104/136 transitions.
[2025-05-29 20:47:46] [INFO ] Flatten gal took : 11 ms
[2025-05-29 20:47:46] [INFO ] Flatten gal took : 12 ms
[2025-05-29 20:47:46] [INFO ] Input system was already deterministic with 104 transitions.
[2025-05-29 20:47:46] [INFO ] Flatten gal took : 11 ms
[2025-05-29 20:47:46] [INFO ] Flatten gal took : 10 ms
[2025-05-29 20:47:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12247657634760472383.gal : 3 ms
[2025-05-29 20:47:46] [INFO ] Time to serialize properties into /tmp/CTLFireability486145806807643373.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/CTLFireability12247657634760472383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability486145806807643373.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,77084,0.807443,18472,2,3567,5,60913,6,0,404,37255,0


Converting to forward existential form...Done !
original formula: (AG(((((EF(((s1>=1)&&(l345>=1))) + ((s1>=1)&&(l150>=1))) + ((p19>=1)&&(l126>=1))) * ((AF(((p32>=1)&&(l0>=1))) + (s1<1)) + (l353<1))) * EG...360
=> equivalent forward existential formula: (([(((FwdU((Init * !(!((E(!((((s1>=1)&&(l504>=1)) + E(EG(!(((s1<1)||(l36<1)))) U !(EX(!(((p14>=1)&&(l156>=1)))))...1382
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, t53, t54, t55,...424
Using saturation style SCC detection
(forward)formula 0,0,7.78318,164236,1,0,493,825866,255,248,2916,716028,559
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-04 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, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 96
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 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 47 place count 76 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 66 transition count 83
Iterating global reduction 1 with 10 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 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 63 transition count 77
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 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 61 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 61 transition count 73
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 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 59 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 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 88 place count 59 transition count 67
Applied a total of 88 rules in 28 ms. Remains 59 /99 variables (removed 40) and now considering 67/136 (removed 69) transitions.
// Phase 1: matrix 67 rows 59 cols
[2025-05-29 20:47:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:47:54] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-29 20:47:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:47:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 20:47:54] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:47:54] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2025-05-29 20:47:54] [INFO ] Invariant cache hit.
[2025-05-29 20:47: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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
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, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 66/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 150 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10012ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 10013ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/99 places, 67/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10305 ms. Remains : 59/99 places, 67/136 transitions.
[2025-05-29 20:48:04] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:48:04] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:48:04] [INFO ] Input system was already deterministic with 67 transitions.
[2025-05-29 20:48:04] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:48:04] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:48:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17234571016007393902.gal : 2 ms
[2025-05-29 20:48:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16557042053251087361.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/CTLFireability17234571016007393902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16557042053251087361.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,23296,0.159715,8132,2,2387,5,16471,6,0,303,12569,0


Converting to forward existential form...Done !
original formula: EG(EF(((s1>=1)&&(l33>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((s1>=1)&&(l33>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t37, t38, t39, t43, t48, t49, t50, t51, t52, t53, t54, t55,...309
(forward)formula 0,1,1.49141,40404,1,0,295,172097,161,150,2066,167638,269
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 85 transition count 111
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 85 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 85 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 81 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 81 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 80 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 80 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 79 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 79 transition count 103
Applied a total of 41 rules in 5 ms. Remains 79 /99 variables (removed 20) and now considering 103/136 (removed 33) transitions.
// Phase 1: matrix 103 rows 79 cols
[2025-05-29 20:48:06] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:48:06] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-05-29 20:48:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:48:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-29 20:48:06] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-05-29 20:48:06] [INFO ] Invariant cache hit.
[2025-05-29 20:48:06] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/182 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 38/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 119 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 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/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/182 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 38/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 102/221 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 221 constraints, problems are : Problem set: 0 solved, 102 unsolved in 14402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19706ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 19706ms
Starting structural reductions in LTL mode, iteration 1 : 79/99 places, 103/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20104 ms. Remains : 79/99 places, 103/136 transitions.
[2025-05-29 20:48:26] [INFO ] Flatten gal took : 10 ms
[2025-05-29 20:48:26] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:48:26] [INFO ] Input system was already deterministic with 103 transitions.
[2025-05-29 20:48:26] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:48:26] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:48:26] [INFO ] Time to serialize gal into /tmp/CTLFireability18418225323898180774.gal : 1 ms
[2025-05-29 20:48:26] [INFO ] Time to serialize properties into /tmp/CTLFireability90188191137741839.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/CTLFireability18418225323898180774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability90188191137741839.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,79168,1.34287,30712,2,7104,5,97902,6,0,419,79214,0


Converting to forward existential form...Done !
original formula: A((((p36>=1)&&(l137>=1)) * (E(AX(AG(((p35>=1)&&(l136>=1)))) U (AF(((s4>=1)&&(l0>=1))) + (AF(((s1>=1)&&(l110>=1))) * EF(((s1>=1)&&(l149>=1...494
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((s1>=1)&&(l354>=1))) + !((E(!(((E(TRUE U !(E(TRUE U !(((s8>=1)&&(l151>=1)))))) * (p2...1630
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t53, t5...435
Using saturation style SCC detection
(forward)formula 0,1,13.169,311588,1,0,724,1.66003e+06,272,347,2999,1.42267e+06,883
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 99
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 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 44 place count 78 transition count 97
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 71 transition count 88
Iterating global reduction 1 with 7 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 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 69 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 69 transition count 82
Applied a total of 66 rules in 14 ms. Remains 69 /99 variables (removed 30) and now considering 82/136 (removed 54) transitions.
// Phase 1: matrix 82 rows 69 cols
[2025-05-29 20:48:39] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:48:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-29 20:48:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:48:40] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-29 20:48:40] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:48:40] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2025-05-29 20:48:40] [INFO ] Invariant cache hit.
[2025-05-29 20:48:40] [INFO ] State equation strengthened by 28 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, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/151 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 28/99 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 20:48:42] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:48:42] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:48:42] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:48:42] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 103 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4309 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 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/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/151 variables, 69/75 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 28/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 81/184 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 184 constraints, problems are : Problem set: 0 solved, 81 unsolved in 14269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18617ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 18618ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/99 places, 82/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18944 ms. Remains : 69/99 places, 82/136 transitions.
[2025-05-29 20:48:58] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:48:58] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:48:58] [INFO ] Input system was already deterministic with 82 transitions.
[2025-05-29 20:48:58] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:48:58] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:48:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6132898017003317683.gal : 2 ms
[2025-05-29 20:48:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3841194040711246729.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/CTLFireability6132898017003317683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3841194040711246729.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,48860,0.388767,15236,2,4141,5,44860,6,0,358,35395,0


Converting to forward existential form...Done !
original formula: AF(((EG(((AF((((s1>=1)&&(l504>=1))&&((s1>=1)&&(l338>=1)))) + (s1<1)) + (l484<1))) * (s1>=1)) * (l116>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((!(EG(!((((s1>=1)&&(l504>=1))&&((s1>=1)&&(l338>=1)))))) + (s1<1)) + (l484<1))) * (s1>=1)) * (...175
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t29, t50, t53, t54, t55, t59, t60, t61, t62, t63, t64, t65, t6...331
Using saturation style SCC detection
(forward)formula 0,0,4.95899,115012,1,0,443,554779,201,246,2488,545708,457
FORMULA DBSingleClientW-PT-d0m05-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, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 96
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 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 47 place count 76 transition count 95
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 67 transition count 84
Iterating global reduction 1 with 9 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 78
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 78
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 77
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
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 60 transition count 68
Applied a total of 86 rules in 13 ms. Remains 60 /99 variables (removed 39) and now considering 68/136 (removed 68) transitions.
// Phase 1: matrix 68 rows 60 cols
[2025-05-29 20:49:03] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:49:03] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-29 20:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:49:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 20:49:04] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:49:04] [INFO ] Redundant transitions in 2 ms returned []
Running 67 sub problems to find dead transitions.
[2025-05-29 20:49:04] [INFO ] Invariant cache hit.
[2025-05-29 20:49:04] [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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:05] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:05] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:05] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:06] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:06] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 91 constraints, problems are : Problem set: 0 solved, 67 unsolved in 4580 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 68/128 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 67/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 158 constraints, problems are : Problem set: 0 solved, 67 unsolved in 10992 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15598ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 15600ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/99 places, 68/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15835 ms. Remains : 60/99 places, 68/136 transitions.
[2025-05-29 20:49:19] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:49:19] [INFO ] Flatten gal took : 3 ms
[2025-05-29 20:49:19] [INFO ] Input system was already deterministic with 68 transitions.
[2025-05-29 20:49:19] [INFO ] Flatten gal took : 3 ms
[2025-05-29 20:49:19] [INFO ] Flatten gal took : 3 ms
[2025-05-29 20:49:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10151934862001332880.gal : 1 ms
[2025-05-29 20:49:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8642498789706088141.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10151934862001332880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8642498789706088141.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8642498789706088141.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 82
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :82 after 198
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :198 after 591
RANDOM walk for 40000 steps (9187 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :591 after 1581
BEST_FIRST walk for 40004 steps (2018 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 7 ms. (steps per millisecond=154 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 7 ms. (steps per millisecond=154 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 256
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 85 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 85 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 85 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 82 transition count 109
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 82 transition count 109
Applied a total of 35 rules in 2 ms. Remains 82 /99 variables (removed 17) and now considering 109/136 (removed 27) transitions.
// Phase 1: matrix 109 rows 82 cols
[2025-05-29 20:49: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:49:19] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-29 20:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:49:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-29 20:49:20] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2025-05-29 20:49:20] [INFO ] Invariant cache hit.
[2025-05-29 20:49:20] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/191 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:23] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:23] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:23] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:24] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:24] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:27] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 7 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 130 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/191 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 40/130 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 108/238 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 238 constraints, problems are : Problem set: 0 solved, 108 unsolved in 16563 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26941ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 26942ms
Starting structural reductions in LTL mode, iteration 1 : 82/99 places, 109/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27312 ms. Remains : 82/99 places, 109/136 transitions.
[2025-05-29 20:49:47] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:49:47] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:49:47] [INFO ] Input system was already deterministic with 109 transitions.
[2025-05-29 20:49:47] [INFO ] Flatten gal took : 11 ms
[2025-05-29 20:49:47] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:49:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14760039451123638842.gal : 2 ms
[2025-05-29 20:49:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17020293092769432168.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/CTLFireability14760039451123638842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17020293092769432168.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,90946,0.98591,24832,2,6157,5,83085,6,0,437,55317,0


Converting to forward existential form...Done !
original formula: A((!((((s1>=1)&&(l337>=1)) + ((AF(((s1>=1)&&(l112>=1))) * (s1>=1)) * (l354>=1)))) + !(((!(AG(((s1>=1)&&(l502>=1)))) * (p38>=1)) * (l136>=...447
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!((((s1>=1)&&(l110>=1)) + !((E(!(((s1>=1)&&(l149>=1))) U (!(((p36>=1)&&(l137>=1))) * !((...1570
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54, t55, t5...456
Using saturation style SCC detection
(forward)formula 0,0,10.1528,230100,1,0,639,1.1971e+06,289,310,3102,1.06036e+06,779
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 75 transition count 93
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 75 transition count 92
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 65 transition count 80
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 62 transition count 73
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
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 58 transition count 64
Applied a total of 90 rules in 7 ms. Remains 58 /99 variables (removed 41) and now considering 64/136 (removed 72) transitions.
// Phase 1: matrix 64 rows 58 cols
[2025-05-29 20:49:57] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:49:57] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-29 20:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:49:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 20:49:57] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-05-29 20:49:57] [INFO ] Invariant cache hit.
[2025-05-29 20:49:57] [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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:49:59] [INFO ] Deduced a trap composed of 24 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 20:49:59] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 82 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/122 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 63/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 63 unsolved in 6629 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9890ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 9891ms
Starting structural reductions in LTL mode, iteration 1 : 58/99 places, 64/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10222 ms. Remains : 58/99 places, 64/136 transitions.
[2025-05-29 20:50:07] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:50:07] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:50:07] [INFO ] Input system was already deterministic with 64 transitions.
[2025-05-29 20:50:07] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:50:07] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:50:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11610202425249608861.gal : 2 ms
[2025-05-29 20:50:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11588026786833681697.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/CTLFireability11610202425249608861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11588026786833681697.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,19724,0.146824,9004,2,2898,5,19031,6,0,296,15610,0


Converting to forward existential form...Done !
original formula: EG(AF(AX(((s1<1)||(l345<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(EX(!(((s1<1)||(l345<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...286
Using saturation style SCC detection
(forward)formula 0,1,1.79814,48604,1,0,284,194220,157,157,2021,217122,269
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 104
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 80 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 75 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 75 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 75 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 74 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 74 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 73 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 73 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 73 transition count 89
Applied a total of 58 rules in 4 ms. Remains 73 /99 variables (removed 26) and now considering 89/136 (removed 47) transitions.
// Phase 1: matrix 89 rows 73 cols
[2025-05-29 20:50:09] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:50:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-29 20:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:50:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-29 20:50:09] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-05-29 20:50:09] [INFO ] Invariant cache hit.
[2025-05-29 20:50:09] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/162 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 32/107 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 32/32 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/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/162 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 32/107 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 88/195 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 195 constraints, problems are : Problem set: 0 solved, 88 unsolved in 15268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19395ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 19395ms
Starting structural reductions in LTL mode, iteration 1 : 73/99 places, 89/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19670 ms. Remains : 73/99 places, 89/136 transitions.
[2025-05-29 20:50:29] [INFO ] Flatten gal took : 4 ms
[2025-05-29 20:50:29] [INFO ] Flatten gal took : 3 ms
[2025-05-29 20:50:29] [INFO ] Input system was already deterministic with 89 transitions.
[2025-05-29 20:50:29] [INFO ] Flatten gal took : 3 ms
[2025-05-29 20:50:29] [INFO ] Flatten gal took : 3 ms
[2025-05-29 20:50:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4566584852632483625.gal : 1 ms
[2025-05-29 20:50:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13917522645788527235.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/CTLFireability4566584852632483625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13917522645788527235.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,61810,0.637396,18268,2,4175,5,59258,6,0,381,38967,0


Converting to forward existential form...Done !
original formula: E(!(AF((EX(EF(((s1>=1)&&(l488>=1)))) + (((E(((s1>=1)&&(l502>=1)) U ((s1>=1)&&(l485>=1))) * E(((p12>=1)&&(l0>=1)) U ((p30>=1)&&(l0>=1)))) ...228
=> equivalent forward existential formula: [(FwdU(Init,!(!(EG(!((EX(E(TRUE U ((s1>=1)&&(l488>=1)))) + (((E(((s1>=1)&&(l502>=1)) U ((s1>=1)&&(l485>=1))) * E...286
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t52, t53, t54, t55, t58, t59, t60, t64, t65, t66, t67, t68, t69, t7...346
Using saturation style SCC detection
(forward)formula 0,0,3.71888,91528,1,0,304,462169,224,145,2689,362536,351
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 76 transition count 94
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 76 transition count 93
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 66 transition count 81
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 66 transition count 81
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 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 62 transition count 74
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 72
Applied a total of 79 rules in 11 ms. Remains 62 /99 variables (removed 37) and now considering 72/136 (removed 64) transitions.
// Phase 1: matrix 72 rows 62 cols
[2025-05-29 20:50:33] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:50:33] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-29 20:50:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:50:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 20:50:33] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:50:33] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-29 20:50:33] [INFO ] Invariant cache hit.
[2025-05-29 20:50:33] [INFO ] State equation strengthened by 22 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, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 86 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2410 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 8736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11176ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 11176ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/99 places, 72/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11405 ms. Remains : 62/99 places, 72/136 transitions.
[2025-05-29 20:50:44] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:50:44] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:50:44] [INFO ] Input system was already deterministic with 72 transitions.
[2025-05-29 20:50:44] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:50:44] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:50:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5685907430883355547.gal : 1 ms
[2025-05-29 20:50:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17106648597326632034.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/CTLFireability5685907430883355547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17106648597326632034.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,28866,0.29379,9584,2,2951,5,23116,6,0,320,19219,0


Converting to forward existential form...Done !
original formula: EG(((EG(((p25<1)||(l0<1))) + (s1<1)) + (l337<1)))
=> equivalent forward existential formula: [FwdG(Init,((EG(((p25<1)||(l0<1))) + (s1<1)) + (l337<1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...296
(forward)formula 0,1,2.05056,52724,1,0,220,235775,170,95,2246,202729,258
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 97
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 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 45 place count 77 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 69 transition count 86
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 69 transition count 86
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 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 68 transition count 83
Iterating global reduction 2 with 1 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
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 67 transition count 80
Applied a total of 69 rules in 5 ms. Remains 67 /99 variables (removed 32) and now considering 80/136 (removed 56) transitions.
// Phase 1: matrix 80 rows 67 cols
[2025-05-29 20:50:46] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:50:46] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-29 20:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:50:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 20:50:46] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-05-29 20:50:46] [INFO ] Invariant cache hit.
[2025-05-29 20:50:46] [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/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/147 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:50:49] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:50:49] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 98 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/147 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 177 constraints, problems are : Problem set: 0 solved, 79 unsolved in 13847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19123ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 19123ms
Starting structural reductions in LTL mode, iteration 1 : 67/99 places, 80/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19484 ms. Remains : 67/99 places, 80/136 transitions.
[2025-05-29 20:51:06] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:51:06] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:51:06] [INFO ] Input system was already deterministic with 80 transitions.
[2025-05-29 20:51:06] [INFO ] Flatten gal took : 5 ms
[2025-05-29 20:51:06] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:51:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11306630152456548096.gal : 1 ms
[2025-05-29 20:51:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11268571366587750951.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/CTLFireability11306630152456548096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11268571366587750951.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,51503,0.455412,11840,2,3271,5,31102,6,0,348,26086,0


Converting to forward existential form...Done !
original formula: (AG(AX(EF(((s1>=1)&&(l502>=1))))) * EF(((((s1>=1)&&(l334>=1))||(s1<1))||(l505<1))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((s1>=1)&&(l502>=1)))))] = FALSE * [(Init * !(E(TRUE U ((((s1>=1)&&(l334>=1)...189
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t51, t52, t53, t54, t58, t59, t60, t61, t62, t63, t64, t65, t6...321
(forward)formula 0,0,2.16997,44704,1,0,201,181490,182,86,2422,146452,228
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 107
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 107
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 105
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 73 transition count 98
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 73 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 56 place count 73 transition count 96
Applied a total of 56 rules in 2 ms. Remains 73 /99 variables (removed 26) and now considering 96/136 (removed 40) transitions.
// Phase 1: matrix 96 rows 73 cols
[2025-05-29 20:51:08] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:51:08] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-29 20:51:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:51:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-29 20:51:08] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-05-29 20:51:08] [INFO ] Invariant cache hit.
[2025-05-29 20:51:08] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 36/111 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:51:11] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:51:12] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:51:12] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:51:14] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:51:14] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:51:15] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:51:15] [INFO ] Deduced a trap composed of 27 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:51:15] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 119 constraints, problems are : Problem set: 0 solved, 95 unsolved in 10596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/169 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 36/119 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 95/214 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 214 constraints, problems are : Problem set: 0 solved, 95 unsolved in 17099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27742ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 27743ms
Starting structural reductions in LTL mode, iteration 1 : 73/99 places, 96/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28153 ms. Remains : 73/99 places, 96/136 transitions.
[2025-05-29 20:51:36] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:51:36] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:51:36] [INFO ] Input system was already deterministic with 96 transitions.
[2025-05-29 20:51:36] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:51:36] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:51:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16577786314750242775.gal : 1 ms
[2025-05-29 20:51:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12257200629689044059.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/CTLFireability16577786314750242775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12257200629689044059.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,70339,0.590488,15080,2,3525,5,45162,6,0,388,31100,0


Converting to forward existential form...Done !
original formula: EG(EF(((E((((s1>=1)&&(l486>=1))||((s1>=1)&&(l33>=1))) U ((s1<1)||(l150<1))) + (((s1<1)||(l502<1))&&((s1<1)||(l33<1)))) + ((EX(((s1>=1)&&(...192
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((E((((s1>=1)&&(l486>=1))||((s1>=1)&&(l33>=1))) U ((s1<1)||(l150<1))) + (((s1<1)||(l502<1))&...241
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, t53, t54, t55,...394
(forward)formula 0,1,2.37972,50100,1,0,227,192715,225,86,2803,164149,246
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-29 20:51:38] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:51:38] [INFO ] Flatten gal took : 5 ms
Total runtime 422404 ms.

BK_STOP 1748551898975

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

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