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-177946993600146.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-d1m05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 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 432K 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-d1m05-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779565420943

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-d1m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 19:43:43] [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 19:43:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 19:43:43] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2026-05-23 19:43:43] [INFO ] Transformed 1440 places.
[2026-05-23 19:43:43] [INFO ] Transformed 672 transitions.
[2026-05-23 19:43:43] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Deduced a syphon composed of 1093 places in 9 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 116 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 154 place count 273 transition count 498
Iterating global reduction 1 with 53 rules applied. Total rules applied 207 place count 273 transition count 498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 213 place count 273 transition count 492
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 248 place count 238 transition count 457
Iterating global reduction 2 with 35 rules applied. Total rules applied 283 place count 238 transition count 457
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 289 place count 232 transition count 451
Iterating global reduction 2 with 6 rules applied. Total rules applied 295 place count 232 transition count 451
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 301 place count 232 transition count 445
Applied a total of 301 rules in 119 ms. Remains 232 /347 variables (removed 115) and now considering 445/672 (removed 227) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3483128234638699454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8487458639624843317.kers'
[2026-05-23 19:43:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3483128234638699454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8487458639624843317.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 445 rows 232 cols 1266 entries
Finished phase 1 with 228 SingleSign rule and 2 generalized
[2026-05-23 19:43:43] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8487458639624843317.kers
Total runtime 8 ms.
[2026-05-23 19:43:44] [INFO ] Implicit Places using invariants in 604 ms returned []
[2026-05-23 19:43:44] [INFO ] Invariant cache hit.
[2026-05-23 19:43:44] [INFO ] State equation strengthened by 240 read => feed constraints.
[2026-05-23 19:43:46] [INFO ] Implicit Places using invariants and state equation in 2478 ms returned []
Implicit Place search using SMT with State Equation took 3156 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2026-05-23 19:43:47] [INFO ] Invariant cache hit.
[2026-05-23 19:43:47] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 445/677 variables, 232/234 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 240/474 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/677 variables, and 474 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 232/232 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 445/677 variables, 232/234 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 240/474 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 444/918 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/677 variables, and 918 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 232/232 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61299ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 61330ms
Starting structural reductions in LTL mode, iteration 1 : 232/347 places, 445/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64691 ms. Remains : 232/347 places, 445/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2026-05-23 19:44:48] [INFO ] Invariant cache hit.
[2026-05-23 19:44:48] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-23 19:44:48] [INFO ] Invariant cache hit.
[2026-05-23 19:44:48] [INFO ] State equation strengthened by 240 read => feed constraints.
[2026-05-23 19:44:50] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2022 ms. Remains : 232/232 places, 445/445 transitions.
Support contains 116 out of 232 places after structural reductions.
[2026-05-23 19:44:50] [INFO ] Flatten gal took : 119 ms
[2026-05-23 19:44:50] [INFO ] Flatten gal took : 73 ms
[2026-05-23 19:44:51] [INFO ] Input system was already deterministic with 445 transitions.
Reduction of identical properties reduced properties to check from 103 to 98
RANDOM walk for 40000 steps (9157 resets) in 4649 ms. (8 steps per ms) remains 76/98 properties
BEST_FIRST walk for 4003 steps (176 resets) in 85 ms. (46 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (402 resets) in 121 ms. (32 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (164 resets) in 52 ms. (75 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (97 resets) in 41 ms. (95 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (186 resets) in 65 ms. (60 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (404 resets) in 77 ms. (51 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (192 resets) in 47 ms. (83 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (187 resets) in 52 ms. (75 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (204 resets) in 43 ms. (90 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (191 resets) in 44 ms. (88 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (189 resets) in 37 ms. (105 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (343 resets) in 36 ms. (108 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4001 steps (187 resets) in 42 ms. (93 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (157 resets) in 32 ms. (121 steps per ms) remains 75/76 properties
BEST_FIRST walk for 4003 steps (613 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (197 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (181 resets) in 40 ms. (97 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (174 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (182 resets) in 29 ms. (133 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (188 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (373 resets) in 46 ms. (85 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (381 resets) in 39 ms. (100 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (171 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (403 resets) in 49 ms. (80 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (187 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (401 resets) in 50 ms. (78 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (413 resets) in 50 ms. (78 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (208 resets) in 27 ms. (142 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (377 resets) in 47 ms. (83 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (177 resets) in 77 ms. (51 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (193 resets) in 44 ms. (88 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (405 resets) in 53 ms. (74 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (191 resets) in 38 ms. (102 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (415 resets) in 53 ms. (74 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (367 resets) in 61 ms. (64 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (191 resets) in 37 ms. (105 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (181 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (198 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (161 resets) in 47 ms. (83 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (368 resets) in 39 ms. (100 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (385 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (192 resets) in 39 ms. (100 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (391 resets) in 51 ms. (76 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (170 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (441 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (113 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (365 resets) in 40 ms. (97 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (182 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (186 resets) in 35 ms. (111 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (407 resets) in 46 ms. (85 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (195 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (404 resets) in 44 ms. (88 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (405 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (410 resets) in 49 ms. (80 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (195 resets) in 35 ms. (111 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (402 resets) in 48 ms. (81 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (177 resets) in 37 ms. (105 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (203 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (180 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (618 resets) in 81 ms. (48 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (194 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (188 resets) in 44 ms. (88 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (371 resets) in 59 ms. (66 steps per ms) remains 75/75 properties
[2026-05-23 19:44:53] [INFO ] Invariant cache hit.
[2026-05-23 19:44:53] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (OVERLAPS) 55/149 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 34/183 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 422/605 variables, 183/185 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 217/402 constraints. Problems are: Problem set: 4 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/402 constraints. Problems are: Problem set: 4 solved, 71 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 8 (OVERLAPS) 72/677 variables, 49/451 constraints. Problems are: Problem set: 5 solved, 70 unsolved
SMT process timed out in 5221ms, After SMT, problems are : Problem set: 5 solved, 70 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 222 transition count 426
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 222 transition count 426
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 222 transition count 418
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 220 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 220 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 220 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 219 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 219 transition count 413
Applied a total of 35 rules in 134 ms. Remains 219 /232 variables (removed 13) and now considering 413/445 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 219/232 places, 413/445 transitions.
RANDOM walk for 40000 steps (9158 resets) in 1700 ms. (23 steps per ms) remains 69/70 properties
BEST_FIRST walk for 4000 steps (181 resets) in 38 ms. (102 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (411 resets) in 66 ms. (59 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (178 resets) in 41 ms. (95 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (395 resets) in 40 ms. (97 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (186 resets) in 30 ms. (129 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (208 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (179 resets) in 40 ms. (97 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (189 resets) in 37 ms. (105 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (184 resets) in 27 ms. (142 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (382 resets) in 39 ms. (100 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (176 resets) in 41 ms. (95 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (206 resets) in 42 ms. (93 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (168 resets) in 34 ms. (114 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4003 steps (211 resets) in 32 ms. (121 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (177 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (196 resets) in 43 ms. (91 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (394 resets) in 46 ms. (85 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (372 resets) in 47 ms. (83 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (169 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (396 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (180 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (391 resets) in 51 ms. (76 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (379 resets) in 51 ms. (76 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (186 resets) in 30 ms. (129 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (391 resets) in 30 ms. (129 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (193 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (168 resets) in 22 ms. (173 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (210 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (418 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (372 resets) in 73 ms. (54 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (180 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (169 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (197 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (217 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (425 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (419 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (187 resets) in 25 ms. (154 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (390 resets) in 35 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (195 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (385 resets) in 32 ms. (121 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (101 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (414 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (185 resets) in 25 ms. (154 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (173 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (379 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (188 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (375 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (422 resets) in 51 ms. (76 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (379 resets) in 35 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (198 resets) in 29 ms. (133 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (393 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (179 resets) in 25 ms. (154 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (203 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (197 resets) in 28 ms. (138 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (178 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (181 resets) in 31 ms. (125 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (403 resets) in 42 ms. (93 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (401 resets) in 42 ms. (93 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (196 resets) in 29 ms. (133 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (800 resets) in 56 ms. (70 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (184 resets) in 31 ms. (125 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (171 resets) in 28 ms. (138 steps per ms) remains 68/68 properties
Finished probabilistic random walk after 349430 steps, run visited all 68 properties in 2212 ms. (steps per millisecond=157 )
Probabilistic random walk after 349430 steps, saw 139699 distinct states, run finished after 2218 ms. (steps per millisecond=157 ) properties seen :68
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2026-05-23 19:45:02] [INFO ] Flatten gal took : 30 ms
[2026-05-23 19:45:02] [INFO ] Flatten gal took : 31 ms
[2026-05-23 19:45:02] [INFO ] Input system was already deterministic with 445 transitions.
Support contains 90 out of 232 places (down from 109) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 37 stable transitions
Graph (complete) has 899 edges and 232 vertex of which 231 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 175 transition count 268
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 175 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 175 transition count 262
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 160 place count 135 transition count 213
Iterating global reduction 1 with 40 rules applied. Total rules applied 200 place count 135 transition count 213
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 213 place count 135 transition count 200
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 236 place count 112 transition count 162
Iterating global reduction 2 with 23 rules applied. Total rules applied 259 place count 112 transition count 162
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 268 place count 112 transition count 153
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 279 place count 101 transition count 134
Iterating global reduction 3 with 11 rules applied. Total rules applied 290 place count 101 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 294 place count 101 transition count 130
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 302 place count 93 transition count 122
Iterating global reduction 4 with 8 rules applied. Total rules applied 310 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 311 place count 93 transition count 121
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 318 place count 86 transition count 114
Iterating global reduction 5 with 7 rules applied. Total rules applied 325 place count 86 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 328 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 329 place count 85 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 330 place count 85 transition count 109
Applied a total of 330 rules in 46 ms. Remains 85 /232 variables (removed 147) and now considering 109/445 (removed 336) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16572360812880893252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13830064581931262183.kers'
[2026-05-23 19:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16572360812880893252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13830064581931262183.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 85 cols 350 entries
Finished phase 1 with 81 SingleSign rule and 2 generalized
[2026-05-23 19:45:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13830064581931262183.kers
Total runtime 1 ms.
[2026-05-23 19:45:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 19:45:02] [INFO ] Invariant cache hit.
[2026-05-23 19:45:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 19:45:03] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2026-05-23 19:45:03] [INFO ] Redundant transitions in 4 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-23 19:45:03] [INFO ] Invariant cache hit.
[2026-05-23 19:45:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 134 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/194 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 108/242 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 242 constraints, problems are : Problem set: 0 solved, 108 unsolved in 22277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31446ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 31448ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/232 places, 109/445 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31885 ms. Remains : 85/232 places, 109/445 transitions.
[2026-05-23 19:45:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:45:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:45:34] [INFO ] Input system was already deterministic with 109 transitions.
[2026-05-23 19:45:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:45:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:45:34] [INFO ] Time to serialize gal into /tmp/CTLFireability887814581133041340.gal : 3 ms
[2026-05-23 19:45:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11933151152058660026.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/CTLFireability887814581133041340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11933151152058660026.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,63981,0.719896,24868,2,5872,5,73933,6,0,449,64498,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((s1<1)||(l299<1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((s1<1)||(l299<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t47, t53, t54, t55, t71, t78, t79, t80, t81, t82, t83, t84, t85, t...377
(forward)formula 0,1,2.2591,56064,1,0,231,208331,243,93,3161,134380,271
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-00 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 : 232/232 places, 445/445 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 175 transition count 268
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 175 transition count 268
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 121 place count 175 transition count 261
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 160 place count 136 transition count 216
Iterating global reduction 1 with 39 rules applied. Total rules applied 199 place count 136 transition count 216
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 212 place count 136 transition count 203
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 234 place count 114 transition count 166
Iterating global reduction 2 with 22 rules applied. Total rules applied 256 place count 114 transition count 166
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 265 place count 114 transition count 157
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 274 place count 105 transition count 141
Iterating global reduction 3 with 9 rules applied. Total rules applied 283 place count 105 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 285 place count 105 transition count 139
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 291 place count 99 transition count 133
Iterating global reduction 4 with 6 rules applied. Total rules applied 297 place count 99 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 298 place count 99 transition count 132
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 303 place count 94 transition count 127
Iterating global reduction 5 with 5 rules applied. Total rules applied 308 place count 94 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 309 place count 94 transition count 126
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 311 place count 92 transition count 118
Iterating global reduction 6 with 2 rules applied. Total rules applied 313 place count 92 transition count 118
Applied a total of 313 rules in 79 ms. Remains 92 /232 variables (removed 140) and now considering 118/445 (removed 327) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-542161232069233852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-386400117629936520.kers'
[2026-05-23 19:45:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-542161232069233852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-386400117629936520.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 118 rows 92 cols 395 entries
Finished phase 1 with 88 SingleSign rule and 2 generalized
[2026-05-23 19:45:37] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-386400117629936520.kers
Total runtime 1 ms.
[2026-05-23 19:45:37] [INFO ] Implicit Places using invariants in 948 ms returned []
[2026-05-23 19:45:37] [INFO ] Invariant cache hit.
[2026-05-23 19:45:38] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 19:45:38] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2026-05-23 19:45:38] [INFO ] Redundant transitions in 5 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-23 19:45:38] [INFO ] Invariant cache hit.
[2026-05-23 19:45:38] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/210 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 34/128 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 117 unsolved in 15160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/210 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 34/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 117/249 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 249 constraints, problems are : Problem set: 0 solved, 117 unsolved in 25243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40469ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 40471ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/232 places, 118/445 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42066 ms. Remains : 92/232 places, 118/445 transitions.
[2026-05-23 19:46:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:46:19] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:46:19] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-23 19:46:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:46:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:46:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17578991222496643160.gal : 3 ms
[2026-05-23 19:46:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9527665971470843386.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/CTLFireability17578991222496643160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9527665971470843386.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,112420,1.79983,45856,2,8634,5,154010,6,0,486,118586,0


Converting to forward existential form...Done !
original formula: EF((AG(E(((p123>=1)&&(l531>=1)) U ((s1>=1)&&(l948>=1)))) * ((s1<1)||(l949<1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((s1<1)||(l949<1))) * !(E(TRUE U !(E(((p123>=1)&&(l531>=1)) U ((s1>=1)&&(l948>=1)))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t48, t53, t54, t55, t64, t66, t72, t79, t80, t82, t...446
(forward)formula 0,0,4.36242,94240,1,0,239,400658,261,92,3411,211452,258
FORMULA DBSingleClientW-PT-d1m05-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 : 232/232 places, 445/445 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 176 transition count 273
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 176 transition count 273
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 119 place count 176 transition count 266
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 157 place count 138 transition count 219
Iterating global reduction 1 with 38 rules applied. Total rules applied 195 place count 138 transition count 219
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 207 place count 138 transition count 207
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 228 place count 117 transition count 171
Iterating global reduction 2 with 21 rules applied. Total rules applied 249 place count 117 transition count 171
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 258 place count 117 transition count 162
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 268 place count 107 transition count 147
Iterating global reduction 3 with 10 rules applied. Total rules applied 278 place count 107 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 282 place count 107 transition count 143
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 289 place count 100 transition count 136
Iterating global reduction 4 with 7 rules applied. Total rules applied 296 place count 100 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 297 place count 100 transition count 135
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 303 place count 94 transition count 129
Iterating global reduction 5 with 6 rules applied. Total rules applied 309 place count 94 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 312 place count 94 transition count 126
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 313 place count 93 transition count 124
Iterating global reduction 6 with 1 rules applied. Total rules applied 314 place count 93 transition count 124
Applied a total of 314 rules in 20 ms. Remains 93 /232 variables (removed 139) and now considering 124/445 (removed 321) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8655354428582089915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12506919673711466480.kers'
[2026-05-23 19:46:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8655354428582089915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12506919673711466480.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 93 cols 395 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-23 19:46:23] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12506919673711466480.kers
Total runtime 2 ms.
[2026-05-23 19:46:23] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-23 19:46:23] [INFO ] Invariant cache hit.
[2026-05-23 19:46:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-23 19:46:24] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2026-05-23 19:46:24] [INFO ] Invariant cache hit.
[2026-05-23 19:46:24] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/217 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 45/140 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 154 constraints, problems are : Problem set: 0 solved, 123 unsolved in 23324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 124/217 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 45/154 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 123/277 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/217 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 277 constraints, problems are : Problem set: 0 solved, 123 unsolved in 26085 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49456ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 49457ms
Starting structural reductions in LTL mode, iteration 1 : 93/232 places, 124/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50043 ms. Remains : 93/232 places, 124/445 transitions.
[2026-05-23 19:47:13] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:47:13] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:47:13] [INFO ] Input system was already deterministic with 124 transitions.
[2026-05-23 19:47:13] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:47:13] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:47:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6989149806520810976.gal : 2 ms
[2026-05-23 19:47:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4231342770908371209.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/CTLFireability6989149806520810976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4231342770908371209.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,97741,1.70229,43688,2,8773,5,122468,6,0,496,116127,0


Converting to forward existential form...Done !
original formula: !(E(AX(FALSE) U ((EF(((s7>=1)&&(l0>=1))) * (s1>=1)) * (l1235>=1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,!(EX(!(FALSE)))) * (l1235>=1)) * (s1>=1)),TRUE) * ((s7>=1)&&(l0>=1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t...507
(forward)formula 0,1,4.25117,86020,1,0,249,308435,270,94,3404,184145,260
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 184 transition count 319
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 184 transition count 319
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 110 place count 184 transition count 305
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 143 place count 151 transition count 263
Iterating global reduction 1 with 33 rules applied. Total rules applied 176 place count 151 transition count 263
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 191 place count 151 transition count 248
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 208 place count 134 transition count 222
Iterating global reduction 2 with 17 rules applied. Total rules applied 225 place count 134 transition count 222
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 235 place count 134 transition count 212
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 241 place count 128 transition count 201
Iterating global reduction 3 with 6 rules applied. Total rules applied 247 place count 128 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 252 place count 128 transition count 196
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 255 place count 125 transition count 193
Iterating global reduction 4 with 3 rules applied. Total rules applied 258 place count 125 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 125 transition count 192
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 261 place count 123 transition count 190
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 123 transition count 190
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 122 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 122 transition count 184
Applied a total of 265 rules in 22 ms. Remains 122 /232 variables (removed 110) and now considering 184/445 (removed 261) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13660640990825905137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12432837295534165772.kers'
[2026-05-23 19:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13660640990825905137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12432837295534165772.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 122 cols 564 entries
Finished phase 1 with 118 SingleSign rule and 2 generalized
[2026-05-23 19:47:17] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12432837295534165772.kers
Total runtime 2 ms.
[2026-05-23 19:47:18] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-23 19:47:18] [INFO ] Invariant cache hit.
[2026-05-23 19:47:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-23 19:47:19] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2026-05-23 19:47:19] [INFO ] Invariant cache hit.
[2026-05-23 19:47:19] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/306 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 78/202 constraints. Problems are: Problem set: 0 solved, 183 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 202 constraints, problems are : Problem set: 0 solved, 183 unsolved in 19494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/306 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 78/202 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 183/385 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 385 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49642ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 49644ms
Starting structural reductions in LTL mode, iteration 1 : 122/232 places, 184/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50816 ms. Remains : 122/232 places, 184/445 transitions.
[2026-05-23 19:48:08] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:48:08] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:48:08] [INFO ] Input system was already deterministic with 184 transitions.
[2026-05-23 19:48:08] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:48:08] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:48:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9728524713680869705.gal : 4 ms
[2026-05-23 19:48:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3933701650552399785.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/CTLFireability9728524713680869705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3933701650552399785.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,276265,4.80968,99756,2,15326,5,278725,6,0,672,251440,0


Converting to forward existential form...Done !
original formula: A(E(((!(((AX(((s1>=1)&&(l1220>=1))) + !(((s1>=1)&&(l1291>=1)))) + !(((s1>=1)&&(l970>=1))))) + !((((s1>=1)&&(l1221>=1))||((s1>=1)&&(l36>=1...409
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(((s1>=1)&&(l459>=1))))))))))) * !(E(!(!(!(EG(!(!(((s1>=1)&&(l459>=1)))))))) U (!(E((...588
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t29, t30, t38, t39, t42, t50, t51, t52, t53, t54, t55,...717
Detected timeout of ITS tools.
[2026-05-23 19:48:38] [INFO ] Flatten gal took : 14 ms
[2026-05-23 19:48:38] [INFO ] Applying decomposition
[2026-05-23 19:48:38] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10958503855943164201.txt' '-o' '/tmp/graph10958503855943164201.bin' '-w' '/tmp/graph10958503855943164201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10958503855943164201.bin' '-l' '-1' '-v' '-w' '/tmp/graph10958503855943164201.weights' '-q' '0' '-e' '0.001'
[2026-05-23 19:48:39] [INFO ] Decomposing Gal with order
[2026-05-23 19:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 19:48:39] [INFO ] Removed a total of 191 redundant transitions.
[2026-05-23 19:48:39] [INFO ] Flatten gal took : 202 ms
[2026-05-23 19:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 53 ms.
[2026-05-23 19:48:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17005668988495713752.gal : 9 ms
[2026-05-23 19:48:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6089594832873623454.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/CTLFireability17005668988495713752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6089594832873623454.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,276265,2.39363,49756,1590,985,53041,14294,437,255398,157,102200,0


Converting to forward existential form...Done !
original formula: A(E(((!(((AX(((i0.u0.s1>=1)&&(i6.u18.l1220>=1))) + !(((i0.u0.s1>=1)&&(i5.u15.l1291>=1)))) + !(((i0.u0.s1>=1)&&(i5.u15.l970>=1))))) + !(((...584
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(((i0.u0.s1>=1)&&(i0.u1.l459>=1))))))))))) * !(E(!(!(!(EG(!(!(((i0.u0.s1>=1)&&(i0.u1....787
Reverse transition relation is NOT exact ! Due to transitions t0, t12, t57, t64, t103, t110, t119, t125, t128, t139, t140, t141, t142, t144, t145, t146, t1...520
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,8.80498,183664,1,0,186711,57418,1954,1.20571e+06,863,326994,457601
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 178 transition count 279
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 178 transition count 279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 115 place count 178 transition count 272
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 152 place count 141 transition count 226
Iterating global reduction 1 with 37 rules applied. Total rules applied 189 place count 141 transition count 226
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 198 place count 141 transition count 217
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 218 place count 121 transition count 184
Iterating global reduction 2 with 20 rules applied. Total rules applied 238 place count 121 transition count 184
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 246 place count 121 transition count 176
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 254 place count 113 transition count 165
Iterating global reduction 3 with 8 rules applied. Total rules applied 262 place count 113 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 265 place count 113 transition count 162
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 270 place count 108 transition count 157
Iterating global reduction 4 with 5 rules applied. Total rules applied 275 place count 108 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 108 transition count 156
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 280 place count 104 transition count 152
Iterating global reduction 5 with 4 rules applied. Total rules applied 284 place count 104 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 286 place count 104 transition count 150
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 103 transition count 148
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 103 transition count 148
Applied a total of 288 rules in 11 ms. Remains 103 /232 variables (removed 129) and now considering 148/445 (removed 297) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13609179005018961458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13850909933295486911.kers'
[2026-05-23 19:48:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13609179005018961458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13850909933295486911.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 103 cols 465 entries
Finished phase 1 with 99 SingleSign rule and 2 generalized
[2026-05-23 19:48:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13850909933295486911.kers
Total runtime 2 ms.
[2026-05-23 19:48:48] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-23 19:48:48] [INFO ] Invariant cache hit.
[2026-05-23 19:48:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 19:48:48] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-23 19:48:48] [INFO ] Invariant cache hit.
[2026-05-23 19:48:48] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/251 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 57/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 162 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/251 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 57/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 147/309 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/251 variables, and 309 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40724ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 40725ms
Starting structural reductions in LTL mode, iteration 1 : 103/232 places, 148/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41304 ms. Remains : 103/232 places, 148/445 transitions.
[2026-05-23 19:49:29] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:49:29] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:49:29] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-23 19:49:29] [INFO ] Flatten gal took : 10 ms
[2026-05-23 19:49:29] [INFO ] Flatten gal took : 10 ms
[2026-05-23 19:49:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9700119179567362459.gal : 3 ms
[2026-05-23 19:49:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15294037953785504992.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/CTLFireability9700119179567362459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15294037953785504992.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,155294,2.71128,60560,2,11919,5,180104,6,0,560,155037,0


Converting to forward existential form...Done !
original formula: A(AG((!(AF(!(((s1>=1)&&(l943>=1))))) * EF(((s1>=1)&&(l297>=1))))) U (EF(EG(EX(((s1>=1)&&(l1021>=1))))) + (A(((AG(((s1>=1)&&(l1238>=1))) *...231
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U EG(EX(((s1>=1)&&(l1021>=1))))) + (!((E(!(((s1>=1)&&(l3>=1))) U (!(((!(E(TRUE U !(((s1...887
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t16, t41, t42, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...612
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,25.6672,503508,1,0,718,2.61526e+06,345,349,3962,1.82412e+06,851
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 177 transition count 274
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 177 transition count 274
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 117 place count 177 transition count 267
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 154 place count 140 transition count 221
Iterating global reduction 1 with 37 rules applied. Total rules applied 191 place count 140 transition count 221
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 204 place count 140 transition count 208
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 224 place count 120 transition count 176
Iterating global reduction 2 with 20 rules applied. Total rules applied 244 place count 120 transition count 176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 252 place count 120 transition count 168
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 261 place count 111 transition count 152
Iterating global reduction 3 with 9 rules applied. Total rules applied 270 place count 111 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 274 place count 111 transition count 148
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 280 place count 105 transition count 142
Iterating global reduction 4 with 6 rules applied. Total rules applied 286 place count 105 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 105 transition count 141
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 292 place count 100 transition count 136
Iterating global reduction 5 with 5 rules applied. Total rules applied 297 place count 100 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 298 place count 100 transition count 135
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 299 place count 99 transition count 133
Iterating global reduction 6 with 1 rules applied. Total rules applied 300 place count 99 transition count 133
Applied a total of 300 rules in 14 ms. Remains 99 /232 variables (removed 133) and now considering 133/445 (removed 312) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4363038189425140699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14683636843801209463.kers'
[2026-05-23 19:49:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4363038189425140699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14683636843801209463.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 99 cols 427 entries
Finished phase 1 with 95 SingleSign rule and 2 generalized
[2026-05-23 19:49:55] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14683636843801209463.kers
Total runtime 1 ms.
[2026-05-23 19:49:55] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 19:49:55] [INFO ] Invariant cache hit.
[2026-05-23 19:49:55] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-23 19:49:56] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-05-23 19:49:56] [INFO ] Invariant cache hit.
[2026-05-23 19:49:56] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/232 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 47/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 148 constraints, problems are : Problem set: 0 solved, 132 unsolved in 8357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/232 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 47/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 132/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 232/232 variables, and 280 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38437ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 38437ms
Starting structural reductions in LTL mode, iteration 1 : 99/232 places, 133/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38906 ms. Remains : 99/232 places, 133/445 transitions.
[2026-05-23 19:50:34] [INFO ] Flatten gal took : 17 ms
[2026-05-23 19:50:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:50:34] [INFO ] Input system was already deterministic with 133 transitions.
[2026-05-23 19:50:34] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:50:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:50:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16574320257029673587.gal : 3 ms
[2026-05-23 19:50:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3162596207186171607.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16574320257029673587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3162596207186171607.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,130517,2.24766,47476,2,9706,5,129144,6,0,529,138792,0


Converting to forward existential form...Done !
original formula: AX(((EG(AG(((p16<1)||(l0<1)))) + AX(A(((s1>=1)&&(l7>=1)) U ((s1>=1)&&(l1289>=1))))) + (AG(EF(((AG(((s1>=1)&&(l533>=1))) * (p59>=1)) * (l6...189
=> equivalent forward existential formula: [(FwdU(((EY(Init) * !((EG(!(E(TRUE U !(((p16<1)||(l0<1)))))) + !(EX(!(!((E(!(((s1>=1)&&(l1289>=1))) U (!(((s1>=1...356
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t31, t32, t45, t47, t48, t49, t51, t52, t53, t54, t60, t61, t62, t69, t...511
Using saturation style SCC detection
(forward)formula 0,0,19.7236,374408,1,0,493,1.73889e+06,313,230,3946,1.46613e+06,563
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 178 transition count 278
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 178 transition count 278
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 118 place count 178 transition count 268
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 152 place count 144 transition count 228
Iterating global reduction 1 with 34 rules applied. Total rules applied 186 place count 144 transition count 228
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 199 place count 144 transition count 215
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 216 place count 127 transition count 188
Iterating global reduction 2 with 17 rules applied. Total rules applied 233 place count 127 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 239 place count 127 transition count 182
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 247 place count 119 transition count 167
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 119 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 259 place count 119 transition count 163
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 264 place count 114 transition count 158
Iterating global reduction 4 with 5 rules applied. Total rules applied 269 place count 114 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 114 transition count 157
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 274 place count 110 transition count 153
Iterating global reduction 5 with 4 rules applied. Total rules applied 278 place count 110 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 279 place count 110 transition count 152
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 109 transition count 146
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 109 transition count 146
Applied a total of 281 rules in 10 ms. Remains 109 /232 variables (removed 123) and now considering 146/445 (removed 299) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7030675189275969002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15401679411094978840.kers'
[2026-05-23 19:50:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7030675189275969002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15401679411094978840.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 109 cols 481 entries
Finished phase 1 with 105 SingleSign rule and 2 generalized
[2026-05-23 19:50:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15401679411094978840.kers
Total runtime 1 ms.
[2026-05-23 19:50:54] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-23 19:50:54] [INFO ] Invariant cache hit.
[2026-05-23 19:50:54] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 19:50:55] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-23 19:50:55] [INFO ] Invariant cache hit.
[2026-05-23 19:50:55] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/255 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 46/157 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 157 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10921 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/255 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 46/157 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 145/302 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/255 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 302 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40984ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 40985ms
Starting structural reductions in LTL mode, iteration 1 : 109/232 places, 146/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41805 ms. Remains : 109/232 places, 146/445 transitions.
[2026-05-23 19:51:36] [INFO ] Flatten gal took : 10 ms
[2026-05-23 19:51:36] [INFO ] Flatten gal took : 9 ms
[2026-05-23 19:51:36] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-23 19:51:36] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:51:36] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:51:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4260397848629134094.gal : 3 ms
[2026-05-23 19:51:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6873072374516916904.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/CTLFireability4260397848629134094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6873072374516916904.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,192210,3.40324,76544,2,11920,5,215800,6,0,582,177726,0


Converting to forward existential form...Done !
original formula: EF(((EG(A(((AX(((s1>=1)&&(l465>=1))) * (p124>=1)) * (l532>=1)) U EF(((p90>=1)&&(l447>=1))))) + (((s1<1)||(l948<1))&&(((s1>=1)&&(l1288>=1)...286
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!((E(!(E(TRUE U ((p90>=1)&&(l447>=1)))) U (!(((!(EX(!(((s1>=1)&&(l465>=1))))) * (p124>=1...534
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t33, t37, t44, t45, t51, t53, t54, t55, t57, t58, t64, t65, t69, t71, t...547
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,17.3907,335328,1,0,415,1.6238e+06,329,193,4148,1.07098e+06,456
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 182 transition count 304
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 182 transition count 304
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 107 place count 182 transition count 297
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 141 place count 148 transition count 257
Iterating global reduction 1 with 34 rules applied. Total rules applied 175 place count 148 transition count 257
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 190 place count 148 transition count 242
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 205 place count 133 transition count 213
Iterating global reduction 2 with 15 rules applied. Total rules applied 220 place count 133 transition count 213
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 230 place count 133 transition count 203
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 236 place count 127 transition count 195
Iterating global reduction 3 with 6 rules applied. Total rules applied 242 place count 127 transition count 195
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 248 place count 121 transition count 189
Iterating global reduction 3 with 6 rules applied. Total rules applied 254 place count 121 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 121 transition count 188
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 260 place count 116 transition count 183
Iterating global reduction 4 with 5 rules applied. Total rules applied 265 place count 116 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 267 place count 116 transition count 181
Applied a total of 267 rules in 10 ms. Remains 116 /232 variables (removed 116) and now considering 181/445 (removed 264) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6634617379886354886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6874373819652922476.kers'
[2026-05-23 19:51:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6634617379886354886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6874373819652922476.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 116 cols 544 entries
Finished phase 1 with 112 SingleSign rule and 2 generalized
[2026-05-23 19:51:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6874373819652922476.kers
Total runtime 2 ms.
[2026-05-23 19:51:54] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-23 19:51:54] [INFO ] Invariant cache hit.
[2026-05-23 19:51:54] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-23 19:51:54] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-23 19:51:54] [INFO ] Invariant cache hit.
[2026-05-23 19:51:54] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/297 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 81/199 constraints. Problems are: Problem set: 0 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 199 constraints, problems are : Problem set: 0 solved, 180 unsolved in 15705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/297 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 81/199 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 180/379 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/297 variables, and 379 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45807ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 45808ms
Starting structural reductions in LTL mode, iteration 1 : 116/232 places, 181/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46623 ms. Remains : 116/232 places, 181/445 transitions.
[2026-05-23 19:52:40] [INFO ] Flatten gal took : 9 ms
[2026-05-23 19:52:40] [INFO ] Flatten gal took : 9 ms
[2026-05-23 19:52:40] [INFO ] Input system was already deterministic with 181 transitions.
[2026-05-23 19:52:40] [INFO ] Flatten gal took : 9 ms
[2026-05-23 19:52:40] [INFO ] Flatten gal took : 10 ms
[2026-05-23 19:52:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16081607990311069574.gal : 3 ms
[2026-05-23 19:52:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13677791943131423858.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/CTLFireability16081607990311069574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13677791943131423858.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,251772,6.65162,126216,2,15082,5,382130,6,0,645,300651,0


Converting to forward existential form...Done !
original formula: A(((EX((!(E(((p42>=1)&&(l618>=1)) U ((s1>=1)&&(l1024>=1)))) * (E(((s1>=1)&&(l1235>=1)) U ((p24>=1)&&(l0>=1))) + !((((s1>=1)&&(l1238>=1))|...380
=> equivalent forward existential formula: [((Init * !(EG(!(EG((!(EX(!(((((s1>=1)&&(l302>=1))||((s1>=1)&&(l1307>=1)))||((s1>=1)&&(l435>=1)))))) * !(((s1>=1...705
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t17, t29, t42, t43, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t...726
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,24.5136,446948,1,0,523,2.36731e+06,418,237,4605,1.44567e+06,613
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 180 transition count 298
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 180 transition count 298
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 112 place count 180 transition count 290
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 148 place count 144 transition count 246
Iterating global reduction 1 with 36 rules applied. Total rules applied 184 place count 144 transition count 246
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 199 place count 144 transition count 231
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 217 place count 126 transition count 198
Iterating global reduction 2 with 18 rules applied. Total rules applied 235 place count 126 transition count 198
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 245 place count 126 transition count 188
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 254 place count 117 transition count 175
Iterating global reduction 3 with 9 rules applied. Total rules applied 263 place count 117 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 266 place count 117 transition count 172
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 273 place count 110 transition count 165
Iterating global reduction 4 with 7 rules applied. Total rules applied 280 place count 110 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 281 place count 110 transition count 164
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 286 place count 105 transition count 159
Iterating global reduction 5 with 5 rules applied. Total rules applied 291 place count 105 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 293 place count 105 transition count 157
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 294 place count 104 transition count 155
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 104 transition count 155
Applied a total of 295 rules in 21 ms. Remains 104 /232 variables (removed 128) and now considering 155/445 (removed 290) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5543301620727490297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9190446557299195529.kers'
[2026-05-23 19:53:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5543301620727490297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9190446557299195529.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 104 cols 473 entries
Finished phase 1 with 100 SingleSign rule and 2 generalized
[2026-05-23 19:53:05] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9190446557299195529.kers
Total runtime 3 ms.
[2026-05-23 19:53:05] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-23 19:53:05] [INFO ] Invariant cache hit.
[2026-05-23 19:53:05] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-23 19:53:06] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2026-05-23 19:53:06] [INFO ] Invariant cache hit.
[2026-05-23 19:53:06] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 155/259 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 66/172 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 172 constraints, problems are : Problem set: 0 solved, 154 unsolved in 8987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 155/259 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 66/172 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 154/326 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 326 constraints, problems are : Problem set: 0 solved, 154 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39082ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 39089ms
Starting structural reductions in LTL mode, iteration 1 : 104/232 places, 155/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39858 ms. Remains : 104/232 places, 155/445 transitions.
[2026-05-23 19:53:45] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:53:45] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:53:45] [INFO ] Input system was already deterministic with 155 transitions.
[2026-05-23 19:53:45] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:53:45] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:53:45] [INFO ] Time to serialize gal into /tmp/CTLFireability775203259636473409.gal : 2 ms
[2026-05-23 19:53:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3635034836306025347.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/CTLFireability775203259636473409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3635034836306025347.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,148648,2.15705,54420,2,10949,5,161499,6,0,571,145249,0


Converting to forward existential form...Done !
original formula: AF(E(EG((((s1>=1)&&(l610>=1)) * (AF(((s1>=1)&&(l1241>=1))) + AX(((s1>=1)&&(l1024>=1)))))) U ((E(!(E(((p79>=1)&&(l0>=1)) U ((p36>=1)&&(l0>...239
=> equivalent forward existential formula: [FwdG(Init,!(E(EG((((s1>=1)&&(l610>=1)) * (!(EG(!(((s1>=1)&&(l1241>=1))))) + !(EX(!(((s1>=1)&&(l1024>=1)))))))) ...296
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t20, t42, t43, t44, t45, t46, t47, t48, t49, t51, t52, t54, t55, t...634
Using saturation style SCC detection
(forward)formula 0,0,16.6906,358372,1,0,604,1.56892e+06,361,307,4060,1.41543e+06,616
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 175 transition count 268
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 175 transition count 268
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 121 place count 175 transition count 261
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 160 place count 136 transition count 216
Iterating global reduction 1 with 39 rules applied. Total rules applied 199 place count 136 transition count 216
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 212 place count 136 transition count 203
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 234 place count 114 transition count 166
Iterating global reduction 2 with 22 rules applied. Total rules applied 256 place count 114 transition count 166
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 265 place count 114 transition count 157
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 275 place count 104 transition count 139
Iterating global reduction 3 with 10 rules applied. Total rules applied 285 place count 104 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 287 place count 104 transition count 137
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 295 place count 96 transition count 129
Iterating global reduction 4 with 8 rules applied. Total rules applied 303 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 304 place count 96 transition count 128
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 311 place count 89 transition count 121
Iterating global reduction 5 with 7 rules applied. Total rules applied 318 place count 89 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 321 place count 89 transition count 118
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 323 place count 87 transition count 110
Iterating global reduction 6 with 2 rules applied. Total rules applied 325 place count 87 transition count 110
Applied a total of 325 rules in 9 ms. Remains 87 /232 variables (removed 145) and now considering 110/445 (removed 335) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4183280408720898749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6236123223049963558.kers'
[2026-05-23 19:54:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4183280408720898749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6236123223049963558.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 87 cols 367 entries
Finished phase 1 with 83 SingleSign rule and 2 generalized
[2026-05-23 19:54:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6236123223049963558.kers
Total runtime 1 ms.
[2026-05-23 19:54:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 19:54:02] [INFO ] Invariant cache hit.
[2026-05-23 19:54:02] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 19:54:02] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2026-05-23 19:54:02] [INFO ] Invariant cache hit.
[2026-05-23 19:54:02] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/197 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 124 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/197 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 109/233 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 233 constraints, problems are : Problem set: 0 solved, 109 unsolved in 22344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29865ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 29865ms
Starting structural reductions in LTL mode, iteration 1 : 87/232 places, 110/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30248 ms. Remains : 87/232 places, 110/445 transitions.
[2026-05-23 19:54:32] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:54:32] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:54:32] [INFO ] Input system was already deterministic with 110 transitions.
[2026-05-23 19:54:32] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:54:32] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:54:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7858958931302577660.gal : 1 ms
[2026-05-23 19:54:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7894113211271130467.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/CTLFireability7858958931302577660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7894113211271130467.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,82550,1.16524,32892,2,6897,5,102917,6,0,458,87710,0


Converting to forward existential form...Done !
original formula: EX(EG(EX(((p128<1)||(l532<1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),EX(((p128<1)||(l532<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t57, t59, t66, t73, t74, t75, t77, t78, t79, t80, t...408
(forward)formula 0,1,4.99926,105240,1,0,393,438863,242,203,3195,407953,358
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 181 transition count 293
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 181 transition count 293
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 109 place count 181 transition count 286
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 144 place count 146 transition count 243
Iterating global reduction 1 with 35 rules applied. Total rules applied 179 place count 146 transition count 243
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 192 place count 146 transition count 230
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 212 place count 126 transition count 201
Iterating global reduction 2 with 20 rules applied. Total rules applied 232 place count 126 transition count 201
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 244 place count 126 transition count 189
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 252 place count 118 transition count 174
Iterating global reduction 3 with 8 rules applied. Total rules applied 260 place count 118 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 263 place count 118 transition count 171
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 269 place count 112 transition count 165
Iterating global reduction 4 with 6 rules applied. Total rules applied 275 place count 112 transition count 165
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 281 place count 106 transition count 159
Iterating global reduction 4 with 6 rules applied. Total rules applied 287 place count 106 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 290 place count 106 transition count 156
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 291 place count 105 transition count 154
Iterating global reduction 5 with 1 rules applied. Total rules applied 292 place count 105 transition count 154
Applied a total of 292 rules in 14 ms. Remains 105 /232 variables (removed 127) and now considering 154/445 (removed 291) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3433524504408626441.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13423046702479836638.kers'
[2026-05-23 19:54:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3433524504408626441.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13423046702479836638.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 105 cols 480 entries
Finished phase 1 with 101 SingleSign rule and 2 generalized
[2026-05-23 19:54:37] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13423046702479836638.kers
Total runtime 1 ms.
[2026-05-23 19:54:37] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-23 19:54:37] [INFO ] Invariant cache hit.
[2026-05-23 19:54:37] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 19:54:38] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2026-05-23 19:54:38] [INFO ] Invariant cache hit.
[2026-05-23 19:54:38] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/259 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 61/168 constraints. Problems are: Problem set: 0 solved, 153 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 168 constraints, problems are : Problem set: 0 solved, 153 unsolved in 9716 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/259 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 61/168 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 153/321 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 321 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39833ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 39834ms
Starting structural reductions in LTL mode, iteration 1 : 105/232 places, 154/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40529 ms. Remains : 105/232 places, 154/445 transitions.
[2026-05-23 19:55:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:55:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:55:18] [INFO ] Input system was already deterministic with 154 transitions.
[2026-05-23 19:55:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:55:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:55:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7892225232227591977.gal : 2 ms
[2026-05-23 19:55:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11261545701313315914.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/CTLFireability7892225232227591977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11261545701313315914.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,152531,2.77077,54500,2,11450,5,150780,6,0,574,141016,0


Converting to forward existential form...Done !
original formula: (EF(AX(EG(!(E(((s1>=1)&&(l1027>=1)) U ((p114>=1)&&(l506>=1))))))) * AF((((((AX(((p68>=1)&&(l618>=1))) + ((s1>=1)&&(l608>=1))) + EF(((s1>=...273
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(EG(!(E(((s1>=1)&&(l1027>=1)) U ((p114>=1)&&(l506>=1)))))))))))] = FALSE * [FwdG(Init...431
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t36, t37, t39, t47, t54, t55, t56, t57, t58, t59, t60,...608
(forward)formula 0,0,22.5516,435620,1,0,596,1.87434e+06,350,312,4069,1.77031e+06,635
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 181 transition count 305
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 181 transition count 305
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 114 place count 181 transition count 293
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 151 place count 144 transition count 249
Iterating global reduction 1 with 37 rules applied. Total rules applied 188 place count 144 transition count 249
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 202 place count 144 transition count 235
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 223 place count 123 transition count 200
Iterating global reduction 2 with 21 rules applied. Total rules applied 244 place count 123 transition count 200
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 255 place count 123 transition count 189
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 265 place count 113 transition count 172
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 113 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 281 place count 113 transition count 166
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 287 place count 107 transition count 160
Iterating global reduction 4 with 6 rules applied. Total rules applied 293 place count 107 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 294 place count 107 transition count 159
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 299 place count 102 transition count 154
Iterating global reduction 5 with 5 rules applied. Total rules applied 304 place count 102 transition count 154
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 305 place count 101 transition count 152
Iterating global reduction 5 with 1 rules applied. Total rules applied 306 place count 101 transition count 152
Applied a total of 306 rules in 18 ms. Remains 101 /232 variables (removed 131) and now considering 152/445 (removed 293) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3545214909948988514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1390616533881951553.kers'
[2026-05-23 19:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3545214909948988514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1390616533881951553.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 101 cols 472 entries
Finished phase 1 with 97 SingleSign rule and 2 generalized
[2026-05-23 19:55:40] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1390616533881951553.kers
Total runtime 1 ms.
[2026-05-23 19:55:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-23 19:55:41] [INFO ] Invariant cache hit.
[2026-05-23 19:55:41] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-23 19:55:41] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2026-05-23 19:55:41] [INFO ] Invariant cache hit.
[2026-05-23 19:55:41] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 152/253 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 165 constraints, problems are : Problem set: 0 solved, 151 unsolved in 9234 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 152/253 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 62/165 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 151/316 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 253/253 variables, and 316 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39325ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 39326ms
Starting structural reductions in LTL mode, iteration 1 : 101/232 places, 152/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39771 ms. Remains : 101/232 places, 152/445 transitions.
[2026-05-23 19:56:20] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:56:20] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:56:20] [INFO ] Input system was already deterministic with 152 transitions.
[2026-05-23 19:56:20] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:56:20] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:56:20] [INFO ] Time to serialize gal into /tmp/CTLFireability395077673575409520.gal : 6 ms
[2026-05-23 19:56:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2695157931199870060.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/CTLFireability395077673575409520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2695157931199870060.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,122565,1.80837,44648,2,9535,5,118883,6,0,556,117678,0


Converting to forward existential form...Done !
original formula: A(A(((EG(E(((s1>=1)&&(l610>=1)) U ((s1>=1)&&(l303>=1)))) + ((p33>=1)&&(l0>=1))) + (AG(((p67>=1)&&(l617>=1))) * EX(((s1>=1)&&(l606>=1)))))...301
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(EG((!(((s1>=1)&&(l311>=1))) + E(((s1>=1)&&(l608>=1)) U ((p19>=1)&&(l0>=1)))))) + EG(((s1>=...713
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t17, t18, t22, t23, t25, t46, t47, t48, t49, t50, t51, t52, t53, t54, t...641
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,12.8996,292148,1,0,546,1.39723e+06,364,283,4009,970001,646
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-11 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 : 232/232 places, 445/445 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 175 transition count 272
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 175 transition count 272
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 121 place count 175 transition count 265
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 160 place count 136 transition count 217
Iterating global reduction 1 with 39 rules applied. Total rules applied 199 place count 136 transition count 217
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 212 place count 136 transition count 204
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 234 place count 114 transition count 167
Iterating global reduction 2 with 22 rules applied. Total rules applied 256 place count 114 transition count 167
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 265 place count 114 transition count 158
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 275 place count 104 transition count 141
Iterating global reduction 3 with 10 rules applied. Total rules applied 285 place count 104 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 289 place count 104 transition count 137
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 296 place count 97 transition count 130
Iterating global reduction 4 with 7 rules applied. Total rules applied 303 place count 97 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 304 place count 97 transition count 129
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 310 place count 91 transition count 123
Iterating global reduction 5 with 6 rules applied. Total rules applied 316 place count 91 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 317 place count 91 transition count 122
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 319 place count 89 transition count 114
Iterating global reduction 6 with 2 rules applied. Total rules applied 321 place count 89 transition count 114
Applied a total of 321 rules in 40 ms. Remains 89 /232 variables (removed 143) and now considering 114/445 (removed 331) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17276631126329012770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12130148145954215296.kers'
[2026-05-23 19:56:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17276631126329012770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12130148145954215296.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 89 cols 370 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 19:56:33] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12130148145954215296.kers
Total runtime 1 ms.
[2026-05-23 19:56:33] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-23 19:56:33] [INFO ] Invariant cache hit.
[2026-05-23 19:56:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 19:56:34] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2026-05-23 19:56:34] [INFO ] Redundant transitions in 7 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-23 19:56:34] [INFO ] Invariant cache hit.
[2026-05-23 19:56:34] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 135 constraints, problems are : Problem set: 0 solved, 113 unsolved in 13631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/203 variables, 89/97 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 113/248 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 248 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43693ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 43694ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/232 places, 114/445 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44272 ms. Remains : 89/232 places, 114/445 transitions.
[2026-05-23 19:57:18] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:57:18] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:57:18] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-23 19:57:18] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:57:18] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:57:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8048540313902731732.gal : 2 ms
[2026-05-23 19:57:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1921157524624250719.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/CTLFireability8048540313902731732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1921157524624250719.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,98709,1.4432,33032,2,7125,5,95815,6,0,470,93206,0


Converting to forward existential form...Done !
original formula: AG(EF(((s1>=1)&&(l1291>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((s1>=1)&&(l1291>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t54, t55, t57, t68, t72, t73, t74, t75, t76, t81, t...427
(forward)formula 0,0,5.21942,102544,1,0,283,439826,249,119,3257,285223,317
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 445/445 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 178 transition count 279
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 178 transition count 279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 115 place count 178 transition count 272
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 152 place count 141 transition count 226
Iterating global reduction 1 with 37 rules applied. Total rules applied 189 place count 141 transition count 226
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 200 place count 141 transition count 215
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 217 place count 124 transition count 186
Iterating global reduction 2 with 17 rules applied. Total rules applied 234 place count 124 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 242 place count 124 transition count 178
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 248 place count 118 transition count 167
Iterating global reduction 3 with 6 rules applied. Total rules applied 254 place count 118 transition count 167
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 260 place count 112 transition count 161
Iterating global reduction 3 with 6 rules applied. Total rules applied 266 place count 112 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 112 transition count 160
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 272 place count 107 transition count 155
Iterating global reduction 4 with 5 rules applied. Total rules applied 277 place count 107 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 279 place count 107 transition count 153
Applied a total of 279 rules in 38 ms. Remains 107 /232 variables (removed 125) and now considering 153/445 (removed 292) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14433968453122901171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15730107925102003895.kers'
[2026-05-23 19:57:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14433968453122901171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15730107925102003895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 107 cols 475 entries
Finished phase 1 with 103 SingleSign rule and 2 generalized
[2026-05-23 19:57:23] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15730107925102003895.kers
Total runtime 2 ms.
[2026-05-23 19:57:23] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-23 19:57:23] [INFO ] Invariant cache hit.
[2026-05-23 19:57:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 19:57:24] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2026-05-23 19:57:24] [INFO ] Redundant transitions in 5 ms returned []
Running 152 sub problems to find dead transitions.
[2026-05-23 19:57:24] [INFO ] Invariant cache hit.
[2026-05-23 19:57:24] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/260 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 61/170 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 260/260 variables, and 179 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/260 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 61/179 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 152/331 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 260/260 variables, and 331 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/232 places, 153/445 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60800 ms. Remains : 107/232 places, 153/445 transitions.
[2026-05-23 19:58:24] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:58:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:58:24] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-23 19:58:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:58:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:58:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5448421359621819703.gal : 2 ms
[2026-05-23 19:58:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8217839756412981824.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/CTLFireability5448421359621819703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8217839756412981824.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,163871,3.15697,72480,2,11841,5,206316,6,0,581,190682,0


Converting to forward existential form...Done !
original formula: AF((EG(((s1<1)||(l1284<1))) + (((s1<1)||(l445<1)) * (EG(A(((s1>=1)&&(l7>=1)) U ((p97>=1)&&(l0>=1)))) + ((E((((s1>=1)&&(l1020>=1))||((s1>=...246
=> equivalent forward existential formula: [FwdG(Init,!((EG(((s1<1)||(l1284<1))) + (((s1<1)||(l445<1)) * (EG(!((E(!(((p97>=1)&&(l0>=1))) U (!(((s1>=1)&&(l7...358
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t25, t30, t31, t32, t46, t47, t48, t49, t51, t52, t53, t54, t55, t56, t...608
Using saturation style SCC detection
(forward)formula 0,1,15.7559,317996,1,0,476,1.58517e+06,356,197,4039,1.21882e+06,545
FORMULA DBSingleClientW-PT-d1m05-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 : 232/232 places, 445/445 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 175 transition count 272
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 175 transition count 272
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 121 place count 175 transition count 265
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 160 place count 136 transition count 217
Iterating global reduction 1 with 39 rules applied. Total rules applied 199 place count 136 transition count 217
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 212 place count 136 transition count 204
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 234 place count 114 transition count 167
Iterating global reduction 2 with 22 rules applied. Total rules applied 256 place count 114 transition count 167
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 265 place count 114 transition count 158
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 275 place count 104 transition count 143
Iterating global reduction 3 with 10 rules applied. Total rules applied 285 place count 104 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 289 place count 104 transition count 139
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 296 place count 97 transition count 132
Iterating global reduction 4 with 7 rules applied. Total rules applied 303 place count 97 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 304 place count 97 transition count 131
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 310 place count 91 transition count 125
Iterating global reduction 5 with 6 rules applied. Total rules applied 316 place count 91 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 319 place count 91 transition count 122
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 321 place count 89 transition count 114
Iterating global reduction 6 with 2 rules applied. Total rules applied 323 place count 89 transition count 114
Applied a total of 323 rules in 29 ms. Remains 89 /232 variables (removed 143) and now considering 114/445 (removed 331) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1624547372119611158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5655508921580325855.kers'
[2026-05-23 19:58:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1624547372119611158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5655508921580325855.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 89 cols 370 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 19:58:40] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5655508921580325855.kers
Total runtime 2 ms.
[2026-05-23 19:58:40] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-23 19:58:40] [INFO ] Invariant cache hit.
[2026-05-23 19:58:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 19:58:40] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2026-05-23 19:58:40] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-23 19:58:40] [INFO ] Invariant cache hit.
[2026-05-23 19:58:40] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 129 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6538 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 113/242 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 242 constraints, problems are : Problem set: 0 solved, 113 unsolved in 23585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30177ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 30178ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/232 places, 114/445 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30686 ms. Remains : 89/232 places, 114/445 transitions.
[2026-05-23 19:59:10] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:59:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:59:10] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-23 19:59:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:59:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:59:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11685628780534651726.gal : 1 ms
[2026-05-23 19:59:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11348136551694200164.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/CTLFireability11685628780534651726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11348136551694200164.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,96220,0.985542,32656,2,7242,5,94512,6,0,470,92961,0


Converting to forward existential form...Done !
original formula: EG(AF(((s1<1)||(l1229<1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((s1<1)||(l1229<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t64, t66, t67, t68, t69, t70, t74, t75, t76, t78, t...442
(forward)formula 0,1,4.03549,97792,1,0,254,364537,253,100,3303,281129,281
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 19:59:14] [INFO ] Flatten gal took : 10 ms
[2026-05-23 19:59:14] [INFO ] Flatten gal took : 9 ms
Total runtime 931914 ms.

BK_STOP 1779566355006

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

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