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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779551661437

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 15:54:23] [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 15:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:54:23] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2026-05-23 15:54:23] [INFO ] Transformed 553 places.
[2026-05-23 15:54:23] [INFO ] Transformed 150 transitions.
[2026-05-23 15:54:23] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Support contains 58 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 27 place count 93 transition count 129
Iterating global reduction 1 with 9 rules applied. Total rules applied 36 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 90 transition count 123
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 90 transition count 123
Applied a total of 45 rules in 48 ms. Remains 90 /109 variables (removed 19) and now considering 123/150 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4757411828600946997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3617753342075738132.kers'
[2026-05-23 15:54:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4757411828600946997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3617753342075738132.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 90 cols 373 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 15:54:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3617753342075738132.kers
Total runtime 2 ms.
[2026-05-23 15:54:24] [INFO ] Implicit Places using invariants in 387 ms returned []
[2026-05-23 15:54:24] [INFO ] Invariant cache hit.
[2026-05-23 15:54:24] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-23 15:54:24] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-23 15:54:24] [INFO ] Invariant cache hit.
[2026-05-23 15:54:24] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 53/145 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 152 constraints, problems are : Problem set: 0 solved, 122 unsolved in 16444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/213 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 53/152 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 122/274 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 274 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46886ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 46909ms
Starting structural reductions in LTL mode, iteration 1 : 90/109 places, 123/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47876 ms. Remains : 90/109 places, 123/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2026-05-23 15:55:11] [INFO ] Invariant cache hit.
[2026-05-23 15:55:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 15:55:11] [INFO ] Invariant cache hit.
[2026-05-23 15:55:11] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-23 15:55:12] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 90/90 places, 123/123 transitions.
Support contains 58 out of 90 places after structural reductions.
[2026-05-23 15:55:12] [INFO ] Flatten gal took : 70 ms
[2026-05-23 15:55:12] [INFO ] Flatten gal took : 44 ms
[2026-05-23 15:55:12] [INFO ] Input system was already deterministic with 123 transitions.
Reduction of identical properties reduced properties to check from 58 to 56
RANDOM walk for 40000 steps (9206 resets) in 2888 ms. (13 steps per ms) remains 29/56 properties
BEST_FIRST walk for 4002 steps (180 resets) in 88 ms. (44 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (205 resets) in 151 ms. (26 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (251 resets) in 65 ms. (60 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (200 resets) in 69 ms. (57 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (398 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (385 resets) in 54 ms. (72 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (205 resets) in 55 ms. (71 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (206 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (205 resets) in 47 ms. (83 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (202 resets) in 47 ms. (83 steps per ms) remains 21/27 properties
BEST_FIRST walk for 4004 steps (179 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (201 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (219 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (390 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (400 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (426 resets) in 67 ms. (58 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (208 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (187 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (276 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (200 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (201 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (196 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (247 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (425 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (207 resets) in 57 ms. (69 steps per ms) remains 21/21 properties
[2026-05-23 15:55:14] [INFO ] Invariant cache hit.
[2026-05-23 15:55:14] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/53 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 23/76 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 114/190 variables, 76/78 constraints. Problems are: Problem set: 3 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 44/122 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/122 constraints. Problems are: Problem set: 3 solved, 18 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 8 (OVERLAPS) 23/213 variables, 14/136 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 9/145 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/145 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/145 constraints. Problems are: Problem set: 4 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 145 constraints, problems are : Problem set: 4 solved, 17 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 28/49 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 24/73 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 108/181 variables, 73/76 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 38/114 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/114 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 32/213 variables, 17/131 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 15/146 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 17/163 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/163 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/163 constraints. Problems are: Problem set: 4 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 163 constraints, problems are : Problem set: 4 solved, 17 unsolved in 4645 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 17/21 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6178ms problems are : Problem set: 4 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1096 ms.
Support contains 21 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 123/123 transitions.
Graph (complete) has 266 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 122
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 83 transition count 112
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 83 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 82 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 82 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 81 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 81 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 80 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 80 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 80 transition count 105
Applied a total of 22 rules in 48 ms. Remains 80 /90 variables (removed 10) and now considering 105/123 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 80/90 places, 105/123 transitions.
RANDOM walk for 40000 steps (9156 resets) in 329 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (175 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (222 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (417 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (218 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (192 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (199 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (204 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (211 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (209 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (432 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (414 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (378 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (191 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (177 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (189 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (397 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (213 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 22602 steps, run visited all 17 properties in 189 ms. (steps per millisecond=119 )
Probabilistic random walk after 22602 steps, saw 10157 distinct states, run finished after 197 ms. (steps per millisecond=114 ) properties seen :17
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 15:55:22] [INFO ] Flatten gal took : 23 ms
[2026-05-23 15:55:22] [INFO ] Flatten gal took : 24 ms
[2026-05-23 15:55:22] [INFO ] Input system was already deterministic with 123 transitions.
Computed a total of 6 stabilizing places and 17 stable transitions
Graph (complete) has 298 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 77 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 77 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 72 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 72 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 72 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 71 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 71 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 71 transition count 93
Applied a total of 40 rules in 19 ms. Remains 71 /90 variables (removed 19) and now considering 93/123 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8625126940199438263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10732645453254038683.kers'
[2026-05-23 15:55:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8625126940199438263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10732645453254038683.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 71 cols 293 entries
Finished phase 1 with 67 SingleSign rule and 2 generalized
[2026-05-23 15:55:22] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10732645453254038683.kers
Total runtime 5 ms.
[2026-05-23 15:55:22] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-23 15:55:22] [INFO ] Invariant cache hit.
[2026-05-23 15:55:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-23 15:55:22] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-23 15:55:22] [INFO ] Invariant cache hit.
[2026-05-23 15:55:22] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/164 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 35/108 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 115 constraints, problems are : Problem set: 0 solved, 92 unsolved in 10511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 93/164 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 35/115 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 92/207 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 207 constraints, problems are : Problem set: 0 solved, 92 unsolved in 13586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24156ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 24157ms
Starting structural reductions in LTL mode, iteration 1 : 71/90 places, 93/123 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24525 ms. Remains : 71/90 places, 93/123 transitions.
[2026-05-23 15:55:46] [INFO ] Flatten gal took : 10 ms
[2026-05-23 15:55:46] [INFO ] Flatten gal took : 11 ms
[2026-05-23 15:55:46] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-23 15:55:46] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:55:46] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12812708952855346353.gal : 4 ms
[2026-05-23 15:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14069842832386233203.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12812708952855346353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14069842832386233203.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,67052,0.60796,15404,2,3291,5,46989,6,0,377,32571,0


Converting to forward existential form...Done !
original formula: AG(((EG(AF(((s1<1)||(l504<1)))) + ((s1>=1)&&(l7>=1))) * (EF(((s1<1)||(l502<1))) + EX(((AF(((s1<1)||(l150<1))) * ((p30<1)||(l0<1))) * ((s1...174
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(((s1>=1)&&(l7>=1)))) * !(EG(!(EG(!(((s1<1)||(l504<1))))))))] = FALSE * [((FwdU(Init,TRUE...285
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t54, t57, t58, t59, t6...381
(forward)formula 0,1,2.80989,64868,1,0,269,316744,216,110,2590,241969,301
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 78 transition count 101
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 78 transition count 101
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 73 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 73 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 73 transition count 94
Applied a total of 36 rules in 16 ms. Remains 73 /90 variables (removed 17) and now considering 94/123 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5105561068944095038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10475927447176962169.kers'
[2026-05-23 15:55:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5105561068944095038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10475927447176962169.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 73 cols 302 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-23 15:55:49] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10475927447176962169.kers
Total runtime 2 ms.
[2026-05-23 15:55:49] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-23 15:55:49] [INFO ] Invariant cache hit.
[2026-05-23 15:55:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-23 15:55:50] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-05-23 15:55:50] [INFO ] Invariant cache hit.
[2026-05-23 15:55:50] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 94/167 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 33/108 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 113 constraints, problems are : Problem set: 0 solved, 93 unsolved in 6946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/167 variables, 73/80 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 33/113 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 206 constraints, problems are : Problem set: 0 solved, 93 unsolved in 16210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23220ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 23221ms
Starting structural reductions in LTL mode, iteration 1 : 73/90 places, 94/123 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23654 ms. Remains : 73/90 places, 94/123 transitions.
[2026-05-23 15:56:13] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:56:13] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:56:13] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-23 15:56:13] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:56:13] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:56:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13647715672548319584.gal : 2 ms
[2026-05-23 15:56:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6916304507359515598.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/CTLFireability13647715672548319584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6916304507359515598.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,61480,0.520653,19468,2,4815,5,58595,6,0,386,45882,0


Converting to forward existential form...Done !
original formula: ((EX(((s1>=1)&&(l509>=1))) + A(!((AF((((s1>=1)&&(l7>=1))&&((s1>=1)&&(l149>=1)))) + AX(!(((s1>=1)&&(l338>=1)))))) U EF((!(A(((s1>=1)&&(l14...449
=> equivalent forward existential formula: (([(EY(Init) * ((s1>=1)&&(l509>=1)))] != FALSE + [((Init * !(EG(!(E(TRUE U (!(!((E(!(((s1>=1)&&(l339>=1))) U (!(...1221
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t57, t60, t61, t62, t6...376
Using saturation style SCC detection
(forward)formula 0,1,6.45976,161224,1,0,487,830359,240,240,2748,741805,581
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 75 transition count 94
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 75 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 71 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 70 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 70 transition count 89
Applied a total of 40 rules in 9 ms. Remains 70 /90 variables (removed 20) and now considering 89/123 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6777475770156938020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17740180869454776126.kers'
[2026-05-23 15:56:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6777475770156938020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17740180869454776126.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 70 cols 295 entries
Finished phase 1 with 66 SingleSign rule and 2 generalized
[2026-05-23 15:56:19] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17740180869454776126.kers
Total runtime 6 ms.
[2026-05-23 15:56:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-23 15:56:20] [INFO ] Invariant cache hit.
[2026-05-23 15:56:20] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 15:56:20] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-23 15:56:20] [INFO ] Invariant cache hit.
[2026-05-23 15:56:20] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/159 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 100 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/159 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 88/188 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 188 constraints, problems are : Problem set: 0 solved, 88 unsolved in 9344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13543ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 13545ms
Starting structural reductions in LTL mode, iteration 1 : 70/90 places, 89/123 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13915 ms. Remains : 70/90 places, 89/123 transitions.
[2026-05-23 15:56:33] [INFO ] Flatten gal took : 11 ms
[2026-05-23 15:56:33] [INFO ] Flatten gal took : 10 ms
[2026-05-23 15:56:33] [INFO ] Input system was already deterministic with 89 transitions.
[2026-05-23 15:56:33] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:56:33] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:56:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13489677384646334861.gal : 3 ms
[2026-05-23 15:56:33] [INFO ] Time to serialize properties into /tmp/CTLFireability18132645667736081289.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/CTLFireability13489677384646334861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18132645667736081289.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,60968,0.656309,16464,2,3747,5,51653,6,0,369,37889,0


Converting to forward existential form...Done !
original formula: AF((AF(((p18>=1)&&(l115>=1))) + ((AX(AX(((s1>=1)&&(l503>=1)))) * A(((s1>=1)&&(l510>=1)) U ((s1>=1)&&(l353>=1)))) * ((p17>=1)&&(l126>=1)))...157
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((p18>=1)&&(l115>=1))))) + ((!(EX(!(!(EX(!(((s1>=1)&&(l503>=1)))))))) * !((E(!(((s1>=1)&&(l...289
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t49, t50, t56, t58, t65, t66, t67, t68, t69, t70, t71, t72, t7...331
(forward)formula 0,0,4.61617,105984,1,0,484,508454,218,261,2589,478853,517
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 81 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 81 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 78 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 78 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 77 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 77 transition count 104
Applied a total of 26 rules in 9 ms. Remains 77 /90 variables (removed 13) and now considering 104/123 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9095516240148795721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6872953332380459959.kers'
[2026-05-23 15:56:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9095516240148795721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6872953332380459959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 77 cols 324 entries
Finished phase 1 with 73 SingleSign rule and 2 generalized
[2026-05-23 15:56:38] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6872953332380459959.kers
Total runtime 1 ms.
[2026-05-23 15:56:38] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-23 15:56:38] [INFO ] Invariant cache hit.
[2026-05-23 15:56:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 15:56:38] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-23 15:56:38] [INFO ] Invariant cache hit.
[2026-05-23 15:56:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/181 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 41/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 120 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/181 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 41/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 103/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 223 constraints, problems are : Problem set: 0 solved, 103 unsolved in 15222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20179ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 20180ms
Starting structural reductions in LTL mode, iteration 1 : 77/90 places, 104/123 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20565 ms. Remains : 77/90 places, 104/123 transitions.
[2026-05-23 15:56:59] [INFO ] Flatten gal took : 11 ms
[2026-05-23 15:56:59] [INFO ] Flatten gal took : 12 ms
[2026-05-23 15:56:59] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-23 15:56:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:56:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:56:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9188396350311474700.gal : 1 ms
[2026-05-23 15:56:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11860368220428481290.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/CTLFireability9188396350311474700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11860368220428481290.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,88179,0.674517,19372,2,4125,5,56193,6,0,412,39331,0


Converting to forward existential form...Done !
original formula: ((E(((((EX(((s1>=1)&&(l355>=1))) * EF(EX(((s1>=1)&&(l123>=1))))) * ((!((s1>=1)&&(l33>=1)))&&((((s0>=1)&&(l0>=1))||((s1>=1)&&(l355>=1)))||...558
=> equivalent forward existential formula: [(FwdU(((Init * !(EX(((!(E(TRUE U !(((s1>=1)&&(l485>=1))))) + ((s1>=1)&&(l149>=1))) + (((p36>=1)&&(l137>=1))&&((...988
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...434
Using saturation style SCC detection
(forward)formula 0,0,9.46702,210512,1,0,750,1.05813e+06,267,400,3018,939901,892
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 73 transition count 90
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 73 transition count 90
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 65 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 62 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 58 transition count 64
Applied a total of 71 rules in 34 ms. Remains 58 /90 variables (removed 32) and now considering 64/123 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3028878634366681814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8486332986259530907.kers'
[2026-05-23 15:57:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3028878634366681814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8486332986259530907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 58 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-23 15:57:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8486332986259530907.kers
Total runtime 1 ms.
[2026-05-23 15:57:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 15:57:08] [INFO ] Invariant cache hit.
[2026-05-23 15:57:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:57:09] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2026-05-23 15:57:09] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-23 15:57:09] [INFO ] Invariant cache hit.
[2026-05-23 15:57:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 82 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3333 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/122 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 63/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 63 unsolved in 6582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9935ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 9936ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/90 places, 64/123 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10232 ms. Remains : 58/90 places, 64/123 transitions.
[2026-05-23 15:57:18] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:57:18] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:57:18] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 15:57:19] [INFO ] Flatten gal took : 23 ms
[2026-05-23 15:57:19] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:57:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4914295710346856762.gal : 1 ms
[2026-05-23 15:57:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1080050904372226215.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4914295710346856762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1080050904372226215.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (9195 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
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 ...328
Loading property file /tmp/ReachabilityCardinality1080050904372226215.prop.
BEST_FIRST walk for 40002 steps (1978 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 142
Finished probabilistic random walk after 3920 steps, run visited all 1 properties in 20 ms. (steps per millisecond=196 )
Probabilistic random walk after 3920 steps, saw 1762 distinct states, run finished after 20 ms. (steps per millisecond=196 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :142 after 294
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :294 after 1416
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 79 transition count 108
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 79 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 75 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 75 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 74 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 74 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 73 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 73 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 73 transition count 99
Applied a total of 35 rules in 14 ms. Remains 73 /90 variables (removed 17) and now considering 99/123 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17936557284716581023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3208002969388690160.kers'
[2026-05-23 15:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17936557284716581023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3208002969388690160.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 73 cols 303 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-23 15:57:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3208002969388690160.kers
Total runtime 3 ms.
[2026-05-23 15:57:19] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 15:57:19] [INFO ] Invariant cache hit.
[2026-05-23 15:57:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 15:57:19] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2026-05-23 15:57:19] [INFO ] Invariant cache hit.
[2026-05-23 15:57:19] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/172 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 41/116 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 116 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/172 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 41/116 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 98/214 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 214 constraints, problems are : Problem set: 0 solved, 98 unsolved in 24554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28672ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 28674ms
Starting structural reductions in LTL mode, iteration 1 : 73/90 places, 99/123 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28968 ms. Remains : 73/90 places, 99/123 transitions.
[2026-05-23 15:57:48] [INFO ] Flatten gal took : 16 ms
[2026-05-23 15:57:48] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:57:48] [INFO ] Input system was already deterministic with 99 transitions.
[2026-05-23 15:57:48] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:57:48] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:57:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15239511535699482638.gal : 2 ms
[2026-05-23 15:57:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10169165500355112147.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/CTLFireability15239511535699482638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10169165500355112147.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,73312,0.508546,19356,2,4091,5,64147,6,0,391,40426,0


Converting to forward existential form...Done !
original formula: AF((((((s1<1)||(l354<1)) * (EX(((p26<1)||(l0<1))) + ((s1>=1)&&(l355>=1)))) * (((s1>=1)&&(l149>=1)) + ((A((((s1>=1)&&(l355>=1))||((s1>=1)&...359
=> equivalent forward existential formula: [FwdG(Init,!((((((s1<1)||(l354<1)) * (EX(((p26<1)||(l0<1))) + ((s1>=1)&&(l355>=1)))) * (((s1>=1)&&(l149>=1)) + (...527
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t51, t52, t53,...424
(forward)formula 0,0,5.2731,133768,1,0,541,641742,248,289,2733,631246,554
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 76 transition count 97
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 76 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 71 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 71 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 70 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 70 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 70 transition count 89
Applied a total of 41 rules in 14 ms. Remains 70 /90 variables (removed 20) and now considering 89/123 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16281678937637435963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8892571540467570307.kers'
[2026-05-23 15:57:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16281678937637435963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8892571540467570307.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 70 cols 290 entries
Finished phase 1 with 66 SingleSign rule and 2 generalized
[2026-05-23 15:57:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8892571540467570307.kers
Total runtime 2 ms.
[2026-05-23 15:57:53] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-23 15:57:53] [INFO ] Invariant cache hit.
[2026-05-23 15:57:53] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 15:57:53] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2026-05-23 15:57:53] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2026-05-23 15:57:53] [INFO ] Invariant cache hit.
[2026-05-23 15:57:53] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/159 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/159 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 106 constraints, problems are : Problem set: 0 solved, 88 unsolved in 8190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 89/159 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 29/106 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 88/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 194 constraints, problems are : Problem set: 0 solved, 88 unsolved in 12298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20512ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 20512ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/90 places, 89/123 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20888 ms. Remains : 70/90 places, 89/123 transitions.
[2026-05-23 15:58:14] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:58:14] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:58:14] [INFO ] Input system was already deterministic with 89 transitions.
[2026-05-23 15:58:14] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:58:14] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:58:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4212696189408853201.gal : 2 ms
[2026-05-23 15:58:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1679365883438853171.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/CTLFireability4212696189408853201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1679365883438853171.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,60774,0.417913,15524,2,3173,5,49515,6,0,369,33450,0


Converting to forward existential form...Done !
original formula: AF(!(A(!(EF((((p32>=1)&&(l0>=1))||((s1>=1)&&(l124>=1))))) U (EG(((s1>=1)&&(l510>=1))) * (A(((s1>=1)&&(l353>=1)) U ((s1>=1)&&(l510>=1))) +...210
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((EG(((s1>=1)&&(l510>=1))) * (!((E(!(((s1>=1)&&(l510>=1))) U (!(((s1>=1)&&(l353>=1))) * !((...956
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t45, t46, t47, t53, t56, t57, t58, t65, t66, t67, t68, t69, t70, t7...341
(forward)formula 0,1,4.22471,101396,1,0,443,499115,229,200,2613,437651,594
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 73 transition count 90
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 73 transition count 90
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 65 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 62 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 61 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 60 transition count 68
Applied a total of 65 rules in 21 ms. Remains 60 /90 variables (removed 30) and now considering 68/123 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-890124339221075510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16072722514231540898.kers'
[2026-05-23 15:58:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-890124339221075510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16072722514231540898.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 60 cols 224 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-23 15:58:18] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16072722514231540898.kers
Total runtime 8 ms.
[2026-05-23 15:58:18] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 15:58:18] [INFO ] Invariant cache hit.
[2026-05-23 15:58:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 15:58:19] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2026-05-23 15:58:19] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2026-05-23 15:58:19] [INFO ] Invariant cache hit.
[2026-05-23 15:58:19] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 83 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 150 constraints, problems are : Problem set: 0 solved, 67 unsolved in 9407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11224ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 11225ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/90 places, 68/123 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11526 ms. Remains : 60/90 places, 68/123 transitions.
[2026-05-23 15:58:30] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:58:30] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:58:30] [INFO ] Input system was already deterministic with 68 transitions.
[2026-05-23 15:58:30] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:58:30] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:58:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1643692494006019631.gal : 2 ms
[2026-05-23 15:58:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7927623684192650981.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/CTLFireability1643692494006019631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7927623684192650981.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,25108,0.14491,8740,2,2571,5,19173,6,0,308,13302,0


Converting to forward existential form...Done !
original formula: AG((EG(AF(((s1<1)||(l355<1)))) + ((s1>=1)&&(l342>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((s1>=1)&&(l342>=1)))) * !(EG(!(EG(!(((s1<1)||(l355<1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t6...291
(forward)formula 0,1,1.3253,40368,1,0,222,185369,165,96,2101,144350,248
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-07 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 : 90/90 places, 123/123 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 93
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 93
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 67 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 61 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 60 transition count 68
Applied a total of 67 rules in 27 ms. Remains 60 /90 variables (removed 30) and now considering 68/123 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12681871443506857635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15209043564791323217.kers'
[2026-05-23 15:58:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12681871443506857635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15209043564791323217.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 60 cols 217 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-23 15:58:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15209043564791323217.kers
Total runtime 1 ms.
[2026-05-23 15:58:31] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-23 15:58:31] [INFO ] Invariant cache hit.
[2026-05-23 15:58:31] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 15:58:31] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2026-05-23 15:58:31] [INFO ] Redundant transitions in 2 ms returned []
Running 67 sub problems to find dead transitions.
[2026-05-23 15:58:31] [INFO ] Invariant cache hit.
[2026-05-23 15:58:32] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 91 constraints, problems are : Problem set: 0 solved, 67 unsolved in 4300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 68/128 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 67/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 158 constraints, problems are : Problem set: 0 solved, 67 unsolved in 10747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15070ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 15070ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/90 places, 68/123 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15366 ms. Remains : 60/90 places, 68/123 transitions.
[2026-05-23 15:58:47] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:58:47] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:58:47] [INFO ] Input system was already deterministic with 68 transitions.
[2026-05-23 15:58:47] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:58:47] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:58:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9067481844228531681.gal : 1 ms
[2026-05-23 15:58:47] [INFO ] Time to serialize properties into /tmp/CTLFireability4630767908490346573.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/CTLFireability9067481844228531681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4630767908490346573.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,26998,0.25083,11884,2,3329,5,32868,6,0,308,23031,0


Converting to forward existential form...Done !
original formula: AG(EF(((s1<1)||(l491<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((s1<1)||(l491<1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t42, t43, t44, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...301
(forward)formula 0,1,1.01426,27896,1,0,139,107484,157,55,2082,68444,146
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 77 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 77 transition count 102
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 73 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 73 transition count 96
Applied a total of 34 rules in 11 ms. Remains 73 /90 variables (removed 17) and now considering 96/123 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7742732457739707101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3843412236945119174.kers'
[2026-05-23 15:58:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7742732457739707101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3843412236945119174.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 73 cols 301 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-23 15:58:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3843412236945119174.kers
Total runtime 1 ms.
[2026-05-23 15:58:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 15:58:48] [INFO ] Invariant cache hit.
[2026-05-23 15:58:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 15:58:48] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2026-05-23 15:58:48] [INFO ] Invariant cache hit.
[2026-05-23 15:58:48] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 37/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 112 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4224 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 37/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 95/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 207 constraints, problems are : Problem set: 0 solved, 95 unsolved in 13494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17757ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 17757ms
Starting structural reductions in LTL mode, iteration 1 : 73/90 places, 96/123 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18035 ms. Remains : 73/90 places, 96/123 transitions.
[2026-05-23 15:59:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:59:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:59:06] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-23 15:59:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:59:06] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:59:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17160341485733151932.gal : 1 ms
[2026-05-23 15:59:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16849758997705073803.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/CTLFireability17160341485733151932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16849758997705073803.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,70494,0.432002,15852,2,4167,5,53379,6,0,388,31185,0


Converting to forward existential form...Done !
original formula: ((EG((AF(!(A(!(((s1<1)||(l491<1))) U ((s1>=1)&&(l501>=1))))) * !(E((((s1>=1)&&(l340>=1))&&((s1>=1)&&(l91>=1))) U !(((s1>=1)&&(l486>=1))))...413
=> equivalent forward existential formula: ((([FwdG(FwdU(EY(((Init * !((EG((!(EG(!(!(!((E(!(((s1>=1)&&(l501>=1))) U (!(!(((s1<1)||(l491<1)))) * !(((s1>=1)&...2110
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55, t62, t6...391
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,8.44014,183168,1,0,556,976365,263,295,2786,832525,646
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 73 transition count 90
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 66 transition count 81
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 62 transition count 72
Applied a total of 60 rules in 3 ms. Remains 62 /90 variables (removed 28) and now considering 72/123 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17461482398428047684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5569774243818141624.kers'
[2026-05-23 15:59:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17461482398428047684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5569774243818141624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 62 cols 238 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-23 15:59:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5569774243818141624.kers
Total runtime 1 ms.
[2026-05-23 15:59:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 15:59:14] [INFO ] Invariant cache hit.
[2026-05-23 15:59:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 15:59:14] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2026-05-23 15:59:14] [INFO ] Invariant cache hit.
[2026-05-23 15:59:14] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 5416 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 72/134 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7722 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13160ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 13161ms
Starting structural reductions in LTL mode, iteration 1 : 62/90 places, 72/123 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13360 ms. Remains : 62/90 places, 72/123 transitions.
[2026-05-23 15:59:28] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:28] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:28] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-23 15:59:28] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:28] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12636819017211482987.gal : 1 ms
[2026-05-23 15:59:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12359332612788459254.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/CTLFireability12636819017211482987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12359332612788459254.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,29802,0.205548,10508,2,3053,5,24654,6,0,320,21576,0


Converting to forward existential form...Done !
original formula: AG((AG(((s1>=1)&&(l336>=1))) + AX(((p19<1)||(l126<1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(E(TRUE U !(((s1>=1)&&(l336>=1)))))))) * !(((p19<1)||(l126<1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...296
(forward)formula 0,0,1.05421,27484,1,0,143,97316,168,58,2187,69099,156
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 73 transition count 90
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 73 transition count 90
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 65 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 62 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 58 transition count 64
Applied a total of 71 rules in 14 ms. Remains 58 /90 variables (removed 32) and now considering 64/123 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3326394643032039172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2289637992785059246.kers'
[2026-05-23 15:59:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3326394643032039172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2289637992785059246.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 58 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-23 15:59:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2289637992785059246.kers
Total runtime 0 ms.
[2026-05-23 15:59:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-23 15:59:29] [INFO ] Invariant cache hit.
[2026-05-23 15:59:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:59:29] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2026-05-23 15:59:29] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-23 15:59:29] [INFO ] Invariant cache hit.
[2026-05-23 15:59:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 82 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/122 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 63/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 63 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7494ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7494ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/90 places, 64/123 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7713 ms. Remains : 58/90 places, 64/123 transitions.
[2026-05-23 15:59:36] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:59:36] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:59:36] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 15:59:36] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:59:36] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2728343062721697426.gal : 1 ms
[2026-05-23 15:59:36] [INFO ] Time to serialize properties into /tmp/CTLFireability15845173990080630786.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/CTLFireability2728343062721697426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15845173990080630786.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,19724,0.153641,9120,2,2898,5,19031,6,0,296,15610,0


Converting to forward existential form...Done !
original formula: AF(AG(AF(((p15<1)||(l0<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(((p15<1)||(l0<1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
(forward)formula 0,1,0.722603,23132,1,0,136,73974,158,52,2004,49217,148
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 75 transition count 94
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 75 transition count 94
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 68 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 65 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 61 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 61 transition count 72
Applied a total of 62 rules in 22 ms. Remains 61 /90 variables (removed 29) and now considering 72/123 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12818064235879912534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2055966309920010239.kers'
[2026-05-23 15:59:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12818064235879912534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2055966309920010239.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 61 cols 235 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 15:59:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2055966309920010239.kers
Total runtime 1 ms.
[2026-05-23 15:59:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 15:59:37] [INFO ] Invariant cache hit.
[2026-05-23 15:59:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 15:59:37] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2026-05-23 15:59:37] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-23 15:59:37] [INFO ] Invariant cache hit.
[2026-05-23 15:59:37] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/133 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 86 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/133 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 71/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 6713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9515ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 9516ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/90 places, 72/123 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9838 ms. Remains : 61/90 places, 72/123 transitions.
[2026-05-23 15:59:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:47] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-23 15:59:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:59:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16767136098987459305.gal : 1 ms
[2026-05-23 15:59:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10087588676048814440.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/ReachabilityCardinality16767136098987459305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10087588676048814440.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 ...330
Loading property file /tmp/ReachabilityCardinality10087588676048814440.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 142
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :142 after 306
RANDOM walk for 40000 steps (9127 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :306 after 1734
SDD proceeding with computation,1 properties remain. new max is 512
BEST_FIRST walk for 40003 steps (2021 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
SDD size :1734 after 4296
Finished probabilistic random walk after 4260 steps, run visited all 1 properties in 16 ms. (steps per millisecond=266 )
Probabilistic random walk after 4260 steps, saw 1918 distinct states, run finished after 16 ms. (steps per millisecond=266 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 95
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 95
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 85
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 66 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 63 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 63 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 63 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 59 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 59 transition count 69
Applied a total of 69 rules in 11 ms. Remains 59 /90 variables (removed 31) and now considering 69/123 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-899467976503715035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16575451635154407950.kers'
[2026-05-23 15:59:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-899467976503715035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16575451635154407950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 59 cols 219 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 15:59:47] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16575451635154407950.kers
Total runtime 0 ms.
[2026-05-23 15:59:47] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 15:59:47] [INFO ] Invariant cache hit.
[2026-05-23 15:59:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 15:59:47] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2026-05-23 15:59:47] [INFO ] Invariant cache hit.
[2026-05-23 15:59:47] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 7821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9704ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 9705ms
Starting structural reductions in LTL mode, iteration 1 : 59/90 places, 69/123 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9948 ms. Remains : 59/90 places, 69/123 transitions.
[2026-05-23 15:59:57] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:59:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:59:57] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-23 15:59:57] [INFO ] Flatten gal took : 2 ms
[2026-05-23 15:59:57] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:59:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8920338638624439726.gal : 1 ms
[2026-05-23 15:59:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15989048158420339367.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/CTLFireability8920338638624439726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15989048158420339367.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,19724,0.168482,8840,2,2850,5,18392,6,0,305,13869,0


Converting to forward existential form...Done !
original formula: EG(EF(((AX(((s1>=1)&&(l149>=1))) + (s9<1)) + (l152<1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(EX(!(((s1>=1)&&(l149>=1))))) + (s9<1)) + (l152<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t45, t50, t51, t52, t5...331
(forward)formula 0,1,1.09742,29312,1,0,161,102047,166,64,2156,88901,170
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 75 transition count 96
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 75 transition count 96
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 67 transition count 86
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 64 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 62 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 62 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 61 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 60 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 60 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 60 transition count 71
Applied a total of 66 rules in 18 ms. Remains 60 /90 variables (removed 30) and now considering 71/123 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17587443623503162297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16668696126585344472.kers'
[2026-05-23 15:59:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17587443623503162297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16668696126585344472.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 60 cols 227 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-23 15:59:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16668696126585344472.kers
Total runtime 1 ms.
[2026-05-23 15:59:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 15:59:58] [INFO ] Invariant cache hit.
[2026-05-23 15:59:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 15:59:58] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2026-05-23 15:59:58] [INFO ] Redundant transitions in 2 ms returned []
Running 70 sub problems to find dead transitions.
[2026-05-23 15:59:58] [INFO ] Invariant cache hit.
[2026-05-23 15:59:58] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 90 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3801 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 71/131 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 70/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 160 constraints, problems are : Problem set: 0 solved, 70 unsolved in 8517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12341ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 12341ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/90 places, 71/123 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12576 ms. Remains : 60/90 places, 71/123 transitions.
[2026-05-23 16:00:11] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:00:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:00:11] [INFO ] Input system was already deterministic with 71 transitions.
[2026-05-23 16:00:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:00:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:00:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10745791023555169288.gal : 1 ms
[2026-05-23 16:00:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17276428506404134013.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/CTLFireability10745791023555169288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17276428506404134013.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,20630,0.313413,10348,2,3309,5,25203,6,0,311,19077,0


Converting to forward existential form...Done !
original formula: EF(((EG(AF(!(A(((s1>=1)&&(l3>=1)) U ((s3>=1)&&(l0>=1)))))) * AG(AF(((p27>=1)&&(l0>=1))))) * ((s1<1)||(l150<1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((s1<1)||(l150<1))) * EG(!(EG(!(!(!((E(!(((s3>=1)&&(l0>=1))) U (!(((s1>=1)&&(l3>=1))) * !(...271
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t46, t51, t52, t53, t5...336
(forward)formula 0,0,2.30894,54620,1,0,226,256885,170,91,2143,204488,259
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-23 16:00:13] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:00:13] [INFO ] Flatten gal took : 6 ms
Total runtime 350288 ms.

BK_STOP 1779552013771

--------------------
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-d0m05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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