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.r146-tall-177961074100394.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 GPUForwardProgress-PT-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.2K Mar 7 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 195K Mar 7 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 132K Mar 7 11:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 14K 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 GPUForwardProgress-PT-08a-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-12
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-13
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-14
FORMULA_NAME GPUForwardProgress-PT-08a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779724712841

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 15:58:34] [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-25 15:58:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:58:34] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2026-05-25 15:58:34] [INFO ] Transformed 40 places.
[2026-05-25 15:58:34] [INFO ] Transformed 49 transitions.
[2026-05-25 15:58:34] [INFO ] Found NUPN structural information;
[2026-05-25 15:58:34] [INFO ] Parsed PT model containing 40 places and 49 transitions and 181 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Support contains 40 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9305407875587899605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11220434131509984289.kers'
[2026-05-25 15:58:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9305407875587899605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11220434131509984289.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:58:34] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11220434131509984289.kers
Total runtime 1 ms.
[2026-05-25 15:58:34] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-25 15:58:34] [INFO ] Invariant cache hit.
[2026-05-25 15:58:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:34] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:58:34] [INFO ] Invariant cache hit.
[2026-05-25 15:58:34] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/78 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2004 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/79 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 137 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2418 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4466ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 4486ms
Finished structural reductions in LTL mode , in 1 iterations and 4960 ms. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:58:39] [INFO ] Invariant cache hit.
[2026-05-25 15:58:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:58:39] [INFO ] Invariant cache hit.
[2026-05-25 15:58:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:39] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 40/40 places, 39/39 transitions.
Support contains 40 out of 40 places after structural reductions.
[2026-05-25 15:58:41] [INFO ] Flatten gal took : 21 ms
[2026-05-25 15:58:41] [INFO ] Flatten gal took : 16 ms
[2026-05-25 15:58:41] [INFO ] Input system was already deterministic with 39 transitions.
Reduction of identical properties reduced properties to check from 61 to 55
RANDOM walk for 40000 steps (314 resets) in 1318 ms. (30 steps per ms) remains 4/55 properties
BEST_FIRST walk for 40002 steps (8 resets) in 440 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (134 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
[2026-05-25 15:58:42] [INFO ] Invariant cache hit.
[2026-05-25 15:58:42] [INFO ] State equation strengthened by 9 read => feed constraints.
Problem AtomicPropp0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 18/30 variables, 7/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 18/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/39 variables, 3/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 9/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 38/77 variables, 39/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 8/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/78 variables, 1/97 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 1/98 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/98 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/99 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 99 constraints, problems are : Problem set: 3 solved, 1 unsolved in 174 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/26 variables, 6/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 18/32 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/39 variables, 4/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 13/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/77 variables, 39/88 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 8/96 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 1/97 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/77 variables, 0/97 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/78 variables, 1/98 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 1/99 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/78 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/79 variables, 1/100 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/79 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 100 constraints, problems are : Problem set: 3 solved, 1 unsolved in 246 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 434ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-05-25 15:58:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:58:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:58:43] [INFO ] Input system was already deterministic with 39 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 5 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3276465121723489921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8780503230662982998.kers'
[2026-05-25 15:58:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3276465121723489921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8780503230662982998.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:58:43] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8780503230662982998.kers
Total runtime 0 ms.
[2026-05-25 15:58:43] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 15:58:43] [INFO ] Invariant cache hit.
[2026-05-25 15:58:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:58:43] [INFO ] Invariant cache hit.
[2026-05-25 15:58:43] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 96 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1352 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 134 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2119 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3495ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3496ms
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3689 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:58:46] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:58:46] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:58:46] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:58:46] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:58:46] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7452974346123252895.gal : 5 ms
[2026-05-25 15:58:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15860288304643439877.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/CTLFireability7452974346123252895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15860288304643439877.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,380093,0.06794,5492,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: AG((((AX((p22==0)) + EX((((p32==0)||(p35==0))||(p39==0)))) + (((p34==0)&&(((p10==0)||(p35==0))||(p39==0)))&&((((p4==0)||(p35==0))||(p39==...315
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !((((p34==0)&&(((p10==0)||(p35==0))||(p39==0)))&&((((p4==0)||(p35==0))||(p39==0))&&((p...414
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.113206,6940,1,0,236,18633,111,122,1363,12163,293
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 29 transition count 31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 23 transition count 31
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 0 with 2 rules applied. Total rules applied 15 place count 22 transition count 30
Applied a total of 15 rules in 13 ms. Remains 22 /40 variables (removed 18) and now considering 30/39 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14155650943892052345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3381406325514703815.kers'
[2026-05-25 15:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14155650943892052345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3381406325514703815.kers]
Normalized transition count is 29 out of 30 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 29 rows 22 cols 82 entries
Finished phase 1 with 20 SingleSign rule and 1 generalized
[2026-05-25 15:58:47] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3381406325514703815.kers
Total runtime 0 ms.
[2026-05-25 15:58:47] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 15:58:47] [INFO ] Invariant cache hit.
[2026-05-25 15:58:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 15:58:47] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2026-05-25 15:58:47] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2026-05-25 15:58:47] [INFO ] Invariant cache hit.
[2026-05-25 15:58:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 29/43 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 8/51 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 1/52 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 46 constraints, problems are : Problem set: 0 solved, 22 unsolved in 519 ms.
Refiners :[Domain max(s): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 29/43 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 8/51 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/52 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/52 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 68 constraints, problems are : Problem set: 0 solved, 22 unsolved in 548 ms.
Refiners :[Domain max(s): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1074ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 1074ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/40 places, 30/39 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1228 ms. Remains : 22/40 places, 30/39 transitions.
[2026-05-25 15:58:48] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:48] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:48] [INFO ] Input system was already deterministic with 30 transitions.
[2026-05-25 15:58:48] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:58:48] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16985528773617418697.gal : 1 ms
[2026-05-25 15:58:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14118869718973399862.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/CTLFireability16985528773617418697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14118869718973399862.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,45503,0.026169,4252,2,95,5,2073,6,0,120,1822,0


Converting to forward existential form...Done !
original formula: EF(AG(!(E((p27==1) U (p15==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(E((p27==1) U (p15==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t7, t8, t9, t11, t13, t14, t16, t19, t21, Intersection with reachable at each step e...210
(forward)formula 0,1,0.045352,5092,1,0,105,6808,84,49,791,7542,99
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3495049751409282810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10778537494432374819.kers'
[2026-05-25 15:58:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3495049751409282810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10778537494432374819.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:58:48] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10778537494432374819.kers
Total runtime 0 ms.
[2026-05-25 15:58:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 15:58:48] [INFO ] Invariant cache hit.
[2026-05-25 15:58:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:48] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:58:48] [INFO ] Invariant cache hit.
[2026-05-25 15:58:48] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 96 constraints, problems are : Problem set: 0 solved, 38 unsolved in 961 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 134 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2005 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3000ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3000ms
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3109 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:58:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:58:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:51] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:58:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:58:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15134359332288023733.gal : 1 ms
[2026-05-25 15:58:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11463937409557219801.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/CTLFireability15134359332288023733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11463937409557219801.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,380093,0.046277,5592,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: (E(!((((p34!=1)||(p23==1))||(p19==1))) U E((((EX((p3==1)) * EG((p15==1))) + (((p6==1)&&(p35==1))&&(p39==1))) + !(EG((((p30==1)&&(p35==1))...516
=> equivalent forward existential formula: ([(Init * !(E(!((((p34!=1)||(p23==1))||(p19==1))) U E((((EX((p3==1)) * EG((p15==1))) + (((p6==1)&&(p35==1))&&(p3...928
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,1,0.243217,14184,1,0,385,61988,128,184,1410,57951,513
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 30 transition count 32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 24 transition count 32
Applied a total of 13 rules in 3 ms. Remains 24 /40 variables (removed 16) and now considering 32/39 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6845041288042696569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14108242198556966151.kers'
[2026-05-25 15:58:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6845041288042696569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14108242198556966151.kers]
Normalized transition count is 31 out of 32 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 31 rows 24 cols 111 entries
Finished phase 1 with 22 SingleSign rule and 1 generalized
[2026-05-25 15:58:51] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14108242198556966151.kers
Total runtime 0 ms.
[2026-05-25 15:58:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 15:58:51] [INFO ] Invariant cache hit.
[2026-05-25 15:58:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-05-25 15:58:51] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2026-05-25 15:58:51] [INFO ] Invariant cache hit.
[2026-05-25 15:58:51] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 31/54 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 1/55 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 1/56 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 58 constraints, problems are : Problem set: 0 solved, 31 unsolved in 513 ms.
Refiners :[Domain max(s): 24/24 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 9/9 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/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 31/54 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 31/86 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/55 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/56 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/56 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 89 constraints, problems are : Problem set: 0 solved, 31 unsolved in 992 ms.
Refiners :[Domain max(s): 24/24 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1533ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1533ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/40 places, 32/39 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1615 ms. Remains : 24/40 places, 32/39 transitions.
[2026-05-25 15:58:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:58:53] [INFO ] Input system was already deterministic with 32 transitions.
[2026-05-25 15:58:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13606863137204267421.gal : 1 ms
[2026-05-25 15:58:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8128517164466038193.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/CTLFireability13606863137204267421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8128517164466038193.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,68830,0.026634,5072,2,108,5,6794,6,0,129,5684,0


Converting to forward existential form...Done !
original formula: EF(AG(E(!(A((p15==1) U (((p12==1)&&(p35==1))&&(p39==1)))) U ((E(((p35==1)&&(p37==1)) U (p26==1)) * AG((p15==1))) * (p15!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(!(!((E(!((((p12==1)&&(p35==1))&&(p39==1))) U (!((p15==1)) * !((((p12==1)&&(p3...314
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t9, t10, t11, t21, t23, t24, t26, t28, t31, Intersection with reachable at each ...216
(forward)formula 0,0,0.112204,9008,1,0,224,35246,100,107,992,27385,236
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 30 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 28 transition count 36
Applied a total of 5 rules in 2 ms. Remains 28 /40 variables (removed 12) and now considering 36/39 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12243375901217690867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9882652306603252882.kers'
[2026-05-25 15:58:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12243375901217690867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9882652306603252882.kers]
Normalized transition count is 35 out of 36 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 35 rows 28 cols 119 entries
Finished phase 1 with 26 SingleSign rule and 1 generalized
[2026-05-25 15:58:53] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9882652306603252882.kers
Total runtime 0 ms.
[2026-05-25 15:58:53] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 15:58:53] [INFO ] Invariant cache hit.
[2026-05-25 15:58:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:53] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2026-05-25 15:58:53] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2026-05-25 15:58:53] [INFO ] Invariant cache hit.
[2026-05-25 15:58:53] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 35/62 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 1/63 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1/64 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/64 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 66 constraints, problems are : Problem set: 0 solved, 35 unsolved in 514 ms.
Refiners :[Domain max(s): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 9/9 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/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 35/62 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 35/98 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/63 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 1/64 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/64 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 101 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1006 ms.
Refiners :[Domain max(s): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 1534ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/40 places, 36/39 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1625 ms. Remains : 28/40 places, 36/39 transitions.
[2026-05-25 15:58:55] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:58:55] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:58:55] [INFO ] Input system was already deterministic with 36 transitions.
[2026-05-25 15:58:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:58:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5774874555533433846.gal : 0 ms
[2026-05-25 15:58:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17886644898094488050.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/CTLFireability5774874555533433846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17886644898094488050.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,215350,0.018995,4688,2,157,5,4556,6,0,149,3678,0


Converting to forward existential form...Done !
original formula: (!(E(EF((((p30==1)&&(p35==1))&&(p39==1))) U EG(A((p38==1) U (((p18==1)&&(p35==1))&&(p39==1)))))) * A(!((AF((p3!=1)) * !(((E((p6==1) U (((...256
=> equivalent forward existential formula: ([FwdG(FwdU(Init,E(TRUE U (((p30==1)&&(p35==1))&&(p39==1)))),!((E(!((((p18==1)&&(p35==1))&&(p39==1))) U (!((p38=...506
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t17, t18, t19, t20, t21, t22, t23, t32, t34, Intersection with reachable at each...217
(forward)formula 0,1,0.493888,24096,1,0,631,134269,138,341,1080,127119,757
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 30 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 27 transition count 35
Applied a total of 7 rules in 4 ms. Remains 27 /40 variables (removed 13) and now considering 35/39 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8502990659645972237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8529245163464215471.kers'
[2026-05-25 15:58:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8502990659645972237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8529245163464215471.kers]
Normalized transition count is 34 out of 35 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 27 cols 117 entries
Finished phase 1 with 25 SingleSign rule and 1 generalized
[2026-05-25 15:58:55] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8529245163464215471.kers
Total runtime 1 ms.
[2026-05-25 15:58:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 15:58:55] [INFO ] Invariant cache hit.
[2026-05-25 15:58:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-25 15:58:55] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2026-05-25 15:58:55] [INFO ] Invariant cache hit.
[2026-05-25 15:58:55] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 34/60 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/62 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 64 constraints, problems are : Problem set: 0 solved, 34 unsolved in 526 ms.
Refiners :[Domain max(s): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 34/60 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/61 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 1/62 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/62 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 98 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1120 ms.
Refiners :[Domain max(s): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1651ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1652ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/40 places, 35/39 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1721 ms. Remains : 27/40 places, 35/39 transitions.
[2026-05-25 15:58:57] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:58:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:58:57] [INFO ] Input system was already deterministic with 35 transitions.
[2026-05-25 15:58:57] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:58:57] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:58:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15350004229899737600.gal : 0 ms
[2026-05-25 15:58:57] [INFO ] Time to serialize properties into /tmp/CTLFireability18284890085209996001.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/CTLFireability15350004229899737600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18284890085209996001.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,161998,0.019176,4772,2,169,5,5150,6,0,144,4191,0


Converting to forward existential form...Done !
original formula: !(E((EF((((p28==1)&&(p35==1))&&(p39==1))) * E(E(((((p6==1)&&(p35==1))&&(p39==1))||(p22==1)) U EF((p18==1))) U E((((p16==1)&&(p35==1))&&(p...426
=> equivalent forward existential formula: [((FwdU(Init,(E(TRUE U (((p28==1)&&(p35==1))&&(p39==1))) * E(E(((((p6==1)&&(p35==1))&&(p39==1))||(p22==1)) U E(T...516
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t15, t16, t17, t18, t19, t20, t29, t31, t34, Intersection with reachable at each...217
(forward)formula 0,1,0.070804,7228,1,0,119,17956,114,60,1068,13828,135
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13129760355362262589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9706208380239457111.kers'
[2026-05-25 15:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13129760355362262589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9706208380239457111.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:58:57] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9706208380239457111.kers
Total runtime 0 ms.
[2026-05-25 15:58:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 15:58:57] [INFO ] Invariant cache hit.
[2026-05-25 15:58:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:57] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:58:57] [INFO ] Invariant cache hit.
[2026-05-25 15:58:57] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 96 constraints, problems are : Problem set: 0 solved, 38 unsolved in 771 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 134 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1878 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2655ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2655ms
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2769 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:59:00] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:59:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:00] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:00] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16475857097137702296.gal : 0 ms
[2026-05-25 15:59:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2558387744881223429.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/CTLFireability16475857097137702296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2558387744881223429.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,380093,0.03563,5592,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: AF(EX(!(E(!(((((p6==1)&&(p35==1))&&((p39==1)&&(p20==1)))&&((p35==1)&&(p39==1)))) U !(EF((p15==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(!(((((p6==1)&&(p35==1))&&((p39==1)&&(p20==1)))&&((p35==1)&&(p39==1)))) U !(E(TRUE U (p15==1)...171
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.337122,18604,1,0,294,70714,109,182,1401,115410,261
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:59:00] [INFO ] Invariant cache hit.
[2026-05-25 15:59:00] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 15:59:00] [INFO ] Invariant cache hit.
[2026-05-25 15:59:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:00] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:59:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:00] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:00] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4015633341792303263.gal : 1 ms
[2026-05-25 15:59:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9121815584942850797.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/CTLFireability4015633341792303263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9121815584942850797.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,380093,0.03818,5600,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: AG((AG(EF((p34==1))) + (EX((p22==0)) * (((p26==0)||(p35==0))||(p39==0)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((EX((p22==0)) * (((p26==0)||(p35==0))||(p39==0))))),TRUE) * !(E(TRUE U (p34==1))))] ...162
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.05961,5864,1,0,94,9740,101,50,1413,8191,98
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3076816643722707934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12079936215253722721.kers'
[2026-05-25 15:59:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3076816643722707934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12079936215253722721.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:59:00] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12079936215253722721.kers
Total runtime 0 ms.
[2026-05-25 15:59:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 15:59:00] [INFO ] Invariant cache hit.
[2026-05-25 15:59:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:00] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:59:00] [INFO ] Invariant cache hit.
[2026-05-25 15:59:00] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/78 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 782 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/79 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 137 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1808 ms.
Refiners :[Domain max(s): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2599ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2599ms
Finished structural reductions in LTL mode , in 1 iterations and 2677 ms. Remains : 40/40 places, 39/39 transitions.
[2026-05-25 15:59:03] [INFO ] Flatten gal took : 5 ms
[2026-05-25 15:59:03] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:03] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:03] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:03] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8574404587749670397.gal : 1 ms
[2026-05-25 15:59:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6643497047692882132.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/CTLFireability8574404587749670397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6643497047692882132.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,380093,0.043075,5640,2,193,5,10085,6,0,200,8337,0


Converting to forward existential form...Done !
original formula: (E(AX((((p14==1)&&(p35==1))&&(p39==1))) U A(((p23==1) + ((AF((p34==1)) + ((p37==1)&&(p23==1))) * !(((p35==1)&&(p37==1))))) U !(A((p6==1) ...568
=> equivalent forward existential formula: ([(FwdU((Init * !(E(!(EX(!((((p14==1)&&(p35==1))&&(p39==1))))) U !((E(!(!(!((E(!((p0==1)) U (!((p6==1)) * !((p0=...1398
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
Using saturation style SCC detection
(forward)formula 0,1,0.523475,23404,1,0,752,115274,158,391,1518,111522,1035
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:59:04] [INFO ] Invariant cache hit.
[2026-05-25 15:59:04] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 15:59:04] [INFO ] Invariant cache hit.
[2026-05-25 15:59:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:04] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 40/40 places, 39/39 transitions.
[2026-05-25 15:59:04] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:04] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:04] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:04] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:04] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13942607333250826702.gal : 1 ms
[2026-05-25 15:59:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4667322989140004594.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/CTLFireability13942607333250826702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4667322989140004594.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,380093,0.043107,5624,2,193,5,10085,6,0,200,8337,0


Converting to forward existential form...Done !
original formula: AF((EX(EG((((p14==0)||(p35==0))||(p39==0)))) + ((p18==1) * (((EF((p23==1)) + (p0==1)) + (AG(AF((p26==1))) + A((((((p1==1)&&(p5==1))&&((p9...318
=> equivalent forward existential formula: [FwdG(Init,!((EX(EG((((p14==0)||(p35==0))||(p39==0)))) + ((p18==1) * (((E(TRUE U (p23==1)) + (p0==1)) + (!(E(TRU...462
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.490654,22352,1,0,622,112709,132,339,1491,111152,808
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16630233300308212197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7281707735800696108.kers'
[2026-05-25 15:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16630233300308212197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7281707735800696108.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:59:04] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7281707735800696108.kers
Total runtime 0 ms.
[2026-05-25 15:59:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 15:59:04] [INFO ] Invariant cache hit.
[2026-05-25 15:59:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:04] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:59:04] [INFO ] Invariant cache hit.
[2026-05-25 15:59:04] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 96 constraints, problems are : Problem set: 0 solved, 38 unsolved in 800 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 134 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1972 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2777ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2777ms
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2867 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:59:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:59:07] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:07] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:07] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:07] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8602482514844969446.gal : 0 ms
[2026-05-25 15:59:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17772767404609758347.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/CTLFireability8602482514844969446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17772767404609758347.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,380093,0.041006,5572,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: ((EX(AX(AX((p3==1)))) * EF((((p16==0)||(p35==0))||(p39==0)))) * !(A(!(A(((p26==1)||(((p22==1)&&(p35==1))&&(p39==1))) U !((((p24==1)&&(p35...287
=> equivalent forward existential formula: ([(((FwdU((Init * (EX(!(EX(!(!(EX(!((p3==1)))))))) * E(TRUE U (((p16==0)||(p35==0))||(p39==0))))),!(((((!(((p20=...785
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.089181,7184,1,0,182,16834,124,89,1449,12448,205
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:59:07] [INFO ] Invariant cache hit.
[2026-05-25 15:59:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 15:59:07] [INFO ] Invariant cache hit.
[2026-05-25 15:59:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:59:07] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:07] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:07] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:07] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:59:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10183479780436922386.gal : 0 ms
[2026-05-25 15:59:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13526194101131757469.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/CTLFireability10183479780436922386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13526194101131757469.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,380093,0.042414,5600,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: (AG(AF(EG((p15==1)))) * AX(A((EX((p27!=1)) + !(((p0==1) + AX((p23==1))))) U !(((!(E((p15==1) U (p6==1))) + (p30!=1)) + !((((p10==1)&&(p35...177
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EG((p15==1))))] = FALSE * ((([((FwdU(EY(Init),!(!(((!(E((p15==1) U (p6==1))) + (p30!=1)...798
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.205292,12680,1,0,203,45890,106,160,1348,61169,220
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Graph (complete) has 122 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 30 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 26 transition count 34
Applied a total of 9 rules in 9 ms. Remains 26 /40 variables (removed 14) and now considering 34/39 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12502228753103214678.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1217460486554505752.kers'
[2026-05-25 15:59:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12502228753103214678.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1217460486554505752.kers]
Normalized transition count is 33 out of 34 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 26 cols 115 entries
Finished phase 1 with 24 SingleSign rule and 1 generalized
[2026-05-25 15:59:07] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1217460486554505752.kers
Total runtime 0 ms.
[2026-05-25 15:59:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 15:59:08] [INFO ] Invariant cache hit.
[2026-05-25 15:59:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2026-05-25 15:59:08] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-25 15:59:08] [INFO ] Invariant cache hit.
[2026-05-25 15:59:08] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 1/59 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 1/60 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 62 constraints, problems are : Problem set: 0 solved, 33 unsolved in 479 ms.
Refiners :[Domain max(s): 26/26 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 33/92 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 1/60 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 95 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1026 ms.
Refiners :[Domain max(s): 26/26 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1511ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1511ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/40 places, 34/39 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1593 ms. Remains : 26/40 places, 34/39 transitions.
[2026-05-25 15:59:09] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:59:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 15:59:09] [INFO ] Input system was already deterministic with 34 transitions.
[2026-05-25 15:59:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:09] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8616686913137148531.gal : 0 ms
[2026-05-25 15:59:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12371976082510931164.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/CTLFireability8616686913137148531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12371976082510931164.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,121822,0.019475,4400,2,139,5,2792,6,0,139,2429,0


Converting to forward existential form...Done !
original formula: AG(EF(((AF(((E((p18==1) U (p14==1)) * (p32==1)) * ((p35==1)&&(p39==1)))) * EG((p18==1))) * (EG((((p15==1)&&(p35==1))&&(p37==1))) * (AG((p...211
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(EG(!(((E((p18==1) U (p14==1)) * (p32==1)) * ((p35==1)&&(p39==1)))))) * EG((p1...289
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t13, t14, t15, t16, t17, t26, t29, t30, t32, Intersection with reachable at each...217
(forward)formula 0,0,0.051003,5756,1,0,127,11243,99,58,1017,9431,143
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3534855299992964729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4324034438264450071.kers'
[2026-05-25 15:59:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3534855299992964729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4324034438264450071.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:59:09] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4324034438264450071.kers
Total runtime 2 ms.
[2026-05-25 15:59:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 15:59:09] [INFO ] Invariant cache hit.
[2026-05-25 15:59:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:09] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:59:09] [INFO ] Invariant cache hit.
[2026-05-25 15:59:09] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 96 constraints, problems are : Problem set: 0 solved, 38 unsolved in 768 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 134 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1963 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2739ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2741ms
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2837 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 3 ms
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:12] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:12] [INFO ] Time to serialize gal into /tmp/CTLFireability18344966727351605696.gal : 1 ms
[2026-05-25 15:59:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2358781908365055277.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/CTLFireability18344966727351605696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2358781908365055277.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,380093,0.042737,5568,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: AG(E(EX(AG((p2==1))) U EX(!(((p35==1)&&(p37==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EX(!(E(TRUE U !((p2==1))))) U EX(!(((p35==1)&&(p37==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.062043,5836,1,0,92,9740,104,48,1375,8191,98
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:59:12] [INFO ] Invariant cache hit.
[2026-05-25 15:59:12] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 15:59:12] [INFO ] Invariant cache hit.
[2026-05-25 15:59:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:12] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13646856467980057958.gal : 0 ms
[2026-05-25 15:59:12] [INFO ] Time to serialize properties into /tmp/CTLFireability4955066432275666935.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/CTLFireability13646856467980057958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4955066432275666935.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,380093,0.040312,5596,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: AF(AX(E((p34==1) U (((p14==1)&&(p35==1))&&(p39==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E((p34==1) U (((p14==1)&&(p35==1))&&(p39==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.197263,12312,1,0,251,42003,103,158,1346,59065,215
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:59:12] [INFO ] Invariant cache hit.
[2026-05-25 15:59:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 15:59:12] [INFO ] Invariant cache hit.
[2026-05-25 15:59:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:59:12] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 39/40 places, 39/39 transitions.
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:12] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:12] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:59:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12088577545918238717.gal : 1 ms
[2026-05-25 15:59:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14338695942661236063.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/CTLFireability12088577545918238717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14338695942661236063.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,380093,0.04139,5596,2,187,5,9740,6,0,196,8191,0


Converting to forward existential form...Done !
original formula: AG(((!(E((AF((p3==1)) + EX((p10==1))) U AX((p15==1)))) * !(A((p30!=1) U A((p3==1) U (p27==1))))) * (p2==0)))
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,TRUE),(!(EG(!((p3==1)))) + EX((p10==1)))) * !(EX(!((p15==1)))))] = FALSE * [((FwdU(Init,TRUE)...456
(forward)formula 0,0,0.042246,5860,1,0,8,9740,9,2,201,8191,1
FORMULA GPUForwardProgress-PT-08a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 15:59:13] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:59:13] [INFO ] Flatten gal took : 2 ms
Total runtime 39009 ms.

BK_STOP 1779724753064

--------------------
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="GPUForwardProgress-PT-08a"
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 GPUForwardProgress-PT-08a, 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 r146-tall-177961074100394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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