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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.0K Mar 6 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 17:07 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.8K Mar 15 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 17:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 6 17:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 6 17:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 6 17:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:27 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 871K 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-12a-CTLFireability-2024-00
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-01
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-02
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-03
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-04
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-05
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-06
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-07
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-08
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-09
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-10
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-11
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-12
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-13
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-14
FORMULA_NAME DLCround-PT-12a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779646017891

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-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 18:06:59] [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 18:06:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 18:06:59] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2026-05-24 18:06:59] [INFO ] Transformed 419 places.
[2026-05-24 18:06:59] [INFO ] Transformed 3407 transitions.
[2026-05-24 18:06:59] [INFO ] Found NUPN structural information;
[2026-05-24 18:06:59] [INFO ] Parsed PT model containing 419 places and 3407 transitions and 13330 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 315 transitions
Reduce redundant transitions removed 315 transitions.
FORMULA DLCround-PT-12a-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 146 out of 419 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 419/419 places, 3092/3092 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 405 transition count 2856
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 405 transition count 2856
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 405 transition count 2854
Drop transitions (Redundant composition of simpler transitions.) removed 984 transitions
Redundant transition composition rules discarded 984 transitions
Iterating global reduction 1 with 984 rules applied. Total rules applied 1014 place count 405 transition count 1870
Applied a total of 1014 rules in 144 ms. Remains 405 /419 variables (removed 14) and now considering 1870/3092 (removed 1222) transitions.
[2026-05-24 18:06:59] [INFO ] Flow matrix only has 234 transitions (discarded 1636 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13304396044259298972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17118216057565956155.kers'
[2026-05-24 18:06:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13304396044259298972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17118216057565956155.kers]
Normalized transition count is 233 out of 234 initially.
Culling duplicate invariants (modulo rational): removing 260 columns.
Culled 260 columns in 0 ms.
// Phase 1: matrix 233 rows 145 cols 482 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-24 18:06:59] [INFO ] Computed 277 invariants in 1 ms
Computed 277 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17118216057565956155.kers
Total runtime 8 ms.
[2026-05-24 18:07:00] [INFO ] Implicit Places using invariants in 1177 ms returned [145, 146, 147, 149, 150, 153, 155, 157, 158, 160, 161, 162, 163, 166, 168, 169, 172, 173, 174, 175, 177, 178, 179, 181, 183, 184, 185, 187, 188, 191, 192, 193, 194, 195, 196, 198, 199, 200, 204, 205, 206, 207, 208, 211, 213, 215, 216, 219, 220, 223, 225, 226, 227, 228, 229, 230, 231, 233, 235, 236, 237, 238, 239, 241, 242, 243, 246, 247, 248, 249, 250, 251, 252, 256, 258, 259, 260, 263, 264, 265, 266, 267, 268, 269, 271, 272, 273, 274, 275, 276, 278, 279, 280, 282, 283, 284, 285, 286, 287, 288, 289, 291, 292, 294, 295, 296, 298, 299, 300, 301, 302, 303, 306, 308, 309, 310, 311, 312, 313, 314, 315, 316, 319, 320, 321, 322, 324, 325, 327, 329, 330, 331, 333, 336, 337, 338, 340, 343, 344, 346, 347, 348, 349, 350, 351, 352, 355, 357, 359, 363, 365, 367, 369, 371, 373, 375, 376, 377, 378, 381, 382, 383, 385, 386, 387, 388, 389, 390, 391, 392, 393, 397, 401, 402, 403, 404]
Discarding 176 places :
Ensure Unique test removed 1009 transitions
Reduce isomorphic transitions removed 1009 transitions.
Implicit Place search using SMT only with invariants took 1217 ms to find 176 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 229/419 places, 861/3092 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 548 transitions
Redundant transition composition rules discarded 548 transitions
Iterating global reduction 0 with 548 rules applied. Total rules applied 548 place count 229 transition count 313
Applied a total of 548 rules in 7 ms. Remains 229 /229 variables (removed 0) and now considering 313/861 (removed 548) transitions.
[2026-05-24 18:07:00] [INFO ] Flow matrix only has 234 transitions (discarded 79 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7992967840517243931.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9577584810504711326.kers'
[2026-05-24 18:07:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7992967840517243931.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9577584810504711326.kers]
Normalized transition count is 233 out of 234 initially.
Culling duplicate invariants (modulo rational): removing 84 columns.
Culled 84 columns in 0 ms.
// Phase 1: matrix 233 rows 145 cols 482 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-24 18:07:00] [INFO ] Computed 101 invariants in 0 ms
Computed 101 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9577584810504711326.kers
Total runtime 1 ms.
[2026-05-24 18:07:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-24 18:07:00] [INFO ] Flow matrix only has 234 transitions (discarded 79 similar events)
[2026-05-24 18:07:00] [INFO ] Invariant cache hit.
[2026-05-24 18:07:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:07:01] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 229/419 places, 313/3092 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1564 ms. Remains : 229/419 places, 313/3092 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2026-05-24 18:07:01] [INFO ] Flow matrix only has 234 transitions (discarded 79 similar events)
[2026-05-24 18:07:01] [INFO ] Invariant cache hit.
[2026-05-24 18:07:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 18:07:01] [INFO ] Flow matrix only has 234 transitions (discarded 79 similar events)
[2026-05-24 18:07:01] [INFO ] Invariant cache hit.
[2026-05-24 18:07:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:07:01] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2026-05-24 18:07:01] [INFO ] Flow matrix only has 234 transitions (discarded 79 similar events)
[2026-05-24 18:07:01] [INFO ] Invariant cache hit.
[2026-05-24 18:07:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 84/229 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 233/462 variables, 229/330 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 1/463 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 0/463 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 331 constraints, problems are : Problem set: 0 solved, 312 unsolved in 22325 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 229/229 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 84/229 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 233/462 variables, 229/330 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 312/642 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 1/463 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 0/463 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 643 constraints, problems are : Problem set: 0 solved, 312 unsolved in 25907 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 229/229 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48316ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 48344ms
Finished structural reductions in LTL mode , in 1 iterations and 48538 ms. Remains : 229/229 places, 313/313 transitions.
Support contains 146 out of 229 places after structural reductions.
[2026-05-24 18:07:49] [INFO ] Flatten gal took : 45 ms
[2026-05-24 18:07:49] [INFO ] Flatten gal took : 18 ms
[2026-05-24 18:07:49] [INFO ] Input system was already deterministic with 313 transitions.
Support contains 145 out of 229 places (down from 146) after GAL structural reductions.
RANDOM walk for 8060 steps (0 resets) in 535 ms. (15 steps per ms) remains 0/78 properties
[2026-05-24 18:07:50] [INFO ] Flatten gal took : 12 ms
[2026-05-24 18:07:50] [INFO ] Flatten gal took : 13 ms
[2026-05-24 18:07:50] [INFO ] Input system was already deterministic with 313 transitions.
Computed a total of 85 stabilizing places and 1 stable transitions
Graph (complete) has 413 edges and 229 vertex of which 145 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 153 transition count 313
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 95 place count 134 transition count 275
Iterating global reduction 1 with 19 rules applied. Total rules applied 114 place count 134 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 116 place count 134 transition count 273
Applied a total of 116 rules in 7 ms. Remains 134 /229 variables (removed 95) and now considering 273/313 (removed 40) transitions.
[2026-05-24 18:07:50] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17461814951151068971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5588550092891581443.kers'
[2026-05-24 18:07:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17461814951151068971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5588550092891581443.kers]
Normalized transition count is 212 out of 213 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 212 rows 126 cols 440 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 18:07:50] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5588550092891581443.kers
Total runtime 1 ms.
[2026-05-24 18:07:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 18:07:50] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2026-05-24 18:07:50] [INFO ] Invariant cache hit.
[2026-05-24 18:07:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:07:50] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2026-05-24 18:07:50] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2026-05-24 18:07:50] [INFO ] Invariant cache hit.
[2026-05-24 18:07:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 8/134 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/346 variables, 134/159 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/347 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/347 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 160 constraints, problems are : Problem set: 0 solved, 272 unsolved in 14102 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 8/134 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/346 variables, 134/159 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 272/431 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 432 constraints, problems are : Problem set: 0 solved, 272 unsolved in 12827 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26949ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 26951ms
Starting structural reductions in LTL mode, iteration 1 : 134/229 places, 273/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27072 ms. Remains : 134/229 places, 273/313 transitions.
[2026-05-24 18:08:17] [INFO ] Flatten gal took : 13 ms
[2026-05-24 18:08:17] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:08:17] [INFO ] Input system was already deterministic with 273 transitions.
[2026-05-24 18:08:17] [INFO ] Flatten gal took : 10 ms
[2026-05-24 18:08:17] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:08:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1197220572696124643.gal : 3 ms
[2026-05-24 18:08:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5495437027216325799.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1197220572696124643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5495437027216325799.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,3.86547e+14,0.039106,4988,2,376,5,1510,6,0,726,1087,0


Converting to forward existential form...Done !
original formula: (AG((((((p47==1)&&(p173==1)) + E(((p7==1)&&(p168==1)) U EX(((p115==1)&&(p226==1))))) + (AF(((p88==1)&&(p200==1))) + A(((p73==1)&&(p321==1...292
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(((((p47==1)&&(p173==1)) + E(((p7==1)&&(p168==1)) U EX(((p115==1)&&(p226==1))))) + (!...505
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 269/0/4
Hit Full ! (commute/partial/dont) 266/6/7
Hit Full ! (commute/partial/dont) 271/0/2
(forward)formula 0,0,0.214622,11164,1,0,44,36453,65,25,3681,22841,45
FORMULA DLCround-PT-12a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 159 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 86 place count 143 transition count 281
Iterating global reduction 1 with 16 rules applied. Total rules applied 102 place count 143 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 143 transition count 279
Applied a total of 104 rules in 9 ms. Remains 143 /229 variables (removed 86) and now considering 279/313 (removed 34) transitions.
[2026-05-24 18:08:17] [INFO ] Flow matrix only has 216 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17684382799690973985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5993312564186533412.kers'
[2026-05-24 18:08:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17684382799690973985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5993312564186533412.kers]
Normalized transition count is 215 out of 216 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 215 rows 129 cols 446 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 18:08:17] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5993312564186533412.kers
Total runtime 3 ms.
[2026-05-24 18:08:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 18:08:17] [INFO ] Flow matrix only has 216 transitions (discarded 63 similar events)
[2026-05-24 18:08:17] [INFO ] Invariant cache hit.
[2026-05-24 18:08:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:08:17] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-24 18:08:17] [INFO ] Flow matrix only has 216 transitions (discarded 63 similar events)
[2026-05-24 18:08:17] [INFO ] Invariant cache hit.
[2026-05-24 18:08:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 14/143 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 215/358 variables, 143/174 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 1/359 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 0/359 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 175 constraints, problems are : Problem set: 0 solved, 278 unsolved in 15173 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 143/143 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 14/143 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 215/358 variables, 143/174 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 278/452 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 1/359 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (OVERLAPS) 0/359 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 453 constraints, problems are : Problem set: 0 solved, 278 unsolved in 14277 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 143/143 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29470ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 29471ms
Starting structural reductions in LTL mode, iteration 1 : 143/229 places, 279/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29622 ms. Remains : 143/229 places, 279/313 transitions.
[2026-05-24 18:08:47] [INFO ] Flatten gal took : 12 ms
[2026-05-24 18:08:47] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:08:47] [INFO ] Input system was already deterministic with 279 transitions.
[2026-05-24 18:08:47] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:08:47] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:08:47] [INFO ] Time to serialize gal into /tmp/CTLFireability272405574111201311.gal : 3 ms
[2026-05-24 18:08:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15608839111790225264.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/CTLFireability272405574111201311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15608839111790225264.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,5.50377e+14,0.035256,5116,2,397,5,1589,6,0,747,1132,0


Converting to forward existential form...Done !
original formula: AG((((EX(((p157==1)&&(p259==1))) + EX(EG(((p151==1)&&(p414==1))))) + ((EF(AX((((p124==1)&&(p375==1))||((p126==1)&&(p376==1))))) * AG(EF((...433
=> equivalent forward existential formula: ((([((((FwdU(Init,TRUE) * !(((E(((p64==1)&&(p190==1)) U ((p97==1)&&(p353==1))) * ((p127==0)||(p235==0))) * ((p37...1582
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 275/4/4
(forward)formula 0,0,0.150419,8964,1,0,24,24429,38,10,3521,5606,22
FORMULA DLCround-PT-12a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 149 transition count 313
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 98 place count 131 transition count 277
Iterating global reduction 1 with 18 rules applied. Total rules applied 116 place count 131 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 131 transition count 275
Applied a total of 118 rules in 3 ms. Remains 131 /229 variables (removed 98) and now considering 275/313 (removed 38) transitions.
[2026-05-24 18:08:47] [INFO ] Flow matrix only has 214 transitions (discarded 61 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8303454130558103696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10859197300964126241.kers'
[2026-05-24 18:08:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8303454130558103696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10859197300964126241.kers]
Normalized transition count is 213 out of 214 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 213 rows 127 cols 442 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 18:08:47] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10859197300964126241.kers
Total runtime 1 ms.
[2026-05-24 18:08:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 18:08:47] [INFO ] Flow matrix only has 214 transitions (discarded 61 similar events)
[2026-05-24 18:08:47] [INFO ] Invariant cache hit.
[2026-05-24 18:08:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:08:47] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2026-05-24 18:08:47] [INFO ] Flow matrix only has 214 transitions (discarded 61 similar events)
[2026-05-24 18:08:47] [INFO ] Invariant cache hit.
[2026-05-24 18:08:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 213/344 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/345 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 153 constraints, problems are : Problem set: 0 solved, 274 unsolved in 14189 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 213/344 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 274/426 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 427 constraints, problems are : Problem set: 0 solved, 274 unsolved in 13305 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27514ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 27515ms
Starting structural reductions in LTL mode, iteration 1 : 131/229 places, 275/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27637 ms. Remains : 131/229 places, 275/313 transitions.
[2026-05-24 18:09:15] [INFO ] Flatten gal took : 14 ms
[2026-05-24 18:09:15] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:09:15] [INFO ] Input system was already deterministic with 275 transitions.
[2026-05-24 18:09:15] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:09:15] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:09:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6705661853106108671.gal : 2 ms
[2026-05-24 18:09:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1619800386354336687.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/CTLFireability6705661853106108671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1619800386354336687.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,4.34865e+14,0.03208,5088,2,371,5,1501,6,0,727,1086,0


Converting to forward existential form...Done !
original formula: EX(AX(AG((AF(((p37==0)||(p165==0))) + ((((p122==1)&&(p380==1))&&((p28==1)&&(p254==1))) * EX(((p44==1)&&(p284==1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(TRUE U !((!(EG(!(((p37==0)||(p165==0))))) + ((((p122==1)&&(p380==1))&&((p28==1)&&(p254==...206
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.125161,8436,1,0,14,24098,25,4,3183,6598,12
FORMULA DLCround-PT-12a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 150 transition count 313
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 98 place count 131 transition count 275
Iterating global reduction 1 with 19 rules applied. Total rules applied 117 place count 131 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 131 transition count 273
Applied a total of 119 rules in 3 ms. Remains 131 /229 variables (removed 98) and now considering 273/313 (removed 40) transitions.
[2026-05-24 18:09:15] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13379118047066620246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15747418362040762939.kers'
[2026-05-24 18:09:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13379118047066620246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15747418362040762939.kers]
Normalized transition count is 212 out of 213 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 212 rows 126 cols 440 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 18:09:15] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15747418362040762939.kers
Total runtime 2 ms.
[2026-05-24 18:09:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 18:09:15] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2026-05-24 18:09:15] [INFO ] Invariant cache hit.
[2026-05-24 18:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:09:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2026-05-24 18:09:15] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2026-05-24 18:09:15] [INFO ] Invariant cache hit.
[2026-05-24 18:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 5/131 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/343 variables, 131/153 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 154 constraints, problems are : Problem set: 0 solved, 272 unsolved in 14270 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 131/131 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 5/131 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/343 variables, 131/153 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 272/425 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/344 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/344 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 426 constraints, problems are : Problem set: 0 solved, 272 unsolved in 13006 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 131/131 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27288ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 27289ms
Starting structural reductions in LTL mode, iteration 1 : 131/229 places, 273/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27408 ms. Remains : 131/229 places, 273/313 transitions.
[2026-05-24 18:09:42] [INFO ] Flatten gal took : 11 ms
[2026-05-24 18:09:42] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:09:42] [INFO ] Input system was already deterministic with 273 transitions.
[2026-05-24 18:09:42] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:09:42] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:09:42] [INFO ] Time to serialize gal into /tmp/CTLFireability15446485631680676727.gal : 1 ms
[2026-05-24 18:09:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8193625637131406733.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/CTLFireability15446485631680676727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8193625637131406733.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,3.86547e+14,0.030731,5076,2,370,5,1491,6,0,723,1075,0


Converting to forward existential form...Done !
original formula: EG((AG(AX(((((p127==1)&&(p331==1))&&((p57==1)&&(p179==1))) + EX(((p107==1)&&(p356==1)))))) * (AX(AF(((p97==0)||(p413==0)))) + ((p119==1)&...169
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EX(!(((((p127==1)&&(p331==1))&&((p57==1)&&(p179==1))) + EX(((p107==1)&&(p356==1))))))...242
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.120735,8340,1,0,17,23441,30,4,3177,5928,15
FORMULA DLCround-PT-12a-CTLFireability-2024-03 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 : 229/229 places, 313/313 transitions.
Graph (trivial) has 309 edges and 229 vertex of which 143 / 229 are part of one of the 17 SCC in 3 ms
Free SCC test removed 126 places
Ensure Unique test removed 292 transitions
Reduce isomorphic transitions removed 292 transitions.
Graph (complete) has 121 edges and 103 vertex of which 20 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.1 ms
Discarding 83 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 17 place count 5 transition count 6
Iterating global reduction 0 with 15 rules applied. Total rules applied 32 place count 5 transition count 6
Applied a total of 32 rules in 13 ms. Remains 5 /229 variables (removed 224) and now considering 6/313 (removed 307) transitions.
[2026-05-24 18:09:42] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18332610666824346731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13418659614066578345.kers'
[2026-05-24 18:09:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18332610666824346731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13418659614066578345.kers]
Normalized transition count is 3 out of 4 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 3 rows 3 cols 6 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 18:09:42] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13418659614066578345.kers
Total runtime 0 ms.
[2026-05-24 18:09:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 18:09:42] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2026-05-24 18:09:42] [INFO ] Invariant cache hit.
[2026-05-24 18:09:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:09:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2026-05-24 18:09:42] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 18:09:42] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2026-05-24 18:09:42] [INFO ] Invariant cache hit.
[2026-05-24 18:09:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/229 places, 6/313 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 178 ms. Remains : 5/229 places, 6/313 transitions.
[2026-05-24 18:09:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:09:42] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:09:42] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-24 18:09:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:09:42] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:09:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2646884983586079426.gal : 0 ms
[2026-05-24 18:09:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15912007449177361415.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/CTLFireability2646884983586079426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15912007449177361415.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,3,0.001767,3744,2,10,5,30,6,0,20,16,0


Converting to forward existential form...Done !
original formula: AG(EF(((p141==0)||(p248==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p141==0)||(p248==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.002687,4036,1,0,6,52,14,0,86,33,5
FORMULA DLCround-PT-12a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 146 transition count 313
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 102 place count 127 transition count 275
Iterating global reduction 1 with 19 rules applied. Total rules applied 121 place count 127 transition count 275
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 127 transition count 273
Applied a total of 123 rules in 2 ms. Remains 127 /229 variables (removed 102) and now considering 273/313 (removed 40) transitions.
[2026-05-24 18:09:43] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5700378649423260067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1017811540048872956.kers'
[2026-05-24 18:09:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5700378649423260067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1017811540048872956.kers]
Normalized transition count is 212 out of 213 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 212 rows 126 cols 440 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 18:09:43] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1017811540048872956.kers
Total runtime 1 ms.
[2026-05-24 18:09:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 18:09:43] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2026-05-24 18:09:43] [INFO ] Invariant cache hit.
[2026-05-24 18:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:09:43] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2026-05-24 18:09:43] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2026-05-24 18:09:43] [INFO ] Invariant cache hit.
[2026-05-24 18:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/339 variables, 127/145 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/340 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 146 constraints, problems are : Problem set: 0 solved, 272 unsolved in 13942 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 127/127 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/339 variables, 127/145 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 272/417 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 418 constraints, problems are : Problem set: 0 solved, 272 unsolved in 12670 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 127/127 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26625ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 26625ms
Starting structural reductions in LTL mode, iteration 1 : 127/229 places, 273/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26725 ms. Remains : 127/229 places, 273/313 transitions.
[2026-05-24 18:10:09] [INFO ] Flatten gal took : 17 ms
[2026-05-24 18:10:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:10:09] [INFO ] Input system was already deterministic with 273 transitions.
[2026-05-24 18:10:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:10:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:10:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12431942292041644512.gal : 1 ms
[2026-05-24 18:10:09] [INFO ] Time to serialize properties into /tmp/CTLFireability1676968491095970765.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/CTLFireability12431942292041644512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1676968491095970765.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,3.86547e+14,0.031067,5068,2,362,5,1467,6,0,719,1063,0


Converting to forward existential form...Done !
original formula: AX(AX(AG(EX(((p69==0)||(p194==0))))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * !(EX(((p69==0)||(p194==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.086157,7384,1,0,6,19424,10,0,2769,2584,4
FORMULA DLCround-PT-12a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Graph (trivial) has 304 edges and 229 vertex of which 140 / 229 are part of one of the 17 SCC in 2 ms
Free SCC test removed 123 places
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 285 transitions.
Graph (complete) has 128 edges and 106 vertex of which 25 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.1 ms
Discarding 81 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 12 transition count 15
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 12 transition count 15
Applied a total of 28 rules in 10 ms. Remains 12 /229 variables (removed 217) and now considering 15/313 (removed 298) transitions.
[2026-05-24 18:10:09] [INFO ] Flow matrix only has 9 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1880287737827442113.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10455317859076292082.kers'
[2026-05-24 18:10:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1880287737827442113.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10455317859076292082.kers]
Normalized transition count is 8 out of 9 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 8 rows 8 cols 18 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 18:10:09] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10455317859076292082.kers
Total runtime 1 ms.
[2026-05-24 18:10:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 18:10:09] [INFO ] Flow matrix only has 9 transitions (discarded 6 similar events)
[2026-05-24 18:10:09] [INFO ] Invariant cache hit.
[2026-05-24 18:10:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:10:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-24 18:10:09] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2026-05-24 18:10:09] [INFO ] Flow matrix only has 9 transitions (discarded 6 similar events)
[2026-05-24 18:10:09] [INFO ] Invariant cache hit.
[2026-05-24 18:10:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 20 constraints, problems are : Problem set: 0 solved, 14 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 34 constraints, problems are : Problem set: 0 solved, 14 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 311ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/229 places, 15/313 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 395 ms. Remains : 12/229 places, 15/313 transitions.
[2026-05-24 18:10:10] [INFO ] Flatten gal took : 2 ms
[2026-05-24 18:10:10] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:10:10] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-24 18:10:10] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:10:10] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:10:10] [INFO ] Time to serialize gal into /tmp/CTLFireability14294072184526514896.gal : 0 ms
[2026-05-24 18:10:10] [INFO ] Time to serialize properties into /tmp/CTLFireability338034946938267454.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/CTLFireability14294072184526514896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability338034946938267454.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.002521,3808,2,26,5,87,6,0,47,54,0


Converting to forward existential form...Done !
original formula: EF(EG((AG((((p139==0)||(p398==0))&&((p39==0)||(p275==0)))) + ((p105==1)&&(p216==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !((((p139==0)||(p398==0))&&((p39==0)||(p275==0)))))) + ((p105==1)&&(p216==1)))...166
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.005185,4212,1,0,9,224,22,2,248,152,13
FORMULA DLCround-PT-12a-CTLFireability-2024-06 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 : 229/229 places, 313/313 transitions.
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 153 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 92 place count 137 transition count 281
Iterating global reduction 1 with 16 rules applied. Total rules applied 108 place count 137 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 137 transition count 279
Applied a total of 110 rules in 2 ms. Remains 137 /229 variables (removed 92) and now considering 279/313 (removed 34) transitions.
[2026-05-24 18:10:10] [INFO ] Flow matrix only has 216 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14828435292633999250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8368616399681601224.kers'
[2026-05-24 18:10:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14828435292633999250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8368616399681601224.kers]
Normalized transition count is 215 out of 216 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 215 rows 129 cols 446 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 18:10:10] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8368616399681601224.kers
Total runtime 1 ms.
[2026-05-24 18:10:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 18:10:10] [INFO ] Flow matrix only has 216 transitions (discarded 63 similar events)
[2026-05-24 18:10:10] [INFO ] Invariant cache hit.
[2026-05-24 18:10:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:10:10] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-24 18:10:10] [INFO ] Flow matrix only has 216 transitions (discarded 63 similar events)
[2026-05-24 18:10:10] [INFO ] Invariant cache hit.
[2026-05-24 18:10:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 8/137 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 215/352 variables, 137/162 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 163 constraints, problems are : Problem set: 0 solved, 278 unsolved in 14644 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 8/137 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 215/352 variables, 137/162 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 278/440 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 441 constraints, problems are : Problem set: 0 solved, 278 unsolved in 13298 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27955ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 27955ms
Starting structural reductions in LTL mode, iteration 1 : 137/229 places, 279/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28080 ms. Remains : 137/229 places, 279/313 transitions.
[2026-05-24 18:10:38] [INFO ] Flatten gal took : 11 ms
[2026-05-24 18:10:38] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:10:38] [INFO ] Input system was already deterministic with 279 transitions.
[2026-05-24 18:10:38] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:10:38] [INFO ] Flatten gal took : 10 ms
[2026-05-24 18:10:38] [INFO ] Time to serialize gal into /tmp/CTLFireability32021683022236473.gal : 1 ms
[2026-05-24 18:10:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11650861581236839917.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/CTLFireability32021683022236473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11650861581236839917.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,5.79821e+14,0.034362,5112,2,385,5,1553,6,0,741,1109,0


Converting to forward existential form...Done !
original formula: ((EG((((p157==1)&&(p346==1))||((p4==1)&&(p223==1)))) + EG((((p112==1)&&(p368==1))||((p28==1)&&(p246==1))))) + (EF(AG(((p49==0)||(p295==0)...255
=> equivalent forward existential formula: (([FwdG(Init,(((p157==1)&&(p346==1))||((p4==1)&&(p223==1))))] != FALSE + [FwdG(Init,(((p112==1)&&(p368==1))||((p...487
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.134581,9128,1,0,17,23764,52,9,3524,5219,24
FORMULA DLCround-PT-12a-CTLFireability-2024-07 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 : 229/229 places, 313/313 transitions.
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 149 transition count 313
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 99 place count 130 transition count 275
Iterating global reduction 1 with 19 rules applied. Total rules applied 118 place count 130 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 130 transition count 273
Applied a total of 120 rules in 7 ms. Remains 130 /229 variables (removed 99) and now considering 273/313 (removed 40) transitions.
[2026-05-24 18:10:38] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8127760060739973525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12054543910804768283.kers'
[2026-05-24 18:10:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8127760060739973525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12054543910804768283.kers]
Normalized transition count is 212 out of 213 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 212 rows 126 cols 440 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 18:10:38] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12054543910804768283.kers
Total runtime 3 ms.
[2026-05-24 18:10:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 18:10:38] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2026-05-24 18:10:38] [INFO ] Invariant cache hit.
[2026-05-24 18:10:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:10:38] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2026-05-24 18:10:38] [INFO ] Flow matrix only has 213 transitions (discarded 60 similar events)
[2026-05-24 18:10:38] [INFO ] Invariant cache hit.
[2026-05-24 18:10:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 4/130 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/342 variables, 130/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 152 constraints, problems are : Problem set: 0 solved, 272 unsolved in 14368 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 4/130 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 212/342 variables, 130/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 272/423 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 424 constraints, problems are : Problem set: 0 solved, 272 unsolved in 12671 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27052ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 27053ms
Starting structural reductions in LTL mode, iteration 1 : 130/229 places, 273/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27178 ms. Remains : 130/229 places, 273/313 transitions.
[2026-05-24 18:11:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 18:11:05] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:11:05] [INFO ] Input system was already deterministic with 273 transitions.
[2026-05-24 18:11:05] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:11:05] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:11:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15722590398470248452.gal : 1 ms
[2026-05-24 18:11:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7967906335691361555.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/CTLFireability15722590398470248452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7967906335691361555.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,3.86547e+14,0.031505,5080,2,368,5,1485,6,0,722,1072,0


Converting to forward existential form...Done !
original formula: EG((AX(((EX(((p93==0)||(p337==0))) + (p57==0)) + (p181==0))) * (((p7==0)||(p216==0))||((p151==0)||(p408==0)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(((EX(((p93==0)||(p337==0))) + (p57==0)) + (p181==0))))) * (((p7==0)||(p216==0))||((p151==0)||...178
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.425702,21488,1,0,149,70722,19,101,2939,123298,110
FORMULA DLCround-PT-12a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Graph (trivial) has 294 edges and 229 vertex of which 133 / 229 are part of one of the 16 SCC in 1 ms
Free SCC test removed 117 places
Ensure Unique test removed 273 transitions
Reduce isomorphic transitions removed 273 transitions.
Graph (complete) has 140 edges and 112 vertex of which 33 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.0 ms
Discarding 79 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 33 transition count 38
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 31 transition count 37
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 19 place count 19 transition count 25
Iterating global reduction 2 with 12 rules applied. Total rules applied 31 place count 19 transition count 25
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 32 place count 19 transition count 24
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 33 place count 19 transition count 24
Applied a total of 33 rules in 8 ms. Remains 19 /229 variables (removed 210) and now considering 24/313 (removed 289) transitions.
[2026-05-24 18:11:06] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3472893991838311468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7326176206551794545.kers'
[2026-05-24 18:11:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3472893991838311468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7326176206551794545.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 15 rows 13 cols 33 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 18:11:06] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7326176206551794545.kers
Total runtime 0 ms.
[2026-05-24 18:11:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 18:11:06] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
[2026-05-24 18:11:06] [INFO ] Invariant cache hit.
[2026-05-24 18:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:11:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-24 18:11:06] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2026-05-24 18:11:06] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
[2026-05-24 18:11:06] [INFO ] Invariant cache hit.
[2026-05-24 18:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 5/19 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 15/34 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 30 constraints, problems are : Problem set: 0 solved, 23 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 5/19 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 15/34 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 23/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 53 constraints, problems are : Problem set: 0 solved, 23 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 587ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/229 places, 24/313 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 643 ms. Remains : 19/229 places, 24/313 transitions.
[2026-05-24 18:11:06] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:11:06] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:11:06] [INFO ] Input system was already deterministic with 24 transitions.
[2026-05-24 18:11:06] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:11:06] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:11:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14356620900245475806.gal : 0 ms
[2026-05-24 18:11:06] [INFO ] Time to serialize properties into /tmp/CTLFireability217951593764256032.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/CTLFireability14356620900245475806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability217951593764256032.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,61,0.006052,3856,2,44,5,148,6,0,76,95,0


Converting to forward existential form...Done !
original formula: A(EG((((p9==1)&&(p217==1))&&(!((p74==1)&&(p194==1))))) U EF(((((p21==1)&&(p204==1)) * (EF(((p16==1)&&(p235==1))) * (p156==1))) * (p258==1...159
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((((p21==1)&&(p204==1)) * (E(TRUE U ((p16==1)&&(p235==1))) * (p156==1))) * (p258==1)))...438
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.013678,4392,1,0,10,498,25,4,391,229,13
FORMULA DLCround-PT-12a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 149 transition count 313
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 100 place count 129 transition count 273
Iterating global reduction 1 with 20 rules applied. Total rules applied 120 place count 129 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 122 place count 129 transition count 271
Applied a total of 122 rules in 2 ms. Remains 129 /229 variables (removed 100) and now considering 271/313 (removed 42) transitions.
[2026-05-24 18:11:06] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15825394993341938591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6380188286627046389.kers'
[2026-05-24 18:11:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15825394993341938591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6380188286627046389.kers]
Normalized transition count is 211 out of 212 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 211 rows 125 cols 438 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-24 18:11:06] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6380188286627046389.kers
Total runtime 1 ms.
[2026-05-24 18:11:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 18:11:06] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2026-05-24 18:11:06] [INFO ] Invariant cache hit.
[2026-05-24 18:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:11:06] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2026-05-24 18:11:06] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2026-05-24 18:11:06] [INFO ] Invariant cache hit.
[2026-05-24 18:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 4/129 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 211/340 variables, 129/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/341 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13791 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 4/129 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 211/340 variables, 129/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/341 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 12802 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26606ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 26607ms
Starting structural reductions in LTL mode, iteration 1 : 129/229 places, 271/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26711 ms. Remains : 129/229 places, 271/313 transitions.
[2026-05-24 18:11:33] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:11:33] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:11:33] [INFO ] Input system was already deterministic with 271 transitions.
[2026-05-24 18:11:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:11:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13537080446951662566.gal : 1 ms
[2026-05-24 18:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7052904766894125692.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/CTLFireability13537080446951662566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7052904766894125692.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,3.43597e+14,0.037681,5060,2,365,5,1471,6,0,717,1064,0


Converting to forward existential form...Done !
original formula: AF(AG(AX((!(E(((p67==1)&&(p184==1)) U ((p14==1)&&(p194==1)))) + !(A(((p106==1)&&(p356==1)) U ((p115==1)&&(p228==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EX(!((!(E(((p67==1)&&(p184==1)) U ((p14==1)&&(p194==1)))) + !(!((E(!(((p115==1)&&(p2...275
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 261/10/10
Hit Full ! (commute/partial/dont) 268/0/3
(forward)formula 0,0,0.157802,8912,1,0,15,23775,38,4,3579,6723,20
FORMULA DLCround-PT-12a-CTLFireability-2024-10 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 : 229/229 places, 313/313 transitions.
Graph (trivial) has 308 edges and 229 vertex of which 141 / 229 are part of one of the 18 SCC in 2 ms
Free SCC test removed 123 places
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 285 transitions.
Graph (complete) has 128 edges and 106 vertex of which 23 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.1 ms
Discarding 83 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 23 transition count 27
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 22 transition count 26
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 20 place count 7 transition count 11
Iterating global reduction 2 with 15 rules applied. Total rules applied 35 place count 7 transition count 11
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 36 place count 7 transition count 10
Applied a total of 36 rules in 11 ms. Remains 7 /229 variables (removed 222) and now considering 10/313 (removed 303) transitions.
[2026-05-24 18:11:33] [INFO ] Flow matrix only has 6 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6938781810017485843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6739810756650961714.kers'
[2026-05-24 18:11:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6938781810017485843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6739810756650961714.kers]
Normalized transition count is 5 out of 6 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 10 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 18:11:33] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6739810756650961714.kers
Total runtime 0 ms.
[2026-05-24 18:11:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 18:11:33] [INFO ] Flow matrix only has 6 transitions (discarded 4 similar events)
[2026-05-24 18:11:33] [INFO ] Invariant cache hit.
[2026-05-24 18:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:11:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-24 18:11:33] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 18:11:33] [INFO ] Flow matrix only has 6 transitions (discarded 4 similar events)
[2026-05-24 18:11:33] [INFO ] Invariant cache hit.
[2026-05-24 18:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/13 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/13 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/13 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 215ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/229 places, 10/313 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 276 ms. Remains : 7/229 places, 10/313 transitions.
[2026-05-24 18:11:34] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:11:34] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:11:34] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-24 18:11:34] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:11:34] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8686016061918583203.gal : 0 ms
[2026-05-24 18:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10373124810024405940.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/CTLFireability8686016061918583203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10373124810024405940.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5,0.002071,3772,2,14,5,48,6,0,30,28,0


Converting to forward existential form...Done !
original formula: EF(AG(((p58==1)&&(p178==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p58==1)&&(p178==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.003163,4044,1,0,6,94,15,0,133,54,5
FORMULA DLCround-PT-12a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Graph (trivial) has 262 edges and 229 vertex of which 108 / 229 are part of one of the 17 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Graph (complete) has 200 edges and 138 vertex of which 62 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.0 ms
Discarding 76 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 62 transition count 98
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 60 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 57 transition count 95
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 25 place count 44 transition count 78
Iterating global reduction 3 with 13 rules applied. Total rules applied 38 place count 44 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 44 transition count 77
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 42 place count 44 transition count 74
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 44 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 46 place count 42 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 42 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 50 place count 42 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 52 place count 42 transition count 68
Applied a total of 52 rules in 14 ms. Remains 42 /229 variables (removed 187) and now considering 68/313 (removed 245) transitions.
[2026-05-24 18:11:34] [INFO ] Flow matrix only has 44 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1431230985213546159.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18195995028780618898.kers'
[2026-05-24 18:11:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1431230985213546159.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18195995028780618898.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 43 rows 33 cols 92 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-24 18:11:34] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18195995028780618898.kers
Total runtime 1 ms.
[2026-05-24 18:11:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-24 18:11:34] [INFO ] Flow matrix only has 44 transitions (discarded 24 similar events)
[2026-05-24 18:11:34] [INFO ] Invariant cache hit.
[2026-05-24 18:11:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:11:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2026-05-24 18:11:34] [INFO ] Redundant transitions in 0 ms returned []
Running 67 sub problems to find dead transitions.
[2026-05-24 18:11:34] [INFO ] Flow matrix only has 44 transitions (discarded 24 similar events)
[2026-05-24 18:11:34] [INFO ] Invariant cache hit.
[2026-05-24 18:11:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 8/42 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 43/85 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/86 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 59 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 8/42 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 43/85 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 67/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 1/86 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 126 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2559ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2560ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/229 places, 68/313 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2641 ms. Remains : 42/229 places, 68/313 transitions.
[2026-05-24 18:11:36] [INFO ] Flatten gal took : 2 ms
[2026-05-24 18:11:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:11:36] [INFO ] Input system was already deterministic with 68 transitions.
[2026-05-24 18:11:36] [INFO ] Flatten gal took : 2 ms
[2026-05-24 18:11:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:11:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13945604095208659309.gal : 1 ms
[2026-05-24 18:11:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11155189162697378489.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/CTLFireability13945604095208659309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11155189162697378489.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,27217,0.012064,4104,2,118,5,456,6,0,187,315,0


Converting to forward existential form...Done !
original formula: A(((p138==1)&&(p393==1)) U !(E(!(((p117==1)&&(p318==1))) U ((((((((p116==1)&&(p359==1))&&(((p104==1)&&(p349==1))||((p7==1)&&(p231==1)))) ...276
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(!(((p117==1)&&(p318==1))) U ((((((((p116==1)&&(p359==1))&&(((p104==1)&&(p349==1))||((p7==1)...831
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 59/0/9
Using saturation style SCC detection
(forward)formula 0,0,0.03707,5036,1,0,22,2981,36,11,993,1614,23
FORMULA DLCround-PT-12a-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 172 transition count 313
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 72 place count 157 transition count 283
Iterating global reduction 1 with 15 rules applied. Total rules applied 87 place count 157 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 157 transition count 281
Applied a total of 89 rules in 6 ms. Remains 157 /229 variables (removed 72) and now considering 281/313 (removed 32) transitions.
[2026-05-24 18:11:36] [INFO ] Flow matrix only has 217 transitions (discarded 64 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13077503293856820503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1731602208010321450.kers'
[2026-05-24 18:11:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13077503293856820503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1731602208010321450.kers]
Normalized transition count is 216 out of 217 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 216 rows 130 cols 448 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-24 18:11:36] [INFO ] Computed 44 invariants in 2 ms
Computed 44 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1731602208010321450.kers
Total runtime 2 ms.
[2026-05-24 18:11:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 18:11:36] [INFO ] Flow matrix only has 217 transitions (discarded 64 similar events)
[2026-05-24 18:11:36] [INFO ] Invariant cache hit.
[2026-05-24 18:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:11:36] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2026-05-24 18:11:36] [INFO ] Flow matrix only has 217 transitions (discarded 64 similar events)
[2026-05-24 18:11:36] [INFO ] Invariant cache hit.
[2026-05-24 18:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 27/157 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 216/373 variables, 157/201 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 1/374 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 202 constraints, problems are : Problem set: 0 solved, 280 unsolved in 16164 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 27/157 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 216/373 variables, 157/201 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 280/481 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 1/374 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 482 constraints, problems are : Problem set: 0 solved, 280 unsolved in 16010 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32200ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 32200ms
Starting structural reductions in LTL mode, iteration 1 : 157/229 places, 281/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32341 ms. Remains : 157/229 places, 281/313 transitions.
[2026-05-24 18:12:09] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:12:09] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:12:09] [INFO ] Input system was already deterministic with 281 transitions.
[2026-05-24 18:12:09] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:12:09] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:12:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17388823312393347059.gal : 2 ms
[2026-05-24 18:12:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9945792643184390438.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/CTLFireability17388823312393347059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9945792643184390438.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.1153e+14,0.0357,5160,2,426,5,1683,6,0,765,1182,0


Converting to forward existential form...Done !
original formula: (EG((AX(EG(((p28==0)||(p166==0)))) + ((((((p121==1)&&(p372==1))&&((p156==0)||(p413==0)))||(p147==0))||(p248==0)) * AF(AG(((p14==0)||(p258...774
=> equivalent forward existential formula: (([((FwdU((Init * !(EG((!(EX(!(EG(((p28==0)||(p166==0)))))) + ((((((p121==1)&&(p372==1))&&((p156==0)||(p413==0))...1861
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 276/0/5
Using saturation style SCC detection
(forward)formula 0,0,0.215989,10736,1,0,23,34665,48,11,4155,12518,26
FORMULA DLCround-PT-12a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 313/313 transitions.
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 156 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 89 place count 140 transition count 281
Iterating global reduction 1 with 16 rules applied. Total rules applied 105 place count 140 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 140 transition count 280
Applied a total of 106 rules in 2 ms. Remains 140 /229 variables (removed 89) and now considering 280/313 (removed 33) transitions.
[2026-05-24 18:12:09] [INFO ] Flow matrix only has 217 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8397737421421909014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1904439006388917983.kers'
[2026-05-24 18:12:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8397737421421909014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1904439006388917983.kers]
Normalized transition count is 216 out of 217 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 216 rows 129 cols 448 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 18:12:09] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1904439006388917983.kers
Total runtime 1 ms.
[2026-05-24 18:12:09] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 18:12:09] [INFO ] Flow matrix only has 217 transitions (discarded 63 similar events)
[2026-05-24 18:12:09] [INFO ] Invariant cache hit.
[2026-05-24 18:12:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:12:09] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-24 18:12:09] [INFO ] Flow matrix only has 217 transitions (discarded 63 similar events)
[2026-05-24 18:12:09] [INFO ] Invariant cache hit.
[2026-05-24 18:12:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 11/140 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 216/356 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 1/357 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (OVERLAPS) 0/357 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 169 constraints, problems are : Problem set: 0 solved, 279 unsolved in 14670 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 140/140 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 11/140 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 216/356 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 279/447 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (OVERLAPS) 1/357 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/357 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 448 constraints, problems are : Problem set: 0 solved, 279 unsolved in 14307 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 140/140 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28991ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 28991ms
Starting structural reductions in LTL mode, iteration 1 : 140/229 places, 280/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29117 ms. Remains : 140/229 places, 280/313 transitions.
[2026-05-24 18:12:38] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:12:38] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:12:38] [INFO ] Input system was already deterministic with 280 transitions.
[2026-05-24 18:12:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:12:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:12:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14054558002792016759.gal : 1 ms
[2026-05-24 18:12:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2453076011528717609.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/CTLFireability14054558002792016759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2453076011528717609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.87068e+14,0.041178,5116,2,391,5,1571,6,0,745,1118,0


Converting to forward existential form...Done !
original formula: (E(((AX(((((p67==1)&&(p386==1))||((p8==1)&&(p185==1))) + AX(((p37==1)&&(p311==1))))) * E(((((p121==1)&&(p236==1))&&((p61==1)&&(p304==1)))...341
=> equivalent forward existential formula: ([(FwdU(Init,((!(EX(!(((((p67==1)&&(p386==1))||((p8==1)&&(p185==1))) + !(EX(!(((p37==1)&&(p311==1))))))))) * E((...450
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 264/26/16
(forward)formula 0,1,0.200316,10444,1,0,23,34517,49,8,3735,13339,23
FORMULA DLCround-PT-12a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 18:12:38] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:12:38] [INFO ] Flatten gal took : 5 ms
Total runtime 339767 ms.

BK_STOP 1779646358819

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

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