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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.2K Mar 6 17:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 6 17:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 6 17:16 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 29K Mar 15 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 6 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:28 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 987K 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-13a-CTLFireability-2024-00
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-01
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-02
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-03
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-04
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-05
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-06
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-07
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-08
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-09
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-10
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-11
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-12
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-13
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-14
FORMULA_NAME DLCround-PT-13a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779648166091

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-13a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 18:42:47] [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:42:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 18:42:47] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2026-05-24 18:42:47] [INFO ] Transformed 463 places.
[2026-05-24 18:42:47] [INFO ] Transformed 3847 transitions.
[2026-05-24 18:42:47] [INFO ] Found NUPN structural information;
[2026-05-24 18:42:47] [INFO ] Parsed PT model containing 463 places and 3847 transitions and 15089 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Ensure Unique test removed 352 transitions
Reduce redundant transitions removed 352 transitions.
Support contains 133 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 3495/3495 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 447 transition count 3211
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 447 transition count 3211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 447 transition count 3209
Drop transitions (Redundant composition of simpler transitions.) removed 1115 transitions
Redundant transition composition rules discarded 1115 transitions
Iterating global reduction 1 with 1115 rules applied. Total rules applied 1149 place count 447 transition count 2094
Applied a total of 1149 rules in 177 ms. Remains 447 /463 variables (removed 16) and now considering 2094/3495 (removed 1401) transitions.
[2026-05-24 18:42:47] [INFO ] Flow matrix only has 248 transitions (discarded 1846 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7551540999962124960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4159583321270333863.kers'
[2026-05-24 18:42:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7551540999962124960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4159583321270333863.kers]
Normalized transition count is 247 out of 248 initially.
Culling duplicate invariants (modulo rational): removing 294 columns.
Culled 294 columns in 0 ms.
// Phase 1: matrix 247 rows 153 cols 511 entries
Finished phase 1 with 135 SingleSign rule and 0 generalized
[2026-05-24 18:42:47] [INFO ] Computed 312 invariants in 1 ms
Computed 312 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4159583321270333863.kers
Total runtime 2 ms.
[2026-05-24 18:42:49] [INFO ] Implicit Places using invariants in 1303 ms returned [153, 154, 155, 157, 158, 159, 160, 161, 162, 163, 164, 166, 167, 169, 170, 171, 173, 174, 175, 176, 177, 179, 183, 184, 186, 187, 188, 189, 191, 192, 193, 194, 195, 197, 198, 199, 201, 203, 207, 208, 210, 211, 213, 214, 215, 216, 217, 218, 219, 221, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 237, 238, 239, 240, 241, 242, 243, 244, 245, 247, 248, 249, 250, 251, 253, 254, 255, 256, 257, 259, 261, 262, 263, 264, 265, 266, 267, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 281, 282, 283, 285, 286, 288, 289, 290, 291, 292, 293, 295, 296, 297, 298, 299, 300, 301, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 318, 319, 320, 321, 322, 323, 324, 325, 328, 329, 330, 332, 333, 334, 336, 337, 338, 339, 342, 343, 346, 347, 348, 349, 351, 353, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 367, 371, 372, 376, 377, 378, 380, 381, 382, 383, 385, 386, 388, 389, 390, 391, 392, 394, 395, 396, 397, 398, 399, 401, 405, 407, 408, 409, 410, 411, 412, 413, 415, 416, 417, 418, 419, 422, 423, 424, 426, 427, 430, 431, 432, 433, 434, 435, 438, 439, 441, 442, 443, 446]
Discarding 222 places :
Ensure Unique test removed 1276 transitions
Reduce isomorphic transitions removed 1276 transitions.
Implicit Place search using SMT only with invariants took 1342 ms to find 222 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/463 places, 818/3495 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 487 transitions
Redundant transition composition rules discarded 487 transitions
Iterating global reduction 0 with 487 rules applied. Total rules applied 487 place count 225 transition count 331
Applied a total of 487 rules in 8 ms. Remains 225 /225 variables (removed 0) and now considering 331/818 (removed 487) transitions.
[2026-05-24 18:42:49] [INFO ] Flow matrix only has 248 transitions (discarded 83 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11076334548631920380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7743663600522471890.kers'
[2026-05-24 18:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11076334548631920380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7743663600522471890.kers]
Normalized transition count is 247 out of 248 initially.
Culling duplicate invariants (modulo rational): removing 72 columns.
Culled 72 columns in 0 ms.
// Phase 1: matrix 247 rows 153 cols 511 entries
Finished phase 1 with 135 SingleSign rule and 0 generalized
[2026-05-24 18:42:49] [INFO ] Computed 90 invariants in 1 ms
Computed 90 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7743663600522471890.kers
Total runtime 1 ms.
[2026-05-24 18:42:49] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-24 18:42:49] [INFO ] Flow matrix only has 248 transitions (discarded 83 similar events)
[2026-05-24 18:42:49] [INFO ] Invariant cache hit.
[2026-05-24 18:42:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:42:49] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 225/463 places, 331/3495 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1717 ms. Remains : 225/463 places, 331/3495 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Applied a total of 0 rules in 2 ms. Remains 225 /225 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2026-05-24 18:42:49] [INFO ] Flow matrix only has 248 transitions (discarded 83 similar events)
[2026-05-24 18:42:49] [INFO ] Invariant cache hit.
[2026-05-24 18:42:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 18:42:49] [INFO ] Flow matrix only has 248 transitions (discarded 83 similar events)
[2026-05-24 18:42:49] [INFO ] Invariant cache hit.
[2026-05-24 18:42:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:42:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2026-05-24 18:42:49] [INFO ] Flow matrix only has 248 transitions (discarded 83 similar events)
[2026-05-24 18:42:49] [INFO ] Invariant cache hit.
[2026-05-24 18:42:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 72/225 variables, 72/90 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 247/472 variables, 225/315 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 1/473 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 0/473 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 316 constraints, problems are : Problem set: 0 solved, 330 unsolved in 23649 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 225/225 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 72/225 variables, 72/90 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 247/472 variables, 225/315 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 330/645 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 1/473 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 10 (OVERLAPS) 0/473 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 646 constraints, problems are : Problem set: 0 solved, 330 unsolved in 26561 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 225/225 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50310ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 50330ms
Finished structural reductions in LTL mode , in 1 iterations and 50526 ms. Remains : 225/225 places, 331/331 transitions.
Support contains 133 out of 225 places after structural reductions.
[2026-05-24 18:43:40] [INFO ] Flatten gal took : 43 ms
[2026-05-24 18:43:40] [INFO ] Flatten gal took : 16 ms
[2026-05-24 18:43:40] [INFO ] Input system was already deterministic with 331 transitions.
RANDOM walk for 13743 steps (2 resets) in 459 ms. (29 steps per ms) remains 0/76 properties
[2026-05-24 18:43:40] [INFO ] Flatten gal took : 13 ms
[2026-05-24 18:43:40] [INFO ] Flatten gal took : 13 ms
[2026-05-24 18:43:40] [INFO ] Input system was already deterministic with 331 transitions.
Computed a total of 73 stabilizing places and 1 stable transitions
Graph (complete) has 420 edges and 225 vertex of which 153 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Graph (trivial) has 304 edges and 225 vertex of which 133 / 225 are part of one of the 17 SCC in 2 ms
Free SCC test removed 116 places
Ensure Unique test removed 269 transitions
Reduce isomorphic transitions removed 269 transitions.
Graph (complete) has 151 edges and 109 vertex of which 40 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.1 ms
Discarding 69 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 40 transition count 61
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 39 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 37 transition count 59
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 23 place count 22 transition count 43
Iterating global reduction 3 with 15 rules applied. Total rules applied 38 place count 22 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 40 place count 22 transition count 41
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 42 place count 21 transition count 40
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 44 place count 21 transition count 38
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 21 transition count 38
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 46 place count 20 transition count 37
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 20 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48 place count 20 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 49 place count 20 transition count 35
Applied a total of 49 rules in 18 ms. Remains 20 /225 variables (removed 205) and now considering 35/331 (removed 296) transitions.
[2026-05-24 18:43:40] [INFO ] Flow matrix only has 24 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14297272918124235045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8302655624018561853.kers'
[2026-05-24 18:43:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14297272918124235045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8302655624018561853.kers]
Normalized transition count is 23 out of 24 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 23 rows 16 cols 48 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 18:43:40] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8302655624018561853.kers
Total runtime 0 ms.
[2026-05-24 18:43:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 18:43:40] [INFO ] Flow matrix only has 24 transitions (discarded 11 similar events)
[2026-05-24 18:43:40] [INFO ] Invariant cache hit.
[2026-05-24 18:43:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:43:40] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-24 18:43:40] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2026-05-24 18:43:40] [INFO ] Flow matrix only has 24 transitions (discarded 11 similar events)
[2026-05-24 18:43:40] [INFO ] Invariant cache hit.
[2026-05-24 18:43:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 23/43 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/44 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/44 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 28 constraints, problems are : Problem set: 0 solved, 34 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 23/43 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 34/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 62 constraints, problems are : Problem set: 0 solved, 34 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 869ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/225 places, 35/331 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 941 ms. Remains : 20/225 places, 35/331 transitions.
[2026-05-24 18:43:41] [INFO ] Flatten gal took : 2 ms
[2026-05-24 18:43:41] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:43:41] [INFO ] Input system was already deterministic with 35 transitions.
[2026-05-24 18:43:41] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:43:41] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:43:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8591449899274671625.gal : 0 ms
[2026-05-24 18:43:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6488989039790056148.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8591449899274671625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6488989039790056148.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,109,0.016905,3816,2,45,5,168,6,0,94,112,0


Converting to forward existential form...Done !
original formula: AG((EG(((p137==0)||(p368==0))) + AF((E(((p97==1)&&(p360==1)) U ((p21==1)&&(p198==1))) * (p136==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(((p137==0)||(p368==0))))),!((E(((p97==1)&&(p360==1)) U ((p21==1)&&(p198==1))) * (p...174
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 28/7/7
(forward)formula 0,0,0.02525,4252,1,0,17,879,31,9,453,578,20
FORMULA DLCround-PT-13a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 154 transition count 331
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 90 place count 135 transition count 293
Iterating global reduction 1 with 19 rules applied. Total rules applied 109 place count 135 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 135 transition count 291
Applied a total of 111 rules in 5 ms. Remains 135 /225 variables (removed 90) and now considering 291/331 (removed 40) transitions.
[2026-05-24 18:43:41] [INFO ] Flow matrix only has 227 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-2315826180753872851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9790257541688448366.kers'
[2026-05-24 18:43:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2315826180753872851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9790257541688448366.kers]
Normalized transition count is 226 out of 227 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 226 rows 134 cols 469 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:43:41] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9790257541688448366.kers
Total runtime 1 ms.
[2026-05-24 18:43:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 18:43:41] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:43:41] [INFO ] Invariant cache hit.
[2026-05-24 18:43:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:43:41] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 18:43:41] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:43:41] [INFO ] Invariant cache hit.
[2026-05-24 18:43:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/361 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 155 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15747 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/361 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 290/444 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/362 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 445 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13740 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29516ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 29517ms
Starting structural reductions in LTL mode, iteration 1 : 135/225 places, 291/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29630 ms. Remains : 135/225 places, 291/331 transitions.
[2026-05-24 18:44:11] [INFO ] Flatten gal took : 15 ms
[2026-05-24 18:44:11] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:44:11] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-24 18:44:11] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:44:11] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:44:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4099407477866078071.gal : 4 ms
[2026-05-24 18:44:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12702275540339572518.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/CTLFireability4099407477866078071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12702275540339572518.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.09238e+15,0.032646,5168,2,385,5,1563,6,0,765,1136,0


Converting to forward existential form...Done !
original formula: AX(EG(EF(((p84==1)&&(p347==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U ((p84==1)&&(p347==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.115451,8080,1,0,7,20618,17,0,3312,2405,9
FORMULA DLCround-PT-13a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 166 transition count 331
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 75 place count 150 transition count 299
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 150 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 150 transition count 297
Applied a total of 93 rules in 4 ms. Remains 150 /225 variables (removed 75) and now considering 297/331 (removed 34) transitions.
[2026-05-24 18:44:11] [INFO ] Flow matrix only has 230 transitions (discarded 67 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2573479633671457288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15654006407872948225.kers'
[2026-05-24 18:44:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2573479633671457288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15654006407872948225.kers]
Normalized transition count is 229 out of 230 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 229 rows 137 cols 475 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-24 18:44:11] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15654006407872948225.kers
Total runtime 0 ms.
[2026-05-24 18:44:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 18:44:11] [INFO ] Flow matrix only has 230 transitions (discarded 67 similar events)
[2026-05-24 18:44:11] [INFO ] Invariant cache hit.
[2026-05-24 18:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:44:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2026-05-24 18:44:11] [INFO ] Flow matrix only has 230 transitions (discarded 67 similar events)
[2026-05-24 18:44:11] [INFO ] Invariant cache hit.
[2026-05-24 18:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 13/150 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 229/379 variables, 150/181 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 182 constraints, problems are : Problem set: 0 solved, 296 unsolved in 16428 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 13/150 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 229/379 variables, 150/181 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 296/477 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 1/380 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 478 constraints, problems are : Problem set: 0 solved, 296 unsolved in 15109 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31561ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 31562ms
Starting structural reductions in LTL mode, iteration 1 : 150/225 places, 297/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31678 ms. Remains : 150/225 places, 297/331 transitions.
[2026-05-24 18:44:43] [INFO ] Flatten gal took : 11 ms
[2026-05-24 18:44:43] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:44:43] [INFO ] Input system was already deterministic with 297 transitions.
[2026-05-24 18:44:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:44:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3450836232495008357.gal : 4 ms
[2026-05-24 18:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6853581334420893413.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/CTLFireability3450836232495008357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6853581334420893413.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.40301e+15,0.038032,5188,2,418,5,1678,6,0,792,1199,0


Converting to forward existential form...Done !
original formula: E((E(EF((AX(((p77==1)&&(p389==1))) * AG((p52==1)))) U ((p21==1)&&(p222==1))) + A(AG(((EX(((p47==1)&&(p386==1))) + ((p109==1)&&(p390==1)))...414
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(E(E(TRUE U (!(EX(!(((p77==1)&&(p389==1))))) * !(E(TRUE U !((p52==1)))))) U ((p21==1)&&(p222==1...744
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 292/5/5
Using saturation style SCC detection
(forward)formula 0,0,0.202023,10872,1,0,32,36798,64,17,3897,13862,46
FORMULA DLCround-PT-13a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 154 transition count 331
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 90 place count 135 transition count 293
Iterating global reduction 1 with 19 rules applied. Total rules applied 109 place count 135 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 135 transition count 291
Applied a total of 111 rules in 4 ms. Remains 135 /225 variables (removed 90) and now considering 291/331 (removed 40) transitions.
[2026-05-24 18:44:43] [INFO ] Flow matrix only has 227 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-14078066382869684151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2524730004451398644.kers'
[2026-05-24 18:44:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14078066382869684151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2524730004451398644.kers]
Normalized transition count is 226 out of 227 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 226 rows 134 cols 469 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:44:43] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2524730004451398644.kers
Total runtime 2 ms.
[2026-05-24 18:44:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 18:44:43] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:44:43] [INFO ] Invariant cache hit.
[2026-05-24 18:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:44:43] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 18:44:43] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:44:43] [INFO ] Invariant cache hit.
[2026-05-24 18:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/361 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 155 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15198 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/361 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 290/444 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/362 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 445 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13714 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28929ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 28929ms
Starting structural reductions in LTL mode, iteration 1 : 135/225 places, 291/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29051 ms. Remains : 135/225 places, 291/331 transitions.
[2026-05-24 18:45:12] [INFO ] Flatten gal took : 12 ms
[2026-05-24 18:45:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:45:12] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-24 18:45:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:45:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:45:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12701394656645985784.gal : 2 ms
[2026-05-24 18:45:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7093409898905119911.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/CTLFireability12701394656645985784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7093409898905119911.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.09238e+15,0.032615,5168,2,385,5,1563,6,0,765,1136,0


Converting to forward existential form...Done !
original formula: AX(EF(((p124==1)&&(p409==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((p124==1)&&(p409==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.100972,7800,1,0,6,20333,14,0,3177,1947,5
FORMULA DLCround-PT-13a-CTLFireability-2024-03 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 : 225/225 places, 331/331 transitions.
Graph (trivial) has 324 edges and 225 vertex of which 148 / 225 are part of one of the 18 SCC in 1 ms
Free SCC test removed 130 places
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Graph (complete) has 117 edges and 95 vertex of which 25 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 27
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 9 transition count 12
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 9 transition count 12
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 35 place count 9 transition count 11
Applied a total of 35 rules in 5 ms. Remains 9 /225 variables (removed 216) and now considering 11/331 (removed 320) transitions.
[2026-05-24 18:45:12] [INFO ] Flow matrix only has 7 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-4697053538255134749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8595492514098399403.kers'
[2026-05-24 18:45:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4697053538255134749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8595492514098399403.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 6 cols 13 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 18:45:12] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8595492514098399403.kers
Total runtime 0 ms.
[2026-05-24 18:45:12] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 18:45:12] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
[2026-05-24 18:45:12] [INFO ] Invariant cache hit.
[2026-05-24 18:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:45:12] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-24 18:45:12] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 18:45:12] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
[2026-05-24 18:45:12] [INFO ] Invariant cache hit.
[2026-05-24 18:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/16 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 10 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/16 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 25 constraints, problems are : Problem set: 0 solved, 10 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 207ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/225 places, 11/331 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 260 ms. Remains : 9/225 places, 11/331 transitions.
[2026-05-24 18:45:12] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:45:12] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:45:12] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-24 18:45:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:45:12] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:45:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10107070283034558956.gal : 0 ms
[2026-05-24 18:45:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1222001429781205202.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/CTLFireability10107070283034558956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1222001429781205202.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((EF(((p109==1)&&(p385==1))) + ((p126==1)&&(p400==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p126==1)&&(p400==1)))) * !(E(TRUE U ((p109==1)&&(p385==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.006943,4060,1,0,6,112,14,0,162,57,5
FORMULA DLCround-PT-13a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 155 transition count 331
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 89 place count 136 transition count 293
Iterating global reduction 1 with 19 rules applied. Total rules applied 108 place count 136 transition count 293
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 136 transition count 291
Applied a total of 110 rules in 4 ms. Remains 136 /225 variables (removed 89) and now considering 291/331 (removed 40) transitions.
[2026-05-24 18:45:12] [INFO ] Flow matrix only has 227 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-11436398425151527443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1774733038082888729.kers'
[2026-05-24 18:45:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11436398425151527443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1774733038082888729.kers]
Normalized transition count is 226 out of 227 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 134 cols 469 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:45:12] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1774733038082888729.kers
Total runtime 1 ms.
[2026-05-24 18:45:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 18:45:12] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:45:12] [INFO ] Invariant cache hit.
[2026-05-24 18:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:45:12] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 18:45:12] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:45:12] [INFO ] Invariant cache hit.
[2026-05-24 18:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/362 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/363 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/363 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 157 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15496 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/362 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 290/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/363 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 447 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13640 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29152ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 29152ms
Starting structural reductions in LTL mode, iteration 1 : 136/225 places, 291/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29253 ms. Remains : 136/225 places, 291/331 transitions.
[2026-05-24 18:45:42] [INFO ] Flatten gal took : 12 ms
[2026-05-24 18:45:42] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:45:42] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-24 18:45:42] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:45:42] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13139361833310354204.gal : 1 ms
[2026-05-24 18:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8829629993597327341.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/CTLFireability13139361833310354204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8829629993597327341.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.09238e+15,0.032938,5164,2,387,5,1569,6,0,766,1139,0


Converting to forward existential form...Done !
original formula: EG(((EX(EF(((p162==1)&&(p461==1)))) + (p14==0)) + (p252==0)))
=> equivalent forward existential formula: [FwdG(Init,((EX(E(TRUE U ((p162==1)&&(p461==1)))) + (p14==0)) + (p252==0)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.127328,8432,1,0,8,21076,20,3,3554,3282,13
FORMULA DLCround-PT-13a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 155 transition count 331
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 90 place count 135 transition count 291
Iterating global reduction 1 with 20 rules applied. Total rules applied 110 place count 135 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 135 transition count 289
Applied a total of 112 rules in 8 ms. Remains 135 /225 variables (removed 90) and now considering 289/331 (removed 42) transitions.
[2026-05-24 18:45:42] [INFO ] Flow matrix only has 226 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-4684723544935492580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16032010870153498014.kers'
[2026-05-24 18:45:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4684723544935492580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16032010870153498014.kers]
Normalized transition count is 225 out of 226 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 225 rows 133 cols 467 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 18:45:42] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16032010870153498014.kers
Total runtime 2 ms.
[2026-05-24 18:45:42] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 18:45:42] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2026-05-24 18:45:42] [INFO ] Invariant cache hit.
[2026-05-24 18:45:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:45:42] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-24 18:45:42] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2026-05-24 18:45:42] [INFO ] Invariant cache hit.
[2026-05-24 18:45:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 225/360 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 156 constraints, problems are : Problem set: 0 solved, 288 unsolved in 15259 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 225/360 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 288/443 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/361 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 444 constraints, problems are : Problem set: 0 solved, 288 unsolved in 14026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29299ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 29299ms
Starting structural reductions in LTL mode, iteration 1 : 135/225 places, 289/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29417 ms. Remains : 135/225 places, 289/331 transitions.
[2026-05-24 18:46:11] [INFO ] Flatten gal took : 13 ms
[2026-05-24 18:46:11] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:46:11] [INFO ] Input system was already deterministic with 289 transitions.
[2026-05-24 18:46:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:46:11] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:46:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8043432242648581704.gal : 1 ms
[2026-05-24 18:46:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4184957059192477002.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/CTLFireability8043432242648581704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4184957059192477002.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,2.74878e+15,0.034932,5164,2,384,5,1554,6,0,761,1128,0


Converting to forward existential form...Done !
original formula: EF(AG((EX(((p107==0)||(p444==0))) + EG(((p87==0)||(p416==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EX(((p107==0)||(p444==0))) + EG(((p87==0)||(p416==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.111748,8204,1,0,8,22585,22,1,3078,4045,9
FORMULA DLCround-PT-13a-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 : 225/225 places, 331/331 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 160 transition count 331
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 84 place count 141 transition count 293
Iterating global reduction 1 with 19 rules applied. Total rules applied 103 place count 141 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 141 transition count 291
Applied a total of 105 rules in 2 ms. Remains 141 /225 variables (removed 84) and now considering 291/331 (removed 40) transitions.
[2026-05-24 18:46:11] [INFO ] Flow matrix only has 227 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-10253334708949559587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3778889859471466441.kers'
[2026-05-24 18:46:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10253334708949559587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3778889859471466441.kers]
Normalized transition count is 226 out of 227 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 226 rows 134 cols 469 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:46:11] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3778889859471466441.kers
Total runtime 0 ms.
[2026-05-24 18:46:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 18:46:11] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:46:11] [INFO ] Invariant cache hit.
[2026-05-24 18:46:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:46:11] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 18:46:11] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:46:11] [INFO ] Invariant cache hit.
[2026-05-24 18:46:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 7/141 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/367 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 167 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15535 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 141/141 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 7/141 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/367 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 290/456 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/368 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/368 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 457 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13950 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 141/141 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29498ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 29499ms
Starting structural reductions in LTL mode, iteration 1 : 141/225 places, 291/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29604 ms. Remains : 141/225 places, 291/331 transitions.
[2026-05-24 18:46:41] [INFO ] Flatten gal took : 9 ms
[2026-05-24 18:46:41] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:46:41] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-24 18:46:41] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:46:41] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:46:41] [INFO ] Time to serialize gal into /tmp/CTLFireability18049191536137430611.gal : 1 ms
[2026-05-24 18:46:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14122053157237079937.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/CTLFireability18049191536137430611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14122053157237079937.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,3.09238e+15,0.035342,5164,2,397,5,1598,6,0,771,1151,0


Converting to forward existential form...Done !
original formula: EF((AG(((p136==1)&&(p422==1))) * ((EX(((p53==1)&&(p318==1))) + EG(((p153==1)&&(p445==1)))) + (EX(((p51==1)&&(p188==1))) * (E(((p14==1)&&(...220
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !(E(TRUE U !(((p136==1)&&(p422==1))))))) * ((p53==1)&&(p318==1)))] != FALSE + [FwdG((F...535
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.13424,9164,1,0,17,23388,34,0,3405,3452,15
FORMULA DLCround-PT-13a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 156 transition count 331
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 89 place count 136 transition count 291
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 136 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 136 transition count 289
Applied a total of 111 rules in 7 ms. Remains 136 /225 variables (removed 89) and now considering 289/331 (removed 42) transitions.
[2026-05-24 18:46:41] [INFO ] Flow matrix only has 226 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-16923787728490394106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6408248490714727839.kers'
[2026-05-24 18:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16923787728490394106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6408248490714727839.kers]
Normalized transition count is 225 out of 226 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 225 rows 133 cols 467 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 18:46:41] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6408248490714727839.kers
Total runtime 3 ms.
[2026-05-24 18:46:41] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 18:46:41] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2026-05-24 18:46:41] [INFO ] Invariant cache hit.
[2026-05-24 18:46:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:46:41] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-24 18:46:41] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2026-05-24 18:46:41] [INFO ] Invariant cache hit.
[2026-05-24 18:46:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 3/136 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 225/361 variables, 136/157 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 158 constraints, problems are : Problem set: 0 solved, 288 unsolved in 15271 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 3/136 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 225/361 variables, 136/157 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 288/445 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/362 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 446 constraints, problems are : Problem set: 0 solved, 288 unsolved in 13661 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28957ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 28957ms
Starting structural reductions in LTL mode, iteration 1 : 136/225 places, 289/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29087 ms. Remains : 136/225 places, 289/331 transitions.
[2026-05-24 18:47:10] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:47:10] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:47:10] [INFO ] Input system was already deterministic with 289 transitions.
[2026-05-24 18:47:10] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:47:10] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:47:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4828441454258835174.gal : 1 ms
[2026-05-24 18:47:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17170265372369043204.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/CTLFireability4828441454258835174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17170265372369043204.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,2.74878e+15,0.036744,5160,2,386,5,1560,6,0,762,1131,0


Converting to forward existential form...Done !
original formula: EF(AG(((AX(((p76==1)&&(p333==1))) + AF(((p14==1)&&(p220==1)))) + EX(((p14==1)&&(p196==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EX(!(((p76==1)&&(p333==1))))) + !(EG(!(((p14==1)&&(p220==1)))))) + EX(((p14...187
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.145147,9000,1,0,13,27105,26,3,3325,7711,13
FORMULA DLCround-PT-13a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 162 transition count 331
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 81 place count 144 transition count 295
Iterating global reduction 1 with 18 rules applied. Total rules applied 99 place count 144 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 144 transition count 293
Applied a total of 101 rules in 2 ms. Remains 144 /225 variables (removed 81) and now considering 293/331 (removed 38) transitions.
[2026-05-24 18:47:10] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10125151958563837419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8203753846069631295.kers'
[2026-05-24 18:47:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10125151958563837419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8203753846069631295.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 227 rows 135 cols 471 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 18:47:10] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8203753846069631295.kers
Total runtime 2 ms.
[2026-05-24 18:47:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 18:47:10] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
[2026-05-24 18:47:10] [INFO ] Invariant cache hit.
[2026-05-24 18:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:47:10] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-24 18:47:10] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
[2026-05-24 18:47:10] [INFO ] Invariant cache hit.
[2026-05-24 18:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 9/144 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 227/371 variables, 144/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 172 constraints, problems are : Problem set: 0 solved, 292 unsolved in 15894 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 144/144 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 9/144 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 227/371 variables, 144/171 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 292/463 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/372 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 464 constraints, problems are : Problem set: 0 solved, 292 unsolved in 14687 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 144/144 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30593ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 30594ms
Starting structural reductions in LTL mode, iteration 1 : 144/225 places, 293/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30710 ms. Remains : 144/225 places, 293/331 transitions.
[2026-05-24 18:47:41] [INFO ] Flatten gal took : 10 ms
[2026-05-24 18:47:41] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:47:41] [INFO ] Input system was already deterministic with 293 transitions.
[2026-05-24 18:47:41] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:47:41] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:47:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11434184182923990500.gal : 1 ms
[2026-05-24 18:47:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12580433612473097274.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/CTLFireability11434184182923990500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12580433612473097274.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,3.47892e+15,0.034624,5168,2,404,5,1625,6,0,778,1168,0


Converting to forward existential form...Done !
original formula: (AG((((p14==0)||(p172==0)) + EF((EG(((p148==1)&&(p262==1))) * ((((p75==1)&&(p343==1))&&((p88==1)&&(p347==1))) + EF(((p21==1)&&(p222==1)))...323
=> equivalent forward existential formula: ([(EY(EY((Init * !(!(E(TRUE U !((((p14==0)||(p172==0)) + E(TRUE U (EG(((p148==1)&&(p262==1))) * ((((p75==1)&&(p3...686
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 283/0/10
(forward)formula 0,1,0.164534,9776,1,0,23,26771,51,9,3588,7364,24
FORMULA DLCround-PT-13a-CTLFireability-2024-09 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 : 225/225 places, 331/331 transitions.
Graph (trivial) has 294 edges and 225 vertex of which 122 / 225 are part of one of the 18 SCC in 2 ms
Free SCC test removed 104 places
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Graph (complete) has 180 edges and 121 vertex of which 55 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.2 ms
Discarding 66 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 55 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 51 transition count 87
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 23 place count 38 transition count 72
Iterating global reduction 2 with 13 rules applied. Total rules applied 36 place count 38 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 38 transition count 66
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 38 transition count 66
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 36 transition count 64
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 36 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 36 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 36 transition count 60
Applied a total of 52 rules in 20 ms. Remains 36 /225 variables (removed 189) and now considering 60/331 (removed 271) transitions.
[2026-05-24 18:47:41] [INFO ] Flow matrix only has 37 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11376515494586071303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-692706516060846118.kers'
[2026-05-24 18:47:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11376515494586071303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-692706516060846118.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 36 rows 29 cols 77 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-24 18:47:41] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-692706516060846118.kers
Total runtime 0 ms.
[2026-05-24 18:47:41] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 18:47:41] [INFO ] Flow matrix only has 37 transitions (discarded 23 similar events)
[2026-05-24 18:47:41] [INFO ] Invariant cache hit.
[2026-05-24 18:47:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:47:41] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-24 18:47:41] [INFO ] Redundant transitions in 0 ms returned []
Running 59 sub problems to find dead transitions.
[2026-05-24 18:47:41] [INFO ] Flow matrix only has 37 transitions (discarded 23 similar events)
[2026-05-24 18:47:41] [INFO ] Invariant cache hit.
[2026-05-24 18:47:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 6/36 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 36/72 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 6/36 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 36/72 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 59/108 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/73 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 109 constraints, problems are : Problem set: 0 solved, 59 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2009ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2009ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/225 places, 60/331 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2094 ms. Remains : 36/225 places, 60/331 transitions.
[2026-05-24 18:47:43] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:47:43] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:47:43] [INFO ] Input system was already deterministic with 60 transitions.
[2026-05-24 18:47:43] [INFO ] Flatten gal took : 1 ms
[2026-05-24 18:47:43] [INFO ] Flatten gal took : 0 ms
[2026-05-24 18:47:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16858661095310689688.gal : 0 ms
[2026-05-24 18:47:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16913651566644568613.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/CTLFireability16858661095310689688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16913651566644568613.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,7201,0.011858,4048,2,94,5,324,6,0,162,220,0


Converting to forward existential form...Done !
original formula: EF((AF((((p85==1)&&(p356==1)) + E((((p97==1)&&(p370==1))||((p163==1)&&(p460==1))) U (((p53==1)&&(p310==1))||((p82==1)&&(p351==1)))))) * E...204
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(!((((p85==1)&&(p356==1)) + E((((p97==1)&&(p370==1))||((p163==1)&&(p460==1))) U (((...339
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 50/0/10
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 53/0/7
Using saturation style SCC detection
(forward)formula 0,1,0.027736,5008,1,0,20,2947,45,10,891,2051,23
FORMULA DLCround-PT-13a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 157 transition count 331
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 87 place count 138 transition count 293
Iterating global reduction 1 with 19 rules applied. Total rules applied 106 place count 138 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 138 transition count 291
Applied a total of 108 rules in 5 ms. Remains 138 /225 variables (removed 87) and now considering 291/331 (removed 40) transitions.
[2026-05-24 18:47:43] [INFO ] Flow matrix only has 227 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-7133470163774115553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5174504923504569690.kers'
[2026-05-24 18:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7133470163774115553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5174504923504569690.kers]
Normalized transition count is 226 out of 227 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 226 rows 134 cols 469 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:47:43] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5174504923504569690.kers
Total runtime 1 ms.
[2026-05-24 18:47:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 18:47:43] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:47:43] [INFO ] Invariant cache hit.
[2026-05-24 18:47:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:47:44] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 18:47:44] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:47:44] [INFO ] Invariant cache hit.
[2026-05-24 18:47:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 4/138 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/364 variables, 138/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 161 constraints, problems are : Problem set: 0 solved, 290 unsolved in 16152 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 138/138 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 4/138 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/364 variables, 138/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 451 constraints, problems are : Problem set: 0 solved, 290 unsolved in 14588 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 138/138 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30761ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 30761ms
Starting structural reductions in LTL mode, iteration 1 : 138/225 places, 291/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30872 ms. Remains : 138/225 places, 291/331 transitions.
[2026-05-24 18:48:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:48:14] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:48:14] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-24 18:48:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:48:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:48:14] [INFO ] Time to serialize gal into /tmp/CTLFireability10338677685044531559.gal : 1 ms
[2026-05-24 18:48:14] [INFO ] Time to serialize properties into /tmp/CTLFireability2276099519775499586.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/CTLFireability10338677685044531559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2276099519775499586.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.09238e+15,0.043245,5164,2,391,5,1581,6,0,768,1145,0


Converting to forward existential form...Done !
original formula: AX(!(E(!((AX(((p156==1)&&(p441==1))) * ((((p136==1)&&(p419==1))&&((p94==1)&&(p366==1)))||((p97==1)&&(p361==1))))) U (p94==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),!((!(EX(!(((p156==1)&&(p441==1))))) * ((((p136==1)&&(p419==1))&&((p94==1)&&(p366==1)))||((p97==1...193
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.131005,8328,1,0,11,21453,14,1,3356,2736,9
FORMULA DLCround-PT-13a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 160 transition count 331
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 82 place count 143 transition count 297
Iterating global reduction 1 with 17 rules applied. Total rules applied 99 place count 143 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 143 transition count 295
Applied a total of 101 rules in 3 ms. Remains 143 /225 variables (removed 82) and now considering 295/331 (removed 36) transitions.
[2026-05-24 18:48:14] [INFO ] Flow matrix only has 229 transitions (discarded 66 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10872655276376643236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16471153712030684978.kers'
[2026-05-24 18:48:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10872655276376643236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16471153712030684978.kers]
Normalized transition count is 228 out of 229 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 228 rows 136 cols 473 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-24 18:48:14] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16471153712030684978.kers
Total runtime 1 ms.
[2026-05-24 18:48:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 18:48:14] [INFO ] Flow matrix only has 229 transitions (discarded 66 similar events)
[2026-05-24 18:48:14] [INFO ] Invariant cache hit.
[2026-05-24 18:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:48:15] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2026-05-24 18:48:15] [INFO ] Flow matrix only has 229 transitions (discarded 66 similar events)
[2026-05-24 18:48:15] [INFO ] Invariant cache hit.
[2026-05-24 18:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 7/143 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 228/371 variables, 143/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 169 constraints, problems are : Problem set: 0 solved, 294 unsolved in 16222 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 7/143 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 228/371 variables, 143/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 294/462 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 1/372 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 463 constraints, problems are : Problem set: 0 solved, 294 unsolved in 14794 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 143/143 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31033ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 31034ms
Starting structural reductions in LTL mode, iteration 1 : 143/225 places, 295/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31146 ms. Remains : 143/225 places, 295/331 transitions.
[2026-05-24 18:48:46] [INFO ] Flatten gal took : 9 ms
[2026-05-24 18:48:46] [INFO ] Flatten gal took : 6 ms
[2026-05-24 18:48:46] [INFO ] Input system was already deterministic with 295 transitions.
[2026-05-24 18:48:46] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:48:46] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:48:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6018796572485131913.gal : 1 ms
[2026-05-24 18:48:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15210980421836320807.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/CTLFireability6018796572485131913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15210980421836320807.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.91379e+15,0.035586,5176,2,403,5,1628,6,0,781,1173,0


Converting to forward existential form...Done !
original formula: EX(E(!(((!(AF(((p124==1)&&(p403==1)))) * EX(((p133==1)&&(p418==1)))) + (((p47==1)&&(p181==1)) * EX(((p112==1)&&(p385==1)))))) U (((p14==1...255
=> equivalent forward existential formula: [(FwdU((FwdU(EY(Init),!(((!(!(EG(!(((p124==1)&&(p403==1)))))) * EX(((p133==1)&&(p418==1)))) + (((p47==1)&&(p181=...320
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 282/0/13
(forward)formula 0,1,0.542291,25700,1,0,143,80729,44,126,3468,158059,198
FORMULA DLCround-PT-13a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 166 transition count 331
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 72 place count 153 transition count 305
Iterating global reduction 1 with 13 rules applied. Total rules applied 85 place count 153 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 153 transition count 304
Applied a total of 86 rules in 6 ms. Remains 153 /225 variables (removed 72) and now considering 304/331 (removed 27) transitions.
[2026-05-24 18:48:46] [INFO ] Flow matrix only has 234 transitions (discarded 70 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3978305378238614325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2418045829901665311.kers'
[2026-05-24 18:48:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3978305378238614325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2418045829901665311.kers]
Normalized transition count is 233 out of 234 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 233 rows 140 cols 483 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 18:48:46] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2418045829901665311.kers
Total runtime 4 ms.
[2026-05-24 18:48:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 18:48:46] [INFO ] Flow matrix only has 234 transitions (discarded 70 similar events)
[2026-05-24 18:48:46] [INFO ] Invariant cache hit.
[2026-05-24 18:48:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:48:46] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2026-05-24 18:48:46] [INFO ] Flow matrix only has 234 transitions (discarded 70 similar events)
[2026-05-24 18:48:46] [INFO ] Invariant cache hit.
[2026-05-24 18:48:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 13/153 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 233/386 variables, 153/184 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/387 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 185 constraints, problems are : Problem set: 0 solved, 303 unsolved in 17173 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 13/153 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 233/386 variables, 153/184 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 303/487 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/387 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 488 constraints, problems are : Problem set: 0 solved, 303 unsolved in 15811 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32997ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 32997ms
Starting structural reductions in LTL mode, iteration 1 : 153/225 places, 304/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33139 ms. Remains : 153/225 places, 304/331 transitions.
[2026-05-24 18:49:19] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:49:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:49:19] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-24 18:49:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:49:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:49:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4116351557774498325.gal : 1 ms
[2026-05-24 18:49:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2751946673435397093.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/CTLFireability4116351557774498325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2751946673435397093.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,6.68708e+15,0.047484,5220,2,427,5,1723,6,0,808,1228,0


Converting to forward existential form...Done !
original formula: EX(((((p49==1) + EG((((p161==1)&&(p276==1))&&(((p39==1)&&(p300==1))||((p28==1)&&(p216==1)))))) + (!(E(((p138==1)&&(p416==1)) U AG(((p163=...397
=> equivalent forward existential formula: ((([(EY(Init) * (p49==1))] != FALSE + [FwdG(EY(Init),(((p161==1)&&(p276==1))&&(((p39==1)&&(p300==1))||((p28==1)&...566
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.154329,9408,1,0,12,24446,31,3,3605,3004,12
FORMULA DLCround-PT-13a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 155 transition count 331
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 89 place count 136 transition count 293
Iterating global reduction 1 with 19 rules applied. Total rules applied 108 place count 136 transition count 293
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 136 transition count 291
Applied a total of 110 rules in 7 ms. Remains 136 /225 variables (removed 89) and now considering 291/331 (removed 40) transitions.
[2026-05-24 18:49:20] [INFO ] Flow matrix only has 227 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-14676570772868565652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15869509922135632810.kers'
[2026-05-24 18:49:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14676570772868565652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15869509922135632810.kers]
Normalized transition count is 226 out of 227 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 134 cols 469 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:49:20] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15869509922135632810.kers
Total runtime 2 ms.
[2026-05-24 18:49:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 18:49:20] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:49:20] [INFO ] Invariant cache hit.
[2026-05-24 18:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:49:20] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 18:49:20] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:49:20] [INFO ] Invariant cache hit.
[2026-05-24 18:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/362 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/363 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/363 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 157 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15662 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/362 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 290/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/363 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 447 constraints, problems are : Problem set: 0 solved, 290 unsolved in 14033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29710ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 29711ms
Starting structural reductions in LTL mode, iteration 1 : 136/225 places, 291/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29835 ms. Remains : 136/225 places, 291/331 transitions.
[2026-05-24 18:49:49] [INFO ] Flatten gal took : 10 ms
[2026-05-24 18:49:49] [INFO ] Flatten gal took : 4 ms
[2026-05-24 18:49:49] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-24 18:49:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:49:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:49:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10123132581360279458.gal : 2 ms
[2026-05-24 18:49:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15886554112569230839.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/CTLFireability10123132581360279458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15886554112569230839.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,3.09238e+15,0.045688,5164,2,387,5,1568,6,0,766,1136,0


Converting to forward existential form...Done !
original formula: EG((AF(AX(AX(((p101==0)||(p384==0))))) + ((p56==1)&&(p188==1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(EX(!(!(EX(!(((p101==0)||(p384==0))))))))))) + ((p56==1)&&(p188==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.127759,8456,1,0,14,24352,23,4,3330,5212,14
FORMULA DLCround-PT-13a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 331/331 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 160 transition count 331
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 83 place count 142 transition count 295
Iterating global reduction 1 with 18 rules applied. Total rules applied 101 place count 142 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 142 transition count 294
Applied a total of 102 rules in 2 ms. Remains 142 /225 variables (removed 83) and now considering 294/331 (removed 37) transitions.
[2026-05-24 18:49:50] [INFO ] Flow matrix only has 229 transitions (discarded 65 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5796607409983575583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4328817629893420272.kers'
[2026-05-24 18:49:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5796607409983575583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4328817629893420272.kers]
Normalized transition count is 228 out of 229 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 228 rows 135 cols 473 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 18:49:50] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4328817629893420272.kers
Total runtime 4 ms.
[2026-05-24 18:49:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 18:49:50] [INFO ] Flow matrix only has 229 transitions (discarded 65 similar events)
[2026-05-24 18:49:50] [INFO ] Invariant cache hit.
[2026-05-24 18:49:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:49:50] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2026-05-24 18:49:50] [INFO ] Flow matrix only has 229 transitions (discarded 65 similar events)
[2026-05-24 18:49:50] [INFO ] Invariant cache hit.
[2026-05-24 18:49:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 7/142 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 228/370 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 168 constraints, problems are : Problem set: 0 solved, 293 unsolved in 16113 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 7/142 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 228/370 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 293/460 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 1/371 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 0/371 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 461 constraints, problems are : Problem set: 0 solved, 293 unsolved in 14407 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 142/142 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30534ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 30535ms
Starting structural reductions in LTL mode, iteration 1 : 142/225 places, 294/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30662 ms. Remains : 142/225 places, 294/331 transitions.
[2026-05-24 18:50:20] [INFO ] Flatten gal took : 7 ms
[2026-05-24 18:50:20] [INFO ] Flatten gal took : 5 ms
[2026-05-24 18:50:20] [INFO ] Input system was already deterministic with 294 transitions.
[2026-05-24 18:50:20] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:50:20] [INFO ] Flatten gal took : 3 ms
[2026-05-24 18:50:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16504596364330871744.gal : 1 ms
[2026-05-24 18:50:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7193103232869444049.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/CTLFireability16504596364330871744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7193103232869444049.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.84829e+15,0.045622,5164,2,400,5,1611,6,0,777,1156,0


Converting to forward existential form...Done !
original formula: A((p50==1) U (AG(((!(((p157==1)&&(p318==1))) + E(((p146==1)&&(p430==1)) U ((p147==1)&&(p395==1)))) + ((!((p1==1)&&(p225==1)))||(!((p137==...250
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(((!(((p157==1)&&(p318==1))) + E(((p146==1)&&(p430==1)) U ((p147==1)&&(p395==1))))...952
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 290/4/4
Hit Full ! (commute/partial/dont) 292/0/2
(forward)formula 0,1,0.186677,9844,1,0,17,27567,51,4,3705,7088,20
FORMULA DLCround-PT-13a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-24 18:50:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 18:50:20] [INFO ] Flatten gal took : 4 ms
Total runtime 453716 ms.

BK_STOP 1779648620979

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

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