About the Execution of ITS-Tools for DBSingleClientW-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 822.684 | 798203.00 | 871593.00 | 2277.30 | TFFFTFTFFFTFTFFF | normal |
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-177946993600138.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-d1m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600138
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 8.4K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K 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 65K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779564265296
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-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 19:24:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 19:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 19:24:28] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2026-05-23 19:24:28] [INFO ] Transformed 1440 places.
[2026-05-23 19:24:28] [INFO ] Transformed 672 transitions.
[2026-05-23 19:24:28] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 109 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 153 place count 274 transition count 515
Iterating global reduction 1 with 52 rules applied. Total rules applied 205 place count 274 transition count 515
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 215 place count 274 transition count 505
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 248 place count 241 transition count 472
Iterating global reduction 2 with 33 rules applied. Total rules applied 281 place count 241 transition count 472
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 288 place count 234 transition count 465
Iterating global reduction 2 with 7 rules applied. Total rules applied 295 place count 234 transition count 465
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 303 place count 234 transition count 457
Applied a total of 303 rules in 177 ms. Remains 234 /347 variables (removed 113) and now considering 457/672 (removed 215) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6046243456239954846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7584318139394115959.kers'
[2026-05-23 19:24:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6046243456239954846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7584318139394115959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 457 rows 234 cols 1305 entries
Finished phase 1 with 224 SingleSign rule and 8 generalized
[2026-05-23 19:24:28] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7584318139394115959.kers
Total runtime 6 ms.
[2026-05-23 19:24:29] [INFO ] Implicit Places using invariants in 828 ms returned []
[2026-05-23 19:24:29] [INFO ] Invariant cache hit.
[2026-05-23 19:24:30] [INFO ] State equation strengthened by 246 read => feed constraints.
[2026-05-23 19:24:32] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 3400 ms to find 0 implicit places.
Running 456 sub problems to find dead transitions.
[2026-05-23 19:24:32] [INFO ] Invariant cache hit.
[2026-05-23 19:24:32] [INFO ] State equation strengthened by 246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (OVERLAPS) 1/234 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (OVERLAPS) 457/691 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 246/482 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 691/691 variables, and 482 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (OVERLAPS) 1/234 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (OVERLAPS) 457/691 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 246/482 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/691 variables, and 938 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61358ms problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 61398ms
Starting structural reductions in LTL mode, iteration 1 : 234/347 places, 457/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65060 ms. Remains : 234/347 places, 457/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2026-05-23 19:25:33] [INFO ] Invariant cache hit.
[2026-05-23 19:25:33] [INFO ] Implicit Places using invariants in 348 ms returned []
[2026-05-23 19:25:33] [INFO ] Invariant cache hit.
[2026-05-23 19:25:34] [INFO ] State equation strengthened by 246 read => feed constraints.
[2026-05-23 19:25:36] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 2530 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2547 ms. Remains : 234/234 places, 457/457 transitions.
Support contains 109 out of 234 places after structural reductions.
[2026-05-23 19:25:36] [INFO ] Flatten gal took : 127 ms
[2026-05-23 19:25:36] [INFO ] Flatten gal took : 74 ms
[2026-05-23 19:25:36] [INFO ] Input system was already deterministic with 457 transitions.
Support contains 108 out of 234 places (down from 109) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 87 to 85
RANDOM walk for 40000 steps (9179 resets) in 4062 ms. (9 steps per ms) remains 71/85 properties
BEST_FIRST walk for 4001 steps (365 resets) in 66 ms. (59 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (422 resets) in 93 ms. (42 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (183 resets) in 54 ms. (72 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (193 resets) in 121 ms. (32 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (441 resets) in 74 ms. (53 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (197 resets) in 39 ms. (100 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (200 resets) in 27 ms. (142 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (164 resets) in 41 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (199 resets) in 26 ms. (148 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (186 resets) in 22 ms. (174 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (214 resets) in 22 ms. (174 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (386 resets) in 29 ms. (133 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (197 resets) in 25 ms. (153 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (354 resets) in 25 ms. (153 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (369 resets) in 26 ms. (148 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4001 steps (186 resets) in 33 ms. (117 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (199 resets) in 28 ms. (138 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (211 resets) in 27 ms. (142 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (409 resets) in 34 ms. (114 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (174 resets) in 21 ms. (181 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (187 resets) in 30 ms. (129 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4001 steps (431 resets) in 56 ms. (70 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4001 steps (394 resets) in 51 ms. (76 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (202 resets) in 29 ms. (133 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (400 resets) in 49 ms. (80 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (206 resets) in 31 ms. (125 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4000 steps (800 resets) in 77 ms. (51 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (393 resets) in 50 ms. (78 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (208 resets) in 54 ms. (72 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (188 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (184 resets) in 54 ms. (72 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4001 steps (384 resets) in 74 ms. (53 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (182 resets) in 49 ms. (80 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (207 resets) in 68 ms. (58 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (174 resets) in 51 ms. (77 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4001 steps (184 resets) in 45 ms. (86 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (183 resets) in 36 ms. (108 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (201 resets) in 41 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (187 resets) in 37 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4001 steps (207 resets) in 37 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (372 resets) in 45 ms. (87 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4001 steps (175 resets) in 34 ms. (114 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (192 resets) in 38 ms. (102 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (201 resets) in 38 ms. (102 steps per ms) remains 69/71 properties
BEST_FIRST walk for 4002 steps (191 resets) in 33 ms. (117 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (204 resets) in 34 ms. (114 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (189 resets) in 32 ms. (121 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (190 resets) in 43 ms. (90 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (379 resets) in 52 ms. (75 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (399 resets) in 55 ms. (71 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (175 resets) in 34 ms. (114 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (188 resets) in 32 ms. (121 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (184 resets) in 34 ms. (114 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (401 resets) in 48 ms. (81 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (418 resets) in 49 ms. (80 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (179 resets) in 38 ms. (102 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (186 resets) in 34 ms. (114 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (403 resets) in 53 ms. (74 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (391 resets) in 51 ms. (76 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (380 resets) in 55 ms. (71 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (397 resets) in 51 ms. (76 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (180 resets) in 36 ms. (108 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (378 resets) in 47 ms. (83 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (196 resets) in 36 ms. (108 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (196 resets) in 34 ms. (114 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (197 resets) in 38 ms. (102 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (187 resets) in 37 ms. (105 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (205 resets) in 41 ms. (95 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (406 resets) in 54 ms. (72 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (800 resets) in 79 ms. (50 steps per ms) remains 69/69 properties
[2026-05-23 19:25:39] [INFO ] Invariant cache hit.
[2026-05-23 19:25:39] [INFO ] State equation strengthened by 246 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/153 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 35/188 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 431/619 variables, 188/190 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/619 variables, 220/410 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 0/410 constraints. Problems are: Problem set: 2 solved, 67 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 8 (OVERLAPS) 72/691 variables, 46/456 constraints. Problems are: Problem set: 4 solved, 65 unsolved
SMT process timed out in 5189ms, After SMT, problems are : Problem set: 4 solved, 65 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 229 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 229 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 228 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 228 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 227 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 227 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 227 transition count 446
Applied a total of 15 rules in 85 ms. Remains 227 /234 variables (removed 7) and now considering 446/457 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 227/234 places, 446/457 transitions.
RANDOM walk for 40000 steps (9128 resets) in 943 ms. (42 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (374 resets) in 50 ms. (78 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (187 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (197 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (427 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (208 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (170 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (189 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (189 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (189 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (195 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (400 resets) in 43 ms. (90 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (401 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (355 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (183 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (202 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (181 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (395 resets) in 49 ms. (80 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (173 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (385 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (426 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (208 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (384 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (185 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (800 resets) in 57 ms. (68 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (401 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (170 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (180 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (408 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (182 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (189 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (192 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (191 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (165 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (204 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (187 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (387 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (178 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (176 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (180 resets) in 27 ms. (143 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (194 resets) in 28 ms. (138 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (184 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (206 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (181 resets) in 45 ms. (87 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (364 resets) in 61 ms. (64 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (403 resets) in 62 ms. (63 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (177 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (187 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (178 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (348 resets) in 33 ms. (117 steps per ms) remains 63/65 properties
BEST_FIRST walk for 4002 steps (393 resets) in 35 ms. (111 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (181 resets) in 26 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (183 resets) in 25 ms. (153 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (376 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (397 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (380 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (424 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (165 resets) in 37 ms. (105 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (398 resets) in 33 ms. (117 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (191 resets) in 25 ms. (153 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (185 resets) in 25 ms. (154 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (164 resets) in 27 ms. (142 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (202 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (202 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (393 resets) in 38 ms. (102 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (800 resets) in 45 ms. (86 steps per ms) remains 63/63 properties
Probably explored full state space saw : 69297 states, properties seen :62
Probabilistic random walk after 179124 steps, saw 69297 distinct states, run finished after 1547 ms. (steps per millisecond=115 ) properties seen :62
Explored full state space saw : 69445 states, properties seen :0
Exhaustive walk after 179344 steps, saw 69445 distinct states, run finished after 776 ms. (steps per millisecond=231 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2026-05-23 19:25:47] [INFO ] Flatten gal took : 32 ms
[2026-05-23 19:25:47] [INFO ] Flatten gal took : 32 ms
[2026-05-23 19:25:48] [INFO ] Input system was already deterministic with 457 transitions.
Support contains 83 out of 234 places (down from 90) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 34 stable transitions
Graph (complete) has 921 edges and 234 vertex of which 233 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 175 transition count 278
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 175 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 175 transition count 275
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 162 place count 134 transition count 225
Iterating global reduction 1 with 41 rules applied. Total rules applied 203 place count 134 transition count 225
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 221 place count 134 transition count 207
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 246 place count 109 transition count 167
Iterating global reduction 2 with 25 rules applied. Total rules applied 271 place count 109 transition count 167
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 285 place count 109 transition count 153
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 296 place count 98 transition count 134
Iterating global reduction 3 with 11 rules applied. Total rules applied 307 place count 98 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 311 place count 98 transition count 130
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 318 place count 91 transition count 123
Iterating global reduction 4 with 7 rules applied. Total rules applied 325 place count 91 transition count 123
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 330 place count 86 transition count 118
Iterating global reduction 4 with 5 rules applied. Total rules applied 335 place count 86 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 338 place count 86 transition count 115
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 340 place count 84 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 342 place count 84 transition count 107
Applied a total of 342 rules in 24 ms. Remains 84 /234 variables (removed 150) and now considering 107/457 (removed 350) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5271390886964478439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4572375808403923532.kers'
[2026-05-23 19:25:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5271390886964478439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4572375808403923532.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 84 cols 344 entries
Finished phase 1 with 80 SingleSign rule and 2 generalized
[2026-05-23 19:25:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4572375808403923532.kers
Total runtime 1 ms.
[2026-05-23 19:25:48] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-23 19:25:48] [INFO ] Invariant cache hit.
[2026-05-23 19:25:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 19:25:48] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-05-23 19:25:48] [INFO ] Invariant cache hit.
[2026-05-23 19:25:48] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 127 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/191 variables, 84/90 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 106/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 233 constraints, problems are : Problem set: 0 solved, 106 unsolved in 20979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29651ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 29652ms
Starting structural reductions in LTL mode, iteration 1 : 84/234 places, 107/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30052 ms. Remains : 84/234 places, 107/457 transitions.
[2026-05-23 19:26:18] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:26:18] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:26:18] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-23 19:26:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:26:18] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:26:18] [INFO ] Time to serialize gal into /tmp/CTLFireability617732126524556166.gal : 8 ms
[2026-05-23 19:26:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6800069071808332065.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability617732126524556166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6800069071808332065.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,9013,0.234933,10308,2,2773,5,22702,6,0,443,16392,0
Converting to forward existential form...Done !
original formula: EX(EG(AG(((s1>=1)&&(l608>=1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(TRUE U !(((s1>=1)&&(l608>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t48, t49, t50, t51, t52, t53, t69, t76, t77, t78, t...400
(forward)formula 0,0,1.00543,29488,1,0,209,103413,242,79,3028,62092,235
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 176 transition count 281
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 176 transition count 281
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 125 place count 176 transition count 272
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 164 place count 137 transition count 224
Iterating global reduction 1 with 39 rules applied. Total rules applied 203 place count 137 transition count 224
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 218 place count 137 transition count 209
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 242 place count 113 transition count 171
Iterating global reduction 2 with 24 rules applied. Total rules applied 266 place count 113 transition count 171
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 277 place count 113 transition count 160
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 286 place count 104 transition count 144
Iterating global reduction 3 with 9 rules applied. Total rules applied 295 place count 104 transition count 144
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 303 place count 104 transition count 136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 308 place count 99 transition count 131
Iterating global reduction 4 with 5 rules applied. Total rules applied 313 place count 99 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 317 place count 95 transition count 127
Iterating global reduction 4 with 4 rules applied. Total rules applied 321 place count 95 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 323 place count 95 transition count 125
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 325 place count 93 transition count 117
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 93 transition count 117
Applied a total of 327 rules in 21 ms. Remains 93 /234 variables (removed 141) and now considering 117/457 (removed 340) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5116671383607260418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2025751411282040623.kers'
[2026-05-23 19:26:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5116671383607260418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2025751411282040623.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 117 rows 93 cols 383 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-23 19:26:19] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2025751411282040623.kers
Total runtime 1 ms.
[2026-05-23 19:26:19] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-23 19:26:19] [INFO ] Invariant cache hit.
[2026-05-23 19:26:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 19:26:19] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2026-05-23 19:26:19] [INFO ] Invariant cache hit.
[2026-05-23 19:26:19] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/210 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 133 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/210 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 116/249 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 249 constraints, problems are : Problem set: 0 solved, 116 unsolved in 21285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28191ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 28192ms
Starting structural reductions in LTL mode, iteration 1 : 93/234 places, 117/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28663 ms. Remains : 93/234 places, 117/457 transitions.
[2026-05-23 19:26:47] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:26:47] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:26:47] [INFO ] Input system was already deterministic with 117 transitions.
[2026-05-23 19:26:47] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:26:47] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:26:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15259626809820529858.gal : 3 ms
[2026-05-23 19:26:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14640545123111385909.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/CTLFireability15259626809820529858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14640545123111385909.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,12755,0.231147,11332,2,3229,5,27496,6,0,489,14028,0
Converting to forward existential form...Done !
original formula: EX(AF(AX((EG(((s1>=1)&&(l1218>=1))) + ((s1>=1)&&(l1215>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(EX(!((EG(((s1>=1)&&(l1218>=1))) + ((s1>=1)&&(l1215>=1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t49, t52, t55, t59, t75, t82, t83, t84, t85, t86, t...420
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,1.87301,53484,1,0,306,257620,263,139,3413,154243,344
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 178 transition count 279
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 178 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 178 transition count 276
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 152 place count 141 transition count 234
Iterating global reduction 1 with 37 rules applied. Total rules applied 189 place count 141 transition count 234
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 203 place count 141 transition count 220
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 222 place count 122 transition count 187
Iterating global reduction 2 with 19 rules applied. Total rules applied 241 place count 122 transition count 187
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 252 place count 122 transition count 176
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 257 place count 117 transition count 168
Iterating global reduction 3 with 5 rules applied. Total rules applied 262 place count 117 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 263 place count 117 transition count 167
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 266 place count 114 transition count 164
Iterating global reduction 4 with 3 rules applied. Total rules applied 269 place count 114 transition count 164
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 271 place count 112 transition count 162
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 112 transition count 162
Applied a total of 273 rules in 12 ms. Remains 112 /234 variables (removed 122) and now considering 162/457 (removed 295) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12322740480137006833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4676881137016961579.kers'
[2026-05-23 19:26:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12322740480137006833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4676881137016961579.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 112 cols 512 entries
Finished phase 1 with 108 SingleSign rule and 2 generalized
[2026-05-23 19:26:49] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4676881137016961579.kers
Total runtime 1 ms.
[2026-05-23 19:26:50] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-23 19:26:50] [INFO ] Invariant cache hit.
[2026-05-23 19:26:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 19:26:50] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2026-05-23 19:26:50] [INFO ] Invariant cache hit.
[2026-05-23 19:26:50] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/274 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 61/175 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 175 constraints, problems are : Problem set: 0 solved, 161 unsolved in 12166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/274 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 61/175 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 161/336 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 336 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42261ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 42262ms
Starting structural reductions in LTL mode, iteration 1 : 112/234 places, 162/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42966 ms. Remains : 112/234 places, 162/457 transitions.
[2026-05-23 19:27:32] [INFO ] Flatten gal took : 12 ms
[2026-05-23 19:27:32] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:27:32] [INFO ] Input system was already deterministic with 162 transitions.
[2026-05-23 19:27:32] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:27:32] [INFO ] Flatten gal took : 18 ms
[2026-05-23 19:27:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4901609254022393695.gal : 3 ms
[2026-05-23 19:27:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11246678170385057088.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/CTLFireability4901609254022393695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11246678170385057088.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,21779,0.93281,30208,2,5560,5,81084,6,0,610,61583,0
Converting to forward existential form...Done !
original formula: (EG((((AF(((s1>=1)&&(l1291>=1))) * AX(((s1<1)||(l1235<1)))) + (EX(((p14<1)||(l0<1))) * AG((((s1>=1)&&(l451>=1))&&((s1>=1)&&(l1020>=1)))))...213
=> equivalent forward existential formula: [FwdG((Init * !(EG((((!(EG(!(((s1>=1)&&(l1291>=1))))) * !(EX(!(((s1<1)||(l1235<1)))))) + (EX(((p14<1)||(l0<1))) ...297
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t17, t34, t43, t44, t45, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...641
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 156/0/6
(forward)formula 0,0,7.49325,182276,1,0,512,854412,374,233,4493,524230,581
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 177 transition count 286
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 177 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 177 transition count 283
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 154 place count 140 transition count 240
Iterating global reduction 1 with 37 rules applied. Total rules applied 191 place count 140 transition count 240
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 208 place count 140 transition count 223
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 230 place count 118 transition count 187
Iterating global reduction 2 with 22 rules applied. Total rules applied 252 place count 118 transition count 187
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 265 place count 118 transition count 174
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 273 place count 110 transition count 159
Iterating global reduction 3 with 8 rules applied. Total rules applied 281 place count 110 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 284 place count 110 transition count 156
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 289 place count 105 transition count 151
Iterating global reduction 4 with 5 rules applied. Total rules applied 294 place count 105 transition count 151
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 299 place count 100 transition count 146
Iterating global reduction 4 with 5 rules applied. Total rules applied 304 place count 100 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 306 place count 100 transition count 144
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 307 place count 99 transition count 142
Iterating global reduction 5 with 1 rules applied. Total rules applied 308 place count 99 transition count 142
Applied a total of 308 rules in 14 ms. Remains 99 /234 variables (removed 135) and now considering 142/457 (removed 315) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18132530693177844629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3101483699032078758.kers'
[2026-05-23 19:27:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18132530693177844629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3101483699032078758.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 99 cols 443 entries
Finished phase 1 with 95 SingleSign rule and 2 generalized
[2026-05-23 19:27:40] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3101483699032078758.kers
Total runtime 1 ms.
[2026-05-23 19:27:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-23 19:27:40] [INFO ] Invariant cache hit.
[2026-05-23 19:27:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-23 19:27:41] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2026-05-23 19:27:41] [INFO ] Invariant cache hit.
[2026-05-23 19:27:41] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/241 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 161 constraints, problems are : Problem set: 0 solved, 141 unsolved in 11865 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 142/241 variables, 99/105 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 56/161 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 141/302 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 302 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41962ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 41964ms
Starting structural reductions in LTL mode, iteration 1 : 99/234 places, 142/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42544 ms. Remains : 99/234 places, 142/457 transitions.
[2026-05-23 19:28:23] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:28:23] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:28:23] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-23 19:28:23] [INFO ] Flatten gal took : 10 ms
[2026-05-23 19:28:23] [INFO ] Flatten gal took : 10 ms
[2026-05-23 19:28:23] [INFO ] Time to serialize gal into /tmp/CTLFireability11569948519345316104.gal : 3 ms
[2026-05-23 19:28:23] [INFO ] Time to serialize properties into /tmp/CTLFireability12605997137373548602.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/CTLFireability11569948519345316104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12605997137373548602.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,14073,0.769545,19648,2,4512,5,49744,6,0,538,43919,0
Converting to forward existential form...Done !
original formula: (EF(((AX(((p60>=1)&&(l620>=1))) + ((s1>=1)&&(l606>=1))) + ((s1>=1)&&(l1019>=1)))) * EG(AF((((s1<1)||(l305<1))||(((s1>=1)&&(l606>=1))||((p...178
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((!(EX(!(((p60>=1)&&(l620>=1))))) + ((s1>=1)&&(l606>=1))) + ((s1>=1)&&(l1019>=1))))),!(EG...239
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t35, t37, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t...565
(forward)formula 0,1,2.99727,74584,1,0,300,247281,318,118,3877,167477,343
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 185 transition count 323
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 185 transition count 323
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 108 place count 185 transition count 313
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 141 place count 152 transition count 273
Iterating global reduction 1 with 33 rules applied. Total rules applied 174 place count 152 transition count 273
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 192 place count 152 transition count 255
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 209 place count 135 transition count 228
Iterating global reduction 2 with 17 rules applied. Total rules applied 226 place count 135 transition count 228
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 235 place count 135 transition count 219
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 242 place count 128 transition count 208
Iterating global reduction 3 with 7 rules applied. Total rules applied 249 place count 128 transition count 208
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 256 place count 128 transition count 201
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 260 place count 124 transition count 197
Iterating global reduction 4 with 4 rules applied. Total rules applied 264 place count 124 transition count 197
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 267 place count 121 transition count 194
Iterating global reduction 4 with 3 rules applied. Total rules applied 270 place count 121 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 272 place count 121 transition count 192
Applied a total of 272 rules in 18 ms. Remains 121 /234 variables (removed 113) and now considering 192/457 (removed 265) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15038163993023694798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7762228967504662632.kers'
[2026-05-23 19:28:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15038163993023694798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7762228967504662632.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 121 cols 578 entries
Finished phase 1 with 117 SingleSign rule and 2 generalized
[2026-05-23 19:28:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7762228967504662632.kers
Total runtime 1 ms.
[2026-05-23 19:28:26] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-23 19:28:26] [INFO ] Invariant cache hit.
[2026-05-23 19:28:26] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-23 19:28:27] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2026-05-23 19:28:27] [INFO ] Invariant cache hit.
[2026-05-23 19:28:27] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/313 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 87/210 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 210 constraints, problems are : Problem set: 0 solved, 191 unsolved in 20249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/313 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 87/210 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 191/401 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 401 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50380ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 50381ms
Starting structural reductions in LTL mode, iteration 1 : 121/234 places, 192/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51376 ms. Remains : 121/234 places, 192/457 transitions.
[2026-05-23 19:29:17] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:29:17] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:29:17] [INFO ] Input system was already deterministic with 192 transitions.
[2026-05-23 19:29:17] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:29:17] [INFO ] Flatten gal took : 11 ms
[2026-05-23 19:29:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1816242456467431065.gal : 3 ms
[2026-05-23 19:29:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17976634369094278317.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/CTLFireability1816242456467431065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17976634369094278317.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,22439,1.61438,42004,2,7119,5,107366,6,0,676,75113,0
Converting to forward existential form...Done !
original formula: E(((EG(AX(!(A(((s2>=1)&&(l1257>=1)) U ((p16>=1)&&(l0>=1)))))) * A(!(EF(((s1>=1)&&(l1219>=1)))) U A(E(((s1>=1)&&(l1218>=1)) U ((s1>=1)&&(l...403
=> equivalent forward existential formula: ([(FwdU(Init,((EG(!(EX(!(!(!((E(!(((p16>=1)&&(l0>=1))) U (!(((s2>=1)&&(l1257>=1))) * !(((p16>=1)&&(l0>=1))))) + ...1773
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t31, t32, t39, t40, t48, t49, t50, t51, t52, t53, t54, t55, t56, t...715
(forward)formula 0,0,8.76412,188980,1,0,608,938623,437,265,4768,485420,745
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 179 transition count 288
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 179 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 179 transition count 285
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 151 place count 141 transition count 238
Iterating global reduction 1 with 38 rules applied. Total rules applied 189 place count 141 transition count 238
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 208 place count 141 transition count 219
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 229 place count 120 transition count 185
Iterating global reduction 2 with 21 rules applied. Total rules applied 250 place count 120 transition count 185
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 261 place count 120 transition count 174
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 269 place count 112 transition count 163
Iterating global reduction 3 with 8 rules applied. Total rules applied 277 place count 112 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 280 place count 112 transition count 160
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 286 place count 106 transition count 154
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 106 transition count 154
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 296 place count 102 transition count 150
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 102 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 303 place count 102 transition count 147
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 304 place count 101 transition count 145
Iterating global reduction 5 with 1 rules applied. Total rules applied 305 place count 101 transition count 145
Applied a total of 305 rules in 12 ms. Remains 101 /234 variables (removed 133) and now considering 145/457 (removed 312) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1579861063709530510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-609724140293765213.kers'
[2026-05-23 19:29:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1579861063709530510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-609724140293765213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 101 cols 446 entries
Finished phase 1 with 97 SingleSign rule and 2 generalized
[2026-05-23 19:29:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-609724140293765213.kers
Total runtime 1 ms.
[2026-05-23 19:29:26] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-23 19:29:26] [INFO ] Invariant cache hit.
[2026-05-23 19:29:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-23 19:29:26] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-05-23 19:29:26] [INFO ] Invariant cache hit.
[2026-05-23 19:29:26] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/246 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 60/163 constraints. Problems are: Problem set: 0 solved, 144 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 163 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/246 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 60/163 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 144/307 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 307 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39303ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 39304ms
Starting structural reductions in LTL mode, iteration 1 : 101/234 places, 145/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39781 ms. Remains : 101/234 places, 145/457 transitions.
[2026-05-23 19:30:06] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:30:06] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:30:06] [INFO ] Input system was already deterministic with 145 transitions.
[2026-05-23 19:30:06] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:30:06] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:30:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15873094547081115043.gal : 2 ms
[2026-05-23 19:30:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3115559983300227289.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/CTLFireability15873094547081115043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3115559983300227289.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,13270,0.680207,18564,2,4438,5,46789,6,0,549,33382,0
Converting to forward existential form...Done !
original formula: A((!((EX(((s1>=1)&&(l533>=1))) + E(((s1>=1)&&(l1232>=1)) U ((s1>=1)&&(l606>=1))))) + EG(AX(((s1>=1)&&(l419>=1))))) U EF(((p104>=1)&&(l0>=...160
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((p104>=1)&&(l0>=1))))))) * !(E(!(E(TRUE U ((p104>=1)&&(l0>=1)))) U (!((!((EX(((s1>=1)...309
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t30, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t...611
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.11381,96936,1,0,432,470088,330,202,3914,283860,484
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 175 transition count 272
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 175 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 175 transition count 269
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 161 place count 135 transition count 220
Iterating global reduction 1 with 40 rules applied. Total rules applied 201 place count 135 transition count 220
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 216 place count 135 transition count 205
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 240 place count 111 transition count 166
Iterating global reduction 2 with 24 rules applied. Total rules applied 264 place count 111 transition count 166
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 276 place count 111 transition count 154
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 286 place count 101 transition count 137
Iterating global reduction 3 with 10 rules applied. Total rules applied 296 place count 101 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 300 place count 101 transition count 133
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 306 place count 95 transition count 127
Iterating global reduction 4 with 6 rules applied. Total rules applied 312 place count 95 transition count 127
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 316 place count 91 transition count 123
Iterating global reduction 4 with 4 rules applied. Total rules applied 320 place count 91 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 322 place count 91 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 324 place count 89 transition count 113
Iterating global reduction 5 with 2 rules applied. Total rules applied 326 place count 89 transition count 113
Applied a total of 326 rules in 50 ms. Remains 89 /234 variables (removed 145) and now considering 113/457 (removed 344) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5890207628123056563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-611453159716351925.kers'
[2026-05-23 19:30:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5890207628123056563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-611453159716351925.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 89 cols 366 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 19:30:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-611453159716351925.kers
Total runtime 1 ms.
[2026-05-23 19:30:10] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 19:30:10] [INFO ] Invariant cache hit.
[2026-05-23 19:30:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 19:30:11] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2026-05-23 19:30:11] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-23 19:30:11] [INFO ] Invariant cache hit.
[2026-05-23 19:30:11] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/202 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 129 constraints, problems are : Problem set: 0 solved, 112 unsolved in 7394 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/202 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 241 constraints, problems are : Problem set: 0 solved, 112 unsolved in 20397 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27840ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 27841ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/234 places, 113/457 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28440 ms. Remains : 89/234 places, 113/457 transitions.
[2026-05-23 19:30:38] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:30:38] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:30:38] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-23 19:30:38] [INFO ] Flatten gal took : 18 ms
[2026-05-23 19:30:38] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:30:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15772632842726143276.gal : 1 ms
[2026-05-23 19:30:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6828935398117764505.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15772632842726143276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6828935398117764505.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (9168 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality6828935398117764505.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40003 steps (1953 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 72
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :72 after 124
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :124 after 224
Finished probabilistic random walk after 13890 steps, run visited all 1 properties in 38 ms. (steps per millisecond=365 )
Probabilistic random walk after 13890 steps, saw 6236 distinct states, run finished after 45 ms. (steps per millisecond=308 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :224 after 538
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 181 transition count 296
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 181 transition count 296
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 112 place count 181 transition count 290
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 146 place count 147 transition count 249
Iterating global reduction 1 with 34 rules applied. Total rules applied 180 place count 147 transition count 249
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 194 place count 147 transition count 235
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 214 place count 127 transition count 206
Iterating global reduction 2 with 20 rules applied. Total rules applied 234 place count 127 transition count 206
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 245 place count 127 transition count 195
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 254 place count 118 transition count 179
Iterating global reduction 3 with 9 rules applied. Total rules applied 263 place count 118 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 267 place count 118 transition count 175
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 272 place count 113 transition count 170
Iterating global reduction 4 with 5 rules applied. Total rules applied 277 place count 113 transition count 170
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 280 place count 110 transition count 167
Iterating global reduction 4 with 3 rules applied. Total rules applied 283 place count 110 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 284 place count 110 transition count 166
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 285 place count 109 transition count 164
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 109 transition count 164
Applied a total of 286 rules in 51 ms. Remains 109 /234 variables (removed 125) and now considering 164/457 (removed 293) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15004556947706491859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3214732020790951503.kers'
[2026-05-23 19:30:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15004556947706491859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3214732020790951503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 109 cols 513 entries
Finished phase 1 with 105 SingleSign rule and 2 generalized
[2026-05-23 19:30:39] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3214732020790951503.kers
Total runtime 2 ms.
[2026-05-23 19:30:39] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-23 19:30:39] [INFO ] Invariant cache hit.
[2026-05-23 19:30:39] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-23 19:30:39] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2026-05-23 19:30:39] [INFO ] Redundant transitions in 9 ms returned []
Running 163 sub problems to find dead transitions.
[2026-05-23 19:30:39] [INFO ] Invariant cache hit.
[2026-05-23 19:30:39] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/273 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 65/176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/273 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 176 constraints, problems are : Problem set: 0 solved, 163 unsolved in 9758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/273 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 65/176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 163/339 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 339 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39872ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 39873ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/234 places, 164/457 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40518 ms. Remains : 109/234 places, 164/457 transitions.
[2026-05-23 19:31:19] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:31:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:31:19] [INFO ] Input system was already deterministic with 164 transitions.
[2026-05-23 19:31:19] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:31:19] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:31:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6644819183329358776.gal : 1 ms
[2026-05-23 19:31:19] [INFO ] Time to serialize properties into /tmp/CTLFireability7834763052538684779.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/CTLFireability6644819183329358776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7834763052538684779.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,18700,1.2714,31820,2,5689,5,85918,6,0,600,61986,0
Converting to forward existential form...Done !
original formula: AG(E(((s1>=1)&&(l316>=1)) U E(((EG(((s1>=1)&&(l1021>=1))) + !(((s1>=1)&&(l460>=1)))) + E(((s1>=1)&&(l534>=1)) U ((s1>=1)&&(l1221>=1)))) U...271
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((s1>=1)&&(l316>=1)) U E(((EG(((s1>=1)&&(l1021>=1))) + !(((s1>=1)&&(l460>=1)))) + E(((s1...331
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t20, t41, t42, t44, t51, t53, t54, t55, t56, t57, t58, t59, t60, t69, t...611
(forward)formula 0,0,6.58418,134828,1,0,627,629017,372,312,4252,392723,664
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 177 transition count 288
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 177 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 177 transition count 282
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 159 place count 138 transition count 237
Iterating global reduction 1 with 39 rules applied. Total rules applied 198 place count 138 transition count 237
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 218 place count 138 transition count 217
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 240 place count 116 transition count 183
Iterating global reduction 2 with 22 rules applied. Total rules applied 262 place count 116 transition count 183
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 275 place count 116 transition count 170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 283 place count 108 transition count 154
Iterating global reduction 3 with 8 rules applied. Total rules applied 291 place count 108 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 295 place count 108 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 299 place count 104 transition count 146
Iterating global reduction 4 with 4 rules applied. Total rules applied 303 place count 104 transition count 146
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 306 place count 101 transition count 143
Iterating global reduction 4 with 3 rules applied. Total rules applied 309 place count 101 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 310 place count 100 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 100 transition count 141
Applied a total of 311 rules in 18 ms. Remains 100 /234 variables (removed 134) and now considering 141/457 (removed 316) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16397778426548705697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17827900163088894851.kers'
[2026-05-23 19:31:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16397778426548705697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17827900163088894851.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 100 cols 453 entries
Finished phase 1 with 96 SingleSign rule and 2 generalized
[2026-05-23 19:31:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17827900163088894851.kers
Total runtime 1 ms.
[2026-05-23 19:31:26] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-23 19:31:26] [INFO ] Invariant cache hit.
[2026-05-23 19:31:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 19:31:26] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2026-05-23 19:31:26] [INFO ] Invariant cache hit.
[2026-05-23 19:31:26] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/241 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 50/152 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/241 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 162 constraints, problems are : Problem set: 0 solved, 140 unsolved in 19157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/241 variables, 100/112 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 50/162 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 140/302 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 302 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49243ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 49244ms
Starting structural reductions in LTL mode, iteration 1 : 100/234 places, 141/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49782 ms. Remains : 100/234 places, 141/457 transitions.
[2026-05-23 19:32:16] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:32:16] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:32:16] [INFO ] Input system was already deterministic with 141 transitions.
[2026-05-23 19:32:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 19:32:16] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:32:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17547395118716707007.gal : 2 ms
[2026-05-23 19:32:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12503174363766868184.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/CTLFireability17547395118716707007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12503174363766868184.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,17392,0.679703,19848,2,4901,5,52284,6,0,541,43176,0
Converting to forward existential form...Done !
original formula: !(A(((E(((s1>=1)&&(l941>=1)) U EG(((s1>=1)&&(l954>=1)))) + ((p53>=1)&&(l621>=1))) * !(E(!(((s1>=1)&&(l1223>=1))) U AF(((s1>=1)&&(l1307>=1...201
=> equivalent forward existential formula: ([(EY((FwdU(Init,!(!(EX(!(E(TRUE U !(!(EG(!(((s1>=1)&&(l606>=1)))))))))))) * !(((E(((s1>=1)&&(l941>=1)) U EG(((s...412
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t33, t34, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...574
(forward)formula 0,0,3.93988,95676,1,0,360,424639,314,137,3879,258701,400
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 183 transition count 296
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 183 transition count 296
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 111 place count 183 transition count 287
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 145 place count 149 transition count 245
Iterating global reduction 1 with 34 rules applied. Total rules applied 179 place count 149 transition count 245
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 189 place count 149 transition count 235
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 209 place count 129 transition count 203
Iterating global reduction 2 with 20 rules applied. Total rules applied 229 place count 129 transition count 203
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 240 place count 129 transition count 192
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 247 place count 122 transition count 182
Iterating global reduction 3 with 7 rules applied. Total rules applied 254 place count 122 transition count 182
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 259 place count 122 transition count 177
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 263 place count 118 transition count 173
Iterating global reduction 4 with 4 rules applied. Total rules applied 267 place count 118 transition count 173
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 270 place count 115 transition count 170
Iterating global reduction 4 with 3 rules applied. Total rules applied 273 place count 115 transition count 170
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 274 place count 114 transition count 168
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 114 transition count 168
Applied a total of 275 rules in 13 ms. Remains 114 /234 variables (removed 120) and now considering 168/457 (removed 289) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8038298256531851375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3057616802058263410.kers'
[2026-05-23 19:32:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8038298256531851375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3057616802058263410.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 114 cols 531 entries
Finished phase 1 with 110 SingleSign rule and 2 generalized
[2026-05-23 19:32:20] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3057616802058263410.kers
Total runtime 1 ms.
[2026-05-23 19:32:20] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-23 19:32:20] [INFO ] Invariant cache hit.
[2026-05-23 19:32:20] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-23 19:32:21] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-23 19:32:21] [INFO ] Invariant cache hit.
[2026-05-23 19:32:21] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/282 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 64/180 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/282 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 189 constraints, problems are : Problem set: 0 solved, 167 unsolved in 23673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/282 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 64/189 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 167/356 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 356 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53803ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 53804ms
Starting structural reductions in LTL mode, iteration 1 : 114/234 places, 168/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54851 ms. Remains : 114/234 places, 168/457 transitions.
[2026-05-23 19:33:15] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:33:15] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:33:15] [INFO ] Input system was already deterministic with 168 transitions.
[2026-05-23 19:33:15] [INFO ] Flatten gal took : 16 ms
[2026-05-23 19:33:15] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:33:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15712554563524644103.gal : 2 ms
[2026-05-23 19:33:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17994653455785536105.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/CTLFireability15712554563524644103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17994653455785536105.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,20063,1.83233,42852,2,6756,5,125112,6,0,624,82570,0
Converting to forward existential form...Done !
original formula: ((EG(((s1>=1)&&(l1241>=1))) + EG(EF((((p81>=1)&&(l405>=1))||((s1>=1)&&(l946>=1)))))) + EX((EX(((AX(((p34>=1)&&(l0>=1))) * (s1>=1)) * (l53...330
=> equivalent forward existential formula: (([FwdG(Init,((s1>=1)&&(l1241>=1)))] != FALSE + [FwdG(Init,E(TRUE U (((p81>=1)&&(l405>=1))||((s1>=1)&&(l946>=1))...681
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t22, t43, t45, t46, t48, t50, t51, t52, t53, t54, t55, t57, t58, t59, t...628
(forward)formula 0,1,6.42746,149260,1,0,485,616040,369,226,4356,385589,484
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 180 transition count 277
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 180 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 180 transition count 274
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 148 place count 143 transition count 230
Iterating global reduction 1 with 37 rules applied. Total rules applied 185 place count 143 transition count 230
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 199 place count 143 transition count 216
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 218 place count 124 transition count 188
Iterating global reduction 2 with 19 rules applied. Total rules applied 237 place count 124 transition count 188
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 247 place count 124 transition count 178
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 253 place count 118 transition count 168
Iterating global reduction 3 with 6 rules applied. Total rules applied 259 place count 118 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 263 place count 118 transition count 164
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 265 place count 116 transition count 162
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 116 transition count 162
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 268 place count 115 transition count 161
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 115 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 115 transition count 160
Applied a total of 270 rules in 12 ms. Remains 115 /234 variables (removed 119) and now considering 160/457 (removed 297) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1850587766815940827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4162074783132217711.kers'
[2026-05-23 19:33:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1850587766815940827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4162074783132217711.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 115 cols 515 entries
Finished phase 1 with 111 SingleSign rule and 2 generalized
[2026-05-23 19:33:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4162074783132217711.kers
Total runtime 1 ms.
[2026-05-23 19:33:21] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-23 19:33:21] [INFO ] Invariant cache hit.
[2026-05-23 19:33:21] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-23 19:33:22] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2026-05-23 19:33:22] [INFO ] Invariant cache hit.
[2026-05-23 19:33:22] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/275 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 56/173 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 176 constraints, problems are : Problem set: 0 solved, 159 unsolved in 29559 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 160/275 variables, 115/120 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 159/335 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 335 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59656ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 59657ms
Starting structural reductions in LTL mode, iteration 1 : 115/234 places, 160/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60723 ms. Remains : 115/234 places, 160/457 transitions.
[2026-05-23 19:34:22] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:34:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:34:22] [INFO ] Input system was already deterministic with 160 transitions.
[2026-05-23 19:34:22] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:34:22] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:34:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10325215597496060912.gal : 2 ms
[2026-05-23 19:34:22] [INFO ] Time to serialize properties into /tmp/CTLFireability944146907515019472.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/CTLFireability10325215597496060912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability944146907515019472.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,19276,1.01057,29684,2,6915,5,70417,6,0,620,70750,0
Converting to forward existential form...Done !
original formula: EX(A((!(A(((s6>=1)&&(l0>=1)) U ((p48>=1)&&(l620>=1)))) * ((AF(((s1>=1)&&(l953>=1))) + !(((p52>=1)&&(l620>=1)))) + ((s1>=1)&&(l605>=1)))) ...244
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(((EG(!(EX(!(((p32>=1)&&(l0>=1)))))) * !(E(TRUE U !(!(((s1>=1)&&(l463>=1))))))) * ((s1>=1)&&...622
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t20, t31, t33, t36, t38, t42, t43, t46, t48, t50, t57, t59, t60, t61, t...652
Using saturation style SCC detection
(forward)formula 0,0,8.45538,189688,1,0,634,845721,372,289,4485,566733,739
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 175 transition count 268
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 175 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 175 transition count 265
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 161 place count 135 transition count 216
Iterating global reduction 1 with 40 rules applied. Total rules applied 201 place count 135 transition count 216
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 216 place count 135 transition count 201
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 239 place count 112 transition count 165
Iterating global reduction 2 with 23 rules applied. Total rules applied 262 place count 112 transition count 165
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 273 place count 112 transition count 154
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 282 place count 103 transition count 138
Iterating global reduction 3 with 9 rules applied. Total rules applied 291 place count 103 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 295 place count 103 transition count 134
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 301 place count 97 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 307 place count 97 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 311 place count 93 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 93 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 318 place count 93 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 319 place count 92 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 320 place count 92 transition count 119
Applied a total of 320 rules in 15 ms. Remains 92 /234 variables (removed 142) and now considering 119/457 (removed 338) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14337705765809554047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2872329753809218019.kers'
[2026-05-23 19:34:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14337705765809554047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2872329753809218019.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 92 cols 381 entries
Finished phase 1 with 88 SingleSign rule and 2 generalized
[2026-05-23 19:34:30] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2872329753809218019.kers
Total runtime 2 ms.
[2026-05-23 19:34:31] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 19:34:31] [INFO ] Invariant cache hit.
[2026-05-23 19:34:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 19:34:31] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2026-05-23 19:34:31] [INFO ] Invariant cache hit.
[2026-05-23 19:34:31] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/211 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 42/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 137 constraints, problems are : Problem set: 0 solved, 118 unsolved in 9193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/211 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 42/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 118/255 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/211 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 255 constraints, problems are : Problem set: 0 solved, 118 unsolved in 25661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34914ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 34915ms
Starting structural reductions in LTL mode, iteration 1 : 92/234 places, 119/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35297 ms. Remains : 92/234 places, 119/457 transitions.
[2026-05-23 19:35:06] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:35:06] [INFO ] Flatten gal took : 2 ms
[2026-05-23 19:35:06] [INFO ] Input system was already deterministic with 119 transitions.
[2026-05-23 19:35:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:35:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:35:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17162553915752884000.gal : 1 ms
[2026-05-23 19:35:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8895038448139037064.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/CTLFireability17162553915752884000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8895038448139037064.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,11330,0.333138,13716,2,2946,5,29554,6,0,487,24420,0
Converting to forward existential form...Done !
original formula: (AF(((EG(((s1<1)||(l954<1))) * EG(((s1<1)||(l449<1)))) + AX(EF(((s0<1)||(l0<1)))))) * EF(((s1>=1)&&(l419>=1))))
=> equivalent forward existential formula: ([FwdG(Init,!(((EG(((s1<1)||(l954<1))) * EG(((s1<1)||(l449<1)))) + !(EX(!(E(TRUE U ((s0<1)||(l0<1)))))))))] = FA...214
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t46, t52, t55, t61, t62, t63, t79, t86, t87, t88, t89, t90, t91, t...407
(forward)formula 0,1,2.64566,76340,1,0,416,350545,276,185,3435,246386,511
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 179 transition count 292
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 179 transition count 292
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 179 transition count 283
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 155 place count 143 transition count 240
Iterating global reduction 1 with 36 rules applied. Total rules applied 191 place count 143 transition count 240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 204 place count 143 transition count 227
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 224 place count 123 transition count 195
Iterating global reduction 2 with 20 rules applied. Total rules applied 244 place count 123 transition count 195
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 255 place count 123 transition count 184
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 261 place count 117 transition count 173
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 117 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 271 place count 117 transition count 169
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 274 place count 114 transition count 166
Iterating global reduction 4 with 3 rules applied. Total rules applied 277 place count 114 transition count 166
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 280 place count 111 transition count 163
Iterating global reduction 4 with 3 rules applied. Total rules applied 283 place count 111 transition count 163
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 284 place count 110 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 285 place count 110 transition count 157
Applied a total of 285 rules in 15 ms. Remains 110 /234 variables (removed 124) and now considering 157/457 (removed 300) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4790264962195327151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-548962714497091598.kers'
[2026-05-23 19:35:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4790264962195327151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-548962714497091598.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 110 cols 499 entries
Finished phase 1 with 106 SingleSign rule and 2 generalized
[2026-05-23 19:35:08] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-548962714497091598.kers
Total runtime 2 ms.
[2026-05-23 19:35:09] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-23 19:35:09] [INFO ] Invariant cache hit.
[2026-05-23 19:35:09] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-23 19:35:09] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-23 19:35:09] [INFO ] Invariant cache hit.
[2026-05-23 19:35:09] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/267 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 58/170 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 170 constraints, problems are : Problem set: 0 solved, 156 unsolved in 12806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/267 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 58/170 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 156/326 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 326 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42876ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 42877ms
Starting structural reductions in LTL mode, iteration 1 : 110/234 places, 157/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43496 ms. Remains : 110/234 places, 157/457 transitions.
[2026-05-23 19:35:52] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:35:52] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:35:52] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-23 19:35:52] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:35:52] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:35:52] [INFO ] Time to serialize gal into /tmp/CTLFireability17384355741976504315.gal : 2 ms
[2026-05-23 19:35:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13500061707105605447.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/CTLFireability17384355741976504315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13500061707105605447.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,19885,0.780198,27656,2,5196,5,75751,6,0,597,53024,0
Converting to forward existential form...Done !
original formula: AG((E(AX((EF(((s1>=1)&&(l1021>=1))) + E(((s1>=1)&&(l944>=1)) U ((s1>=1)&&(l400>=1))))) U E(((((s1>=1)&&(l445>=1))||((s1>=1)&&(l1021>=1)))...259
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((((p98>=1)&&(l0>=1))&&((s1<1)||(l1215<1))))) * !(E(!(EX(!((E(TRUE U ((s1>=1)&&(l1021>=1))...328
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t29, t30, t44, t50, t52, t53, t54, t56, t60, t61, t62, t63, t67, t...582
(forward)formula 0,0,3.36522,82812,1,0,379,352073,356,156,4147,184919,439
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 180 transition count 287
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 180 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 180 transition count 284
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 147 place count 144 transition count 244
Iterating global reduction 1 with 36 rules applied. Total rules applied 183 place count 144 transition count 244
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 200 place count 144 transition count 227
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 220 place count 124 transition count 193
Iterating global reduction 2 with 20 rules applied. Total rules applied 240 place count 124 transition count 193
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 251 place count 124 transition count 182
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 259 place count 116 transition count 167
Iterating global reduction 3 with 8 rules applied. Total rules applied 267 place count 116 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 116 transition count 166
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 274 place count 110 transition count 160
Iterating global reduction 4 with 6 rules applied. Total rules applied 280 place count 110 transition count 160
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 285 place count 105 transition count 155
Iterating global reduction 4 with 5 rules applied. Total rules applied 290 place count 105 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 292 place count 105 transition count 153
Applied a total of 292 rules in 11 ms. Remains 105 /234 variables (removed 129) and now considering 153/457 (removed 304) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9437357276421868075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13265859259643654257.kers'
[2026-05-23 19:35:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9437357276421868075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13265859259643654257.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 105 cols 478 entries
Finished phase 1 with 101 SingleSign rule and 2 generalized
[2026-05-23 19:35:55] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13265859259643654257.kers
Total runtime 2 ms.
[2026-05-23 19:35:55] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-23 19:35:55] [INFO ] Invariant cache hit.
[2026-05-23 19:35:56] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-23 19:35:56] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-23 19:35:56] [INFO ] Invariant cache hit.
[2026-05-23 19:35:56] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/258 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 169 constraints, problems are : Problem set: 0 solved, 152 unsolved in 16883 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/258 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 60/169 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 152/321 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 321 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46953ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 46954ms
Starting structural reductions in LTL mode, iteration 1 : 105/234 places, 153/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47449 ms. Remains : 105/234 places, 153/457 transitions.
[2026-05-23 19:36:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:36:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:36:43] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-23 19:36:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:36:43] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:36:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16541941987648881011.gal : 2 ms
[2026-05-23 19:36:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16545362798323111719.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/CTLFireability16541941987648881011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16545362798323111719.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,16726,1.06033,24136,2,5233,5,61652,6,0,573,48260,0
Converting to forward existential form...Done !
original formula: AG((A(AX(((((p127>=1)&&(l531>=1))||((p94>=1)&&(l0>=1)))||(!((s1>=1)&&(l1025>=1))))) U (EF(!(((s1>=1)&&(l445>=1)))) * EG(E(((s1>=1)&&(l608...244
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,TRUE) * !(((E(TRUE U EG(((s1<1)||(l496<1)))) * (s1>=1)) * (l526>=1)))),!((E(TRUE U !(((s1>=...901
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t31, t32, t33, t46, t47, t49, t50, t52, t53, t54, t55, t56, t57, t58, t...611
Using saturation style SCC detection
(forward)formula 0,0,4.88629,111996,1,0,406,523741,350,166,4197,319811,465
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 457/457 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 180 transition count 294
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 180 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 112 place count 180 transition count 290
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 150 place count 142 transition count 243
Iterating global reduction 1 with 38 rules applied. Total rules applied 188 place count 142 transition count 243
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 205 place count 142 transition count 226
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 226 place count 121 transition count 193
Iterating global reduction 2 with 21 rules applied. Total rules applied 247 place count 121 transition count 193
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 258 place count 121 transition count 182
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 267 place count 112 transition count 167
Iterating global reduction 3 with 9 rules applied. Total rules applied 276 place count 112 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 280 place count 112 transition count 163
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 286 place count 106 transition count 157
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 106 transition count 157
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 296 place count 102 transition count 153
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 102 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 102 transition count 152
Applied a total of 301 rules in 10 ms. Remains 102 /234 variables (removed 132) and now considering 152/457 (removed 305) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2070111096507282500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5837871531059672663.kers'
[2026-05-23 19:36:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2070111096507282500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5837871531059672663.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 102 cols 461 entries
Finished phase 1 with 98 SingleSign rule and 2 generalized
[2026-05-23 19:36:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5837871531059672663.kers
Total runtime 2 ms.
[2026-05-23 19:36:48] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-23 19:36:48] [INFO ] Invariant cache hit.
[2026-05-23 19:36:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-23 19:36:48] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2026-05-23 19:36:48] [INFO ] Invariant cache hit.
[2026-05-23 19:36:48] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 152/254 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 0/254 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 179 constraints, problems are : Problem set: 0 solved, 151 unsolved in 21558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 152/254 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 66/179 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 151/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/254 variables, and 330 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51652ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 51653ms
Starting structural reductions in LTL mode, iteration 1 : 102/234 places, 152/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52187 ms. Remains : 102/234 places, 152/457 transitions.
[2026-05-23 19:37:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:37:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:37:40] [INFO ] Input system was already deterministic with 152 transitions.
[2026-05-23 19:37:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 19:37:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 19:37:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3656479384389673023.gal : 1 ms
[2026-05-23 19:37:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4655372980967933047.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/CTLFireability3656479384389673023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4655372980967933047.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,15372,0.939457,24380,2,4973,5,70341,6,0,560,43554,0
Converting to forward existential form...Done !
original formula: (AG(((EF(((s1>=1)&&(l1291>=1))) + (E(((s1>=1)&&(l611>=1)) U ((s1>=1)&&(l1221>=1))) * EX(((s1>=1)&&(l534>=1))))) * AF(((p65>=1)&&(l615>=1)...265
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((E(((s1>=1)&&(l611>=1)) U ((s1>=1)&&(l1221>=1))) * EX(((s1>=1)&&(l534>=1)))))) * !(E(TR...379
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t...581
(forward)formula 0,0,2.86465,67188,1,0,287,218938,330,105,4003,129388,330
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 19:37:43] [INFO ] Flatten gal took : 9 ms
[2026-05-23 19:37:43] [INFO ] Flatten gal took : 9 ms
Total runtime 795715 ms.
BK_STOP 1779565063499
--------------------
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-d1m04"
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-d1m04, 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-177946993600138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 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 '
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 ;