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.r066-tall-177946967700330.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 CO4-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 98K 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 CO4-PT-07-CTLFireability-2024-00
FORMULA_NAME CO4-PT-07-CTLFireability-2024-01
FORMULA_NAME CO4-PT-07-CTLFireability-2024-02
FORMULA_NAME CO4-PT-07-CTLFireability-2024-03
FORMULA_NAME CO4-PT-07-CTLFireability-2024-04
FORMULA_NAME CO4-PT-07-CTLFireability-2024-05
FORMULA_NAME CO4-PT-07-CTLFireability-2024-06
FORMULA_NAME CO4-PT-07-CTLFireability-2024-07
FORMULA_NAME CO4-PT-07-CTLFireability-2024-08
FORMULA_NAME CO4-PT-07-CTLFireability-2024-09
FORMULA_NAME CO4-PT-07-CTLFireability-2024-10
FORMULA_NAME CO4-PT-07-CTLFireability-2024-11
FORMULA_NAME CO4-PT-07-CTLFireability-2024-12
FORMULA_NAME CO4-PT-07-CTLFireability-2024-13
FORMULA_NAME CO4-PT-07-CTLFireability-2024-14
FORMULA_NAME CO4-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779521426557

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 07:30:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 07:30:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:30:27] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-23 07:30:27] [INFO ] Transformed 384 places.
[2026-05-23 07:30:27] [INFO ] Transformed 456 transitions.
[2026-05-23 07:30:27] [INFO ] Found NUPN structural information;
[2026-05-23 07:30:27] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 274 transition count 335
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 55 place count 230 transition count 290
Iterating global reduction 1 with 44 rules applied. Total rules applied 99 place count 230 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 103 place count 230 transition count 286
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 122 place count 211 transition count 267
Iterating global reduction 2 with 19 rules applied. Total rules applied 141 place count 211 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 209 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 209 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 208 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 208 transition count 263
Applied a total of 147 rules in 71 ms. Remains 208 /284 variables (removed 76) and now considering 263/336 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17713861548701233375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11874141761447285697.kers'
[2026-05-23 07:30:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17713861548701233375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11874141761447285697.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 208 cols 600 entries
Finished phase 1 with 204 SingleSign rule and 0 generalized
[2026-05-23 07:30:28] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11874141761447285697.kers
Total runtime 1 ms.
[2026-05-23 07:30:28] [INFO ] Implicit Places using invariants in 267 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 302 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 207/284 places, 263/336 transitions.
Applied a total of 0 rules in 13 ms. Remains 207 /207 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 207/284 places, 263/336 transitions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6993753938057046694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17840741979754055515.kers'
[2026-05-23 07:30:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6993753938057046694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17840741979754055515.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 207 cols 598 entries
Finished phase 1 with 204 SingleSign rule and 0 generalized
[2026-05-23 07:30:28] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17840741979754055515.kers
Total runtime 1 ms.
[2026-05-23 07:30:28] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-23 07:30:28] [INFO ] Invariant cache hit.
[2026-05-23 07:30:28] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-23 07:30:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/470 variables, 207/210 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 212 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17048 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/470 variables, 207/212 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 262/474 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 474 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47156ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47169ms
Finished structural reductions in LTL mode , in 1 iterations and 47435 ms. Remains : 207/207 places, 263/263 transitions.
Support contains 72 out of 207 places after structural reductions.
[2026-05-23 07:31:15] [INFO ] Flatten gal took : 39 ms
[2026-05-23 07:31:15] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:31:16] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 70 out of 207 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (21 resets) in 1925 ms. (20 steps per ms) remains 52/61 properties
BEST_FIRST walk for 4001 steps (20 resets) in 62 ms. (63 steps per ms) remains 48/52 properties
BEST_FIRST walk for 4001 steps (29 resets) in 108 ms. (36 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4002 steps (40 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (31 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (13 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (37 resets) in 35 ms. (111 steps per ms) remains 45/47 properties
BEST_FIRST walk for 4001 steps (29 resets) in 51 ms. (76 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (22 resets) in 17 ms. (222 steps per ms) remains 39/44 properties
BEST_FIRST walk for 4001 steps (32 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (22 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (21 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (26 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (31 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (24 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (28 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (31 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (30 resets) in 49 ms. (80 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (20 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (24 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (37 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (30 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (38 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (29 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (31 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4002 steps (39 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (35 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (36 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (37 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (33 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (36 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (31 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (39 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4000 steps (13 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (30 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (25 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
[2026-05-23 07:31:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 13/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 5/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 147/211 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 182/393 variables, 95/162 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 9 (OVERLAPS) 62/455 variables, 39/201 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 11/466 variables, 7/208 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Problem AtomicPropp56 is UNSAT
At refinement iteration 13 (OVERLAPS) 4/470 variables, 2/210 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/470 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 0/470 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 210 constraints, problems are : Problem set: 2 solved, 34 unsolved in 2186 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 13/55 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 137/197 variables, 60/63 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 7/70 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/70 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 180/377 variables, 91/161 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 27/188 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 34 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 11 (OVERLAPS) 72/449 variables, 44/232 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/232 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 14/463 variables, 8/240 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 7/470 variables, 4/244 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/470 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 244 constraints, problems are : Problem set: 3 solved, 33 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 34/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7203ms problems are : Problem set: 3 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 263/263 transitions.
Graph (trivial) has 135 edges and 207 vertex of which 2 / 207 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 335 edges and 206 vertex of which 192 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 192 transition count 207
Reduce places removed 35 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 52 rules applied. Total rules applied 97 place count 157 transition count 190
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 116 place count 140 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 139 transition count 188
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 117 place count 139 transition count 181
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 131 place count 132 transition count 181
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 136 place count 127 transition count 175
Iterating global reduction 4 with 5 rules applied. Total rules applied 141 place count 127 transition count 175
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 126 transition count 174
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 126 transition count 174
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 187 place count 104 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 104 transition count 147
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 103 transition count 146
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 103 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 195 place count 102 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 196 place count 102 transition count 144
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 210 place count 95 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 215 place count 95 transition count 139
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 218 place count 92 transition count 133
Iterating global reduction 7 with 3 rules applied. Total rules applied 221 place count 92 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 223 place count 92 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 224 place count 92 transition count 130
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 230 place count 92 transition count 124
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 236 place count 86 transition count 124
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 241 place count 86 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 242 place count 86 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 243 place count 85 transition count 122
Applied a total of 243 rules in 79 ms. Remains 85 /207 variables (removed 122) and now considering 122/263 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 85/207 places, 122/263 transitions.
RANDOM walk for 40000 steps (4041 resets) in 893 ms. (44 steps per ms) remains 4/33 properties
BEST_FIRST walk for 40003 steps (652 resets) in 111 ms. (357 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (938 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1004 resets) in 75 ms. (526 steps per ms) remains 1/2 properties
[2026-05-23 07:31:24] [INFO ] Flow matrix only has 120 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9724538446341240104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18150750762327160761.kers'
[2026-05-23 07:31:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9724538446341240104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18150750762327160761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 85 cols 292 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-23 07:31:24] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18150750762327160761.kers
Total runtime 0 ms.
[2026-05-23 07:31:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/39 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 97/136 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 47/183 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/198 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/204 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/205 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/205 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/39 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 97/136 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 47/183 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/198 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/204 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/205 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/205 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 87 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2026-05-23 07:31:24] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:31:24] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:31:24] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 61 out of 207 places (down from 64) after GAL structural reductions.
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 337 edges and 207 vertex of which 202 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Graph (trivial) has 205 edges and 207 vertex of which 2 / 207 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 336 edges and 206 vertex of which 201 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 200 transition count 183
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 127 transition count 181
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 155 place count 126 transition count 177
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 122 transition count 177
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 159 place count 122 transition count 166
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 181 place count 111 transition count 166
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 193 place count 99 transition count 152
Iterating global reduction 4 with 12 rules applied. Total rules applied 205 place count 99 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 208 place count 99 transition count 149
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 210 place count 98 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 210 place count 98 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 214 place count 96 transition count 146
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 217 place count 93 transition count 143
Iterating global reduction 6 with 3 rules applied. Total rules applied 220 place count 93 transition count 143
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 244 place count 81 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 246 place count 81 transition count 129
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 247 place count 80 transition count 128
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 80 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 250 place count 79 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 253 place count 79 transition count 124
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 256 place count 78 transition count 122
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 258 place count 77 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 260 place count 76 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 264 place count 76 transition count 116
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 265 place count 76 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 266 place count 75 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 268 place count 74 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 270 place count 72 transition count 112
Applied a total of 270 rules in 37 ms. Remains 72 /207 variables (removed 135) and now considering 112/263 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1936871611616411193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4832611658972124853.kers'
[2026-05-23 07:31:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1936871611616411193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4832611658972124853.kers]
Normalized transition count is 111 out of 112 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 72 cols 269 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-23 07:31:25] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4832611658972124853.kers
Total runtime 0 ms.
[2026-05-23 07:31:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 07:31:25] [INFO ] Invariant cache hit.
[2026-05-23 07:31:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:31:25] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-23 07:31:25] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-23 07:31:25] [INFO ] Invariant cache hit.
[2026-05-23 07:31:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 111/182 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 1/183 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3926 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 111/182 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 61/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 182 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4425 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8362ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 8363ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/207 places, 112/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8505 ms. Remains : 72/207 places, 112/263 transitions.
[2026-05-23 07:31:33] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:31:33] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:31:33] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-23 07:31:33] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:31:33] [INFO ] Flatten gal took : 47 ms
[2026-05-23 07:31:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5304028233039693101.gal : 2 ms
RANDOM walk for 40000 steps (4893 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
[2026-05-23 07:31:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10829522150409613587.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/ReachabilityCardinality5304028233039693101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10829522150409613587.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (672 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2868 steps, run visited all 1 properties in 31 ms. (steps per millisecond=92 )

Probabilistic random walk after 2868 steps, saw 979 distinct states, run finished after 40 ms. (steps per millisecond=71 ) properties seen :1
FORMULA CO4-PT-07-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10829522150409613587.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Graph (trivial) has 214 edges and 207 vertex of which 2 / 207 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 336 edges and 206 vertex of which 201 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 200 transition count 175
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 119 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 167 place count 118 transition count 173
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 167 place count 118 transition count 162
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 189 place count 107 transition count 162
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 197 place count 99 transition count 152
Iterating global reduction 3 with 8 rules applied. Total rules applied 205 place count 99 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 99 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 206 place count 99 transition count 149
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 97 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 213 place count 94 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 216 place count 94 transition count 146
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 244 place count 80 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 250 place count 80 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 255 place count 78 transition count 122
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 257 place count 77 transition count 121
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 258 place count 76 transition count 120
Iterating global reduction 7 with 1 rules applied. Total rules applied 259 place count 76 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 261 place count 75 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 265 place count 75 transition count 115
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 266 place count 75 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 267 place count 74 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 269 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 271 place count 71 transition count 111
Applied a total of 271 rules in 36 ms. Remains 71 /207 variables (removed 136) and now considering 111/263 (removed 152) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7844880149602692872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16396945478213401435.kers'
[2026-05-23 07:31:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7844880149602692872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16396945478213401435.kers]
Normalized transition count is 110 out of 111 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 71 cols 227 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:31:33] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16396945478213401435.kers
Total runtime 0 ms.
[2026-05-23 07:31:33] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-23 07:31:33] [INFO ] Invariant cache hit.
[2026-05-23 07:31:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:31:34] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2026-05-23 07:31:34] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-23 07:31:34] [INFO ] Invariant cache hit.
[2026-05-23 07:31:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3213 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3494 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6715ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 6715ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/207 places, 111/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6952 ms. Remains : 71/207 places, 111/263 transitions.
[2026-05-23 07:31:40] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:31:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:31:40] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-23 07:31:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:31:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:31:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3878307656370304126.gal : 1 ms
[2026-05-23 07:31:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7552791500047243902.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/CTLFireability3878307656370304126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7552791500047243902.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,10561,0.032054,4352,2,198,5,1581,6,0,388,1263,0


Converting to forward existential form...Done !
original formula: EG(EF((p146==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p146==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t32, t35, t45, t51, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,1,0.149201,10392,1,0,188,28289,248,120,2256,37508,277
FORMULA CO4-PT-07-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 183 transition count 237
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 183 transition count 237
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 183 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 176 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 176 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 174 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 174 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 173 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 173 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 172 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 172 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 172 transition count 222
Applied a total of 73 rules in 23 ms. Remains 172 /207 variables (removed 35) and now considering 222/263 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10422989575769075737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13295092550564825833.kers'
[2026-05-23 07:31:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10422989575769075737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13295092550564825833.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 172 cols 507 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 07:31:40] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13295092550564825833.kers
Total runtime 1 ms.
[2026-05-23 07:31:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-23 07:31:41] [INFO ] Invariant cache hit.
[2026-05-23 07:31:41] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-23 07:31:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/394 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 177 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15048 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/394 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 221/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 399 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45114ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 45115ms
Starting structural reductions in LTL mode, iteration 1 : 172/207 places, 222/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45359 ms. Remains : 172/207 places, 222/263 transitions.
[2026-05-23 07:32:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:32:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:32:26] [INFO ] Input system was already deterministic with 222 transitions.
[2026-05-23 07:32:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:32:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:32:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12825594839508009534.gal : 3 ms
[2026-05-23 07:32:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16658784722601607894.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/CTLFireability12825594839508009534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16658784722601607894.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,226023,0.095377,7876,2,790,5,13563,6,0,907,16280,0


Converting to forward existential form...Done !
original formula: A(((p128!=1) * !(EX((p157==1)))) U A(AF(((p370==1)&&(p97==1))) U AX(EF(EX(((p248==1)&&(p370==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(EX(!(E(TRUE U EX(((p248==1)&&(p370==1)))))))) U (!(!(EG(!(((p370==1)&&(p97==1)))))) * ...743
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t126, t154, t177, t205, ...255
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.99714,360204,1,0,1033,2.48101e+06,481,604,5683,2.26641e+06,1238
FORMULA CO4-PT-07-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 181 transition count 236
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 181 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 173 transition count 226
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 173 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 171 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 171 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 170 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 170 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 169 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 169 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 169 transition count 220
Applied a total of 79 rules in 20 ms. Remains 169 /207 variables (removed 38) and now considering 220/263 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9716812530098028615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4171529401936247057.kers'
[2026-05-23 07:32:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9716812530098028615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4171529401936247057.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 169 cols 502 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-23 07:32:36] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4171529401936247057.kers
Total runtime 1 ms.
[2026-05-23 07:32:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 07:32:36] [INFO ] Invariant cache hit.
[2026-05-23 07:32:36] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-23 07:32:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/389 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 174 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/389 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 219/393 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 394 constraints, problems are : Problem set: 0 solved, 219 unsolved in 28641 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42884ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 42885ms
Starting structural reductions in LTL mode, iteration 1 : 169/207 places, 220/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43155 ms. Remains : 169/207 places, 220/263 transitions.
[2026-05-23 07:33:19] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:33:19] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:33:19] [INFO ] Input system was already deterministic with 220 transitions.
[2026-05-23 07:33:19] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:33:19] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:33:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16825470969432599503.gal : 1 ms
[2026-05-23 07:33:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5976183760266799319.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/CTLFireability16825470969432599503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5976183760266799319.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,283451,0.088512,7648,2,772,5,12769,6,0,894,15050,0


Converting to forward existential form...Done !
original formula: EG(EF((AX((p202==0)) * ((p353==0)||(p375==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(EX(!((p202==0)))) * ((p353==0)||(p375==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t19, t28, t33, t34, t36, t37, t41, t42, t45, t154, t177, t2...259
(forward)formula 0,1,0.725597,31984,1,0,300,117790,467,183,5602,113101,477
FORMULA CO4-PT-07-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Graph (trivial) has 213 edges and 207 vertex of which 2 / 207 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 336 edges and 206 vertex of which 201 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 200 transition count 177
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 121 transition count 175
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 165 place count 120 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 118 transition count 173
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 167 place count 118 transition count 162
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 189 place count 107 transition count 162
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 197 place count 99 transition count 152
Iterating global reduction 4 with 8 rules applied. Total rules applied 205 place count 99 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 99 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 206 place count 99 transition count 149
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 210 place count 97 transition count 149
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 213 place count 94 transition count 146
Iterating global reduction 5 with 3 rules applied. Total rules applied 216 place count 94 transition count 146
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 244 place count 80 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 250 place count 80 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 255 place count 78 transition count 122
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 257 place count 77 transition count 121
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 258 place count 76 transition count 120
Iterating global reduction 8 with 1 rules applied. Total rules applied 259 place count 76 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 261 place count 75 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 265 place count 75 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 267 place count 74 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 269 place count 72 transition count 112
Applied a total of 269 rules in 30 ms. Remains 72 /207 variables (removed 135) and now considering 112/263 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3312820094816877757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4242512338493284068.kers'
[2026-05-23 07:33:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3312820094816877757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4242512338493284068.kers]
Normalized transition count is 111 out of 112 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 72 cols 229 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-23 07:33:20] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4242512338493284068.kers
Total runtime 0 ms.
[2026-05-23 07:33:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-23 07:33:20] [INFO ] Invariant cache hit.
[2026-05-23 07:33:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:33:20] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2026-05-23 07:33:20] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2026-05-23 07:33:20] [INFO ] Invariant cache hit.
[2026-05-23 07:33:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 102/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 178 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3422 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6481ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6482ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/207 places, 112/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6601 ms. Remains : 72/207 places, 112/263 transitions.
[2026-05-23 07:33:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:33:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:33:27] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-23 07:33:27] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:33:27] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:33:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6116772869654156963.gal : 1 ms
[2026-05-23 07:33:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13160832338268885060.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/CTLFireability6116772869654156963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13160832338268885060.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,10753,0.016958,4460,2,205,5,1669,6,0,393,1419,0


Converting to forward existential form...Done !
original formula: AF((p245==1))
=> equivalent forward existential formula: [FwdG(Init,!((p245==1)))] = FALSE
Hit Full ! (commute/partial/dont) 110/0/2
(forward)formula 0,0,0.049787,5956,1,0,10,9848,20,4,1819,5390,8
FORMULA CO4-PT-07-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 180 transition count 234
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 180 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 232
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 172 transition count 224
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 172 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 170 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 170 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 169 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 169 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 168 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 168 transition count 218
Applied a total of 81 rules in 6 ms. Remains 168 /207 variables (removed 39) and now considering 218/263 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11218494404856688717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4631634430864853037.kers'
[2026-05-23 07:33:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11218494404856688717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4631634430864853037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 168 cols 498 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-23 07:33:27] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4631634430864853037.kers
Total runtime 1 ms.
[2026-05-23 07:33:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 07:33:27] [INFO ] Invariant cache hit.
[2026-05-23 07:33:27] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-23 07:33:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13809 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43847ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 43847ms
Starting structural reductions in LTL mode, iteration 1 : 168/207 places, 218/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43998 ms. Remains : 168/207 places, 218/263 transitions.
[2026-05-23 07:34:11] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:34:11] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:34:11] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-23 07:34:11] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:34:11] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:34:11] [INFO ] Time to serialize gal into /tmp/CTLFireability148426150416007137.gal : 1 ms
[2026-05-23 07:34:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12141971049871154525.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/CTLFireability148426150416007137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12141971049871154525.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,218967,0.089579,7620,2,769,5,12746,6,0,888,15298,0


Converting to forward existential form...Done !
original formula: (AF(AX(FALSE)) * EF(((p207!=1) + !(E((p155==1) U (p194==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE * [(Init * !(E(TRUE U ((p207!=1) + !(E((p155==1) U (p194==1)))))))] = F...160
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t202, Inter...249
(forward)formula 0,0,1.36423,57712,1,0,471,214885,468,311,5261,328647,607
FORMULA CO4-PT-07-CTLFireability-2024-05 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 : 207/207 places, 263/263 transitions.
Graph (trivial) has 213 edges and 207 vertex of which 2 / 207 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 336 edges and 206 vertex of which 201 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 200 transition count 174
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 118 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 169 place count 117 transition count 172
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 169 place count 117 transition count 162
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 189 place count 107 transition count 162
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 196 place count 100 transition count 153
Iterating global reduction 3 with 7 rules applied. Total rules applied 203 place count 100 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 204 place count 100 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 204 place count 100 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 208 place count 98 transition count 150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 211 place count 95 transition count 147
Iterating global reduction 4 with 3 rules applied. Total rules applied 214 place count 95 transition count 147
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 242 place count 81 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 248 place count 81 transition count 126
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 253 place count 79 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 255 place count 78 transition count 122
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 256 place count 77 transition count 121
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 77 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 259 place count 76 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 263 place count 76 transition count 116
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 264 place count 76 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 265 place count 75 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 267 place count 74 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 269 place count 72 transition count 112
Applied a total of 269 rules in 25 ms. Remains 72 /207 variables (removed 135) and now considering 112/263 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7645571525670983956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3484912161882833877.kers'
[2026-05-23 07:34:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7645571525670983956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3484912161882833877.kers]
Normalized transition count is 111 out of 112 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 72 cols 233 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-23 07:34:12] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3484912161882833877.kers
Total runtime 1 ms.
[2026-05-23 07:34:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-23 07:34:12] [INFO ] Invariant cache hit.
[2026-05-23 07:34:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:34:12] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-05-23 07:34:12] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2026-05-23 07:34:12] [INFO ] Invariant cache hit.
[2026-05-23 07:34:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3349 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 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/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 103/178 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 1/184 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 179 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3868 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7223ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 7224ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/207 places, 112/263 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7355 ms. Remains : 72/207 places, 112/263 transitions.
[2026-05-23 07:34:19] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:34:19] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:34:19] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-23 07:34:19] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:34:19] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:34:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9830969757321660642.gal : 0 ms
[2026-05-23 07:34:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2583427793147573241.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/CTLFireability9830969757321660642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2583427793147573241.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,14689,0.018569,4520,2,226,5,1710,6,0,393,1588,0


Converting to forward existential form...Done !
original formula: EF(EG(((p300==0)||(p365==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p300==0)||(p365==0)))] != FALSE
Hit Full ! (commute/partial/dont) 106/0/6
(forward)formula 0,1,0.050678,5900,1,0,8,10081,19,3,1835,4540,8
FORMULA CO4-PT-07-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 183 transition count 237
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 183 transition count 237
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 183 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 176 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 176 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 175 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 175 transition count 227
Applied a total of 66 rules in 4 ms. Remains 175 /207 variables (removed 32) and now considering 227/263 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5675796091299263178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12248180157363563483.kers'
[2026-05-23 07:34:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5675796091299263178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12248180157363563483.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 175 cols 516 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-23 07:34:19] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12248180157363563483.kers
Total runtime 1 ms.
[2026-05-23 07:34:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 07:34:19] [INFO ] Invariant cache hit.
[2026-05-23 07:34:20] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-05-23 07:34:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/402 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 180 constraints, problems are : Problem set: 0 solved, 226 unsolved in 14936 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 227/402 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 226/406 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 407 constraints, problems are : Problem set: 0 solved, 226 unsolved in 29814 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44762ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 44762ms
Starting structural reductions in LTL mode, iteration 1 : 175/207 places, 227/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44902 ms. Remains : 175/207 places, 227/263 transitions.
[2026-05-23 07:35:04] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:35:04] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:35:04] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-23 07:35:04] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:35:04] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:35:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3483173627680698227.gal : 2 ms
[2026-05-23 07:35:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16033291414977046323.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/CTLFireability3483173627680698227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16033291414977046323.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,265335,0.112599,8048,2,803,5,14260,6,0,925,16744,0


Converting to forward existential form...Done !
original formula: (AX(!(E(!(((EG((p91==1)) + (p208==1)) + (p337==1))) U (p334==1)))) + E(((p370!=1) + AF((p116==1))) U (p302==1)))
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(((p370!=1) + !(EG(!((p116==1))))) U (p302==1))))),!(((EG((p91==1)) + (p208==1)) + (p337==1...181
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t44, t47, t49, t158, t181, t2...259
(forward)formula 0,1,6.06535,180996,1,0,960,1.14167e+06,494,537,5160,1.13284e+06,1254
FORMULA CO4-PT-07-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 180 transition count 234
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 180 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 232
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 172 transition count 224
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 172 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 170 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 170 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 169 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 169 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 168 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 168 transition count 218
Applied a total of 81 rules in 15 ms. Remains 168 /207 variables (removed 39) and now considering 218/263 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17707726936910644014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5245115503710117616.kers'
[2026-05-23 07:35:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17707726936910644014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5245115503710117616.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 168 cols 498 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-23 07:35:11] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5245115503710117616.kers
Total runtime 2 ms.
[2026-05-23 07:35:11] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 07:35:11] [INFO ] Invariant cache hit.
[2026-05-23 07:35:11] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-23 07:35:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14099 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44127ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 44127ms
Starting structural reductions in LTL mode, iteration 1 : 168/207 places, 218/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44280 ms. Remains : 168/207 places, 218/263 transitions.
[2026-05-23 07:35:55] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:35:55] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:35:55] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-23 07:35:55] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:35:55] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:35:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12199320519129506636.gal : 1 ms
[2026-05-23 07:35:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3526599387055620473.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/CTLFireability12199320519129506636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3526599387055620473.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,218967,0.092457,7620,2,769,5,12746,6,0,888,15298,0


Converting to forward existential form...Done !
original formula: A(AG(!(((((((p222==1)||(p337==1))&&((p289==1)||(p337==1)))||(p245!=1))&&(p107==1))&&(p370==1)))) U !(AF(AX(FALSE))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(EX(!(FALSE))))))))))) * !(E(!(!(!(EG(!(!(EX(!(FALSE)))))))) U (!(!(E(TRUE U !(!(((((...291
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t202, Inter...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,1,8.68137,298880,1,0,730,2.04703e+06,468,478,5545,1.85677e+06,946
FORMULA CO4-PT-07-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 184 transition count 238
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 184 transition count 238
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 184 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 178 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 178 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 176 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 176 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 175 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 175 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 174 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 174 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 174 transition count 224
Applied a total of 69 rules in 15 ms. Remains 174 /207 variables (removed 33) and now considering 224/263 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-841505284326973399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6476240267144800617.kers'
[2026-05-23 07:36:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-841505284326973399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6476240267144800617.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 174 cols 511 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-23 07:36:04] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6476240267144800617.kers
Total runtime 3 ms.
[2026-05-23 07:36:04] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-23 07:36:04] [INFO ] Invariant cache hit.
[2026-05-23 07:36:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-23 07:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 224/398 variables, 174/177 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/398 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 179 constraints, problems are : Problem set: 0 solved, 223 unsolved in 15299 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/398 variables, 174/179 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 223/402 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 403 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45326ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 45326ms
Starting structural reductions in LTL mode, iteration 1 : 174/207 places, 224/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45495 ms. Remains : 174/207 places, 224/263 transitions.
[2026-05-23 07:36:49] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:36:49] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:36:49] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-23 07:36:49] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:36:49] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:36:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6390063718779271627.gal : 1 ms
[2026-05-23 07:36:49] [INFO ] Time to serialize properties into /tmp/CTLFireability3017609537968606572.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/CTLFireability6390063718779271627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3017609537968606572.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,243431,0.093577,7808,2,801,5,13454,6,0,917,15781,0


Converting to forward existential form...Done !
original formula: AF((!(E(((p204==1) + EF((p173==1))) U !(EG((p117==1))))) * (EX(((EG((p134==1)) + AX((p232==1))) + (((p251==1)&&(p370==1))||(p322==1)))) +...168
=> equivalent forward existential formula: [FwdG(Init,!((!(E(((p204==1) + E(TRUE U (p173==1))) U !(EG((p117==1))))) * (EX(((EG((p134==1)) + !(EX(!((p232==1...225
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t36, t37, t41, t42, t45, t130, t157, t180, t208, ...255
(forward)formula 0,0,1.9521,79660,1,0,674,452927,491,353,5747,413210,952
FORMULA CO4-PT-07-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 182 transition count 236
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 182 transition count 236
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 182 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 174 transition count 226
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 174 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 172 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 172 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 171 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 171 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 170 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 170 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 170 transition count 220
Applied a total of 77 rules in 11 ms. Remains 170 /207 variables (removed 37) and now considering 220/263 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13163416955497413212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-254646823703609497.kers'
[2026-05-23 07:36:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13163416955497413212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-254646823703609497.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 170 cols 502 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-23 07:36:51] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-254646823703609497.kers
Total runtime 1 ms.
[2026-05-23 07:36:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 07:36:51] [INFO ] Invariant cache hit.
[2026-05-23 07:36:51] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-23 07:36:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/390 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 175 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14375 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/390 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 219/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/390 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 395 constraints, problems are : Problem set: 0 solved, 219 unsolved in 27865 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42252ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 42253ms
Starting structural reductions in LTL mode, iteration 1 : 170/207 places, 220/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42401 ms. Remains : 170/207 places, 220/263 transitions.
[2026-05-23 07:37:33] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:37:33] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:37:33] [INFO ] Input system was already deterministic with 220 transitions.
[2026-05-23 07:37:33] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:37:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:37:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8085573783996432749.gal : 1 ms
[2026-05-23 07:37:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9830164309808421884.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/CTLFireability8085573783996432749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9830164309808421884.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,229231,0.104148,8128,2,789,5,14185,6,0,898,17700,0


Converting to forward existential form...Done !
original formula: A(EG((p293==1)) U ((p190==1) + (EF(EX((p284==1))) * (!(EF((p327==1))) + AG(EX((p191==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(((p190==1) + (E(TRUE U EX((p284==1))) * (!(E(TRUE U (p327==1))) + !(E(TRUE U !(EX((p191==1)))))...408
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t32, t33, t35, t36, t40, t41, t44, t154, t177, t204, Inter...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.50197,242040,1,0,860,1.6264e+06,477,508,5580,1.54372e+06,1092
FORMULA CO4-PT-07-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 181 transition count 236
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 181 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 173 transition count 226
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 173 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 171 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 171 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 170 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 170 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 169 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 169 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 169 transition count 220
Applied a total of 79 rules in 12 ms. Remains 169 /207 variables (removed 38) and now considering 220/263 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9972289903739466385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17231545702709261502.kers'
[2026-05-23 07:37:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9972289903739466385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17231545702709261502.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 169 cols 502 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-23 07:37:40] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17231545702709261502.kers
Total runtime 1 ms.
[2026-05-23 07:37:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 07:37:40] [INFO ] Invariant cache hit.
[2026-05-23 07:37:40] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-23 07:37:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/389 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 174 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14277 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/389 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 219/393 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 394 constraints, problems are : Problem set: 0 solved, 219 unsolved in 28575 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42864ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 42865ms
Starting structural reductions in LTL mode, iteration 1 : 169/207 places, 220/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43015 ms. Remains : 169/207 places, 220/263 transitions.
[2026-05-23 07:38:23] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:38:23] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:38:23] [INFO ] Input system was already deterministic with 220 transitions.
[2026-05-23 07:38:23] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:38:23] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3808724892231250833.gal : 1 ms
[2026-05-23 07:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability878711900903334901.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/CTLFireability3808724892231250833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability878711900903334901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,283451,0.088525,7612,2,772,5,12769,6,0,894,15050,0


Converting to forward existential form...Done !
original formula: EG(EX(EF(((p375==1)||(p268==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(TRUE U ((p375==1)||(p268==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t19, t28, t33, t34, t36, t37, t41, t42, t45, t154, t177, t2...259
(forward)formula 0,1,3.63545,133084,1,0,495,532166,467,317,5271,923391,618
FORMULA CO4-PT-07-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 184 transition count 238
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 184 transition count 238
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 184 transition count 236
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 177 transition count 229
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 177 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 175 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 175 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 174 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 174 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 173 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 173 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 173 transition count 223
Applied a total of 71 rules in 7 ms. Remains 173 /207 variables (removed 34) and now considering 223/263 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13340828153903906279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10842128440212510378.kers'
[2026-05-23 07:38:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13340828153903906279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10842128440212510378.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 173 cols 507 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-23 07:38:27] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10842128440212510378.kers
Total runtime 2 ms.
[2026-05-23 07:38:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 07:38:27] [INFO ] Invariant cache hit.
[2026-05-23 07:38:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-23 07:38:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/396 variables, 173/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 178 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14769 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/396 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 222/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/396 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 401 constraints, problems are : Problem set: 0 solved, 222 unsolved in 28159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42939ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 42939ms
Starting structural reductions in LTL mode, iteration 1 : 173/207 places, 223/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43079 ms. Remains : 173/207 places, 223/263 transitions.
[2026-05-23 07:39:10] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:39:10] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:39:10] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-23 07:39:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:39:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:39:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8133311720865614260.gal : 1 ms
[2026-05-23 07:39:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9477859871984983508.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/CTLFireability8133311720865614260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9477859871984983508.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,248199,0.103943,8224,2,793,5,14688,6,0,912,18573,0


Converting to forward existential form...Done !
original formula: E((EF(!(A((p292==1) U (p325==1)))) * E((AX(FALSE) + !(((p163!=1)||(p192==1)))) U (p97==1))) U (AX(!(AG((p327!=1)))) * E(!(E((p210==1) U (...205
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,(E(TRUE U !(!((E(!((p325==1)) U (!((p292==1)) * !((p325==1)))) + EG(!((p325==1))))))) * E((!(...585
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t32, t34, t36, t37, t41, t42, t45, t128, t156, t179, t206, ...255
Hit Full ! (commute/partial/dont) 221/0/2
(forward)formula 0,1,4.5104,162324,1,0,645,1.02879e+06,510,355,5713,948112,894
FORMULA CO4-PT-07-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 183 transition count 237
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 183 transition count 237
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 183 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 176 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 176 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 175 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 175 transition count 226
Applied a total of 66 rules in 5 ms. Remains 175 /207 variables (removed 32) and now considering 226/263 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7092448123007193598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11682926455618963866.kers'
[2026-05-23 07:39:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7092448123007193598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11682926455618963866.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 226 rows 175 cols 516 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-23 07:39:14] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11682926455618963866.kers
Total runtime 2 ms.
[2026-05-23 07:39:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 07:39:15] [INFO ] Invariant cache hit.
[2026-05-23 07:39:15] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2026-05-23 07:39:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 226/401 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 180 constraints, problems are : Problem set: 0 solved, 225 unsolved in 15121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 226/401 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 225/405 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 0/401 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 406 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45151ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 45152ms
Starting structural reductions in LTL mode, iteration 1 : 175/207 places, 226/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45312 ms. Remains : 175/207 places, 226/263 transitions.
[2026-05-23 07:40:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:40:00] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:40:00] [INFO ] Input system was already deterministic with 226 transitions.
[2026-05-23 07:40:00] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:40:00] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:40:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11533265387312301209.gal : 0 ms
[2026-05-23 07:40:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9984040240839195358.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/CTLFireability11533265387312301209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9984040240839195358.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,245331,0.09695,7980,2,797,5,13828,6,0,924,16478,0


Converting to forward existential form...Done !
original formula: AF(((A((p345!=1) U AF((p228==1))) + A((p335!=1) U (p306==1))) + ((p94==1) + EF((AG(E((p158==1) U (p284==1))) * EX(((p273==1)||(p98==1))))...159
=> equivalent forward existential formula: [FwdG(Init,!(((!((E(!(!(EG(!((p228==1))))) U (!((p345!=1)) * !(!(EG(!((p228==1))))))) + EG(!(!(EG(!((p228==1))))...342
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t42, t43, t46, t157, t182, t210, Inter...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.3281,352976,1,0,1364,2.35502e+06,509,819,5789,2.29833e+06,1656
FORMULA CO4-PT-07-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 187 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 187 transition count 242
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 187 transition count 241
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 180 transition count 234
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 180 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 178 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 178 transition count 231
Applied a total of 59 rules in 13 ms. Remains 178 /207 variables (removed 29) and now considering 231/263 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4673491911854486587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1945330647484625370.kers'
[2026-05-23 07:40:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4673491911854486587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1945330647484625370.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 231 rows 178 cols 528 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 07:40:10] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1945330647484625370.kers
Total runtime 1 ms.
[2026-05-23 07:40:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 07:40:10] [INFO ] Invariant cache hit.
[2026-05-23 07:40:10] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2026-05-23 07:40:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/409 variables, 178/181 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/409 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 183 constraints, problems are : Problem set: 0 solved, 230 unsolved in 16115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/409 variables, 178/183 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 230/413 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 414 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46141ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 46142ms
Starting structural reductions in LTL mode, iteration 1 : 178/207 places, 231/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46285 ms. Remains : 178/207 places, 231/263 transitions.
[2026-05-23 07:40:56] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:40:56] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:40:56] [INFO ] Input system was already deterministic with 231 transitions.
[2026-05-23 07:40:56] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:40:57] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:40:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8533820762433562845.gal : 1 ms
[2026-05-23 07:40:57] [INFO ] Time to serialize properties into /tmp/CTLFireability18348671263527824341.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/CTLFireability8533820762433562845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18348671263527824341.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,328369,0.105531,8384,2,839,5,15043,6,0,941,19149,0


Converting to forward existential form...Done !
original formula: ((EX(AG(AF((p195==1)))) + A((((p267==1) * A(((p235==1)||(p1==1)) U A((p188==1) U (p88==1)))) * !(((EX(((p300==1)&&(p344==1))) + (p306==1)...214
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U !(!(EG(!((p195==1))))))))] != FALSE + [((Init * !(EG(!((p375==1))))) * !(E(!((p375==1)...584
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t19, t28, t33, t34, t36, t37, t44, t45, t48, t161, t185, t2...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,10.3528,354760,1,0,1136,2.32064e+06,519,656,5899,2.31973e+06,1603
FORMULA CO4-PT-07-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 07:41:07] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:41:07] [INFO ] Flatten gal took : 3 ms
Total runtime 639726 ms.

BK_STOP 1779522067464

--------------------
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="CO4-PT-07"
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 CO4-PT-07, 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 r066-tall-177946967700330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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