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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779554946751

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-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 16:49:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 16:49:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:49:09] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2026-05-23 16:49:09] [INFO ] Transformed 553 places.
[2026-05-23 16:49:09] [INFO ] Transformed 150 transitions.
[2026-05-23 16:49:09] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 70 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Applied a total of 18 rules in 43 ms. Remains 102 /109 variables (removed 7) and now considering 139/150 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11971687231110673867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8135293191146780926.kers'
[2026-05-23 16:49:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11971687231110673867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8135293191146780926.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 102 cols 416 entries
Finished phase 1 with 98 SingleSign rule and 2 generalized
[2026-05-23 16:49:09] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8135293191146780926.kers
Total runtime 4 ms.
[2026-05-23 16:49:10] [INFO ] Implicit Places using invariants in 507 ms returned []
[2026-05-23 16:49:10] [INFO ] Invariant cache hit.
[2026-05-23 16:49:10] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-23 16:49:10] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-23 16:49:10] [INFO ] Invariant cache hit.
[2026-05-23 16:49:10] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 138/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 305 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40030ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 40061ms
Starting structural reductions in LTL mode, iteration 1 : 102/109 places, 139/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41249 ms. Remains : 102/109 places, 139/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2026-05-23 16:49:50] [INFO ] Invariant cache hit.
[2026-05-23 16:49:51] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-23 16:49:51] [INFO ] Invariant cache hit.
[2026-05-23 16:49:51] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-23 16:49:51] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 102/102 places, 139/139 transitions.
Support contains 70 out of 102 places after structural reductions.
[2026-05-23 16:49:51] [INFO ] Flatten gal took : 56 ms
[2026-05-23 16:49:51] [INFO ] Flatten gal took : 41 ms
[2026-05-23 16:49:52] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 68 out of 102 places (down from 70) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 72 to 67
RANDOM walk for 40000 steps (9148 resets) in 2377 ms. (16 steps per ms) remains 34/67 properties
BEST_FIRST walk for 4004 steps (211 resets) in 67 ms. (58 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (199 resets) in 114 ms. (34 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (210 resets) in 72 ms. (54 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (192 resets) in 65 ms. (60 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (197 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (800 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (419 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (415 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (206 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (430 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (208 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (199 resets) in 44 ms. (88 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (196 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (208 resets) in 19 ms. (200 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (186 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (443 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (198 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (204 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (800 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (181 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (392 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (398 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (309 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (396 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (423 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (211 resets) in 45 ms. (87 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (213 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (131 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (192 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (170 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (800 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (183 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (197 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
[2026-05-23 16:49:53] [INFO ] Invariant cache hit.
[2026-05-23 16:49:53] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/70 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 29 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 19/89 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 133/222 variables, 89/91 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 57/148 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/148 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 19/241 variables, 13/161 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 6/167 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 4 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 4 solved, 29 unsolved in 2202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 28/67 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 20/87 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 133/220 variables, 87/90 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 57/147 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 4/151 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 4/155 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/155 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 21/241 variables, 15/170 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 6/176 constraints. Problems are: Problem set: 4 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 25/201 constraints. Problems are: Problem set: 4 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 201 constraints, problems are : Problem set: 4 solved, 29 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 29/33 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7254ms problems are : Problem set: 4 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 92 transition count 129
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 92 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 90 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 90 transition count 127
Applied a total of 24 rules in 33 ms. Remains 90 /102 variables (removed 12) and now considering 127/139 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 90/102 places, 127/139 transitions.
RANDOM walk for 40000 steps (9139 resets) in 494 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (221 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (203 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (198 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (186 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (194 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (800 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (395 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (438 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (192 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (408 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (194 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (192 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (173 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (184 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (184 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (413 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (179 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (195 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (800 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (411 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (406 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (319 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (412 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (404 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (200 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (129 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (199 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (800 resets) in 66 ms. (59 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (189 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
Probabilistic random walk after 1000001 steps, saw 381019 distinct states, run finished after 1748 ms. (steps per millisecond=572 ) properties seen :28
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3747968548518233392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17651201003048650302.kers'
[2026-05-23 16:50:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3747968548518233392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17651201003048650302.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 90 cols 378 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 16:50:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17651201003048650302.kers
Total runtime 1 ms.
[2026-05-23 16:50:02] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/140 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 67/207 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 40/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/217 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/140 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 13/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 67/207 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 40/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/217 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/217 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 745ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 125 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 127/127 transitions.
Graph (complete) has 268 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 125
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 75 transition count 95
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 75 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 75 transition count 94
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 67 transition count 86
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 64 transition count 78
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 59 place count 62 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 60 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 67 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 59 transition count 69
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 71 place count 59 transition count 67
Applied a total of 71 rules in 44 ms. Remains 59 /90 variables (removed 31) and now considering 67/127 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 59/90 places, 67/127 transitions.
RANDOM walk for 40000 steps (9185 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3196 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2724012 steps, run timeout after 3011 ms. (steps per millisecond=904 ) properties seen :0 out of 1
Probabilistic random walk after 2724012 steps, saw 1039533 distinct states, run finished after 3015 ms. (steps per millisecond=903 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16298520450583080276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17434918344818066064.kers'
[2026-05-23 16:50:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16298520450583080276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17434918344818066064.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 59 cols 215 entries
Finished phase 1 with 54 SingleSign rule and 3 generalized
[2026-05-23 16:50:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17434918344818066064.kers
Total runtime 1 ms.
[2026-05-23 16:50:06] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/97 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/126 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/97 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/126 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2026-05-23 16:50:07] [INFO ] Invariant cache hit.
[2026-05-23 16:50:07] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 16:50:07] [INFO ] Invariant cache hit.
[2026-05-23 16:50:07] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 16:50:07] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2026-05-23 16:50:07] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2026-05-23 16:50:07] [INFO ] Invariant cache hit.
[2026-05-23 16:50:07] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3207 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 66/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 150 constraints, problems are : Problem set: 0 solved, 66 unsolved in 9768 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13023ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 13025ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13402 ms. Remains : 59/59 places, 67/67 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 59 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 58 transition count 63
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 58 transition count 57
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 52 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 51 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 51 transition count 56
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 50 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 50 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 49 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 47 transition count 64
Applied a total of 27 rules in 28 ms. Remains 47 /59 variables (removed 12) and now considering 64/67 (removed 3) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12966491724002910515.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-969465289083900025.kers'
[2026-05-23 16:50:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12966491724002910515.kers, --Pflows, --basisKERS=/tmp/petrispot-output-969465289083900025.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 47 cols 242 entries
Finished phase 1 with 40 SingleSign rule and 3 generalized
[2026-05-23 16:50:20] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-969465289083900025.kers
Total runtime 1 ms.
[2026-05-23 16:50:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-23 16:50:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 16:50:20] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 16:50:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-23 16:50:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 16:50:20] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 16:50:20] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 16:50:20] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-23 16:50:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 16:50:21] [INFO ] Flatten gal took : 30 ms
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 16:50:21] [INFO ] Flatten gal took : 27 ms
[2026-05-23 16:50:21] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 64 out of 102 places (down from 65) after GAL structural reductions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 341 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 86 transition count 115
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 86 transition count 115
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 78 transition count 107
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 78 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 77 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 77 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 76 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 76 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 75 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 75 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 75 transition count 100
Applied a total of 56 rules in 24 ms. Remains 75 /102 variables (removed 27) and now considering 100/139 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11979585681489324573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12329206996204488932.kers'
[2026-05-23 16:50:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11979585681489324573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12329206996204488932.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 75 cols 305 entries
Finished phase 1 with 71 SingleSign rule and 2 generalized
[2026-05-23 16:50:21] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12329206996204488932.kers
Total runtime 4 ms.
[2026-05-23 16:50:21] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-23 16:50:21] [INFO ] Invariant cache hit.
[2026-05-23 16:50:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 16:50:21] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2026-05-23 16:50:21] [INFO ] Invariant cache hit.
[2026-05-23 16:50:21] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/175 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 122 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7773 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 100/175 variables, 75/80 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 42/122 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 99/221 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 221 constraints, problems are : Problem set: 0 solved, 99 unsolved in 17283 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25130ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 25131ms
Starting structural reductions in LTL mode, iteration 1 : 75/102 places, 100/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25552 ms. Remains : 75/102 places, 100/139 transitions.
[2026-05-23 16:50:46] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:50:46] [INFO ] Flatten gal took : 9 ms
[2026-05-23 16:50:46] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-23 16:50:46] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:50:46] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16183960714051117627.gal : 4 ms
[2026-05-23 16:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11854943217655853470.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/CTLFireability16183960714051117627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11854943217655853470.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,2.23594e+07,9.63057,184504,2,15615,5,718797,6,0,400,565185,0


Converting to forward existential form...Done !
original formula: !(E((EG(E((((s1>=1)&&(l149>=1))&&((s1>=1)&&(l503>=1))) U (((s1>=1)&&(l37>=1))||((s1>=1)&&(l150>=1))))) * EX(!((!(((s1>=1)&&(l504>=1))) + ...415
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,(EG(E((((s1>=1)&&(l149>=1))&&((s1>=1)&&(l503>=1))) U (((s1>=1)&&(l37>=1))||((s1>=1)&&(l150>...1311
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t51,...430
Detected timeout of ITS tools.
[2026-05-23 16:51:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 16:51:16] [INFO ] Applying decomposition
[2026-05-23 16:51:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph550370863405768926.txt' '-o' '/tmp/graph550370863405768926.bin' '-w' '/tmp/graph550370863405768926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph550370863405768926.bin' '-l' '-1' '-v' '-w' '/tmp/graph550370863405768926.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:51:17] [INFO ] Decomposing Gal with order
[2026-05-23 16:51:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:51:17] [INFO ] Removed a total of 117 redundant transitions.
[2026-05-23 16:51:17] [INFO ] Flatten gal took : 115 ms
[2026-05-23 16:51:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 15 ms.
[2026-05-23 16:51:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14814218661085890768.gal : 7 ms
[2026-05-23 16:51:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6118332137476719410.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/CTLFireability14814218661085890768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6118332137476719410.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 79 transition count 97
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 68 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 63 transition count 73
Applied a total of 83 rules in 11 ms. Remains 63 /102 variables (removed 39) and now considering 73/139 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1396191906145355518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13170627394460796283.kers'
[2026-05-23 16:51:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1396191906145355518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13170627394460796283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 240 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 16:51:47] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13170627394460796283.kers
Total runtime 1 ms.
[2026-05-23 16:51:47] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-23 16:51:47] [INFO ] Invariant cache hit.
[2026-05-23 16:51:47] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 16:51:47] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2026-05-23 16:51:47] [INFO ] Invariant cache hit.
[2026-05-23 16:51:47] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 89 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 73/136 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 72/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 161 constraints, problems are : Problem set: 0 solved, 72 unsolved in 10763 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13595ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 13596ms
Starting structural reductions in LTL mode, iteration 1 : 63/102 places, 73/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13852 ms. Remains : 63/102 places, 73/139 transitions.
[2026-05-23 16:52:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:52:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:52:01] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-23 16:52:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:52:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:52:01] [INFO ] Time to serialize gal into /tmp/CTLFireability61088836554884406.gal : 2 ms
[2026-05-23 16:52:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2134547284336526138.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/CTLFireability61088836554884406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2134547284336526138.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 -...281
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,6.29121e+06,3.6407,72612,2,11762,5,255490,6,0,325,335354,0


Converting to forward existential form...Done !
original formula: (AX(EX((AF(((s1>=1)&&(l125>=1))) + AG(((p13<1)||(l155<1)))))) * AF(((s1<1)||(l505<1))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX((!(EG(!(((s1>=1)&&(l125>=1))))) + !(E(TRUE U !(((p13<1)||(l155<1)))))))))] = FALSE * [FwdG(In...190
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t48, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
Detected timeout of ITS tools.
[2026-05-23 16:52:31] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:52:31] [INFO ] Applying decomposition
[2026-05-23 16:52:31] [INFO ] Flatten gal took : 7 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/graph2292904799388603471.txt' '-o' '/tmp/graph2292904799388603471.bin' '-w' '/tmp/graph2292904799388603471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2292904799388603471.bin' '-l' '-1' '-v' '-w' '/tmp/graph2292904799388603471.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:52:31] [INFO ] Decomposing Gal with order
[2026-05-23 16:52:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:52:31] [INFO ] Removed a total of 72 redundant transitions.
[2026-05-23 16:52:31] [INFO ] Flatten gal took : 13 ms
[2026-05-23 16:52:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 6 ms.
[2026-05-23 16:52:31] [INFO ] Time to serialize gal into /tmp/CTLFireability574616648691236640.gal : 8 ms
[2026-05-23 16:52:31] [INFO ] Time to serialize properties into /tmp/CTLFireability777278326168658282.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/CTLFireability574616648691236640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability777278326168658282.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 83 transition count 108
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 83 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 83 transition count 106
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 74 transition count 97
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 74 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 74 transition count 95
Applied a total of 60 rules in 18 ms. Remains 74 /102 variables (removed 28) and now considering 95/139 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16416039925980647433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4432667694656067721.kers'
[2026-05-23 16:53:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16416039925980647433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4432667694656067721.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 74 cols 304 entries
Finished phase 1 with 70 SingleSign rule and 2 generalized
[2026-05-23 16:53:01] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4432667694656067721.kers
Total runtime 1 ms.
[2026-05-23 16:53:01] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-23 16:53:01] [INFO ] Invariant cache hit.
[2026-05-23 16:53:01] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 16:53:01] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-23 16:53:01] [INFO ] Invariant cache hit.
[2026-05-23 16:53:01] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/169 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 110 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/169 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 94/204 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 204 constraints, problems are : Problem set: 0 solved, 94 unsolved in 19356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23396ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 23397ms
Starting structural reductions in LTL mode, iteration 1 : 74/102 places, 95/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23691 ms. Remains : 74/102 places, 95/139 transitions.
[2026-05-23 16:53:25] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:53:25] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:53:25] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-23 16:53:25] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:53:25] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:53:25] [INFO ] Time to serialize gal into /tmp/CTLFireability15255759329587013497.gal : 3 ms
[2026-05-23 16:53:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4384657786026787524.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/CTLFireability15255759329587013497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4384657786026787524.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,2.42725e+07,9.64279,183052,2,15548,5,663992,6,0,391,624344,0


Converting to forward existential form...Done !
original formula: ((AF(((EG(((EX(((p14<1)||(l156<1))) * (p26>=1)) * (l0>=1))) * AF(((s1>=1)&&(l484>=1)))) * AX(EF(((s1<1)||(l150<1)))))) * AX(EF(EX(((s1>=1...279
=> equivalent forward existential formula: (([FwdG(Init,!(((EG(((EX(((p14<1)||(l156<1))) * (p26>=1)) * (l0>=1))) * !(EG(!(((s1>=1)&&(l484>=1)))))) * !(EX(!...432
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t57, t60, t61, t62, t7...376
Detected timeout of ITS tools.
[2026-05-23 16:53:55] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:53:55] [INFO ] Applying decomposition
[2026-05-23 16:53:55] [INFO ] Flatten gal took : 6 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/graph11196410197382679442.txt' '-o' '/tmp/graph11196410197382679442.bin' '-w' '/tmp/graph11196410197382679442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11196410197382679442.bin' '-l' '-1' '-v' '-w' '/tmp/graph11196410197382679442.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:53:55] [INFO ] Decomposing Gal with order
[2026-05-23 16:53:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:53:55] [INFO ] Removed a total of 97 redundant transitions.
[2026-05-23 16:53:55] [INFO ] Flatten gal took : 15 ms
[2026-05-23 16:53:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 6 ms.
[2026-05-23 16:53:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16205170851272856079.gal : 3 ms
[2026-05-23 16:53:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17158857886182502916.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/CTLFireability16205170851272856079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17158857886182502916.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.42725e+07,6.67018,101620,2175,644,143892,16092,290,426847,86,118884,0


Converting to forward existential form...Done !
original formula: ((AF(((EG(((EX(((u7.p14<1)||(i6.u14.l156<1))) * (i5.u12.p26>=1)) * (i5.u1.l0>=1))) * AF(((i5.u1.s1>=1)&&(i6.u15.l484>=1)))) * AX(EF(((i5....390
=> equivalent forward existential formula: (([FwdG(Init,!(((EG(((EX(((u7.p14<1)||(i6.u14.l156<1))) * (i5.u12.p26>=1)) * (i5.u1.l0>=1))) * !(EG(!(((i5.u1.s1...543
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t25, t27, t28, t29, t30, t32, t33, t57, t60, t61, t62, t70, t71, t72, t73, t74, t75, ...359
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 83 transition count 111
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 83 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 83 transition count 110
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 74 transition count 101
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 74 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 72 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 72 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 72 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 71 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 71 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 70 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 70 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 70 transition count 91
Applied a total of 68 rules in 8 ms. Remains 70 /102 variables (removed 32) and now considering 91/139 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2247906817478928617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2428402454778421346.kers'
[2026-05-23 16:54:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2247906817478928617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2428402454778421346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 70 cols 280 entries
Finished phase 1 with 66 SingleSign rule and 2 generalized
[2026-05-23 16:54:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2428402454778421346.kers
Total runtime 1 ms.
[2026-05-23 16:54:25] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 16:54:25] [INFO ] Invariant cache hit.
[2026-05-23 16:54:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 16:54:25] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-23 16:54:25] [INFO ] Invariant cache hit.
[2026-05-23 16:54:25] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/161 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 37/109 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 111 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4276 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/161 variables, 70/74 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 37/111 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 90/201 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 201 constraints, problems are : Problem set: 0 solved, 90 unsolved in 13278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17588ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17588ms
Starting structural reductions in LTL mode, iteration 1 : 70/102 places, 91/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17932 ms. Remains : 70/102 places, 91/139 transitions.
[2026-05-23 16:54:43] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:54:43] [INFO ] Flatten gal took : 7 ms
[2026-05-23 16:54:43] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-23 16:54:43] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:54:43] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:54:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17038149845525457955.gal : 3 ms
[2026-05-23 16:54:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9705104330863270238.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/CTLFireability17038149845525457955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9705104330863270238.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,1.67997e+07,6.55919,120800,2,13816,5,449107,6,0,371,464468,0


Converting to forward existential form...Done !
original formula: A(AF((((s1>=1)&&(l353>=1)) + ((!(AX(((s1>=1)&&(l491>=1)))) * (p24>=1)) * (l0>=1)))) U AF(AX(((!(E(((s1>=1)&&(l149>=1)) U ((s1>=1)&&(l491>...188
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(EX(!(((!(E(((s1>=1)&&(l149>=1)) U ((s1>=1)&&(l491>=1)))) * (s1>=1)) * (l504>=1))))))))...479
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t47, t48, t49, t55, t5...396
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-23 16:55:13] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:55:13] [INFO ] Applying decomposition
[2026-05-23 16:55:13] [INFO ] Flatten gal took : 7 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/graph8770385603207655114.txt' '-o' '/tmp/graph8770385603207655114.bin' '-w' '/tmp/graph8770385603207655114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8770385603207655114.bin' '-l' '-1' '-v' '-w' '/tmp/graph8770385603207655114.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:55:13] [INFO ] Decomposing Gal with order
[2026-05-23 16:55:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:55:13] [INFO ] Removed a total of 93 redundant transitions.
[2026-05-23 16:55:13] [INFO ] Flatten gal took : 19 ms
[2026-05-23 16:55:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 7 ms.
[2026-05-23 16:55:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2945204873925074679.gal : 4 ms
[2026-05-23 16:55:13] [INFO ] Time to serialize properties into /tmp/CTLFireability320347809484210637.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/CTLFireability2945204873925074679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability320347809484210637.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.67997e+07,11.6203,180600,2651,755,261421,13343,270,652744,92,134153,0


Converting to forward existential form...Done !
original formula: A(AF((((i0.u0.s1>=1)&&(i5.u1.l353>=1)) + ((!(AX(((i0.u0.s1>=1)&&(i6.u11.l491>=1)))) * (i0.u7.p24>=1)) * (i0.u0.l0>=1)))) U AF(AX(((!(E(((...260
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(EX(!(((!(E(((i0.u0.s1>=1)&&(u6.l149>=1)) U ((i0.u0.s1>=1)&&(i6.u11.l491>=1)))) * (i0.u...621
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t8, t9, t32, t47, t48, t49, t57, t58, t59, t68, t69, t71, t72, t73, t74, t75, t76...339
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 82 transition count 102
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 82 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 82 transition count 101
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 74 transition count 93
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 74 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 74 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 73 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 73 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 72 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 72 transition count 88
Applied a total of 63 rules in 27 ms. Remains 72 /102 variables (removed 30) and now considering 88/139 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17780612963362124878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10686774902873042484.kers'
[2026-05-23 16:55:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17780612963362124878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10686774902873042484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 72 cols 287 entries
Finished phase 1 with 68 SingleSign rule and 2 generalized
[2026-05-23 16:55:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-10686774902873042484.kers
Total runtime 12 ms.
[2026-05-23 16:55:43] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-23 16:55:43] [INFO ] Invariant cache hit.
[2026-05-23 16:55:43] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 16:55:44] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2026-05-23 16:55:44] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2026-05-23 16:55:44] [INFO ] Invariant cache hit.
[2026-05-23 16:55:44] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/160 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 29/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 107 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6555 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/160 variables, 72/78 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 29/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 87/194 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 194 constraints, problems are : Problem set: 0 solved, 87 unsolved in 14310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20899ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 20900ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/102 places, 88/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21555 ms. Remains : 72/102 places, 88/139 transitions.
[2026-05-23 16:56:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:56:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:56:05] [INFO ] Input system was already deterministic with 88 transitions.
[2026-05-23 16:56:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:56:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:56:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10979543134647952418.gal : 2 ms
[2026-05-23 16:56:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13214954450893036752.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/CTLFireability10979543134647952418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13214954450893036752.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,1.89606e+07,9.99388,182572,2,19546,5,626876,6,0,376,702724,0


Converting to forward existential form...Done !
original formula: ((AF(((s1>=1)&&(l110>=1))) * AF((AF((((s1>=1)&&(l345>=1))||(((s1>=1)&&(l91>=1))&&((s1>=1)&&(l110>=1))))) + (AG(((s1>=1)&&(l488>=1))) * ((...326
=> equivalent forward existential formula: (([FwdG(Init,!(((s1>=1)&&(l110>=1))))] = FALSE * [FwdG(Init,!((!(EG(!((((s1>=1)&&(l345>=1))||(((s1>=1)&&(l91>=1)...449
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t51, t52, t53, t55, t63, t64, t65, t66, t67, t68, t69, t7...341
(forward)formula 0,0,18.994,235508,1,0,173,1.0482e+06,198,68,2639,892050,186
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 81 transition count 103
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 81 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 81 transition count 102
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 71 transition count 92
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 69 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 69 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 68 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 67 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 67 transition count 83
Applied a total of 73 rules in 17 ms. Remains 67 /102 variables (removed 35) and now considering 83/139 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6203972924360642808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5797156985954048338.kers'
[2026-05-23 16:56:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6203972924360642808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5797156985954048338.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 67 cols 268 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 16:56:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5797156985954048338.kers
Total runtime 1 ms.
[2026-05-23 16:56:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 16:56:24] [INFO ] Invariant cache hit.
[2026-05-23 16:56:24] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 16:56:24] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2026-05-23 16:56:24] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2026-05-23 16:56:24] [INFO ] Invariant cache hit.
[2026-05-23 16:56:24] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/150 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 104 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/150 variables, 67/76 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 28/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 82/186 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 186 constraints, problems are : Problem set: 0 solved, 82 unsolved in 11034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16193ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 16193ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/102 places, 83/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16490 ms. Remains : 67/102 places, 83/139 transitions.
[2026-05-23 16:56:40] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:56:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:56:40] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-23 16:56:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:56:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:56:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8511332562368495174.gal : 1 ms
[2026-05-23 16:56:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13711916694925217923.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/CTLFireability8511332562368495174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13711916694925217923.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,1.06625e+07,3.80225,80080,2,11044,5,347071,6,0,351,301120,0


Converting to forward existential form...Done !
original formula: E(!(EF(((!((p28>=1)&&(l0>=1)))||((s1>=1)&&(l354>=1))))) U AF(((s1>=1)&&(l502>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U ((!((p28>=1)&&(l0>=1)))||((s1>=1)&&(l354>=1)))))) * !(EG(!(((s1>=1)&&(l502>=1))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t44, t45, t51, t54, t55, t56, t60, t61, t62, t63, t64, t65, t6...336
Detected timeout of ITS tools.
[2026-05-23 16:57:10] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:57:10] [INFO ] Applying decomposition
[2026-05-23 16:57:10] [INFO ] Flatten gal took : 3 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/graph9629505700927491172.txt' '-o' '/tmp/graph9629505700927491172.bin' '-w' '/tmp/graph9629505700927491172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9629505700927491172.bin' '-l' '-1' '-v' '-w' '/tmp/graph9629505700927491172.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:57:10] [INFO ] Decomposing Gal with order
[2026-05-23 16:57:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:57:10] [INFO ] Removed a total of 87 redundant transitions.
[2026-05-23 16:57:10] [INFO ] Flatten gal took : 9 ms
[2026-05-23 16:57:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 4 ms.
[2026-05-23 16:57:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15365132899137659841.gal : 1 ms
[2026-05-23 16:57:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12673309597393032874.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/CTLFireability15365132899137659841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12673309597393032874.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06625e+07,6.53656,121884,2217,635,124581,10488,263,738491,74,99880,0


Converting to forward existential form...Done !
original formula: E(!(EF(((!((i0.u1.p28>=1)&&(i4.u0.l0>=1)))||((i4.u0.s1>=1)&&(i6.u11.l354>=1))))) U AF(((i4.u0.s1>=1)&&(i6.u14.l502>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U ((!((i0.u1.p28>=1)&&(i4.u0.l0>=1)))||((i4.u0.s1>=1)&&(i6.u11.l354>=1)))))) * !(EG(!(((i4....197
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t28, t39, t43, t45, t53, t54, t55, t56, t60, t61, t62, t63, t64, t65, t66, t67, t68, ...342
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 83 transition count 106
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 83 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 83 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 76 transition count 97
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 76 transition count 97
Applied a total of 54 rules in 2 ms. Remains 76 /102 variables (removed 26) and now considering 97/139 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2836293244923990170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3923554950583266662.kers'
[2026-05-23 16:57:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2836293244923990170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3923554950583266662.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 76 cols 314 entries
Finished phase 1 with 72 SingleSign rule and 2 generalized
[2026-05-23 16:57:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3923554950583266662.kers
Total runtime 1 ms.
[2026-05-23 16:57:41] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 16:57:41] [INFO ] Invariant cache hit.
[2026-05-23 16:57:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-23 16:57:41] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-23 16:57:41] [INFO ] Invariant cache hit.
[2026-05-23 16:57:41] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/173 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 33/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 122 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8064 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/173 variables, 76/89 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 33/122 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 96/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 218 constraints, problems are : Problem set: 0 solved, 96 unsolved in 15718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23808ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 23809ms
Starting structural reductions in LTL mode, iteration 1 : 76/102 places, 97/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24072 ms. Remains : 76/102 places, 97/139 transitions.
[2026-05-23 16:58:05] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:58:05] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:58:05] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-23 16:58:05] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:58:05] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:58:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2062798249328918991.gal : 2 ms
[2026-05-23 16:58:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2012610499051855737.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/CTLFireability2062798249328918991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2012610499051855737.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,2.86891e+07,10.8584,194668,2,17691,5,755515,6,0,401,681043,0


Converting to forward existential form...Done !
original formula: A(EX(AF((AG(((s1>=1)&&(l114>=1))) * A(((p38>=1)&&(l136>=1)) U ((s1>=1)&&(l486>=1)))))) U E(AF(EG(EX(((s1>=1)&&(l502>=1))))) U (((!(E(((s1...374
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(EG(!(EG(EX(((s1>=1)&&(l502>=1))))))) U (((!(E(((s1>=1)&&(l32>=1)) U ((s1>=1)&&(l509>=1)))) ...1088
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t49, t50, t51, t58, t61, t62, t63, t64, t71, t72, t73, t7...366
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-23 16:58:35] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:58:35] [INFO ] Applying decomposition
[2026-05-23 16:58:35] [INFO ] Flatten gal took : 3 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/graph15042687914273424874.txt' '-o' '/tmp/graph15042687914273424874.bin' '-w' '/tmp/graph15042687914273424874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15042687914273424874.bin' '-l' '-1' '-v' '-w' '/tmp/graph15042687914273424874.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:58:35] [INFO ] Decomposing Gal with order
[2026-05-23 16:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:58:35] [INFO ] Removed a total of 94 redundant transitions.
[2026-05-23 16:58:35] [INFO ] Flatten gal took : 36 ms
[2026-05-23 16:58:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 4 ms.
[2026-05-23 16:58:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3553473471495590132.gal : 2 ms
[2026-05-23 16:58:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10359970536382785576.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3553473471495590132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10359970536382785576.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 79 transition count 98
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 79 transition count 98
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 67 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 60 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 59 transition count 67
Applied a total of 93 rules in 36 ms. Remains 59 /102 variables (removed 43) and now considering 67/139 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5588477697080538979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12832544402618463642.kers'
[2026-05-23 16:59:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5588477697080538979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12832544402618463642.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 59 cols 215 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 16:59:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12832544402618463642.kers
Total runtime 4 ms.
[2026-05-23 16:59:05] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-23 16:59:05] [INFO ] Invariant cache hit.
[2026-05-23 16:59:05] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 16:59:05] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2026-05-23 16:59:05] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2026-05-23 16:59:05] [INFO ] Invariant cache hit.
[2026-05-23 16:59:05] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 87 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/126 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 66/153 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 153 constraints, problems are : Problem set: 0 solved, 66 unsolved in 7582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11353ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 11353ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/102 places, 67/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11648 ms. Remains : 59/102 places, 67/139 transitions.
[2026-05-23 16:59:17] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:59:17] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:59:17] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-23 16:59:17] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:59:17] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:59:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18064916500580579674.gal : 1 ms
[2026-05-23 16:59:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10232827003169320993.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/CTLFireability18064916500580579674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10232827003169320993.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,2.4133e+06,1.22967,28520,2,9045,5,96180,6,0,303,96215,0


Converting to forward existential form...Done !
original formula: EG(EF(((s2>=1)&&(l496>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((s2>=1)&&(l496>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...291
(forward)formula 0,1,18.393,372696,1,0,456,1.71411e+06,161,260,2097,2.07607e+06,401
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 79 transition count 99
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 79 transition count 98
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 68 transition count 87
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 64 transition count 75
Applied a total of 82 rules in 15 ms. Remains 64 /102 variables (removed 38) and now considering 75/139 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9333569244287148092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17438483886765385780.kers'
[2026-05-23 16:59:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9333569244287148092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17438483886765385780.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 64 cols 243 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 16:59:35] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17438483886765385780.kers
Total runtime 0 ms.
[2026-05-23 16:59:35] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 16:59:35] [INFO ] Invariant cache hit.
[2026-05-23 16:59:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:59:35] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2026-05-23 16:59:35] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2026-05-23 16:59:35] [INFO ] Invariant cache hit.
[2026-05-23 16:59:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 95 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/139 variables, 64/70 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 74/169 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 169 constraints, problems are : Problem set: 0 solved, 74 unsolved in 12200 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17602ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 17602ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/102 places, 75/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17851 ms. Remains : 64/102 places, 75/139 transitions.
[2026-05-23 16:59:53] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:59:53] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:59:53] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-23 16:59:53] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:59:53] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:59:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1875993336128026382.gal : 1 ms
[2026-05-23 16:59:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17484421400204268062.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/CTLFireability1875993336128026382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17484421400204268062.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,7.9744e+06,3.03599,70688,2,9278,5,274782,6,0,331,272735,0


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l502<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l502<1)))] != FALSE
Hit Full ! (commute/partial/dont) 1/0/74
(forward)formula 0,1,13.809,295860,1,0,20,1.37151e+06,19,4,1781,1.2666e+06,16
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 79 transition count 101
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 79 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 79 transition count 100
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 68 transition count 89
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 66 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 64 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 63 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 63 transition count 77
Applied a total of 83 rules in 22 ms. Remains 63 /102 variables (removed 39) and now considering 77/139 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16297661494601084024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1886236925029705950.kers'
[2026-05-23 17:00:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16297661494601084024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1886236925029705950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 63 cols 247 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 17:00:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1886236925029705950.kers
Total runtime 1 ms.
[2026-05-23 17:00:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 17:00:07] [INFO ] Invariant cache hit.
[2026-05-23 17:00:07] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 17:00:07] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2026-05-23 17:00:07] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2026-05-23 17:00:07] [INFO ] Invariant cache hit.
[2026-05-23 17:00:07] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 92 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 168 constraints, problems are : Problem set: 0 solved, 76 unsolved in 9898 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12687ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 12688ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/102 places, 77/139 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12957 ms. Remains : 63/102 places, 77/139 transitions.
[2026-05-23 17:00:20] [INFO ] Flatten gal took : 12 ms
[2026-05-23 17:00:20] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:00:20] [INFO ] Input system was already deterministic with 77 transitions.
[2026-05-23 17:00:20] [INFO ] Flatten gal took : 19 ms
[2026-05-23 17:00:20] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:00:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13070404589080372017.gal : 1 ms
[2026-05-23 17:00:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11246066598489309515.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/CTLFireability13070404589080372017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11246066598489309515.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,5.256e+06,3.77345,86468,2,14463,5,301083,6,0,329,345545,0


Converting to forward existential form...Done !
original formula: EF((AF((((s1>=1)&&(l150>=1))||(((s1>=1)&&(l150>=1))&&((s1>=1)&&(l149>=1))))) * (((p19>=1)&&(l126>=1))||((s4>=1)&&(l0>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((p19>=1)&&(l126>=1))||((s4>=1)&&(l0>=1)))) * !(EG(!((((s1>=1)&&(l150>=1))||(((s1>=1)&&(l1...200
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t51, t56, t57, t58, t5...341
(forward)formula 0,1,25.4592,496552,1,0,308,2.74501e+06,178,124,2304,2.21373e+06,353
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-09 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 : 102/102 places, 139/139 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 81 transition count 101
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 81 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 81 transition count 100
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 71 transition count 90
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 71 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 69 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 69 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 69 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 68 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 68 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 67 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 67 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 67 transition count 79
Applied a total of 75 rules in 4 ms. Remains 67 /102 variables (removed 35) and now considering 79/139 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14821133756713867076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4131403237202084188.kers'
[2026-05-23 17:00:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14821133756713867076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4131403237202084188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 67 cols 257 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 17:00:46] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4131403237202084188.kers
Total runtime 2 ms.
[2026-05-23 17:00:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 17:00:46] [INFO ] Invariant cache hit.
[2026-05-23 17:00:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 17:00:46] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2026-05-23 17:00:46] [INFO ] Invariant cache hit.
[2026-05-23 17:00:46] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/146 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/146 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 102 constraints, problems are : Problem set: 0 solved, 78 unsolved in 9191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/146 variables, 67/76 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 26/102 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 78/180 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/146 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 180 constraints, problems are : Problem set: 0 solved, 78 unsolved in 13888 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23097ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 23097ms
Starting structural reductions in LTL mode, iteration 1 : 67/102 places, 79/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23374 ms. Remains : 67/102 places, 79/139 transitions.
[2026-05-23 17:01:09] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:01:09] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:01:09] [INFO ] Input system was already deterministic with 79 transitions.
[2026-05-23 17:01:09] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:01:09] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:01:09] [INFO ] Time to serialize gal into /tmp/CTLFireability80242846803078456.gal : 1 ms
[2026-05-23 17:01:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14276562228458288627.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/CTLFireability80242846803078456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14276562228458288627.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,9.02168e+06,7.38894,139976,2,17344,5,584559,6,0,347,516069,0


Converting to forward existential form...Done !
original formula: !(E(EF(AX(((((s1>=1)&&(l116>=1))||((s1>=1)&&(l339>=1))) * E(((s1>=1)&&(l502>=1)) U ((p27>=1)&&(l0>=1)))))) U (AG(((s1>=1)&&(l502>=1))) * ...186
=> equivalent forward existential formula: [(FwdU((FwdU(Init,E(TRUE U !(EX(!(((((s1>=1)&&(l116>=1))||((s1>=1)&&(l339>=1))) * E(((s1>=1)&&(l502>=1)) U ((p27...265
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t29, t47, t50, t51, t52, t56, t57, t58, t59, t60, t61, t62, t6...331
(forward)formula 0,1,14.2196,186428,1,0,173,850706,182,67,2416,754091,177
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 83 transition count 109
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 83 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 83 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 78 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 78 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 77 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 77 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 77 transition count 100
Applied a total of 52 rules in 4 ms. Remains 77 /102 variables (removed 25) and now considering 100/139 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14091049773299270394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10483883194062816358.kers'
[2026-05-23 17:01:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14091049773299270394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10483883194062816358.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 77 cols 314 entries
Finished phase 1 with 73 SingleSign rule and 2 generalized
[2026-05-23 17:01:23] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10483883194062816358.kers
Total runtime 2 ms.
[2026-05-23 17:01:23] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-23 17:01:23] [INFO ] Invariant cache hit.
[2026-05-23 17:01:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 17:01:24] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2026-05-23 17:01:24] [INFO ] Invariant cache hit.
[2026-05-23 17:01:24] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/177 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 38/117 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 117 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/177 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 38/117 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 99/216 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 216 constraints, problems are : Problem set: 0 solved, 99 unsolved in 19163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23864ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 23866ms
Starting structural reductions in LTL mode, iteration 1 : 77/102 places, 100/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24342 ms. Remains : 77/102 places, 100/139 transitions.
[2026-05-23 17:01:48] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:01:48] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:01:48] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-23 17:01:48] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:01:48] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:01:48] [INFO ] Time to serialize gal into /tmp/CTLFireability18276325873042366792.gal : 2 ms
[2026-05-23 17:01:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3643041041743752634.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/CTLFireability18276325873042366792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3643041041743752634.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,4.11856e+07,20.3629,360800,2,24766,5,1.38329e+06,6,0,408,1.20931e+06,0


Converting to forward existential form...Done !
original formula: (E(A(E(((s1>=1)&&(l110>=1)) U (((AX(((p16>=1)&&(l115>=1))) * (s1>=1)) * ((l1>=1)&&(s1>=1))) * (l491>=1))) U E(E(((s5>=1)&&(l0>=1)) U ((s1...375
=> equivalent forward existential formula: (([((FwdU(FwdU(FwdU(Init,!((E(!(E(E(((s5>=1)&&(l0>=1)) U ((s1>=1)&&(l488>=1))) U !(!(EX(!(((s5>=1)&&(l0>=1))))))...1363
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t46, t47, t48, t55, t56, t57, t59, t60, t61, t63, t65, t6...392
Detected timeout of ITS tools.
[2026-05-23 17:02:18] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:02:18] [INFO ] Applying decomposition
[2026-05-23 17:02:18] [INFO ] Flatten gal took : 3 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/graph2627351793160246529.txt' '-o' '/tmp/graph2627351793160246529.bin' '-w' '/tmp/graph2627351793160246529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2627351793160246529.bin' '-l' '-1' '-v' '-w' '/tmp/graph2627351793160246529.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:02:18] [INFO ] Decomposing Gal with order
[2026-05-23 17:02:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:02:18] [INFO ] Removed a total of 100 redundant transitions.
[2026-05-23 17:02:18] [INFO ] Flatten gal took : 9 ms
[2026-05-23 17:02:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 3 ms.
[2026-05-23 17:02:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17883625344043946952.gal : 1 ms
[2026-05-23 17:02:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9111460181504764853.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/CTLFireability17883625344043946952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9111460181504764853.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 84 transition count 112
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 84 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 84 transition count 111
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 76 transition count 103
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 76 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 75 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 75 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 75 transition count 100
Applied a total of 56 rules in 4 ms. Remains 75 /102 variables (removed 27) and now considering 100/139 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6634110272816171588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14395705369678659729.kers'
[2026-05-23 17:02:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6634110272816171588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14395705369678659729.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 75 cols 314 entries
Finished phase 1 with 71 SingleSign rule and 2 generalized
[2026-05-23 17:02:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14395705369678659729.kers
Total runtime 1 ms.
[2026-05-23 17:02:48] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-23 17:02:48] [INFO ] Invariant cache hit.
[2026-05-23 17:02:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 17:02:48] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2026-05-23 17:02:48] [INFO ] Invariant cache hit.
[2026-05-23 17:02:48] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/175 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 115 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4351 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/175 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 99/214 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 214 constraints, problems are : Problem set: 0 solved, 99 unsolved in 14610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18987ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 18988ms
Starting structural reductions in LTL mode, iteration 1 : 75/102 places, 100/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19363 ms. Remains : 75/102 places, 100/139 transitions.
[2026-05-23 17:03:07] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:03:07] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:03:07] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-23 17:03:07] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:03:07] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:03:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5879148583873049283.gal : 2 ms
[2026-05-23 17:03:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5023765779243366062.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/CTLFireability5879148583873049283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5023765779243366062.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,2.91797e+07,10.2651,187556,2,12261,5,728744,6,0,400,571760,0


Converting to forward existential form...Done !
original formula: EG((((s1<1)||(l32<1)) + (((AX(((s1>=1)&&(l345>=1))) * (s1>=1)) * ((l490>=1)&&(((s1<1)||(l336<1))||((l149<1)||(l150>=1))))) + (AG((((s1<1)...307
=> equivalent forward existential formula: [FwdG(Init,(((s1<1)||(l32<1)) + (((!(EX(!(((s1>=1)&&(l345>=1))))) * (s1>=1)) * ((l490>=1)&&(((s1<1)||(l336<1))||...380
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t50, t51, t52,...425
Detected timeout of ITS tools.
[2026-05-23 17:03:37] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:03:37] [INFO ] Applying decomposition
[2026-05-23 17:03:37] [INFO ] Flatten gal took : 3 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/graph234678957892204256.txt' '-o' '/tmp/graph234678957892204256.bin' '-w' '/tmp/graph234678957892204256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph234678957892204256.bin' '-l' '-1' '-v' '-w' '/tmp/graph234678957892204256.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:03:37] [INFO ] Decomposing Gal with order
[2026-05-23 17:03:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:03:37] [INFO ] Removed a total of 95 redundant transitions.
[2026-05-23 17:03:37] [INFO ] Flatten gal took : 14 ms
[2026-05-23 17:03:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 4 ms.
[2026-05-23 17:03:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8378607378510487576.gal : 3 ms
[2026-05-23 17:03:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6995365429979791697.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/CTLFireability8378607378510487576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6995365429979791697.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91797e+07,10.1557,125408,2158,835,151044,13153,286,328766,111,140055,0


Converting to forward existential form...Done !
original formula: EG((((i2.u2.s1<1)||(i3.u4.l32<1)) + (((AX(((i2.u2.s1>=1)&&(i0.u10.l345>=1))) * (i2.u2.s1>=1)) * ((u11.l490>=1)&&(((i2.u2.s1<1)||(u9.l336<...437
=> equivalent forward existential formula: [FwdG(Init,(((i2.u2.s1<1)||(i3.u4.l32<1)) + (((!(EX(!(((i2.u2.s1>=1)&&(i0.u10.l345>=1))))) * (i2.u2.s1>=1)) * ((...510
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t8, t9, t32, t50, t52, t53, t54, t55, t62, t64, t65, t66, t67, t74, t75, t77, t78, t7...364
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,24.1663,290276,1,0,413539,71831,1230,1.12682e+06,672,437665,579586
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 87 transition count 117
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 87 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 82 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 82 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 82 transition count 110
Applied a total of 42 rules in 3 ms. Remains 82 /102 variables (removed 20) and now considering 110/139 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17555367541108239079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11315657941682934393.kers'
[2026-05-23 17:04:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17555367541108239079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11315657941682934393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 82 cols 337 entries
Finished phase 1 with 78 SingleSign rule and 2 generalized
[2026-05-23 17:04:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11315657941682934393.kers
Total runtime 1 ms.
[2026-05-23 17:04:02] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 17:04:02] [INFO ] Invariant cache hit.
[2026-05-23 17:04:02] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 17:04:02] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2026-05-23 17:04:02] [INFO ] Invariant cache hit.
[2026-05-23 17:04:02] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/192 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 46/130 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 138 constraints, problems are : Problem set: 0 solved, 109 unsolved in 14952 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 8/8 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/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/192 variables, 82/92 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 46/138 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 109/247 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 247 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45016ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 45016ms
Starting structural reductions in LTL mode, iteration 1 : 82/102 places, 110/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45434 ms. Remains : 82/102 places, 110/139 transitions.
[2026-05-23 17:04:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:04:47] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:04:47] [INFO ] Input system was already deterministic with 110 transitions.
[2026-05-23 17:04:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:04:47] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:04:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17669529160452863160.gal : 1 ms
[2026-05-23 17:04:47] [INFO ] Time to serialize properties into /tmp/CTLFireability4924465241117695053.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/CTLFireability17669529160452863160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4924465241117695053.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,5.40494e+07,17.806,331764,2,22932,5,1.11908e+06,6,0,438,1.10286e+06,0


Converting to forward existential form...Done !
original formula: AF(((((p21>=1)&&(l126>=1)) * (EG(AG(((s1>=1)&&(l510>=1)))) * AX((((s1<1)||(l110<1))||(((s6>=1)&&(l0>=1))||((p25>=1)&&(l0>=1))))))) * ((EF...430
=> equivalent forward existential formula: [FwdG(Init,!(((((p21>=1)&&(l126>=1)) * (EG(!(E(TRUE U !(((s1>=1)&&(l510>=1)))))) * !(EX(!((((s1<1)||(l110<1))||(...598
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t60, t61, t62, t64, t6...442
Detected timeout of ITS tools.
[2026-05-23 17:05:17] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:05:17] [INFO ] Applying decomposition
[2026-05-23 17:05:17] [INFO ] Flatten gal took : 2 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/graph18402026099722967942.txt' '-o' '/tmp/graph18402026099722967942.bin' '-w' '/tmp/graph18402026099722967942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18402026099722967942.bin' '-l' '-1' '-v' '-w' '/tmp/graph18402026099722967942.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:05:17] [INFO ] Decomposing Gal with order
[2026-05-23 17:05:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:05:17] [INFO ] Removed a total of 114 redundant transitions.
[2026-05-23 17:05:17] [INFO ] Flatten gal took : 18 ms
[2026-05-23 17:05:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 4 ms.
[2026-05-23 17:05:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1778368971421943670.gal : 11 ms
[2026-05-23 17:05:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11208360562010333260.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/CTLFireability1778368971421943670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11208360562010333260.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,5.40494e+07,11.5861,164708,3033,835,168344,10299,296,907972,106,72382,0


Converting to forward existential form...Done !
original formula: AF(((((i2.u8.p21>=1)&&(i7.u14.l126>=1)) * (EG(AG(((i3.u0.s1>=1)&&(i3.u0.l510>=1)))) * AX((((i3.u0.s1<1)||(i3.u4.l110<1))||(((i3.u4.s6>=1)...623
=> equivalent forward existential formula: [FwdG(Init,!(((((i2.u8.p21>=1)&&(i7.u14.l126>=1)) * (EG(!(E(TRUE U !(((i3.u0.s1>=1)&&(i3.u0.l510>=1)))))) * !(EX...817
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t32, t64, t65, t66, t70, t71, t72, t74, t82, t83, t84, t87, t88, t89, t90, t91, t92, ...352
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 85 transition count 112
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 85 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 76 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 76 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 76 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 74 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 74 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 74 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 73 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 73 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 72 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 72 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 72 transition count 92
Applied a total of 64 rules in 4 ms. Remains 72 /102 variables (removed 30) and now considering 92/139 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8579170591300404783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13084948831703625013.kers'
[2026-05-23 17:05:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8579170591300404783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13084948831703625013.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 72 cols 282 entries
Finished phase 1 with 68 SingleSign rule and 2 generalized
[2026-05-23 17:05:47] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13084948831703625013.kers
Total runtime 3 ms.
[2026-05-23 17:05:47] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-23 17:05:47] [INFO ] Invariant cache hit.
[2026-05-23 17:05:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 17:05:48] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-23 17:05:48] [INFO ] Invariant cache hit.
[2026-05-23 17:05:48] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/164 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 38/112 constraints. Problems are: Problem set: 0 solved, 91 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 112 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4078 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/164 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 38/112 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 91/203 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 203 constraints, problems are : Problem set: 0 solved, 91 unsolved in 14253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18362ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 18363ms
Starting structural reductions in LTL mode, iteration 1 : 72/102 places, 92/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18733 ms. Remains : 72/102 places, 92/139 transitions.
[2026-05-23 17:06:06] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:06:06] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:06:06] [INFO ] Input system was already deterministic with 92 transitions.
[2026-05-23 17:06:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:06:06] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:06:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10180810040150381475.gal : 1 ms
[2026-05-23 17:06:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13236098281585678025.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/CTLFireability10180810040150381475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13236098281585678025.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,1.55546e+07,8.04602,171512,2,22298,5,640454,6,0,380,585436,0


Converting to forward existential form...Done !
original formula: AG((E((EF(AX(((s1>=1)&&(l116>=1)))) + (((EF(((s1>=1)&&(l491>=1))) + AX(((s2>=1)&&(l496>=1)))) * (((s6>=1)&&(l0>=1))||((s1>=1)&&(l491>=1))...315
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(E((E(TRUE U !(EX(!(((s1>=1)&&(l116>=1)))))) + (((E(TRUE U ((s1>=1)&&(l491>=1))) + ...1220
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t53, t55, t5...401
Hit Full ! (commute/partial/dont) 2/0/90
(forward)formula 0,0,28.2044,521056,1,0,272,2.49797e+06,225,103,2697,2.33132e+06,297
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 17:06:35] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:06:35] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:06:35] [INFO ] Applying decomposition
[2026-05-23 17:06:35] [INFO ] Flatten gal took : 3 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/graph17184910305794257421.txt' '-o' '/tmp/graph17184910305794257421.bin' '-w' '/tmp/graph17184910305794257421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17184910305794257421.bin' '-l' '-1' '-v' '-w' '/tmp/graph17184910305794257421.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:06:35] [INFO ] Decomposing Gal with order
[2026-05-23 17:06:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:06:35] [INFO ] Removed a total of 149 redundant transitions.
[2026-05-23 17:06:35] [INFO ] Flatten gal took : 12 ms
[2026-05-23 17:06:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 3 ms.
[2026-05-23 17:06:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14112461434763538436.gal : 2 ms
[2026-05-23 17:06:35] [INFO ] Time to serialize properties into /tmp/CTLFireability668040879854473290.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/CTLFireability14112461434763538436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability668040879854473290.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 -...262
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58579e+08,358.471,3413320,24624,1817,1.53171e+06,38581,373,3.44913e+07,121,655991,0


Converting to forward existential form...Done !
original formula: !(E((EG(E((((i0.u0.s1>=1)&&(u7.l149>=1))&&((i0.u0.s1>=1)&&(i4.u17.l503>=1))) U (((i0.u0.s1>=1)&&(i0.u0.l37>=1))||((i0.u0.s1>=1)&&(u7.l150...582
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,(EG(E((((i0.u0.s1>=1)&&(u7.l149>=1))&&((i0.u0.s1>=1)&&(i4.u17.l503>=1))) U (((i0.u0.s1>=1)&...1760
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t8, t9, t26, t30, t57, t58, t59, t60, t61, t62, t74, t75, t76, t79, t80, t81, t86, t8...516
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,1080.92,5889636,1,0,2.91784e+06,234081,1038,6.08312e+07,430,1.82412e+06,3481537
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(EX((AF(((i0.u0.s1>=1)&&(u7.l125>=1))) + AG(((i2.u5.p13<1)||(i6.u12.l155<1)))))) * AF(((i0.u0.s1<1)||(i4.u17.l505<1))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX((!(EG(!(((i0.u0.s1>=1)&&(u7.l125>=1))))) + !(E(TRUE U !(((i2.u5.p13<1)||(i6.u12.l155<1)))))))...225
(forward)formula 1,1,1462.56,6573544,1,0,4.8766e+06,234081,1156,6.08312e+07,449,1.82412e+06,1656875
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-23 17:32:23] [INFO ] Flatten gal took : 5 ms
[2026-05-23 17:32:23] [INFO ] Time to serialize gal into /tmp/CTLFireability1351987443401302825.gal : 1 ms
[2026-05-23 17:32:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11863970640438000700.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/CTLFireability1351987443401302825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11863970640438000700.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 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58579e+08,46.9394,766492,2,59833,5,3.12144e+06,6,0,547,1.97451e+06,0


Converting to forward existential form...Done !
original formula: ((AF(((EG(((EX(((p14<1)||(l156<1))) * (p26>=1)) * (l0>=1))) * AF(((s1>=1)&&(l484>=1)))) * AX(EF(((s1<1)||(l150<1)))))) * AX(EF(EX(((s1>=1...279
=> equivalent forward existential formula: (([FwdG(Init,!(((EG(((EX(((p14<1)||(l156<1))) * (p26>=1)) * (l0>=1))) * !(EG(!(((s1>=1)&&(l484>=1)))))) * !(EX(!...432
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t21, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35,...589
Using saturation style SCC detection
(forward)formula 0,0,234.631,2422364,1,0,431,1.33179e+07,26,169,2237,9.02682e+06,172
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(AF((((s1>=1)&&(l353>=1)) + ((!(AX(((s1>=1)&&(l491>=1)))) * (p24>=1)) * (l0>=1)))) U AF(AX(((!(E(((s1>=1)&&(l149>=1)) U ((s1>=1)&&(l491>...188
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(EX(!(((!(E(((s1>=1)&&(l149>=1)) U ((s1>=1)&&(l491>=1)))) * (s1>=1)) * (l504>=1))))))))...479
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 1,0,343.882,2708364,1,0,431,1.62784e+07,31,217,1928,1.15576e+07,350
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(!(EF(((!((p28>=1)&&(l0>=1)))||((s1>=1)&&(l354>=1))))) U AF(((s1>=1)&&(l502>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U ((!((p28>=1)&&(l0>=1)))||((s1>=1)&&(l354>=1)))))) * !(EG(!(((s1>=1)&&(l502>=1))))))] != F...159
(forward)formula 2,0,409.417,2908076,1,0,431,1.76562e+07,21,242,1930,1.28449e+07,128
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(EX(AF((AG(((s1>=1)&&(l114>=1))) * A(((p38>=1)&&(l136>=1)) U ((s1>=1)&&(l486>=1)))))) U E(AF(EG(EX(((s1>=1)&&(l502>=1))))) U (((!(E(((s1...374
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(EG(!(EG(EX(((s1>=1)&&(l502>=1))))))) U (((!(E(((s1>=1)&&(l32>=1)) U ((s1>=1)&&(l509>=1)))) ...1088
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection

BK_TIME_CONFINEMENT_REACHED

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

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