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.r098-tall-177955695700602.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 DLCround-PT-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K Mar 6 17:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 6 17:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 6 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 17:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Mar 6 17:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 566K 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 DLCround-PT-09a-CTLFireability-2024-00
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-01
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-02
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-03
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-04
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-05
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-06
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-07
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-08
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-09
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-10
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-11
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-12
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-13
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-14
FORMULA_NAME DLCround-PT-09a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779638717879

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 16:05:18] [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-24 16:05:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 16:05:19] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2026-05-24 16:05:19] [INFO ] Transformed 299 places.
[2026-05-24 16:05:19] [INFO ] Transformed 2243 transitions.
[2026-05-24 16:05:19] [INFO ] Found NUPN structural information;
[2026-05-24 16:05:19] [INFO ] Parsed PT model containing 299 places and 2243 transitions and 8689 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 216 transitions
Reduce redundant transitions removed 216 transitions.
FORMULA DLCround-PT-09a-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 158 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 2027/2027 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 294 transition count 1956
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 294 transition count 1956
Drop transitions (Redundant composition of simpler transitions.) removed 678 transitions
Redundant transition composition rules discarded 678 transitions
Iterating global reduction 0 with 678 rules applied. Total rules applied 688 place count 294 transition count 1278
Applied a total of 688 rules in 81 ms. Remains 294 /299 variables (removed 5) and now considering 1278/2027 (removed 749) transitions.
[2026-05-24 16:05:19] [INFO ] Flow matrix only has 197 transitions (discarded 1081 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7056294983542953301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10405884191843409314.kers'
[2026-05-24 16:05:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7056294983542953301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10405884191843409314.kers]
Normalized transition count is 196 out of 197 initially.
Culling duplicate invariants (modulo rational): removing 170 columns.
Culled 170 columns in 0 ms.
// Phase 1: matrix 196 rows 124 cols 405 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 16:05:19] [INFO ] Computed 184 invariants in 1 ms
Computed 184 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10405884191843409314.kers
Total runtime 1 ms.
[2026-05-24 16:05:20] [INFO ] Implicit Places using invariants in 631 ms returned [124, 127, 129, 130, 131, 133, 134, 135, 137, 140, 143, 145, 146, 147, 148, 149, 150, 152, 154, 160, 162, 164, 166, 168, 170, 171, 172, 175, 178, 180, 181, 182, 184, 185, 186, 187, 188, 190, 192, 193, 195, 197, 200, 201, 202, 205, 206, 207, 208, 210, 211, 212, 216, 217, 219, 222, 226, 227, 234, 235, 238, 240, 241, 243, 244, 245, 249, 250, 252, 255, 256, 258, 260, 272, 273, 274, 276, 280, 281, 284, 288, 289, 290]
Discarding 83 places :
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Implicit Place search using SMT only with invariants took 666 ms to find 83 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 211/299 places, 846/2027 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 579 transitions
Redundant transition composition rules discarded 579 transitions
Iterating global reduction 0 with 579 rules applied. Total rules applied 579 place count 211 transition count 267
Applied a total of 579 rules in 10 ms. Remains 211 /211 variables (removed 0) and now considering 267/846 (removed 579) transitions.
[2026-05-24 16:05:20] [INFO ] Flow matrix only has 197 transitions (discarded 70 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3332847293975815434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1541047427577750995.kers'
[2026-05-24 16:05:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3332847293975815434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1541047427577750995.kers]
Normalized transition count is 196 out of 197 initially.
Culling duplicate invariants (modulo rational): removing 87 columns.
Culled 87 columns in 0 ms.
// Phase 1: matrix 196 rows 124 cols 405 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 16:05:20] [INFO ] Computed 101 invariants in 0 ms
Computed 101 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1541047427577750995.kers
Total runtime 1 ms.
[2026-05-24 16:05:20] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 16:05:20] [INFO ] Flow matrix only has 197 transitions (discarded 70 similar events)
[2026-05-24 16:05:20] [INFO ] Invariant cache hit.
[2026-05-24 16:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:05:20] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 211/299 places, 267/2027 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 978 ms. Remains : 211/299 places, 267/2027 transitions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-24 16:05:20] [INFO ] Flow matrix only has 197 transitions (discarded 70 similar events)
[2026-05-24 16:05:20] [INFO ] Invariant cache hit.
[2026-05-24 16:05:20] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 16:05:20] [INFO ] Flow matrix only has 197 transitions (discarded 70 similar events)
[2026-05-24 16:05:20] [INFO ] Invariant cache hit.
[2026-05-24 16:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:05:20] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-24 16:05:20] [INFO ] Flow matrix only has 197 transitions (discarded 70 similar events)
[2026-05-24 16:05:20] [INFO ] Invariant cache hit.
[2026-05-24 16:05:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 87/211 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 196/407 variables, 211/312 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 313 constraints, problems are : Problem set: 0 solved, 266 unsolved in 17734 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 211/211 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 87/211 variables, 87/101 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 196/407 variables, 211/312 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 266/578 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 1/408 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 0/408 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 579 constraints, problems are : Problem set: 0 solved, 266 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 211/211 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37880ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 37890ms
Finished structural reductions in LTL mode , in 1 iterations and 38069 ms. Remains : 211/211 places, 267/267 transitions.
Support contains 158 out of 211 places after structural reductions.
[2026-05-24 16:05:58] [INFO ] Flatten gal took : 43 ms
[2026-05-24 16:05:58] [INFO ] Flatten gal took : 21 ms
[2026-05-24 16:05:58] [INFO ] Input system was already deterministic with 267 transitions.
Reduction of identical properties reduced properties to check from 85 to 84
RANDOM walk for 40000 steps (8 resets) in 872 ms. (45 steps per ms) remains 1/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
[2026-05-24 16:05:59] [INFO ] Flow matrix only has 197 transitions (discarded 70 similar events)
[2026-05-24 16:05:59] [INFO ] Invariant cache hit.
[2026-05-24 16:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/211 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/407 variables, 211/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 211/211 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp68 is UNSAT
After SMT solving in domain Int declared 20/408 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 3/101 constraints, State Equation: 0/211 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2026-05-24 16:05:59] [INFO ] Flatten gal took : 11 ms
[2026-05-24 16:05:59] [INFO ] Flatten gal took : 12 ms
[2026-05-24 16:05:59] [INFO ] Input system was already deterministic with 267 transitions.
Computed a total of 88 stabilizing places and 1 stable transitions
Graph (complete) has 367 edges and 211 vertex of which 124 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 267/267 transitions.
Graph (trivial) has 250 edges and 211 vertex of which 114 / 211 are part of one of the 14 SCC in 2 ms
Free SCC test removed 100 places
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Graph (complete) has 137 edges and 111 vertex of which 27 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 27 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 26 transition count 36
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 16 place count 14 transition count 23
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 14 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 13 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 13 transition count 20
Applied a total of 33 rules in 16 ms. Remains 13 /211 variables (removed 198) and now considering 20/267 (removed 247) transitions.
[2026-05-24 16:05:59] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9757368148296006033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2076532810693153204.kers'
[2026-05-24 16:05:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9757368148296006033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2076532810693153204.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 12 rows 9 cols 25 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 16:05:59] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2076532810693153204.kers
Total runtime 2 ms.
[2026-05-24 16:05:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 16:05:59] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
[2026-05-24 16:05:59] [INFO ] Invariant cache hit.
[2026-05-24 16:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:05:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-24 16:05:59] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 16:05:59] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
[2026-05-24 16:05:59] [INFO ] Invariant cache hit.
[2026-05-24 16:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 12/25 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 20 constraints, problems are : Problem set: 0 solved, 19 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 12/25 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/26 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 39 constraints, problems are : Problem set: 0 solved, 19 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 501ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/211 places, 20/267 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 563 ms. Remains : 13/211 places, 20/267 transitions.
[2026-05-24 16:05:59] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:05:59] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:05:59] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-24 16:05:59] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:05:59] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:05:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2461429935824795119.gal : 2 ms
[2026-05-24 16:05:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4598002160353483326.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/CTLFireability2461429935824795119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4598002160353483326.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,13,0.009369,3732,2,32,5,109,6,0,55,72,0


Converting to forward existential form...Done !
original formula: EF((((EF(EG(((p68==0)||(p158==0)))) * (p1==1)) * ((p201==1)&&(p67==1))) * (p284==1)))
=> equivalent forward existential formula: [FwdG(FwdU((((FwdU(Init,TRUE) * (p284==1)) * ((p201==1)&&(p67==1))) * (p1==1)),TRUE),((p68==0)||(p158==0)))] != ...160
Hit Full ! (commute/partial/dont) 15/0/5
(forward)formula 0,1,0.011767,4168,1,0,11,309,23,4,279,167,14
FORMULA DLCround-PT-09a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 267/267 transitions.
Graph (trivial) has 216 edges and 211 vertex of which 88 / 211 are part of one of the 12 SCC in 0 ms
Free SCC test removed 76 places
Ensure Unique test removed 175 transitions
Reduce isomorphic transitions removed 175 transitions.
Graph (complete) has 192 edges and 135 vertex of which 57 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.1 ms
Discarding 78 places :
Also discarding 0 output 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 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 90
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 55 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 54 transition count 89
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 20 place count 42 transition count 72
Iterating global reduction 3 with 12 rules applied. Total rules applied 32 place count 42 transition count 72
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 3 with 2 rules applied. Total rules applied 34 place count 42 transition count 70
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 36 place count 41 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 39 place count 41 transition count 66
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 41 place count 41 transition count 66
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 43 place count 39 transition count 64
Iterating global reduction 5 with 2 rules applied. Total rules applied 45 place count 39 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 47 place count 39 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 48 place count 39 transition count 61
Applied a total of 48 rules in 12 ms. Remains 39 /211 variables (removed 172) and now considering 61/267 (removed 206) transitions.
[2026-05-24 16:06:00] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14825957509601774820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12727665419444937235.kers'
[2026-05-24 16:06:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14825957509601774820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12727665419444937235.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 40 rows 29 cols 85 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-24 16:06:00] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12727665419444937235.kers
Total runtime 0 ms.
[2026-05-24 16:06:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 16:06:00] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
[2026-05-24 16:06:00] [INFO ] Invariant cache hit.
[2026-05-24 16:06:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:06:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2026-05-24 16:06:00] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-24 16:06:00] [INFO ] Flow matrix only has 41 transitions (discarded 20 similar events)
[2026-05-24 16:06:00] [INFO ] Invariant cache hit.
[2026-05-24 16:06:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 9/39 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 40/79 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 56 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1134 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 9/39 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 40/79 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 60/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/80 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/80 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 116 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1175 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2313ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2314ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/211 places, 61/267 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2391 ms. Remains : 39/211 places, 61/267 transitions.
[2026-05-24 16:06:02] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:06:02] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:06:02] [INFO ] Input system was already deterministic with 61 transitions.
[2026-05-24 16:06:02] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:06:02] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:06:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1732571088114694643.gal : 1 ms
[2026-05-24 16:06:02] [INFO ] Time to serialize properties into /tmp/CTLFireability165274919274060769.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/CTLFireability1732571088114694643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability165274919274060769.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,4609,0.006061,4064,2,103,5,393,6,0,169,253,0


Converting to forward existential form...Done !
original formula: E(!(AG(!(EG((((p14==1)&&(p179==1))&&((p91==1)&&(p270==1))))))) U (((p115==1)&&(p282==1)) * ((!(EG((((p77==1)&&(p163==1))&&((p106==1)&&(p1...293
=> equivalent forward existential formula: (([((FwdU(Init,!(!(E(TRUE U !(!(EG((((p14==1)&&(p179==1))&&((p91==1)&&(p270==1)))))))))) * ((p115==1)&&(p282==1)...628
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.017327,4656,1,0,11,2503,31,3,870,1172,14
FORMULA DLCround-PT-09a-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 : 211/211 places, 267/267 transitions.
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 136 transition count 267
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 92 place count 119 transition count 233
Iterating global reduction 1 with 17 rules applied. Total rules applied 109 place count 119 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 119 transition count 230
Applied a total of 112 rules in 3 ms. Remains 119 /211 variables (removed 92) and now considering 230/267 (removed 37) transitions.
[2026-05-24 16:06:02] [INFO ] Flow matrix only has 177 transitions (discarded 53 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6804598388722655604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3400461049363744497.kers'
[2026-05-24 16:06:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6804598388722655604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3400461049363744497.kers]
Normalized transition count is 176 out of 177 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 176 rows 107 cols 365 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-24 16:06:02] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3400461049363744497.kers
Total runtime 0 ms.
[2026-05-24 16:06:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 16:06:02] [INFO ] Flow matrix only has 177 transitions (discarded 53 similar events)
[2026-05-24 16:06:02] [INFO ] Invariant cache hit.
[2026-05-24 16:06:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:06:02] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-24 16:06:02] [INFO ] Flow matrix only has 177 transitions (discarded 53 similar events)
[2026-05-24 16:06:02] [INFO ] Invariant cache hit.
[2026-05-24 16:06:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 12/119 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 176/295 variables, 119/145 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 1/296 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 0/296 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 146 constraints, problems are : Problem set: 0 solved, 229 unsolved in 10759 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 12/119 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 176/295 variables, 119/145 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 229/374 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 1/296 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 0/296 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 375 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9721 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20495ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 20496ms
Starting structural reductions in LTL mode, iteration 1 : 119/211 places, 230/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20620 ms. Remains : 119/211 places, 230/267 transitions.
[2026-05-24 16:06:23] [INFO ] Flatten gal took : 11 ms
[2026-05-24 16:06:23] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:06:23] [INFO ] Input system was already deterministic with 230 transitions.
[2026-05-24 16:06:23] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:06:23] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:06:23] [INFO ] Time to serialize gal into /tmp/CTLFireability726698085952959535.gal : 4 ms
[2026-05-24 16:06:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11009977115460882631.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/CTLFireability726698085952959535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11009977115460882631.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,1.48636e+12,0.02633,4860,2,330,5,1321,6,0,618,928,0


Converting to forward existential form...Done !
original formula: A(EF((AX(AG((p101==1))) + A(E(((p117==1)&&(p252==1)) U ((p97==1)&&(p214==1))) U ((((p121==1)&&(p297==1))&&((p15==1)&&(p141==1)))&&((p121=...391
=> equivalent forward existential formula: [((Init * !(EG(!(((E(TRUE U !(EX(!((((p123==1)&&(p296==1))||(p24==1)))))) * !(EX(!(EX(EX(((p69==1)&&(p166==1))))...1147
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 220/10/10
Hit Full ! (commute/partial/dont) 223/0/7
(forward)formula 0,0,0.141512,9104,1,0,25,25748,40,10,3033,11623,31
FORMULA DLCround-PT-09a-CTLFireability-2024-02 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 : 211/211 places, 267/267 transitions.
Graph (trivial) has 219 edges and 211 vertex of which 89 / 211 are part of one of the 12 SCC in 1 ms
Free SCC test removed 77 places
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Graph (complete) has 189 edges and 134 vertex of which 55 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.2 ms
Discarding 79 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 55 transition count 88
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 54 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 51 transition count 85
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 21 place count 40 transition count 69
Iterating global reduction 3 with 11 rules applied. Total rules applied 32 place count 40 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 40 transition count 65
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 40 place count 38 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 43 place count 38 transition count 60
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 45 place count 38 transition count 60
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 47 place count 36 transition count 58
Iterating global reduction 5 with 2 rules applied. Total rules applied 49 place count 36 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 51 place count 36 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 52 place count 36 transition count 55
Applied a total of 52 rules in 21 ms. Remains 36 /211 variables (removed 175) and now considering 55/267 (removed 212) transitions.
[2026-05-24 16:06:23] [INFO ] Flow matrix only has 35 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1052023010418334249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7007166155363686832.kers'
[2026-05-24 16:06:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1052023010418334249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7007166155363686832.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 34 rows 27 cols 74 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-24 16:06:23] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7007166155363686832.kers
Total runtime 0 ms.
[2026-05-24 16:06:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 16:06:23] [INFO ] Flow matrix only has 35 transitions (discarded 20 similar events)
[2026-05-24 16:06:23] [INFO ] Invariant cache hit.
[2026-05-24 16:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:06:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-24 16:06:23] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2026-05-24 16:06:23] [INFO ] Flow matrix only has 35 transitions (discarded 20 similar events)
[2026-05-24 16:06:23] [INFO ] Invariant cache hit.
[2026-05-24 16:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 8/36 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 34/70 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/71 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 53 constraints, problems are : Problem set: 0 solved, 54 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 8/36 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 34/70 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 107 constraints, problems are : Problem set: 0 solved, 54 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1963ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1963ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/211 places, 55/267 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2040 ms. Remains : 36/211 places, 55/267 transitions.
[2026-05-24 16:06:25] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:06:25] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:06:25] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-24 16:06:25] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:06:25] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:06:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11529259787029209270.gal : 0 ms
[2026-05-24 16:06:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9011231917267284936.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/CTLFireability11529259787029209270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9011231917267284936.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,4537,0.005632,4028,2,86,5,308,6,0,154,206,0


Converting to forward existential form...Done !
original formula: AF(E(EF(EG(((p47==1)&&(p137==1)))) U (((p44==1)&&(p223==1))&&((((!((p28==1)&&(p208==1)))||(!(((p72==1)&&(p247==1))||(p107==1))))||((!(((p...249
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U EG(((p47==1)&&(p137==1)))) U (((p44==1)&&(p223==1))&&((((!((p28==1)&&(p208==1)))||(!(((p...300
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.01421,4520,1,0,8,1825,27,0,774,697,12
FORMULA DLCround-PT-09a-CTLFireability-2024-03 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 : 211/211 places, 267/267 transitions.
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 129 transition count 267
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 105 place count 106 transition count 221
Iterating global reduction 1 with 23 rules applied. Total rules applied 128 place count 106 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 132 place count 106 transition count 217
Applied a total of 132 rules in 3 ms. Remains 106 /211 variables (removed 105) and now considering 217/267 (removed 50) transitions.
[2026-05-24 16:06:25] [INFO ] Flow matrix only has 170 transitions (discarded 47 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5129766589883985129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17321346520443140481.kers'
[2026-05-24 16:06:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5129766589883985129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17321346520443140481.kers]
Normalized transition count is 169 out of 170 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 169 rows 101 cols 351 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-24 16:06:25] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17321346520443140481.kers
Total runtime 1 ms.
[2026-05-24 16:06:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 16:06:25] [INFO ] Flow matrix only has 170 transitions (discarded 47 similar events)
[2026-05-24 16:06:25] [INFO ] Invariant cache hit.
[2026-05-24 16:06:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:06:25] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-24 16:06:25] [INFO ] Flow matrix only has 170 transitions (discarded 47 similar events)
[2026-05-24 16:06:25] [INFO ] Invariant cache hit.
[2026-05-24 16:06:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 5/106 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 169/275 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/276 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 126 constraints, problems are : Problem set: 0 solved, 216 unsolved in 9524 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 5/106 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 169/275 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 216/341 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 342 constraints, problems are : Problem set: 0 solved, 216 unsolved in 8644 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18189ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 18190ms
Starting structural reductions in LTL mode, iteration 1 : 106/211 places, 217/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18325 ms. Remains : 106/211 places, 217/267 transitions.
[2026-05-24 16:06:43] [INFO ] Flatten gal took : 11 ms
[2026-05-24 16:06:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:06:43] [INFO ] Input system was already deterministic with 217 transitions.
[2026-05-24 16:06:43] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:06:43] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:06:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11063973924201079869.gal : 1 ms
[2026-05-24 16:06:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6234881373817239230.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/CTLFireability11063973924201079869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6234881373817239230.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,6.71089e+11,0.022916,4788,2,298,5,1192,6,0,580,857,0


Converting to forward existential form...Done !
original formula: AG((EF(((p106==1)&&(p275==1))) + (AX((((p21==1)&&(p133==1))||((p47==1)&&(p282==1)))) * A(!(((p56==1)&&(p230==1))) U !(((p68==1)&&(p156==1...162
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !(E(TRUE U ((p106==1)&&(p275==1)))))) * !((((p21==1)&&(p133==1))||((p47==1)&&(p282==1))...438
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.083966,7224,1,0,12,13297,33,2,2567,2409,11
FORMULA DLCround-PT-09a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 267/267 transitions.
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 126 transition count 267
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 107 place count 104 transition count 223
Iterating global reduction 1 with 22 rules applied. Total rules applied 129 place count 104 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 133 place count 104 transition count 219
Applied a total of 133 rules in 3 ms. Remains 104 /211 variables (removed 107) and now considering 219/267 (removed 48) transitions.
[2026-05-24 16:06:43] [INFO ] Flow matrix only has 171 transitions (discarded 48 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9340906374541660038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18039106296797994641.kers'
[2026-05-24 16:06:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9340906374541660038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18039106296797994641.kers]
Normalized transition count is 170 out of 171 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 170 rows 102 cols 353 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 16:06:43] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18039106296797994641.kers
Total runtime 0 ms.
[2026-05-24 16:06:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 16:06:43] [INFO ] Flow matrix only has 171 transitions (discarded 48 similar events)
[2026-05-24 16:06:43] [INFO ] Invariant cache hit.
[2026-05-24 16:06:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:06:43] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 16:06:43] [INFO ] Flow matrix only has 171 transitions (discarded 48 similar events)
[2026-05-24 16:06:43] [INFO ] Invariant cache hit.
[2026-05-24 16:06:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 2/104 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 170/274 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/275 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 121 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9365 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 2/104 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 170/274 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 218/338 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/275 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 339 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8343 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17725ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 17725ms
Starting structural reductions in LTL mode, iteration 1 : 104/211 places, 219/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17846 ms. Remains : 104/211 places, 219/267 transitions.
[2026-05-24 16:07:01] [INFO ] Flatten gal took : 10 ms
[2026-05-24 16:07:01] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:07:01] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-24 16:07:01] [INFO ] Flatten gal took : 7 ms
[2026-05-24 16:07:01] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:07:01] [INFO ] Time to serialize gal into /tmp/CTLFireability17439607257219403888.gal : 1 ms
[2026-05-24 16:07:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14051031076398586038.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/CTLFireability17439607257219403888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14051031076398586038.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,7.54975e+11,0.023063,4792,2,295,5,1189,6,0,582,859,0


Converting to forward existential form...Done !
original formula: EX(EF((((p84==1)&&(p172==1))&&((p77==1)&&(p164==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (((p84==1)&&(p172==1))&&((p77==1)&&(p164==1))))] != FALSE
(forward)formula 0,1,0.036868,5060,1,0,8,1343,9,1,1071,859,4
FORMULA DLCround-PT-09a-CTLFireability-2024-05 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 : 211/211 places, 267/267 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 146 transition count 267
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 84 place count 127 transition count 229
Iterating global reduction 1 with 19 rules applied. Total rules applied 103 place count 127 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 107 place count 127 transition count 225
Applied a total of 107 rules in 3 ms. Remains 127 /211 variables (removed 84) and now considering 225/267 (removed 42) transitions.
[2026-05-24 16:07:01] [INFO ] Flow matrix only has 174 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3833811495780718562.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-40928838426703236.kers'
[2026-05-24 16:07:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3833811495780718562.kers, --Pflows, --basisKERS=/tmp/petrispot-output-40928838426703236.kers]
Normalized transition count is 173 out of 174 initially.
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 173 rows 105 cols 359 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-24 16:07:01] [INFO ] Computed 36 invariants in 0 ms
Computed 36 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-40928838426703236.kers
Total runtime 1 ms.
[2026-05-24 16:07:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 16:07:01] [INFO ] Flow matrix only has 174 transitions (discarded 51 similar events)
[2026-05-24 16:07:01] [INFO ] Invariant cache hit.
[2026-05-24 16:07:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:07:01] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2026-05-24 16:07:01] [INFO ] Flow matrix only has 174 transitions (discarded 51 similar events)
[2026-05-24 16:07:01] [INFO ] Invariant cache hit.
[2026-05-24 16:07:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 22/127 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 173/300 variables, 127/163 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 164 constraints, problems are : Problem set: 0 solved, 224 unsolved in 10802 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 127/127 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 22/127 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 173/300 variables, 127/163 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 224/387 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 1/301 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 388 constraints, problems are : Problem set: 0 solved, 224 unsolved in 10149 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 127/127 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20961ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 20962ms
Starting structural reductions in LTL mode, iteration 1 : 127/211 places, 225/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21067 ms. Remains : 127/211 places, 225/267 transitions.
[2026-05-24 16:07:22] [INFO ] Flatten gal took : 9 ms
[2026-05-24 16:07:22] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:07:22] [INFO ] Input system was already deterministic with 225 transitions.
[2026-05-24 16:07:22] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:07:22] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:07:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7821898608903452175.gal : 1 ms
[2026-05-24 16:07:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3998324433831271891.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/CTLFireability7821898608903452175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3998324433831271891.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,1.07495e+12,0.027304,4860,2,344,5,1352,6,0,617,946,0


Converting to forward existential form...Done !
original formula: ((EF(AG((AG(((p103==1)&&(p274==1))) + EX(((p96==1)&&(p271==1)))))) + A(E(AF(((((p68==1)&&(p236==1))||((p117==1)&&(p298==1))) * A(((p104==...703
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((p103==1)&&(p274==1))))) + EX(((p96==1)&&(p271==1))))))))] != ...1522
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 220/0/5
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 215/0/10
Hit Full ! (commute/partial/dont) 215/10/10
Hit Full ! (commute/partial/dont) 222/0/3
(forward)formula 0,0,0.16862,9592,1,0,36,25900,101,17,3471,10488,57
FORMULA DLCround-PT-09a-CTLFireability-2024-06 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 : 211/211 places, 267/267 transitions.
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 133 transition count 267
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 97 place count 114 transition count 229
Iterating global reduction 1 with 19 rules applied. Total rules applied 116 place count 114 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 120 place count 114 transition count 225
Applied a total of 120 rules in 7 ms. Remains 114 /211 variables (removed 97) and now considering 225/267 (removed 42) transitions.
[2026-05-24 16:07:23] [INFO ] Flow matrix only has 174 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9247518087267780529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2197793044252982360.kers'
[2026-05-24 16:07:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9247518087267780529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2197793044252982360.kers]
Normalized transition count is 173 out of 174 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 173 rows 105 cols 359 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-24 16:07:23] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2197793044252982360.kers
Total runtime 1 ms.
[2026-05-24 16:07:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 16:07:23] [INFO ] Flow matrix only has 174 transitions (discarded 51 similar events)
[2026-05-24 16:07:23] [INFO ] Invariant cache hit.
[2026-05-24 16:07:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:07:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2026-05-24 16:07:23] [INFO ] Flow matrix only has 174 transitions (discarded 51 similar events)
[2026-05-24 16:07:23] [INFO ] Invariant cache hit.
[2026-05-24 16:07:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 9/114 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 173/287 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 1/288 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/288 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 138 constraints, problems are : Problem set: 0 solved, 224 unsolved in 10032 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 9/114 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 173/287 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 224/361 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 1/288 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 0/288 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 362 constraints, problems are : Problem set: 0 solved, 224 unsolved in 9266 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19314ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 19314ms
Starting structural reductions in LTL mode, iteration 1 : 114/211 places, 225/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19424 ms. Remains : 114/211 places, 225/267 transitions.
[2026-05-24 16:07:42] [INFO ] Flatten gal took : 10 ms
[2026-05-24 16:07:42] [INFO ] Flatten gal took : 7 ms
[2026-05-24 16:07:42] [INFO ] Input system was already deterministic with 225 transitions.
[2026-05-24 16:07:42] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:07:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:07:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16783284239770847826.gal : 3 ms
[2026-05-24 16:07:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6480412675530527693.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/CTLFireability16783284239770847826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6480412675530527693.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14662e+12,0.023655,4828,2,318,5,1275,6,0,604,906,0


Converting to forward existential form...Done !
original formula: E(!(AG((AG(((p108==1)&&(p273==1))) + ((p106==1)&&(p188==1))))) U ((A(!((((AX(((p57==1)&&(p238==1))) * (p39==1)) * ((p225==1)&&(p18==1))) ...281
=> equivalent forward existential formula: [((((FwdU(Init,!(!(E(TRUE U !((!(E(TRUE U !(((p108==1)&&(p273==1))))) + ((p106==1)&&(p188==1)))))))) * (p251==1)...483
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.083996,7144,1,0,11,16473,22,0,2514,3244,13
FORMULA DLCround-PT-09a-CTLFireability-2024-07 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 : 211/211 places, 267/267 transitions.
Graph (trivial) has 259 edges and 211 vertex of which 118 / 211 are part of one of the 14 SCC in 1 ms
Free SCC test removed 104 places
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Graph (complete) has 127 edges and 107 vertex of which 21 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.2 ms
Discarding 86 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 20 transition count 26
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 15 place count 9 transition count 15
Iterating global reduction 2 with 11 rules applied. Total rules applied 26 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 9 transition count 14
Applied a total of 27 rules in 10 ms. Remains 9 /211 variables (removed 202) and now considering 14/267 (removed 253) transitions.
[2026-05-24 16:07:42] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3214959890928032325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12981478371235691646.kers'
[2026-05-24 16:07:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3214959890928032325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12981478371235691646.kers]
Normalized transition count is 8 out of 9 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 17 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 16:07:42] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12981478371235691646.kers
Total runtime 0 ms.
[2026-05-24 16:07:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 16:07:42] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2026-05-24 16:07:42] [INFO ] Invariant cache hit.
[2026-05-24 16:07:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:07:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 16:07:42] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2026-05-24 16:07:42] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2026-05-24 16:07:42] [INFO ] Invariant cache hit.
[2026-05-24 16:07:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/18 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 14 constraints, problems are : Problem set: 0 solved, 13 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/18 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 27 constraints, problems are : Problem set: 0 solved, 13 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 277ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/211 places, 14/267 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 329 ms. Remains : 9/211 places, 14/267 transitions.
[2026-05-24 16:07:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:07:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:07:42] [INFO ] Input system was already deterministic with 14 transitions.
[2026-05-24 16:07:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:07:42] [INFO ] Flatten gal took : 0 ms
[2026-05-24 16:07:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9115241510856643813.gal : 0 ms
[2026-05-24 16:07:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5654839899258474782.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/CTLFireability9115241510856643813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5654839899258474782.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,9,0.003922,3792,2,18,5,72,6,0,41,48,0


Converting to forward existential form...Done !
original formula: AF(E(!(AF((p69==1))) U ((p113==1)&&(p288==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(!(EG(!((p69==1))))) U ((p113==1)&&(p288==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.006695,4116,1,0,19,259,27,11,182,241,19
FORMULA DLCround-PT-09a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 267/267 transitions.
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 128 transition count 267
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 105 place count 106 transition count 223
Iterating global reduction 1 with 22 rules applied. Total rules applied 127 place count 106 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 131 place count 106 transition count 219
Applied a total of 131 rules in 2 ms. Remains 106 /211 variables (removed 105) and now considering 219/267 (removed 48) transitions.
[2026-05-24 16:07:43] [INFO ] Flow matrix only has 171 transitions (discarded 48 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17383830244123494864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16823269273688918489.kers'
[2026-05-24 16:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17383830244123494864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16823269273688918489.kers]
Normalized transition count is 170 out of 171 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 170 rows 102 cols 353 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 16:07:43] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16823269273688918489.kers
Total runtime 0 ms.
[2026-05-24 16:07:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 16:07:43] [INFO ] Flow matrix only has 171 transitions (discarded 48 similar events)
[2026-05-24 16:07:43] [INFO ] Invariant cache hit.
[2026-05-24 16:07:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:07:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 16:07:43] [INFO ] Flow matrix only has 171 transitions (discarded 48 similar events)
[2026-05-24 16:07:43] [INFO ] Invariant cache hit.
[2026-05-24 16:07:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 170/276 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/277 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 125 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9578 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 170/276 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 218/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/277 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 343 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8769 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18356ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 18357ms
Starting structural reductions in LTL mode, iteration 1 : 106/211 places, 219/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18439 ms. Remains : 106/211 places, 219/267 transitions.
[2026-05-24 16:08:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:08:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:08:01] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-24 16:08:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:08:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:08:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13478159223028532916.gal : 1 ms
[2026-05-24 16:08:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9285909436546981043.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/CTLFireability13478159223028532916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9285909436546981043.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.54975e+11,0.022298,4796,2,299,5,1200,6,0,584,862,0


Converting to forward existential form...Done !
original formula: EF(((AG(AF(E(((p128==1)&&(p296==1)) U ((p51==1)&&(p228==1))))) + ((p125==1)&&(p292==1))) + (AX(EG(((p127==0)||(p235==0)))) * (p28==1))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(E(((p128==1)&&(p296==1)) U ((p51==1)&&(p228==1))))))))))] != FALSE + [...292
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 214/4/5
Using saturation style SCC detection
(forward)formula 0,1,0.083768,7216,1,0,13,14356,29,2,2748,3023,13
FORMULA DLCround-PT-09a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 267/267 transitions.
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 128 transition count 267
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 106 place count 105 transition count 221
Iterating global reduction 1 with 23 rules applied. Total rules applied 129 place count 105 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 133 place count 105 transition count 217
Applied a total of 133 rules in 2 ms. Remains 105 /211 variables (removed 106) and now considering 217/267 (removed 50) transitions.
[2026-05-24 16:08:01] [INFO ] Flow matrix only has 170 transitions (discarded 47 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14800704693485167268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16231040358556322124.kers'
[2026-05-24 16:08:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14800704693485167268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16231040358556322124.kers]
Normalized transition count is 169 out of 170 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 169 rows 101 cols 351 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-24 16:08:01] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16231040358556322124.kers
Total runtime 1 ms.
[2026-05-24 16:08:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 16:08:01] [INFO ] Flow matrix only has 170 transitions (discarded 47 similar events)
[2026-05-24 16:08:01] [INFO ] Invariant cache hit.
[2026-05-24 16:08:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:08:01] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-24 16:08:01] [INFO ] Flow matrix only has 170 transitions (discarded 47 similar events)
[2026-05-24 16:08:01] [INFO ] Invariant cache hit.
[2026-05-24 16:08:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 169/274 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/275 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 124 constraints, problems are : Problem set: 0 solved, 216 unsolved in 9237 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 169/274 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 216/339 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 1/275 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 340 constraints, problems are : Problem set: 0 solved, 216 unsolved in 8508 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17756ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 17756ms
Starting structural reductions in LTL mode, iteration 1 : 105/211 places, 217/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17854 ms. Remains : 105/211 places, 217/267 transitions.
[2026-05-24 16:08:19] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:08:19] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:08:19] [INFO ] Input system was already deterministic with 217 transitions.
[2026-05-24 16:08:19] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:08:19] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:08:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18278394807687536778.gal : 0 ms
[2026-05-24 16:08:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8648049445092303780.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/CTLFireability18278394807687536778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8648049445092303780.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,6.71089e+11,0.022667,4788,2,296,5,1186,6,0,579,854,0


Converting to forward existential form...Done !
original formula: (AX(EX(((A(!(((p46==1)&&(p223==1))) U ((p55==1)&&(p228==1))) * (p57==1)) * (p292==1)))) + EG(((p7==0)||(p146==0))))
=> equivalent forward existential formula: [(EY((Init * !(EG(((p7==0)||(p146==0)))))) * !(EX(((!((E(!(((p55==1)&&(p228==1))) U (!(!(((p46==1)&&(p223==1))))...254
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 214/0/3
(forward)formula 0,0,0.089286,7176,1,0,14,15776,32,5,2550,4640,15
FORMULA DLCround-PT-09a-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 : 211/211 places, 267/267 transitions.
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 134 transition count 267
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 97 place count 114 transition count 227
Iterating global reduction 1 with 20 rules applied. Total rules applied 117 place count 114 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 114 transition count 224
Applied a total of 120 rules in 2 ms. Remains 114 /211 variables (removed 97) and now considering 224/267 (removed 43) transitions.
[2026-05-24 16:08:19] [INFO ] Flow matrix only has 174 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10516024836325604901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3935278107885653269.kers'
[2026-05-24 16:08:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10516024836325604901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3935278107885653269.kers]
Normalized transition count is 173 out of 174 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 173 rows 104 cols 359 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 16:08:19] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3935278107885653269.kers
Total runtime 1 ms.
[2026-05-24 16:08:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 16:08:19] [INFO ] Flow matrix only has 174 transitions (discarded 50 similar events)
[2026-05-24 16:08:19] [INFO ] Invariant cache hit.
[2026-05-24 16:08:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:08:19] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-24 16:08:19] [INFO ] Flow matrix only has 174 transitions (discarded 50 similar events)
[2026-05-24 16:08:19] [INFO ] Invariant cache hit.
[2026-05-24 16:08:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 10/114 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 173/287 variables, 114/138 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 1/288 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/288 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 139 constraints, problems are : Problem set: 0 solved, 223 unsolved in 10695 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 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/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 10/114 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 173/287 variables, 114/138 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 223/361 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/288 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/288 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 362 constraints, problems are : Problem set: 0 solved, 223 unsolved in 9871 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20589ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 20590ms
Starting structural reductions in LTL mode, iteration 1 : 114/211 places, 224/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20686 ms. Remains : 114/211 places, 224/267 transitions.
[2026-05-24 16:08:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 16:08:40] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:08:40] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-24 16:08:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:08:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:08:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3972561490708479831.gal : 1 ms
[2026-05-24 16:08:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15666222289533726574.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/CTLFireability3972561490708479831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15666222289533726574.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01922e+12,0.02608,4836,2,317,5,1266,6,0,601,899,0


Converting to forward existential form...Done !
original formula: AX((E(((!(E(((p28==1)&&(p160==1)) U ((p57==1)&&(p230==1)))) + !(((p96==1)&&(p178==1)))) + (((p81==1)&&(p53==1))&&((p229==1)&&(((p28==1)&&...388
=> equivalent forward existential formula: ([(EY(Init) * !(E(((!(E(((p28==1)&&(p160==1)) U ((p57==1)&&(p230==1)))) + !(((p96==1)&&(p178==1)))) + (((p81==1)...535
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 217/6/7
Hit Full ! (commute/partial/dont) 214/0/10
(forward)formula 0,1,0.171623,10852,1,0,62,39463,50,38,2880,26770,56
FORMULA DLCround-PT-09a-CTLFireability-2024-11 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 : 211/211 places, 267/267 transitions.
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 130 transition count 267
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 101 place count 110 transition count 227
Iterating global reduction 1 with 20 rules applied. Total rules applied 121 place count 110 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 123 place count 110 transition count 225
Applied a total of 123 rules in 3 ms. Remains 110 /211 variables (removed 101) and now considering 225/267 (removed 42) transitions.
[2026-05-24 16:08:40] [INFO ] Flow matrix only has 175 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12464848570896828740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8715873182347982703.kers'
[2026-05-24 16:08:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12464848570896828740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8715873182347982703.kers]
Normalized transition count is 174 out of 175 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 174 rows 104 cols 361 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 16:08:40] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8715873182347982703.kers
Total runtime 1 ms.
[2026-05-24 16:08:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 16:08:40] [INFO ] Flow matrix only has 175 transitions (discarded 50 similar events)
[2026-05-24 16:08:40] [INFO ] Invariant cache hit.
[2026-05-24 16:08:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:08:40] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2026-05-24 16:08:40] [INFO ] Flow matrix only has 175 transitions (discarded 50 similar events)
[2026-05-24 16:08:40] [INFO ] Invariant cache hit.
[2026-05-24 16:08:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 6/110 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 174/284 variables, 110/130 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 1/285 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 131 constraints, problems are : Problem set: 0 solved, 224 unsolved in 10030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 6/110 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 174/284 variables, 110/130 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 224/354 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 355 constraints, problems are : Problem set: 0 solved, 224 unsolved in 9039 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19086ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 19087ms
Starting structural reductions in LTL mode, iteration 1 : 110/211 places, 225/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19189 ms. Remains : 110/211 places, 225/267 transitions.
[2026-05-24 16:08:59] [INFO ] Flatten gal took : 9 ms
[2026-05-24 16:08:59] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:08:59] [INFO ] Input system was already deterministic with 225 transitions.
[2026-05-24 16:08:59] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:08:59] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:08:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6116613317654850316.gal : 1 ms
[2026-05-24 16:08:59] [INFO ] Time to serialize properties into /tmp/CTLFireability12444437070352886533.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/CTLFireability6116613317654850316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12444437070352886533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08716e+12,0.034179,4828,2,309,5,1244,6,0,598,888,0


Converting to forward existential form...Done !
original formula: (AG(AF(((p9==0)||(p203==0)))) * (AG(((p16==1)||((p97==1)&&(p287==1)))) + E(AG(!((((((p63==1)&&(p242==1))||((p47==1)&&(p209==1)))&&(p79==1...215
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(((p9==0)||(p203==0))))] = FALSE * [(FwdU((Init * !(E(!(E(TRUE U !(!((((((p63==1)&&(p242...317
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.097268,7088,1,0,9,15437,22,3,2737,3487,10
FORMULA DLCround-PT-09a-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 267/267 transitions.
Graph (trivial) has 206 edges and 211 vertex of which 78 / 211 are part of one of the 13 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Graph (complete) has 219 edges and 146 vertex of which 66 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.1 ms
Discarding 80 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 66 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 62 transition count 115
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 21 place count 51 transition count 99
Iterating global reduction 2 with 11 rules applied. Total rules applied 32 place count 51 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 51 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 38 place count 51 transition count 93
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 51 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 46 place count 47 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 47 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 54 place count 47 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 47 transition count 82
Applied a total of 57 rules in 22 ms. Remains 47 /211 variables (removed 164) and now considering 82/267 (removed 185) transitions.
[2026-05-24 16:08:59] [INFO ] Flow matrix only has 54 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5117833550393046177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12563120986105536094.kers'
[2026-05-24 16:08:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5117833550393046177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12563120986105536094.kers]
Normalized transition count is 53 out of 54 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 53 rows 39 cols 112 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-24 16:08:59] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12563120986105536094.kers
Total runtime 0 ms.
[2026-05-24 16:08:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 16:08:59] [INFO ] Flow matrix only has 54 transitions (discarded 28 similar events)
[2026-05-24 16:08:59] [INFO ] Invariant cache hit.
[2026-05-24 16:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:08:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2026-05-24 16:08:59] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-24 16:08:59] [INFO ] Flow matrix only has 54 transitions (discarded 28 similar events)
[2026-05-24 16:08:59] [INFO ] Invariant cache hit.
[2026-05-24 16:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 7/47 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 53/100 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/101 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 63 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1802 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 7/47 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 53/100 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 81/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/101 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 144 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1764 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3568ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3569ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/211 places, 82/267 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3670 ms. Remains : 47/211 places, 82/267 transitions.
[2026-05-24 16:09:03] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:09:03] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:09:03] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-24 16:09:03] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:09:03] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:09:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13580278071923678077.gal : 1 ms
[2026-05-24 16:09:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16591058797360534723.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/CTLFireability13580278071923678077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16591058797360534723.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,93313,0.012752,4172,2,133,5,551,6,0,220,388,0


Converting to forward existential form...Done !
original formula: A(((p127==1)||((p45==1)&&(p220==1))) U AF(((AG(((p87==1)&&(p174==1))) + ((p117==1)&&(p234==1))) + (((!(((p77==1)&&(p166==1))&&((p47==1)&&...231
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((!(E(TRUE U !(((p87==1)&&(p174==1))))) + ((p117==1)&&(p234==1))) + (((!(((p77==1)&&(p16...708
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.033691,5296,1,0,18,4884,26,10,1122,3711,19
FORMULA DLCround-PT-09a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 267/267 transitions.
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 137 transition count 267
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 91 place count 120 transition count 233
Iterating global reduction 1 with 17 rules applied. Total rules applied 108 place count 120 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 120 transition count 230
Applied a total of 111 rules in 2 ms. Remains 120 /211 variables (removed 91) and now considering 230/267 (removed 37) transitions.
[2026-05-24 16:09:03] [INFO ] Flow matrix only has 177 transitions (discarded 53 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8211965709740266245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4671128591395345230.kers'
[2026-05-24 16:09:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8211965709740266245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4671128591395345230.kers]
Normalized transition count is 176 out of 177 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 176 rows 107 cols 365 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-24 16:09:03] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4671128591395345230.kers
Total runtime 0 ms.
[2026-05-24 16:09:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 16:09:03] [INFO ] Flow matrix only has 177 transitions (discarded 53 similar events)
[2026-05-24 16:09:03] [INFO ] Invariant cache hit.
[2026-05-24 16:09:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:09:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-24 16:09:03] [INFO ] Flow matrix only has 177 transitions (discarded 53 similar events)
[2026-05-24 16:09:03] [INFO ] Invariant cache hit.
[2026-05-24 16:09:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 13/120 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 176/296 variables, 120/147 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 1/297 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 148 constraints, problems are : Problem set: 0 solved, 229 unsolved in 10612 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 13/120 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 176/296 variables, 120/147 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 229/376 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 1/297 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 377 constraints, problems are : Problem set: 0 solved, 229 unsolved in 9788 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20412ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 20412ms
Starting structural reductions in LTL mode, iteration 1 : 120/211 places, 230/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20501 ms. Remains : 120/211 places, 230/267 transitions.
[2026-05-24 16:09:24] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:09:24] [INFO ] Flatten gal took : 7 ms
[2026-05-24 16:09:24] [INFO ] Input system was already deterministic with 230 transitions.
[2026-05-24 16:09:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:09:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:09:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14655686671075022629.gal : 1 ms
[2026-05-24 16:09:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3027216094587546664.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/CTLFireability14655686671075022629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3027216094587546664.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65113e+12,0.038,4868,2,332,5,1327,6,0,619,927,0


Converting to forward existential form...Done !
original formula: EX((((EG(((A(((p47==1)&&(p226==1)) U ((p46==1)&&(p144==1))) + ((p41==1)&&(p219==1))) + ((p66==1)&&(p244==1)))) * (p71==1)) * ((p168==1)&&...374
=> equivalent forward existential formula: ([(((EY(Init) * ((EG(((!((E(!(((p46==1)&&(p144==1))) U (!(((p47==1)&&(p226==1))) * !(((p46==1)&&(p144==1))))) + ...904
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 220/0/10
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 226/0/4
Using saturation style SCC detection
(forward)formula 0,0,0.153694,9156,1,0,34,24553,68,14,3263,10112,32
FORMULA DLCround-PT-09a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 16:09:24] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:09:24] [INFO ] Flatten gal took : 4 ms
Total runtime 245223 ms.

BK_STOP 1779638964266

--------------------
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="DLCround-PT-09a"
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 DLCround-PT-09a, 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 r098-tall-177955695700602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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