Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993500098.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is DBSingleClientW-PT-d0m06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993500098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.0K Mar 6 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 6 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 6 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 6 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779552498633

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 16:08:21] [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]
[2026-05-23 16:08:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:08:21] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2026-05-23 16:08:21] [INFO ] Transformed 553 places.
[2026-05-23 16:08:21] [INFO ] Transformed 150 transitions.
[2026-05-23 16:08:21] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 67 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 37 ms. Remains 99 /109 variables (removed 10) and now considering 136/150 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1691202063606868997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3053081866498850938.kers'
[2026-05-23 16:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1691202063606868997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3053081866498850938.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 99 cols 406 entries
Finished phase 1 with 95 SingleSign rule and 2 generalized
[2026-05-23 16:08:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3053081866498850938.kers
Total runtime 2 ms.
[2026-05-23 16:08:22] [INFO ] Implicit Places using invariants in 459 ms returned []
[2026-05-23 16:08:22] [INFO ] Invariant cache hit.
[2026-05-23 16:08:22] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-23 16:08:22] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2026-05-23 16:08:22] [INFO ] Invariant cache hit.
[2026-05-23 16:08:22] [INFO ] State equation strengthened by 62 read => feed constraints.
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, 62/163 constraints. Problems are: Problem set: 0 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 163 constraints, problems are : Problem set: 0 solved, 135 unsolved in 11892 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
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, 62/163 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 135/298 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/298 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 298 constraints, problems are : Problem set: 0 solved, 135 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42342ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 42368ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 136/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43356 ms. Remains : 99/109 places, 136/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2026-05-23 16:09:05] [INFO ] Invariant cache hit.
[2026-05-23 16:09:05] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 16:09:05] [INFO ] Invariant cache hit.
[2026-05-23 16:09:05] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-23 16:09:05] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 99/99 places, 136/136 transitions.
Support contains 67 out of 99 places after structural reductions.
[2026-05-23 16:09:05] [INFO ] Flatten gal took : 113 ms
[2026-05-23 16:09:05] [INFO ] Flatten gal took : 38 ms
[2026-05-23 16:09:05] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 66 out of 99 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 63
RANDOM walk for 40000 steps (9155 resets) in 2938 ms. (13 steps per ms) remains 32/63 properties
BEST_FIRST walk for 4004 steps (194 resets) in 91 ms. (43 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (196 resets) in 33 ms. (117 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (192 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (195 resets) in 58 ms. (67 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4002 steps (202 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (185 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (204 resets) in 56 ms. (70 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (217 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (199 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (214 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (201 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (426 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (384 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (410 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (800 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (199 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (195 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (374 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (203 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (182 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (189 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (195 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (374 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (192 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (207 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (206 resets) in 55 ms. (71 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (417 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (201 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (177 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (204 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
[2026-05-23 16:09:07] [INFO ] Invariant cache hit.
[2026-05-23 16:09:07] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/69 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/87 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 133/220 variables, 87/89 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 59/148 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/148 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 15/235 variables, 12/160 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 3/163 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/163 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/235 variables, 1/164 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/164 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/235 variables, 1/165 constraints. Problems are: Problem set: 5 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/235 variables, and 165 constraints, problems are : Problem set: 5 solved, 25 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 29/64 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 20/84 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 122/206 variables, 84/86 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 48/134 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 3/137 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 29/235 variables, 15/152 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 14/166 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 22/188 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/190 constraints. Problems are: Problem set: 5 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/190 constraints. Problems are: Problem set: 5 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/235 variables, and 190 constraints, problems are : Problem set: 5 solved, 25 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 25/30 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10064ms problems are : Problem set: 5 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 94 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 94 transition count 129
Applied a total of 10 rules in 24 ms. Remains 94 /99 variables (removed 5) and now considering 129/136 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 94/99 places, 129/136 transitions.
RANDOM walk for 40000 steps (9196 resets) in 482 ms. (82 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (180 resets) in 19 ms. (200 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4001 steps (191 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (200 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (214 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (207 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (202 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (197 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (189 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (194 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (215 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (372 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (404 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (800 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (388 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (192 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (184 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (190 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (399 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (195 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (212 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (193 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (395 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (215 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
Finished probabilistic random walk after 38511 steps, run visited all 23 properties in 152 ms. (steps per millisecond=253 )
Probabilistic random walk after 38511 steps, saw 16986 distinct states, run finished after 158 ms. (steps per millisecond=243 ) properties seen :23
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2026-05-23 16:09:17] [INFO ] Flatten gal took : 15 ms
[2026-05-23 16:09:17] [INFO ] Flatten gal took : 16 ms
[2026-05-23 16:09:17] [INFO ] Input system was already deterministic with 136 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 331 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 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 100
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 82 transition count 99
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 74 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 74 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 74 transition count 89
Applied a total of 53 rules in 12 ms. Remains 74 /99 variables (removed 25) and now considering 89/136 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4984230618824078004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8861787442492589239.kers'
[2026-05-23 16:09:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4984230618824078004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8861787442492589239.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 74 cols 298 entries
Finished phase 1 with 70 SingleSign rule and 2 generalized
[2026-05-23 16:09:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8861787442492589239.kers
Total runtime 4 ms.
[2026-05-23 16:09:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-23 16:09:18] [INFO ] Invariant cache hit.
[2026-05-23 16:09:18] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 16:09:18] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-23 16:09:18] [INFO ] Invariant cache hit.
[2026-05-23 16:09:18] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/163 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 26/102 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 115 constraints, problems are : Problem set: 0 solved, 88 unsolved in 7629 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 89/163 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 88/203 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 203 constraints, problems are : Problem set: 0 solved, 88 unsolved in 14048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21745ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 21748ms
Starting structural reductions in LTL mode, iteration 1 : 74/99 places, 89/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22022 ms. Remains : 74/99 places, 89/136 transitions.
[2026-05-23 16:09:40] [INFO ] Flatten gal took : 12 ms
[2026-05-23 16:09:40] [INFO ] Flatten gal took : 9 ms
[2026-05-23 16:09:40] [INFO ] Input system was already deterministic with 89 transitions.
[2026-05-23 16:09:40] [INFO ] Flatten gal took : 9 ms
[2026-05-23 16:09:40] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:09:40] [INFO ] Time to serialize gal into /tmp/CTLFireability632397785839614057.gal : 4 ms
[2026-05-23 16:09:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4743688864625111812.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability632397785839614057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4743688864625111812.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,647821,1.45239,38268,2,8133,5,121662,6,0,385,131527,0


Converting to forward existential form...Done !
original formula: EX(!(A(((AF(((s1>=1)&&(l338>=1))) * (!(((s1>=1)&&(l503>=1))) + A(((s1>=1)&&(l345>=1)) U ((p27>=1)&&(l0>=1))))) * !(((s1>=1)&&(l490>=1))))...238
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(EX((E(((s1>=1)&&(l501>=1)) U ((p25>=1)&&(l0>=1))) * !(((s1>=1)&&(l337>=1))))))) * !(((!(EG(!...556
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t51, t52, t54, t55, t62, t63, t64, t65, t66, t67, t68, t69, t70, t7...341
(forward)formula 0,1,14.6494,346364,1,0,570,1.7791e+06,226,294,2722,1.60816e+06,658
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 105
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 82 transition count 103
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 73 transition count 94
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 73 transition count 94
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 92
Applied a total of 56 rules in 9 ms. Remains 73 /99 variables (removed 26) and now considering 92/136 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9316955620627165846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8624607571562555291.kers'
[2026-05-23 16:09:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9316955620627165846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8624607571562555291.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 73 cols 296 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-23 16:09:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8624607571562555291.kers
Total runtime 1 ms.
[2026-05-23 16:09:55] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-23 16:09:55] [INFO ] Invariant cache hit.
[2026-05-23 16:09:55] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 16:09:55] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-23 16:09:55] [INFO ] Invariant cache hit.
[2026-05-23 16:09:55] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/165 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 32/107 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 107 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4313 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: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/165 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 32/107 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 91/198 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/165 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 198 constraints, problems are : Problem set: 0 solved, 91 unsolved in 20063 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: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24431ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 24432ms
Starting structural reductions in LTL mode, iteration 1 : 73/99 places, 92/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24870 ms. Remains : 73/99 places, 92/136 transitions.
[2026-05-23 16:10:19] [INFO ] Flatten gal took : 12 ms
[2026-05-23 16:10:19] [INFO ] Flatten gal took : 12 ms
[2026-05-23 16:10:19] [INFO ] Input system was already deterministic with 92 transitions.
[2026-05-23 16:10:19] [INFO ] Flatten gal took : 12 ms
[2026-05-23 16:10:19] [INFO ] Flatten gal took : 12 ms
[2026-05-23 16:10:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9232058329975581467.gal : 4 ms
[2026-05-23 16:10:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11696863677058436867.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9232058329975581467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11696863677058436867.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,723949,1.34684,40136,2,6176,5,148600,6,0,384,107065,0


Converting to forward existential form...Done !
original formula: AF((!(E(((((s1>=1)&&(l340>=1)) + EF(((s1>=1)&&(l91>=1)))) + A(((s1>=1)&&(l505>=1)) U ((s1>=1)&&(l33>=1)))) U AX(EX(((s1>=1)&&(l504>=1))))...237
=> equivalent forward existential formula: [FwdG(Init,!((!(E(((((s1>=1)&&(l340>=1)) + E(TRUE U ((s1>=1)&&(l91>=1)))) + !((E(!(((s1>=1)&&(l33>=1))) U (!(((s...361
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t48, t49, t50, t55, t58, t59, t60, t68, t69, t70, t71, t72,...349
(forward)formula 0,0,16.2216,378120,1,0,571,1.83696e+06,233,299,2712,2.03064e+06,584
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 81 transition count 107
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 81 transition count 106
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 71 transition count 96
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 71 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 69 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 69 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 69 transition count 92
Applied a total of 62 rules in 11 ms. Remains 69 /99 variables (removed 30) and now considering 92/136 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3722314753049209555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14814551794351719427.kers'
[2026-05-23 16:10:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3722314753049209555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14814551794351719427.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 69 cols 291 entries
Finished phase 1 with 65 SingleSign rule and 2 generalized
[2026-05-23 16:10:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14814551794351719427.kers
Total runtime 1 ms.
[2026-05-23 16:10:36] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 16:10:36] [INFO ] Invariant cache hit.
[2026-05-23 16:10:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 16:10:36] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-23 16:10:36] [INFO ] Invariant cache hit.
[2026-05-23 16:10:36] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/161 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 34/105 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 109 constraints, problems are : Problem set: 0 solved, 91 unsolved in 9119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/161 variables, 69/75 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 34/109 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 91/200 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 200 constraints, problems are : Problem set: 0 solved, 91 unsolved in 16042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25215ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 25217ms
Starting structural reductions in LTL mode, iteration 1 : 69/99 places, 92/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25478 ms. Remains : 69/99 places, 92/136 transitions.
[2026-05-23 16:11:01] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:11:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:11:01] [INFO ] Input system was already deterministic with 92 transitions.
[2026-05-23 16:11:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:11:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:11:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8424570220906372858.gal : 2 ms
[2026-05-23 16:11:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3230475065041744628.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8424570220906372858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3230475065041744628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,544052,2.53562,57872,2,8814,5,244477,6,0,368,168052,0


Converting to forward existential form...Done !
original formula: (EF(((s1>=1)&&(l491>=1))) * E(AX(((EG(((s1>=1)&&(l345>=1))) * A(((s1>=1)&&(l150>=1)) U ((s1>=1)&&(l509>=1)))) * AX(FALSE))) U EX(!(((E(((...277
=> equivalent forward existential formula: (([(EY(FwdU((Init * E(TRUE U ((s1>=1)&&(l491>=1)))),!(EX(!(((EG(((s1>=1)&&(l345>=1))) * !((E(!(((s1>=1)&&(l509>=...896
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t50, t51, t52, t58, t6...376
(forward)formula 0,1,15.7248,326912,1,0,418,1.82034e+06,230,182,2568,1.51963e+06,502
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-02 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 102
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 transition count 102
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 71 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 71 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 71 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 69 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 69 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 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 16 ms. Remains 67 /99 variables (removed 32) and now considering 80/136 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-971174030402796261.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-956001443204017646.kers'
[2026-05-23 16:11:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-971174030402796261.kers, --Pflows, --basisKERS=/tmp/petrispot-output-956001443204017646.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 67 cols 254 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 16:11:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-956001443204017646.kers
Total runtime 1 ms.
[2026-05-23 16:11:17] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 16:11:17] [INFO ] Invariant cache hit.
[2026-05-23 16:11:17] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 16:11:17] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2026-05-23 16:11:17] [INFO ] Invariant cache hit.
[2026-05-23 16:11:17] [INFO ] State equation strengthened by 29 read => feed constraints.
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, 29/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (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 2500 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: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
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, 29/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (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 13443 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: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15968ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 15968ms
Starting structural reductions in LTL mode, iteration 1 : 67/99 places, 80/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16242 ms. Remains : 67/99 places, 80/136 transitions.
[2026-05-23 16:11:33] [INFO ] Flatten gal took : 9 ms
[2026-05-23 16:11:33] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:11:33] [INFO ] Input system was already deterministic with 80 transitions.
[2026-05-23 16:11:33] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:11:33] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2144990430251687011.gal : 2 ms
[2026-05-23 16:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15904914602201218255.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2144990430251687011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15904914602201218255.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,346632,1.05679,26952,2,7342,5,86324,6,0,348,86066,0


Converting to forward existential form...Done !
original formula: AF((AX(((s1>=1)&&(l504>=1))) + (((s1>=1)&&(l496>=1))&&((s1<1)||(l133<1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(((s1>=1)&&(l504>=1))))) + (((s1>=1)&&(l496>=1))&&((s1<1)||(l133<1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t47, t51, t52, t53, t57, t58, t59, t60, t61, t62, t63, t6...331
(forward)formula 0,0,6.09602,145292,1,0,352,583117,184,189,2360,810794,300
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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 97
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 68 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 79
Iterating global reduction 2 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 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 63 transition count 73
Applied a total of 77 rules in 26 ms. Remains 63 /99 variables (removed 36) and now considering 73/136 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3283590698488112800.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12105729429505365820.kers'
[2026-05-23 16:11:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3283590698488112800.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12105729429505365820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 240 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 16:11:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12105729429505365820.kers
Total runtime 1 ms.
[2026-05-23 16:11:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 16:11:40] [INFO ] Invariant cache hit.
[2026-05-23 16:11:40] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 16:11:40] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-05-23 16:11:40] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-23 16:11:40] [INFO ] Invariant cache hit.
[2026-05-23 16:11:40] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 88 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 160 constraints, problems are : Problem set: 0 solved, 72 unsolved in 7654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10414ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 10415ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/99 places, 73/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10670 ms. Remains : 63/99 places, 73/136 transitions.
[2026-05-23 16:11:50] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:11:50] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:11:50] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-23 16:11:50] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:11:50] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:11:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16569126739278367389.gal : 1 ms
[2026-05-23 16:11:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17593602193687082826.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16569126739278367389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17593602193687082826.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,269258,0.818626,22020,2,5403,5,69127,6,0,325,74718,0


Converting to forward existential form...Done !
original formula: EG(EF(((s1>=1)&&(l503>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((s1>=1)&&(l503>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t48, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,1,6.27048,147820,1,0,364,702751,173,198,2247,757901,338
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 110
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 82 transition count 109
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 73 transition count 100
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 73 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 71 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 71 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 71 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 70 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 70 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 69 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 69 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 68 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 68 transition count 92
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 68 transition count 90
Applied a total of 66 rules in 25 ms. Remains 68 /99 variables (removed 31) and now considering 90/136 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3799312442541120590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9680343368645134948.kers'
[2026-05-23 16:11:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3799312442541120590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9680343368645134948.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 90 rows 68 cols 278 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-23 16:11:57] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9680343368645134948.kers
Total runtime 2 ms.
[2026-05-23 16:11:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 16:11:57] [INFO ] Invariant cache hit.
[2026-05-23 16:11:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 16:11:57] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2026-05-23 16:11:57] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2026-05-23 16:11:57] [INFO ] Invariant cache hit.
[2026-05-23 16:11:57] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/158 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 36/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/158 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 115 constraints, problems are : Problem set: 0 solved, 89 unsolved in 13133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/158 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 36/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 89/204 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 204 constraints, problems are : Problem set: 0 solved, 89 unsolved in 23435 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36597ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 36597ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/99 places, 90/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36891 ms. Remains : 68/99 places, 90/136 transitions.
[2026-05-23 16:12:33] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:12:33] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:12:34] [INFO ] Input system was already deterministic with 90 transitions.
[2026-05-23 16:12:34] [INFO ] Flatten gal took : 9 ms
[2026-05-23 16:12:34] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:12:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6909305273323533357.gal : 1 ms
[2026-05-23 16:12:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10223582992163595606.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6909305273323533357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10223582992163595606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,438643,1.69106,43728,2,5922,5,152239,6,0,362,108789,0


Converting to forward existential form...Done !
original formula: (!(E(((s1>=1)&&(l114>=1)) U ((!(EF(((s1>=1)&&(l150>=1)))) * AF(!(((s1>=1)&&(l491>=1))))) * ((s1>=1)&&(l33>=1))))) * !(A(EF(!(EG(((s1>=1)&...228
=> equivalent forward existential formula: ([(((FwdU(Init,((s1>=1)&&(l114>=1))) * ((s1>=1)&&(l33>=1))) * !(E(TRUE U ((s1>=1)&&(l150>=1))))) * !(EG(!(!(((s1...480
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, t45, t46, t47,...399
Hit Full ! (commute/partial/dont) 1/86/89
(forward)formula 0,1,10.3173,224800,1,0,430,1.15481e+06,228,180,2612,1.04516e+06,505
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL 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 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 63 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 78 place count 63 transition count 73
Applied a total of 78 rules in 7 ms. Remains 63 /99 variables (removed 36) and now considering 73/136 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15158538499059559243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18259944557031492658.kers'
[2026-05-23 16:12:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15158538499059559243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18259944557031492658.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 244 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 16:12:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18259944557031492658.kers
Total runtime 0 ms.
[2026-05-23 16:12:44] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-23 16:12:44] [INFO ] Invariant cache hit.
[2026-05-23 16:12:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 16:12:44] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2026-05-23 16:12:44] [INFO ] Invariant cache hit.
[2026-05-23 16:12:44] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 90 constraints, problems are : Problem set: 0 solved, 72 unsolved in 6035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/136 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 72/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 162 constraints, problems are : Problem set: 0 solved, 72 unsolved in 10010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16070ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 16071ms
Starting structural reductions in LTL mode, iteration 1 : 63/99 places, 73/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16369 ms. Remains : 63/99 places, 73/136 transitions.
[2026-05-23 16:13:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:00] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-23 16:13:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:00] [INFO ] Time to serialize gal into /tmp/CTLFireability18071406283016691839.gal : 1 ms
[2026-05-23 16:13:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13012665531951676908.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18071406283016691839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13012665531951676908.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,241836,0.65069,22432,2,5756,5,67739,6,0,325,68508,0


Converting to forward existential form...Done !
original formula: AF(AG(EX(((AF(((p36>=1)&&(l137>=1))) * (p38>=1)) * (l136>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX(((!(EG(!(((p36>=1)&&(l137>=1))))) * (p38>=1)) * (l136>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,0,6.85707,166536,1,0,249,852143,178,107,2345,708274,296
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-06 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 100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 100
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 69 transition count 89
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 69 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 69 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 66 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 66 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 64 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 64 transition count 76
Applied a total of 75 rules in 6 ms. Remains 64 /99 variables (removed 35) and now considering 76/136 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8529516104437205697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6786399074148813841.kers'
[2026-05-23 16:13:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8529516104437205697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6786399074148813841.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 64 cols 245 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 16:13:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6786399074148813841.kers
Total runtime 0 ms.
[2026-05-23 16:13:07] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 16:13:07] [INFO ] Invariant cache hit.
[2026-05-23 16:13:07] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 16:13:07] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2026-05-23 16:13:07] [INFO ] Invariant cache hit.
[2026-05-23 16:13:07] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/140 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 75 unsolved in 7730 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 76/140 variables, 64/71 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 75/172 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 172 constraints, problems are : Problem set: 0 solved, 75 unsolved in 15786 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23537ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 23537ms
Starting structural reductions in LTL mode, iteration 1 : 64/99 places, 76/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23767 ms. Remains : 64/99 places, 76/136 transitions.
[2026-05-23 16:13:31] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:13:31] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:31] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-23 16:13:31] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:13:31] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7632093851883234575.gal : 1 ms
[2026-05-23 16:13:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9523332231468426694.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7632093851883234575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9523332231468426694.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,249736,0.93286,27420,2,6287,5,95080,6,0,332,79041,0


Converting to forward existential form...Done !
original formula: (A(A(((s1>=1)&&(l124>=1)) U EF(((s1>=1)&&(l484>=1)))) U ((s4>=1)&&(l0>=1))) + AX(((s2>=1)&&(l497>=1))))
=> equivalent forward existential formula: [(EY((Init * !(!((E(!(((s4>=1)&&(l0>=1))) U (!(!((E(!(E(TRUE U ((s1>=1)&&(l484>=1)))) U (!(((s1>=1)&&(l124>=1)))...331
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t6...301
Using saturation style SCC detection
(forward)formula 0,0,10.0522,222764,1,0,381,1.18799e+06,191,195,2368,1.02396e+06,452
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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 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 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 68 transition count 89
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 67 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 66 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 66 transition count 84
Applied a total of 69 rules in 7 ms. Remains 66 /99 variables (removed 33) and now considering 84/136 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12498513373018102923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4521041272931263010.kers'
[2026-05-23 16:13:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12498513373018102923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4521041272931263010.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 66 cols 273 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-23 16:13:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4521041272931263010.kers
Total runtime 5 ms.
[2026-05-23 16:13:41] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 16:13:41] [INFO ] Invariant cache hit.
[2026-05-23 16:13:41] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 16:13:41] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2026-05-23 16:13:41] [INFO ] Invariant cache hit.
[2026-05-23 16:13:41] [INFO ] State equation strengthened by 28 read => feed constraints.
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, 28/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 100 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5501 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/150 variables, 66/72 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 83/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 183 constraints, problems are : Problem set: 0 solved, 83 unsolved in 10245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15779ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 15780ms
Starting structural reductions in LTL mode, iteration 1 : 66/99 places, 84/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16057 ms. Remains : 66/99 places, 84/136 transitions.
[2026-05-23 16:13:57] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:57] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:13:57] [INFO ] Input system was already deterministic with 84 transitions.
[2026-05-23 16:13:57] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:57] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:13:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6861265702895455171.gal : 1 ms
[2026-05-23 16:13:57] [INFO ] Time to serialize properties into /tmp/CTLFireability11022535568480705386.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6861265702895455171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11022535568480705386.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,375982,1.1697,32284,2,6349,5,109381,6,0,348,108628,0


Converting to forward existential form...Done !
original formula: !(E(!((AX(AF(((s1>=1)&&(l338>=1)))) + ((EG(((s1>=1)&&(l125>=1))) + ((s1>=1)&&(l355>=1))) * !(((s1>=1)&&(l150>=1)))))) U ((p36>=1)&&(l137>...161
=> equivalent forward existential formula: [(FwdU(Init,!((!(EX(!(!(EG(!(((s1>=1)&&(l338>=1)))))))) + ((EG(((s1>=1)&&(l125>=1))) + ((s1>=1)&&(l355>=1))) * !...215
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t54, t62, t63, t64, t6...346
(forward)formula 0,0,10.4544,234808,1,0,473,1.19482e+06,204,244,2432,1.14882e+06,540
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 82 transition count 105
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 82 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 82 transition count 103
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 72 transition count 93
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 72 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 69 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 69 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 68 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 67 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 67 transition count 83
Applied a total of 68 rules in 6 ms. Remains 67 /99 variables (removed 32) and now considering 83/136 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6710201016250476731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2785255758412062483.kers'
[2026-05-23 16:14:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6710201016250476731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2785255758412062483.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 67 cols 268 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 16:14:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2785255758412062483.kers
Total runtime 1 ms.
[2026-05-23 16:14:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 16:14:08] [INFO ] Invariant cache hit.
[2026-05-23 16:14:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 16:14:08] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2026-05-23 16:14:08] [INFO ] Invariant cache hit.
[2026-05-23 16:14:08] [INFO ] State equation strengthened by 28 read => feed constraints.
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, 28/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 103 constraints, problems are : Problem set: 0 solved, 82 unsolved in 6261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/150 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 28/103 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 82/185 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 185 constraints, problems are : Problem set: 0 solved, 82 unsolved in 16695 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22987ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 22987ms
Starting structural reductions in LTL mode, iteration 1 : 67/99 places, 83/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23286 ms. Remains : 67/99 places, 83/136 transitions.
[2026-05-23 16:14:31] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:14:31] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:14:31] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-23 16:14:31] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:14:31] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:14:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17893748102920280468.gal : 1 ms
[2026-05-23 16:14:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5308432733999371359.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17893748102920280468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5308432733999371359.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,340456,1.07979,29520,2,5568,5,119354,6,0,351,78958,0


Converting to forward existential form...Done !
original formula: (!(E(EG(EX((((s1>=1)&&(l484>=1))||((p28>=1)&&(l0>=1))))) U EF(((EF(((s1>=1)&&(l353>=1))) * (s0>=1)) * (l0>=1))))) * AX(AF((((p13>=1)&&(l1...235
=> equivalent forward existential formula: ([(FwdU(((FwdU(FwdU(Init,EG(EX((((s1>=1)&&(l484>=1))||((p28>=1)&&(l0>=1)))))),TRUE) * (l0>=1)) * (s0>=1)),TRUE) ...311
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t43, t44, t45, t46, t47, t48, t55, t60, t61, t62, t63, t64,...344
Using saturation style SCC detection
(forward)formula 0,0,9.13492,191888,1,0,371,1.03197e+06,210,165,2491,780612,420
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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 103
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 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 37 place count 81 transition count 102
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 69 transition count 90
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 69 transition count 90
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 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 66 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 66 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 64 transition count 78
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 61 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 61 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 83 place count 61 transition count 72
Applied a total of 83 rules in 10 ms. Remains 61 /99 variables (removed 38) and now considering 72/136 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2330868349788655737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-798100987970921728.kers'
[2026-05-23 16:14:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2330868349788655737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-798100987970921728.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 61 cols 231 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 16:14:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-798100987970921728.kers
Total runtime 1 ms.
[2026-05-23 16:14:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 16:14:40] [INFO ] Invariant cache hit.
[2026-05-23 16:14:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:14:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2026-05-23 16:14:41] [INFO ] Invariant cache hit.
[2026-05-23 16:14:41] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/133 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 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
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/133 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9122ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 9122ms
Starting structural reductions in LTL mode, iteration 1 : 61/99 places, 72/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9377 ms. Remains : 61/99 places, 72/136 transitions.
[2026-05-23 16:14:50] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:14:50] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:14:50] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-23 16:14:50] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:14:50] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:14:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11032040635687369177.gal : 0 ms
[2026-05-23 16:14:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2253922059593051740.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11032040635687369177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2253922059593051740.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,148109,0.570644,18872,2,5877,5,52937,6,0,316,53717,0


Converting to forward existential form...Done !
original formula: EF(EG(((!(E(AX(((s1>=1)&&(l1>=1))) U (((s6>=1)&&(l0>=1))||((p27>=1)&&(l0>=1))))) + (s1<1)) + (l150<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!(E(!(EX(!(((s1>=1)&&(l1>=1))))) U (((s6>=1)&&(l0>=1))||((p27>=1)&&(l0>=1))))) + (s1<1))...178
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t46, t51, t52, t53, t5...341
(forward)formula 0,1,2.13493,48356,1,0,167,178800,171,64,2216,178510,173
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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 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 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 67 transition count 88
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 60 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 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 12 ms. Remains 59 /99 variables (removed 40) and now considering 69/136 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3770046149273933923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15942623637479061619.kers'
[2026-05-23 16:14:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3770046149273933923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15942623637479061619.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 59 cols 219 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 16:14:52] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15942623637479061619.kers
Total runtime 2 ms.
[2026-05-23 16:14:52] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-23 16:14:52] [INFO ] Invariant cache hit.
[2026-05-23 16:14:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:14:52] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2026-05-23 16:14:52] [INFO ] Invariant cache hit.
[2026-05-23 16:14:52] [INFO ] State equation strengthened by 25 read => feed constraints.
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 1941 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
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 8304 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 10273ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 10273ms
Starting structural reductions in LTL mode, iteration 1 : 59/99 places, 69/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10634 ms. Remains : 59/99 places, 69/136 transitions.
[2026-05-23 16:15:03] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:15:03] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:15:03] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-23 16:15:03] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:15:03] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:15:03] [INFO ] Time to serialize gal into /tmp/CTLFireability18030318455559814918.gal : 1 ms
[2026-05-23 16:15:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3914562361316404149.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18030318455559814918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3914562361316404149.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,141041,0.415887,15576,2,5124,5,44467,6,0,305,41475,0


Converting to forward existential form...Done !
original formula: AG(AX(((EF(((s1<1)||(l149<1))) + EG(((s1<1)||(l149<1)))) + EG(AG(((s1<1)||(l149<1)))))))
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * !(EG(!(E(TRUE U !(((s1<1)||(l149<1)))))))) * !(EG(((s1<1)||(l149<1))))) * !(E(TRUE U (...184
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t45, t50, t51, t52, t5...331
(forward)formula 0,1,1.75829,44856,1,0,143,175619,159,54,2067,136236,148
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 105
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 83 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 77 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 77 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 47 place count 77 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 76 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 76 transition count 93
Applied a total of 50 rules in 13 ms. Remains 76 /99 variables (removed 23) and now considering 93/136 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8762124470293263591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4709759616995537400.kers'
[2026-05-23 16:15:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8762124470293263591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4709759616995537400.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 76 cols 298 entries
Finished phase 1 with 72 SingleSign rule and 2 generalized
[2026-05-23 16:15:04] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4709759616995537400.kers
Total runtime 2 ms.
[2026-05-23 16:15:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 16:15:04] [INFO ] Invariant cache hit.
[2026-05-23 16:15:05] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-23 16:15:05] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2026-05-23 16:15:05] [INFO ] Redundant transitions in 4 ms returned []
Running 92 sub problems to find dead transitions.
[2026-05-23 16:15:05] [INFO ] Invariant cache hit.
[2026-05-23 16:15:05] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/169 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 33/111 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 124 constraints, problems are : Problem set: 0 solved, 92 unsolved in 9262 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 93/169 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 92/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 216 constraints, problems are : Problem set: 0 solved, 92 unsolved in 16145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25444ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 25446ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/99 places, 93/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25840 ms. Remains : 76/99 places, 93/136 transitions.
[2026-05-23 16:15:30] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:15:30] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:15:30] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-23 16:15:30] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:15:30] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:15:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5518988867385782541.gal : 1 ms
[2026-05-23 16:15:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14224688795767730661.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5518988867385782541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14224688795767730661.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,911886,2.06332,48112,2,7233,5,161336,6,0,397,149357,0


Converting to forward existential form...Done !
original formula: AF(((AG(((EG(((p28<1)||(l0<1))) + AF(((s1<1)||(l489<1)))) + ((s1<1)||(l487<1)))) * (EG(EF(((s1>=1)&&(l490>=1)))) + ((s1>=1)&&(l510>=1))))...231
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(((EG(((p28<1)||(l0<1))) + !(EG(!(((s1<1)||(l489<1)))))) + ((s1<1)||(l487<1)))))) * (...369
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t49, t50, t51, t54, t55, t56, t58, t59, t60, t67, t68, t69, t7...366
Using saturation style SCC detection
(forward)formula 0,0,24.1929,524724,1,0,724,2.78161e+06,243,393,2831,2.6554e+06,816
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 86 transition count 116
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 86 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 86 transition count 113
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 79 transition count 106
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 79 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 79 transition count 104
Applied a total of 45 rules in 2 ms. Remains 79 /99 variables (removed 20) and now considering 104/136 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1134520210578534708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11085651094090141344.kers'
[2026-05-23 16:15:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1134520210578534708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11085651094090141344.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 79 cols 322 entries
Finished phase 1 with 75 SingleSign rule and 2 generalized
[2026-05-23 16:15:55] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11085651094090141344.kers
Total runtime 4 ms.
[2026-05-23 16:15:55] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-23 16:15:55] [INFO ] Invariant cache hit.
[2026-05-23 16:15:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 16:15:55] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-23 16:15:55] [INFO ] Invariant cache hit.
[2026-05-23 16:15:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/183 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 42/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 123 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/183 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 42/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 103/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 226 constraints, problems are : Problem set: 0 solved, 103 unsolved in 29614 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35846ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 35846ms
Starting structural reductions in LTL mode, iteration 1 : 79/99 places, 104/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36140 ms. Remains : 79/99 places, 104/136 transitions.
[2026-05-23 16:16:31] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:16:31] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:16:31] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-23 16:16:31] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:16:31] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:16:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9066291894207017385.gal : 1 ms
[2026-05-23 16:16:31] [INFO ] Time to serialize properties into /tmp/CTLFireability3875613788927824979.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9066291894207017385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3875613788927824979.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00769e+06,2.00756,46476,2,6633,5,180803,6,0,420,108321,0


Converting to forward existential form...Done !
original formula: (AF(EX(((((((s1>=1)&&(l33>=1)) + AG(((s1>=1)&&(l33>=1)))) * (s7>=1)) * (l0>=1)) + (!(E(((s1>=1)&&(l503>=1)) U ((s1>=1)&&(l339>=1)))) * ((...500
=> equivalent forward existential formula: ([FwdG(Init,!(EX(((((((s1>=1)&&(l33>=1)) + !(E(TRUE U !(((s1>=1)&&(l33>=1)))))) * (s7>=1)) * (l0>=1)) + (!(E(((s...1084
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,...429
(forward)formula 0,0,12.9455,262064,1,0,331,1.38843e+06,243,128,3031,1.04677e+06,378
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 83 transition count 104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 83 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 34 place count 83 transition count 102
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 74 transition count 93
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 74 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 73 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 73 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 72 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 72 transition count 90
Applied a total of 56 rules in 3 ms. Remains 72 /99 variables (removed 27) and now considering 90/136 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2438322999390075735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17242039310025664573.kers'
[2026-05-23 16:16:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2438322999390075735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17242039310025664573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 90 rows 72 cols 297 entries
Finished phase 1 with 68 SingleSign rule and 2 generalized
[2026-05-23 16:16:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17242039310025664573.kers
Total runtime 1 ms.
[2026-05-23 16:16:44] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-23 16:16:44] [INFO ] Invariant cache hit.
[2026-05-23 16:16:44] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 16:16:44] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2026-05-23 16:16:44] [INFO ] Invariant cache hit.
[2026-05-23 16:16:44] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/162 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 102 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/162 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 89/191 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 191 constraints, problems are : Problem set: 0 solved, 89 unsolved in 10184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13465ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 13466ms
Starting structural reductions in LTL mode, iteration 1 : 72/99 places, 90/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13988 ms. Remains : 72/99 places, 90/136 transitions.
[2026-05-23 16:16:58] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:16:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:16:58] [INFO ] Input system was already deterministic with 90 transitions.
[2026-05-23 16:16:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:16:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:16:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14468865829685453001.gal : 1 ms
[2026-05-23 16:16:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18415306504957793101.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14468865829685453001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18415306504957793101.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,452764,1.24184,34852,2,6476,5,133277,6,0,378,98674,0


Converting to forward existential form...Done !
original formula: AX(((A(((((s1>=1)&&(l339>=1))||((s6>=1)&&(l0>=1))) * E(((p30>=1)&&(l0>=1)) U ((s1>=1)&&(l509>=1)))) U (EF(((s1>=1)&&(l112>=1))) + E(((p30...241
=> equivalent forward existential formula: ((([(((FwdU(EY(Init),!((E(TRUE U ((s1>=1)&&(l112>=1))) + E(((p30>=1)&&(l0>=1)) U ((p10>=1)&&(l153>=1)))))) * !((...556
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t47, t48, t49, t56, t64, t65, t66, t67, t68, t69, t70, t7...346
(forward)formula 0,1,4.54277,99516,1,0,244,496534,222,105,2636,334750,279
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 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 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 67 transition count 88
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 61 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 73
Applied a total of 82 rules in 15 ms. Remains 61 /99 variables (removed 38) and now considering 73/136 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13951395120169031223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2041022354969066128.kers'
[2026-05-23 16:17:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13951395120169031223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2041022354969066128.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 61 cols 233 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 16:17:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2041022354969066128.kers
Total runtime 1 ms.
[2026-05-23 16:17:03] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 16:17:03] [INFO ] Invariant cache hit.
[2026-05-23 16:17:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 16:17:03] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2026-05-23 16:17:03] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-23 16:17:03] [INFO ] Invariant cache hit.
[2026-05-23 16:17:03] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 89 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3218 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 72/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 161 constraints, problems are : Problem set: 0 solved, 72 unsolved in 7990 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11223ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 11227ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/99 places, 73/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11482 ms. Remains : 61/99 places, 73/136 transitions.
[2026-05-23 16:17:14] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:17:14] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:17:14] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-23 16:17:14] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:17:14] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:17:14] [INFO ] Time to serialize gal into /tmp/CTLFireability10098648263728581278.gal : 0 ms
[2026-05-23 16:17:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11694926057160601345.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10098648263728581278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11694926057160601345.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,193600,0.629729,17292,2,4809,5,49824,6,0,317,48803,0


Converting to forward existential form...Done !
original formula: EG(EF((AG(((s1<1)||(l149<1))) + (((s1<1)||(l336<1))&&((s4<1)||(l0<1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(E(TRUE U !(((s1<1)||(l149<1))))) + (((s1<1)||(l336<1))&&((s4<1)||(l0<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t53, t54, t55, t5...336
(forward)formula 0,1,4.00713,94540,1,0,201,403451,173,83,2263,391549,224
FORMULA DBSingleClientW-PT-d0m06-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 16:17:18] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:17:18] [INFO ] Flatten gal took : 3 ms
Total runtime 537407 ms.

BK_STOP 1779553038538

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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