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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Mar 6 15:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 6 15:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 6 15:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 15:15 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.9K Mar 15 09:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 6 15:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 139K Mar 6 15:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 545K 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 DLCflexbar-PT-2a-CTLFireability-2024-00
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-01
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-02
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-03
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-04
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-05
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-06
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-07
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-08
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-09
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-10
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-11
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-12
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-13
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-14
FORMULA_NAME DLCflexbar-PT-2a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779607185861

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-2a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 07:19: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 07:19:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:19:47] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2026-05-24 07:19:47] [INFO ] Transformed 353 places.
[2026-05-24 07:19:47] [INFO ] Transformed 2169 transitions.
[2026-05-24 07:19:47] [INFO ] Found NUPN structural information;
[2026-05-24 07:19:47] [INFO ] Parsed PT model containing 353 places and 2169 transitions and 8205 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 264 transitions
Reduce redundant transitions removed 264 transitions.
Support contains 126 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 1905/1905 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 320 transition count 1700
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 320 transition count 1700
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 81 place count 320 transition count 1685
Drop transitions (Redundant composition of simpler transitions.) removed 574 transitions
Redundant transition composition rules discarded 574 transitions
Iterating global reduction 1 with 574 rules applied. Total rules applied 655 place count 320 transition count 1111
Applied a total of 655 rules in 98 ms. Remains 320 /353 variables (removed 33) and now considering 1111/1905 (removed 794) transitions.
[2026-05-24 07:19:47] [INFO ] Flow matrix only has 218 transitions (discarded 893 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13001984191065282262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15796425772866069269.kers'
[2026-05-24 07:19:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13001984191065282262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15796425772866069269.kers]
Normalized transition count is 217 out of 218 initially.
Culling duplicate invariants (modulo rational): removing 172 columns.
Culled 172 columns in 0 ms.
// Phase 1: matrix 217 rows 148 cols 457 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-24 07:19:47] [INFO ] Computed 196 invariants in 1 ms
Computed 196 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15796425772866069269.kers
Total runtime 2 ms.
[2026-05-24 07:19:48] [INFO ] Implicit Places using invariants in 656 ms returned [148, 150, 152, 153, 154, 155, 156, 157, 158, 160, 162, 164, 165, 166, 167, 169, 171, 172, 174, 175, 176, 178, 179, 180, 181, 182, 183, 184, 186, 187, 189, 190, 197, 198, 199, 200, 201, 202, 204, 205, 207, 209, 211, 212, 213, 214, 215, 217, 219, 220, 221, 222, 229, 230, 232, 234, 235, 236, 237, 238, 242, 243, 244, 245, 247, 249, 250, 251, 252, 253, 254, 255, 256, 258, 260, 261, 262, 264, 266, 269, 270, 274, 275, 278, 281, 284, 285, 286, 287, 288, 290, 292, 293, 296, 298, 301, 302, 304, 305, 306, 310, 311, 312, 314, 318, 319]
Discarding 106 places :
Ensure Unique test removed 446 transitions
Reduce isomorphic transitions removed 446 transitions.
Implicit Place search using SMT only with invariants took 689 ms to find 106 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/353 places, 665/1905 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 371 transitions
Redundant transition composition rules discarded 371 transitions
Iterating global reduction 0 with 371 rules applied. Total rules applied 371 place count 214 transition count 294
Applied a total of 371 rules in 8 ms. Remains 214 /214 variables (removed 0) and now considering 294/665 (removed 371) transitions.
[2026-05-24 07:19:48] [INFO ] Flow matrix only has 218 transitions (discarded 76 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-74810157819560528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2454682273024850577.kers'
[2026-05-24 07:19:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-74810157819560528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2454682273024850577.kers]
Normalized transition count is 217 out of 218 initially.
Culling duplicate invariants (modulo rational): removing 66 columns.
Culled 66 columns in 0 ms.
// Phase 1: matrix 217 rows 148 cols 457 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-24 07:19:48] [INFO ] Computed 90 invariants in 0 ms
Computed 90 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2454682273024850577.kers
Total runtime 1 ms.
[2026-05-24 07:19:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 07:19:48] [INFO ] Flow matrix only has 218 transitions (discarded 76 similar events)
[2026-05-24 07:19:48] [INFO ] Invariant cache hit.
[2026-05-24 07:19:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 07:19:48] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 214/353 places, 294/1905 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 988 ms. Remains : 214/353 places, 294/1905 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Applied a total of 0 rules in 2 ms. Remains 214 /214 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2026-05-24 07:19:48] [INFO ] Flow matrix only has 218 transitions (discarded 76 similar events)
[2026-05-24 07:19:48] [INFO ] Invariant cache hit.
[2026-05-24 07:19:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 07:19:48] [INFO ] Flow matrix only has 218 transitions (discarded 76 similar events)
[2026-05-24 07:19:48] [INFO ] Invariant cache hit.
[2026-05-24 07:19:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 07:19:48] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2026-05-24 07:19:48] [INFO ] Flow matrix only has 218 transitions (discarded 76 similar events)
[2026-05-24 07:19:48] [INFO ] Invariant cache hit.
[2026-05-24 07:19:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 62/214 variables, 62/90 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 217/431 variables, 214/304 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 1/432 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 0/432 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 307 constraints, problems are : Problem set: 0 solved, 293 unsolved in 20479 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 214/214 constraints, ReadFeed: 3/3 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/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 62/214 variables, 62/90 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 217/431 variables, 214/304 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 293/599 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 1/432 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/432 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 600 constraints, problems are : Problem set: 0 solved, 293 unsolved in 21940 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 214/214 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42509ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 42522ms
Finished structural reductions in LTL mode , in 1 iterations and 42693 ms. Remains : 214/214 places, 294/294 transitions.
Support contains 126 out of 214 places after structural reductions.
[2026-05-24 07:20:31] [INFO ] Flatten gal took : 74 ms
[2026-05-24 07:20:31] [INFO ] Flatten gal took : 30 ms
[2026-05-24 07:20:31] [INFO ] Input system was already deterministic with 294 transitions.
Support contains 124 out of 214 places (down from 126) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1218 ms. (32 steps per ms) remains 1/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
[2026-05-24 07:20:32] [INFO ] Flow matrix only has 218 transitions (discarded 76 similar events)
[2026-05-24 07:20:32] [INFO ] Invariant cache hit.
[2026-05-24 07:20:32] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 194/214 variables, 84/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 217/431 variables, 214/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/432 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/432 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 214/214 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 20/432 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 6/90 constraints, State Equation: 0/214 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-24 07:20:32] [INFO ] Flatten gal took : 11 ms
[2026-05-24 07:20:32] [INFO ] Flatten gal took : 30 ms
[2026-05-24 07:20:32] [INFO ] Input system was already deterministic with 294 transitions.
Computed a total of 67 stabilizing places and 1 stable transitions
Graph (complete) has 393 edges and 214 vertex of which 152 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.15 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Graph (trivial) has 258 edges and 214 vertex of which 125 / 214 are part of one of the 23 SCC in 2 ms
Free SCC test removed 102 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Graph (complete) has 177 edges and 112 vertex of which 54 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 76
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 52 transition count 74
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 50 transition count 73
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 34 place count 27 transition count 47
Iterating global reduction 3 with 23 rules applied. Total rules applied 57 place count 27 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 26 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 26 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 24 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 24 transition count 41
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 24 transition count 41
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 70 place count 22 transition count 39
Iterating global reduction 5 with 2 rules applied. Total rules applied 72 place count 22 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 74 place count 22 transition count 37
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 75 place count 22 transition count 36
Applied a total of 75 rules in 32 ms. Remains 22 /214 variables (removed 192) and now considering 36/294 (removed 258) transitions.
[2026-05-24 07:20:32] [INFO ] Flow matrix only has 24 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8116398322135510949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17201331989491895245.kers'
[2026-05-24 07:20:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8116398322135510949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17201331989491895245.kers]
Normalized transition count is 23 out of 24 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 23 rows 17 cols 48 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 07:20:32] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17201331989491895245.kers
Total runtime 1 ms.
[2026-05-24 07:20:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 07:20:32] [INFO ] Flow matrix only has 24 transitions (discarded 12 similar events)
[2026-05-24 07:20:32] [INFO ] Invariant cache hit.
[2026-05-24 07:20:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2026-05-24 07:20:32] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2026-05-24 07:20:32] [INFO ] Flow matrix only has 24 transitions (discarded 12 similar events)
[2026-05-24 07:20:32] [INFO ] Invariant cache hit.
[2026-05-24 07:20:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 4/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 23/45 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/46 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/46 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 31 constraints, problems are : Problem set: 0 solved, 35 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 4/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 23/45 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/46 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/46 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 66 constraints, problems are : Problem set: 0 solved, 35 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1344ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 1345ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/214 places, 36/294 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1451 ms. Remains : 22/214 places, 36/294 transitions.
[2026-05-24 07:20:33] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:20:33] [INFO ] Flatten gal took : 2 ms
[2026-05-24 07:20:33] [INFO ] Input system was already deterministic with 36 transitions.
[2026-05-24 07:20:33] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:33] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11705811348039792925.gal : 1 ms
[2026-05-24 07:20:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12816743857982592807.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/CTLFireability11705811348039792925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12816743857982592807.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,127,0.017178,3828,2,49,5,182,6,0,99,119,0


Converting to forward existential form...Done !
original formula: E(EF((((p166==1)&&(p292==1))&&((p159==1)&&(p249==1)))) U !((EF(((p56==1)&&(p236==1))) + ((p169==1)&&(p342==1)))))
=> equivalent forward existential formula: [((FwdU(Init,E(TRUE U (((p166==1)&&(p292==1))&&((p159==1)&&(p249==1))))) * !(((p169==1)&&(p342==1)))) * !(E(TRUE...192
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.020173,4120,1,0,6,605,14,0,434,213,5
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Graph (trivial) has 266 edges and 214 vertex of which 131 / 214 are part of one of the 24 SCC in 1 ms
Free SCC test removed 107 places
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Graph (complete) has 165 edges and 107 vertex of which 50 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.1 ms
Discarding 57 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 48 transition count 64
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 27 place count 27 transition count 40
Iterating global reduction 2 with 21 rules applied. Total rules applied 48 place count 27 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 27 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 26 transition count 38
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 53 place count 26 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 25 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 24 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 24 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 24 transition count 35
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 23 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 23 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 23 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 23 transition count 32
Applied a total of 61 rules in 15 ms. Remains 23 /214 variables (removed 191) and now considering 32/294 (removed 262) transitions.
[2026-05-24 07:20:33] [INFO ] Flow matrix only has 20 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10412722346492818480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17155544453686384339.kers'
[2026-05-24 07:20:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10412722346492818480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17155544453686384339.kers]
Normalized transition count is 19 out of 20 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 19 rows 17 cols 42 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-24 07:20:33] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17155544453686384339.kers
Total runtime 0 ms.
[2026-05-24 07:20:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 07:20:33] [INFO ] Flow matrix only has 20 transitions (discarded 12 similar events)
[2026-05-24 07:20:33] [INFO ] Invariant cache hit.
[2026-05-24 07:20:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-24 07:20:34] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2026-05-24 07:20:34] [INFO ] Flow matrix only has 20 transitions (discarded 12 similar events)
[2026-05-24 07:20:34] [INFO ] Invariant cache hit.
[2026-05-24 07:20:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 5/23 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 19/42 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 31 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 5/23 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 19/42 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 31/65 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 66 constraints, problems are : Problem set: 0 solved, 31 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 835ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 835ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/214 places, 32/294 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 907 ms. Remains : 23/214 places, 32/294 transitions.
[2026-05-24 07:20:34] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:34] [INFO ] Flatten gal took : 2 ms
[2026-05-24 07:20:34] [INFO ] Input system was already deterministic with 32 transitions.
[2026-05-24 07:20:34] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:34] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11634943739764490912.gal : 0 ms
[2026-05-24 07:20:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9255119455571262243.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/CTLFireability11634943739764490912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9255119455571262243.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,217,0.003654,3892,2,54,5,190,6,0,96,123,0


Converting to forward existential form...Done !
original formula: AG(AF((((p95==0)||(p327==0))||((((p33==1)&&((p22==0)||(p227==0)))&&((p159==0)||(p225==0)))||(((p159==1)&&(p226==1))&&((p147==1)&&(p218==1...162
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p95==0)||(p327==0))||((((p33==1)&&((p22==0)||(p227==0)))&&((p159==0)||(p225==0)))||((...214
Hit Full ! (commute/partial/dont) 15/41/17
(forward)formula 0,0,0.008133,4192,1,0,7,860,20,0,527,632,9
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 155 transition count 294
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 76 place count 138 transition count 260
Iterating global reduction 1 with 17 rules applied. Total rules applied 93 place count 138 transition count 260
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 138 transition count 255
Applied a total of 98 rules in 8 ms. Remains 138 /214 variables (removed 76) and now considering 255/294 (removed 39) transitions.
[2026-05-24 07:20:34] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12401642551009879274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17270958840209919181.kers'
[2026-05-24 07:20:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12401642551009879274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17270958840209919181.kers]
Normalized transition count is 198 out of 199 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 198 rows 134 cols 419 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 07:20:34] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17270958840209919181.kers
Total runtime 0 ms.
[2026-05-24 07:20:34] [INFO ] Implicit Places using invariants in 36 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/214 places, 255/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 137/214 places, 255/294 transitions.
[2026-05-24 07:20:34] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:34] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:34] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-24 07:20:34] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:34] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8440437033278862667.gal : 3 ms
[2026-05-24 07:20:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17881554250124984777.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/CTLFireability8440437033278862667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17881554250124984777.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,4.39453e+17,0.028906,4996,2,383,5,1473,6,0,739,1018,0


Converting to forward existential form...Done !
original formula: AG((AX((!(A((p98==1) U ((p179==1)&&(p313==1)))) + EF((p45==0)))) + !(A(((p112==1)&&(p251==1)) U AG(((p156==1)&&(p256==1)))))))
=> equivalent forward existential formula: [(((EY((FwdU(Init,TRUE) * !(!(!((E(!(!(E(TRUE U !(((p156==1)&&(p256==1)))))) U (!(((p112==1)&&(p251==1))) * !(!(...397
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 245/0/10
(forward)formula 0,1,0.110973,8236,1,0,10,20305,29,1,3256,2234,13
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 155 transition count 294
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 74 place count 140 transition count 264
Iterating global reduction 1 with 15 rules applied. Total rules applied 89 place count 140 transition count 264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 92 place count 140 transition count 261
Applied a total of 92 rules in 11 ms. Remains 140 /214 variables (removed 74) and now considering 261/294 (removed 33) transitions.
[2026-05-24 07:20:35] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1567082290385557230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2101206596288608960.kers'
[2026-05-24 07:20:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1567082290385557230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2101206596288608960.kers]
Normalized transition count is 202 out of 203 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 202 rows 136 cols 427 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 07:20:35] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2101206596288608960.kers
Total runtime 1 ms.
[2026-05-24 07:20:35] [INFO ] Implicit Places using invariants in 39 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/214 places, 261/294 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 139/214 places, 261/294 transitions.
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:35] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10837270821802634067.gal : 3 ms
[2026-05-24 07:20:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4140355848014760477.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/CTLFireability10837270821802634067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4140355848014760477.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.32813e+17,0.030079,5060,2,389,5,1504,6,0,751,1034,0


Converting to forward existential form...Done !
original formula: AG((AX(EX(((p127==0)||(p257==0)))) + (AF(((p141==0)||(p194==0))) * !(A((p105==1) U ((p135==1)&&(p259==1)))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(!(EX(!(EX(((p127==0)||(p257==0)))))))),!(((p141==0)||(p194==0))))] = FALSE * [(((Fwd...336
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 257/0/4
(forward)formula 0,1,0.119504,8732,1,0,11,22253,33,1,3315,3340,13
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 153 transition count 294
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 79 place count 135 transition count 258
Iterating global reduction 1 with 18 rules applied. Total rules applied 97 place count 135 transition count 258
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 102 place count 135 transition count 253
Applied a total of 102 rules in 4 ms. Remains 135 /214 variables (removed 79) and now considering 253/294 (removed 41) transitions.
[2026-05-24 07:20:35] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1172815796065616901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-540631890149617540.kers'
[2026-05-24 07:20:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1172815796065616901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-540631890149617540.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 197 rows 133 cols 417 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 07:20:35] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-540631890149617540.kers
Total runtime 1 ms.
[2026-05-24 07:20:35] [INFO ] Implicit Places using invariants in 39 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/214 places, 253/294 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 134/214 places, 253/294 transitions.
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:35] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12950986364158996566.gal : 2 ms
[2026-05-24 07:20:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11230261567921754912.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/CTLFireability12950986364158996566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11230261567921754912.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.90625e+17,0.028332,4988,2,376,5,1446,6,0,732,1001,0


Converting to forward existential form...Done !
original formula: EF(AX(EX(EF((((p47==1)&&(p160==1))&&(p226==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(E(TRUE U (((p47==1)&&(p160==1))&&(p226==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.092947,7580,1,0,6,19159,14,0,3056,1641,5
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 157 transition count 294
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 139 transition count 258
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 139 transition count 258
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 139 transition count 253
Applied a total of 98 rules in 12 ms. Remains 139 /214 variables (removed 75) and now considering 253/294 (removed 41) transitions.
[2026-05-24 07:20:35] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11009819909533189340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10907706396911554273.kers'
[2026-05-24 07:20:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11009819909533189340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10907706396911554273.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 197 rows 133 cols 417 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 07:20:35] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10907706396911554273.kers
Total runtime 1 ms.
[2026-05-24 07:20:35] [INFO ] Implicit Places using invariants in 42 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/214 places, 253/294 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 138/214 places, 253/294 transitions.
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:35] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:35] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:35] [INFO ] Time to serialize gal into /tmp/CTLFireability392465175983979437.gal : 1 ms
[2026-05-24 07:20:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17936577109836574902.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/CTLFireability392465175983979437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17936577109836574902.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.90625e+17,0.030692,5000,2,384,5,1470,6,0,736,1013,0


Converting to forward existential form...Done !
original formula: AX(EX((AX(AX(((p42==1)&&(p192==1)))) * (((p179==0)||(p301==0)) + ((AX(((p98==0)||(p328==0))) * ((p177==0)||(p330==0))) * ((p157==0)||(p22...166
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(EX(!(!(EX(!(((p42==1)&&(p192==1)))))))) * (((p179==0)||(p301==0)) + ((!(EX(!(((p98==0)||(p3...231
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.103129,8056,1,0,17,22605,16,5,3031,4120,11
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Graph (trivial) has 263 edges and 214 vertex of which 126 / 214 are part of one of the 24 SCC in 1 ms
Free SCC test removed 102 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Graph (complete) has 177 edges and 112 vertex of which 53 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.2 ms
Discarding 59 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 53 transition count 75
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 50 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 49 transition count 74
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 34 place count 25 transition count 46
Iterating global reduction 3 with 24 rules applied. Total rules applied 58 place count 25 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 25 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 24 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 24 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 23 transition count 40
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 22 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 22 transition count 39
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 70 place count 22 transition count 39
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 72 place count 20 transition count 37
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 20 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 76 place count 20 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 78 place count 20 transition count 33
Applied a total of 78 rules in 18 ms. Remains 20 /214 variables (removed 194) and now considering 33/294 (removed 261) transitions.
[2026-05-24 07:20:35] [INFO ] Flow matrix only has 21 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5750351086571752604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14796666177992073421.kers'
[2026-05-24 07:20:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5750351086571752604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14796666177992073421.kers]
Normalized transition count is 20 out of 21 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 20 rows 16 cols 42 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 07:20:35] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14796666177992073421.kers
Total runtime 0 ms.
[2026-05-24 07:20:35] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 07:20:35] [INFO ] Flow matrix only has 21 transitions (discarded 12 similar events)
[2026-05-24 07:20:35] [INFO ] Invariant cache hit.
[2026-05-24 07:20:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-24 07:20:35] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-24 07:20:35] [INFO ] Flow matrix only has 21 transitions (discarded 12 similar events)
[2026-05-24 07:20:35] [INFO ] Invariant cache hit.
[2026-05-24 07:20:35] [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, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 20/40 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 28 constraints, problems are : Problem set: 0 solved, 32 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 20/40 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 32/59 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 60 constraints, problems are : Problem set: 0 solved, 32 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 866ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 868ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/214 places, 33/294 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 937 ms. Remains : 20/214 places, 33/294 transitions.
[2026-05-24 07:20:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:36] [INFO ] Input system was already deterministic with 33 transitions.
[2026-05-24 07:20:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:36] [INFO ] Time to serialize gal into /tmp/CTLFireability17763474844208360191.gal : 1 ms
[2026-05-24 07:20:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3496512807315545613.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/CTLFireability17763474844208360191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3496512807315545613.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,109,0.010273,3900,2,42,5,161,6,0,91,104,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((!(A(((p159==1)&&(p221==1)) U ((p179==1)&&(p305==1)))) * ((p168==0)||(p272==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((!(!((E(!(((p179==1)&&(p305==1))) U (!(((p159==1)&&(p221==1))) * !((...255
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 26/0/7
(forward)formula 0,0,0.020152,4312,1,0,11,651,29,2,459,356,13
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 154 transition count 294
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 78 place count 136 transition count 258
Iterating global reduction 1 with 18 rules applied. Total rules applied 96 place count 136 transition count 258
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 101 place count 136 transition count 253
Applied a total of 101 rules in 4 ms. Remains 136 /214 variables (removed 78) and now considering 253/294 (removed 41) transitions.
[2026-05-24 07:20:36] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11933876723293644887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15235813717046120501.kers'
[2026-05-24 07:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11933876723293644887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15235813717046120501.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 197 rows 133 cols 417 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 07:20:36] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15235813717046120501.kers
Total runtime 1 ms.
[2026-05-24 07:20:36] [INFO ] Implicit Places using invariants in 44 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/214 places, 253/294 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 135/214 places, 253/294 transitions.
[2026-05-24 07:20:36] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:36] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:36] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-24 07:20:36] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:36] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:20:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8737268352272929479.gal : 1 ms
[2026-05-24 07:20:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14692991240039059787.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/CTLFireability8737268352272929479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14692991240039059787.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.90625e+17,0.028454,4988,2,378,5,1452,6,0,733,1004,0


Converting to forward existential form...Done !
original formula: EF(AG(((AX(AF(((p177==1)&&(p322==1)))) * (p167==1)) * (p300==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EX(!(!(EG(!(((p177==1)&&(p322==1)))))))) * (p167==1)) * (p300==1))))))] != ...160
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.105506,7780,1,0,8,19497,25,0,3206,2054,12
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 163 transition count 294
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 147 transition count 262
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 147 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 88 place count 147 transition count 257
Applied a total of 88 rules in 2 ms. Remains 147 /214 variables (removed 67) and now considering 257/294 (removed 37) transitions.
[2026-05-24 07:20:36] [INFO ] Flow matrix only has 199 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3384868206439827104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7842917877563093625.kers'
[2026-05-24 07:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3384868206439827104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7842917877563093625.kers]
Normalized transition count is 198 out of 199 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 198 rows 134 cols 419 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 07:20:36] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7842917877563093625.kers
Total runtime 0 ms.
[2026-05-24 07:20:36] [INFO ] Implicit Places using invariants in 38 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/214 places, 257/294 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 146 transition count 255
Applied a total of 2 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 255/257 (removed 2) transitions.
[2026-05-24 07:20:36] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2535799973946478177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3336250305147294934.kers'
[2026-05-24 07:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2535799973946478177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3336250305147294934.kers]
Normalized transition count is 198 out of 199 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 198 rows 134 cols 419 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 07:20:36] [INFO ] Computed 36 invariants in 0 ms
Computed 36 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3336250305147294934.kers
Total runtime 1 ms.
[2026-05-24 07:20:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 07:20:36] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2026-05-24 07:20:36] [INFO ] Invariant cache hit.
[2026-05-24 07:20:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:37] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/214 places, 255/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 146/214 places, 255/294 transitions.
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 14 ms
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:20:37] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:37] [INFO ] Time to serialize gal into /tmp/CTLFireability481841712750792710.gal : 1 ms
[2026-05-24 07:20:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8585291820043202018.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/CTLFireability481841712750792710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8585291820043202018.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.39453e+17,0.030344,5020,2,401,5,1527,6,0,748,1045,0


Converting to forward existential form...Done !
original formula: EF((((EX(((p119==1)&&(p333==1))) * A(((EX(((p149==1)&&(p201==1))) + !(((p158==1)&&(p224==1)))) + A(((p149==1)&&(p182==1)) U (p54==1))) U ...393
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((EX(((p119==1)&&(p333==1))) * !((E(!(((((!(((p158==1)&&(p258==1))&&((p42==1)&&(p312==1)))...1567
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 253/0/2
Hit Full ! (commute/partial/dont) 224/109/31
(forward)formula 0,1,0.172065,9808,1,0,27,28653,45,11,3809,9348,25
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 153 transition count 294
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 76 place count 138 transition count 264
Iterating global reduction 1 with 15 rules applied. Total rules applied 91 place count 138 transition count 264
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 95 place count 138 transition count 260
Applied a total of 95 rules in 8 ms. Remains 138 /214 variables (removed 76) and now considering 260/294 (removed 34) transitions.
[2026-05-24 07:20:37] [INFO ] Flow matrix only has 201 transitions (discarded 59 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17109601038842788597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8840749157852371532.kers'
[2026-05-24 07:20:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17109601038842788597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8840749157852371532.kers]
Normalized transition count is 200 out of 201 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 200 rows 135 cols 423 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 07:20:37] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8840749157852371532.kers
Total runtime 1 ms.
[2026-05-24 07:20:37] [INFO ] Implicit Places using invariants in 45 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/214 places, 260/294 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 137 transition count 258
Applied a total of 2 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 258/260 (removed 2) transitions.
[2026-05-24 07:20:37] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10985025826872104098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10347081972053008161.kers'
[2026-05-24 07:20:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10985025826872104098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10347081972053008161.kers]
Normalized transition count is 200 out of 201 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 200 rows 135 cols 423 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 07:20:37] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10347081972053008161.kers
Total runtime 1 ms.
[2026-05-24 07:20:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 07:20:37] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2026-05-24 07:20:37] [INFO ] Invariant cache hit.
[2026-05-24 07:20:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:37] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/214 places, 258/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 137/214 places, 258/294 transitions.
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:20:37] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:20:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10189219655173883691.gal : 1 ms
[2026-05-24 07:20:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17889632989340936186.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/CTLFireability10189219655173883691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17889632989340936186.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,5.27344e+17,0.032721,5060,2,384,5,1483,6,0,744,1025,0


Converting to forward existential form...Done !
original formula: EF(AG(((EX((((p166==0)||(p264==0))&&(p128==1))) * (p35==1)) * (p229==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((EX((((p166==0)||(p264==0))&&(p128==1))) * (p35==1)) * (p229==1))))))] != FALS...156
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.10484,7844,1,0,11,20897,16,3,3113,2688,8
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 156 transition count 294
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 75 place count 139 transition count 260
Iterating global reduction 1 with 17 rules applied. Total rules applied 92 place count 139 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 139 transition count 256
Applied a total of 96 rules in 7 ms. Remains 139 /214 variables (removed 75) and now considering 256/294 (removed 38) transitions.
[2026-05-24 07:20:37] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15384909307226914505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-747782883661731635.kers'
[2026-05-24 07:20:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15384909307226914505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-747782883661731635.kers]
Normalized transition count is 199 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 199 rows 134 cols 421 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 07:20:37] [INFO ] Computed 29 invariants in 1 ms
Computed 29 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-747782883661731635.kers
Total runtime 1 ms.
[2026-05-24 07:20:37] [INFO ] Implicit Places using invariants in 50 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/214 places, 256/294 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 138/214 places, 256/294 transitions.
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:20:37] [INFO ] Input system was already deterministic with 256 transitions.
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:37] [INFO ] Time to serialize gal into /tmp/CTLFireability12159904095505240134.gal : 1 ms
[2026-05-24 07:20:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4008912564807277897.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/CTLFireability12159904095505240134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4008912564807277897.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,4.6875e+17,0.030041,5004,2,385,5,1480,6,0,741,1020,0


Converting to forward existential form...Done !
original formula: AX(AX((EG(EF(((p179==1)&&(p346==1)))) + (EG(((p79==0)||(p243==0))) * ((((p155==0)||(p256==0))||((p169==0)||(p281==0)))||(p83==0))))))
=> equivalent forward existential formula: [((EY(EY(Init)) * !((EG(((p79==0)||(p243==0))) * ((((p155==0)||(p256==0))||((p169==0)||(p281==0)))||(p83==0)))))...207
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.110095,7916,1,0,7,20092,17,0,3247,2100,9
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-10 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 : 214/214 places, 294/294 transitions.
Graph (trivial) has 266 edges and 214 vertex of which 132 / 214 are part of one of the 24 SCC in 2 ms
Free SCC test removed 108 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Graph (complete) has 164 edges and 106 vertex of which 46 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 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 46 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 64
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 29 place count 20 transition count 34
Iterating global reduction 2 with 25 rules applied. Total rules applied 54 place count 20 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 19 transition count 31
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 60 place count 19 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 18 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 17 transition count 28
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 17 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 17 transition count 28
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 16 transition count 27
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 16 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 16 transition count 26
Applied a total of 67 rules in 24 ms. Remains 16 /214 variables (removed 198) and now considering 26/294 (removed 268) transitions.
[2026-05-24 07:20:37] [INFO ] Flow matrix only has 17 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2098734054446071801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1448632739152489935.kers'
[2026-05-24 07:20:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2098734054446071801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1448632739152489935.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 13 cols 34 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 07:20:37] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1448632739152489935.kers
Total runtime 0 ms.
[2026-05-24 07:20:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 07:20:37] [INFO ] Flow matrix only has 17 transitions (discarded 9 similar events)
[2026-05-24 07:20:37] [INFO ] Invariant cache hit.
[2026-05-24 07:20:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-24 07:20:37] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2026-05-24 07:20:37] [INFO ] Flow matrix only has 17 transitions (discarded 9 similar events)
[2026-05-24 07:20:37] [INFO ] Invariant cache hit.
[2026-05-24 07:20:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 23 constraints, problems are : Problem set: 0 solved, 25 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 1/33 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 48 constraints, problems are : Problem set: 0 solved, 25 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 637ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/214 places, 26/294 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 719 ms. Remains : 16/214 places, 26/294 transitions.
[2026-05-24 07:20:38] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:38] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:38] [INFO ] Input system was already deterministic with 26 transitions.
[2026-05-24 07:20:38] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:38] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2123234173936303125.gal : 1 ms
[2026-05-24 07:20:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9636590999220620553.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/CTLFireability2123234173936303125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9636590999220620553.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,43,0.008407,3856,2,34,5,133,6,0,74,85,0


Converting to forward existential form...Done !
original formula: A((p129==1) U (!(((p179==1)&&(p313==1))) * EF(((!(AF((p116==1))) * (p176==1)) * (p310==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(((p179==1)&&(p313==1))) * E(TRUE U ((!(!(EG(!((p116==1))))) * (p176==1)) * (p310==1)))))))) ...380
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.018825,4560,1,0,16,602,34,10,375,412,19
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 165 transition count 294
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 150 transition count 264
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 150 transition count 264
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 150 transition count 260
Applied a total of 83 rules in 3 ms. Remains 150 /214 variables (removed 64) and now considering 260/294 (removed 34) transitions.
[2026-05-24 07:20:38] [INFO ] Flow matrix only has 201 transitions (discarded 59 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13650708264968220120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6811264990020443237.kers'
[2026-05-24 07:20:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13650708264968220120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6811264990020443237.kers]
Normalized transition count is 200 out of 201 initially.
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 200 rows 135 cols 423 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 07:20:38] [INFO ] Computed 39 invariants in 0 ms
Computed 39 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6811264990020443237.kers
Total runtime 1 ms.
[2026-05-24 07:20:38] [INFO ] Implicit Places using invariants in 45 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/214 places, 260/294 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 149 transition count 258
Applied a total of 2 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 258/260 (removed 2) transitions.
[2026-05-24 07:20:38] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8104147110794397652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9106817230498508860.kers'
[2026-05-24 07:20:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8104147110794397652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9106817230498508860.kers]
Normalized transition count is 200 out of 201 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 200 rows 135 cols 423 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 07:20:38] [INFO ] Computed 38 invariants in 2 ms
Computed 38 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9106817230498508860.kers
Total runtime 2 ms.
[2026-05-24 07:20:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 07:20:38] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2026-05-24 07:20:38] [INFO ] Invariant cache hit.
[2026-05-24 07:20:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:38] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/214 places, 258/294 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 149/214 places, 258/294 transitions.
[2026-05-24 07:20:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:38] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-24 07:20:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17783069731443016067.gal : 1 ms
[2026-05-24 07:20:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7038532591805191131.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/CTLFireability17783069731443016067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7038532591805191131.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.625e+17,0.035983,5084,2,408,5,1555,6,0,756,1056,0


Converting to forward existential form...Done !
original formula: EF(((((EG(((p169==1)&&(p279==1))) * AX((((p133==1)&&(p298==1))&&((p169==1)&&(p292==1))))) * (E(((p169==1)&&(p273==1)) U ((p67==1)&&(p239=...482
=> equivalent forward existential formula: ([(((((FwdU(Init,TRUE) * (((EG(((p169==1)&&(p279==1))) * !(EX(!((((p133==1)&&(p298==1))&&((p169==1)&&(p292==1)))...993
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 248/10/10
(forward)formula 0,0,0.150521,9224,1,0,21,25018,51,5,3475,4982,26
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Graph (trivial) has 273 edges and 214 vertex of which 132 / 214 are part of one of the 23 SCC in 0 ms
Free SCC test removed 109 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Graph (complete) has 160 edges and 105 vertex of which 44 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 59
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 42 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 41 transition count 58
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 33 place count 16 transition count 29
Iterating global reduction 3 with 25 rules applied. Total rules applied 58 place count 16 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 62 place count 16 transition count 25
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 64 place count 15 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 66 place count 14 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 70 place count 14 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 71 place count 13 transition count 19
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 72 place count 12 transition count 18
Iterating global reduction 6 with 1 rules applied. Total rules applied 73 place count 12 transition count 18
Applied a total of 73 rules in 4 ms. Remains 12 /214 variables (removed 202) and now considering 18/294 (removed 276) transitions.
[2026-05-24 07:20:38] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8850192511408627165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4163881924962334386.kers'
[2026-05-24 07:20:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8850192511408627165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4163881924962334386.kers]
Normalized transition count is 11 out of 12 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 23 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 07:20:38] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4163881924962334386.kers
Total runtime 1 ms.
[2026-05-24 07:20:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 07:20:38] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
[2026-05-24 07:20:38] [INFO ] Invariant cache hit.
[2026-05-24 07:20:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:20:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-24 07:20:38] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2026-05-24 07:20:38] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
[2026-05-24 07:20:38] [INFO ] Invariant cache hit.
[2026-05-24 07:20:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 11/23 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 17 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 11/23 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 35 constraints, problems are : Problem set: 0 solved, 17 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 391ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 391ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/214 places, 18/294 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 453 ms. Remains : 12/214 places, 18/294 transitions.
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:20:39] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:20:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8909793814209291478.gal : 0 ms
[2026-05-24 07:20:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8606169422519151349.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/CTLFireability8909793814209291478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8606169422519151349.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,16,0.002605,3824,2,24,5,90,6,0,53,57,0


Converting to forward existential form...Done !
original formula: EF((AG(((p84==1)&&(p324==1))) * EG(((p175==1)&&(p304==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(TRUE U !(((p84==1)&&(p324==1)))))),((p175==1)&&(p304==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.004428,4224,1,0,8,245,24,0,254,134,9
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 294/294 transitions.
Graph (trivial) has 283 edges and 214 vertex of which 142 / 214 are part of one of the 24 SCC in 0 ms
Free SCC test removed 118 places
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Graph (complete) has 138 edges and 96 vertex of which 34 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.0 ms
Discarding 62 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (trivial) has 8 edges and 7 vertex of which 4 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 4 transition count 10
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 65 place count 2 transition count 4
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 66 place count 2 transition count 3
Applied a total of 66 rules in 3 ms. Remains 2 /214 variables (removed 212) and now considering 3/294 (removed 291) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10372353245874738360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17638617492143580854.kers'
[2026-05-24 07:20:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10372353245874738360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17638617492143580854.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-24 07:20:39] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17638617492143580854.kers
Total runtime 0 ms.
[2026-05-24 07:20:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 07:20:39] [INFO ] Invariant cache hit.
[2026-05-24 07:20:39] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2026-05-24 07:20:39] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-24 07:20:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 54ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/214 places, 3/294 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 2/214 places, 3/294 transitions.
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:39] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:20:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3399863822819199690.gal : 1 ms
[2026-05-24 07:20:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1469331907956775167.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/CTLFireability3399863822819199690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1469331907956775167.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,0.002834,3728,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: EG((p48==0))
=> equivalent forward existential formula: [FwdG(Init,(p48==0))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.003849,3996,1,0,5,18,18,0,49,11,8
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-14 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 : 214/214 places, 294/294 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 158 transition count 294
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 71 place count 143 transition count 264
Iterating global reduction 1 with 15 rules applied. Total rules applied 86 place count 143 transition count 264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 91 place count 143 transition count 259
Applied a total of 91 rules in 3 ms. Remains 143 /214 variables (removed 71) and now considering 259/294 (removed 35) transitions.
[2026-05-24 07:20:39] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1430669615609320325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5412273936677751287.kers'
[2026-05-24 07:20:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1430669615609320325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5412273936677751287.kers]
Normalized transition count is 200 out of 201 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 200 rows 136 cols 423 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 07:20:39] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5412273936677751287.kers
Total runtime 1 ms.
[2026-05-24 07:20:39] [INFO ] Implicit Places using invariants in 47 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/214 places, 259/294 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 142/214 places, 259/294 transitions.
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:39] [INFO ] Input system was already deterministic with 259 transitions.
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:20:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14772624509386190699.gal : 2 ms
[2026-05-24 07:20:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6619572282551599756.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/CTLFireability14772624509386190699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6619572282551599756.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.56183e+17,0.029918,5064,2,395,5,1521,6,0,752,1049,0


Converting to forward existential form...Done !
original formula: AX((((AX(((p158==0)||(p260==0))) * EF((p139==1))) * (EX((((p174==0)||(p164==0))||(p290==0))) * EG(AF(((p28==0)||(p228==0)))))) * ((p144==...235
=> equivalent forward existential formula: ((([(EY(EY(Init)) * !(((p158==0)||(p260==0))))] = FALSE * [(EY(Init) * !(E(TRUE U (p139==1))))] = FALSE) * ([(EY...398
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.115065,8676,1,0,15,24980,26,5,3340,6079,10
FORMULA DLCflexbar-PT-2a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 07:20:39] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:20:39] [INFO ] Flatten gal took : 4 ms
Total runtime 52656 ms.

BK_STOP 1779607239727

--------------------
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="DLCflexbar-PT-2a"
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 DLCflexbar-PT-2a, 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-177955695500394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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