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.r130-smll-177955809000306.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 FlexibleBarrier-PT-04a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.1K Mar 7 05:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 05:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Mar 7 05:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 05:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 7 05:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:10 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 23K 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 FlexibleBarrier-PT-04a-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779865920143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-27 07:12:02] [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-27 07:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 07:12:02] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-27 07:12:02] [INFO ] Transformed 51 places.
[2026-05-27 07:12:02] [INFO ] Transformed 88 transitions.
[2026-05-27 07:12:02] [INFO ] Found NUPN structural information;
[2026-05-27 07:12:02] [INFO ] Parsed PT model containing 51 places and 88 transitions and 309 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Support contains 43 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 33 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (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-2774487590623888536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15957111169466566717.kers'
[2026-05-27 07:12:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2774487590623888536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15957111169466566717.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 74 rows 49 cols 169 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-27 07:12:03] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15957111169466566717.kers
Total runtime 2 ms.
[2026-05-27 07:12:03] [INFO ] Implicit Places using invariants in 414 ms returned []
[2026-05-27 07:12:03] [INFO ] Invariant cache hit.
[2026-05-27 07:12:03] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-27 07:12:03] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2026-05-27 07:12:03] [INFO ] Invariant cache hit.
[2026-05-27 07:12:03] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3756 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 214 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3099 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6920ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 6940ms
Starting structural reductions in LTL mode, iteration 1 : 51/51 places, 74/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7694 ms. Remains : 51/51 places, 74/78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-27 07:12:10] [INFO ] Invariant cache hit.
[2026-05-27 07:12:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-27 07:12:10] [INFO ] Invariant cache hit.
[2026-05-27 07:12:10] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-27 07:12:10] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 51/51 places, 74/74 transitions.
Support contains 43 out of 51 places after structural reductions.
[2026-05-27 07:12:11] [INFO ] Flatten gal took : 36 ms
[2026-05-27 07:12:11] [INFO ] Flatten gal took : 16 ms
[2026-05-27 07:12:11] [INFO ] Input system was already deterministic with 74 transitions.
Support contains 42 out of 51 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 67 to 61
RANDOM walk for 40000 steps (8 resets) in 2257 ms. (17 steps per ms) remains 6/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
[2026-05-27 07:12:12] [INFO ] Invariant cache hit.
[2026-05-27 07:12:12] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp60 is UNSAT
After SMT solving in domain Real declared 51/125 variables, and 20 constraints, problems are : Problem set: 6 solved, 0 unsolved in 70 ms.
Refiners :[Domain max(s): 14/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/51 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2026-05-27 07:12:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-27 07:12:12] [INFO ] Flatten gal took : 10 ms
[2026-05-27 07:12:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-27 07:12:12] [INFO ] Flatten gal took : 12 ms
[2026-05-27 07:12:12] [INFO ] Input system was already deterministic with 74 transitions.
Support contains 37 out of 51 places (down from 42) after GAL structural reductions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 26 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 45 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 45 transition count 64
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 45 transition count 64
Applied a total of 10 rules in 45 ms. Remains 45 /51 variables (removed 6) and now considering 64/74 (removed 10) transitions.
[2026-05-27 07:12:12] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3129833652206272190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5283399240734801622.kers'
[2026-05-27 07:12:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3129833652206272190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5283399240734801622.kers]
Normalized transition count is 59 out of 60 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 59 rows 43 cols 123 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-27 07:12:12] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5283399240734801622.kers
Total runtime 1 ms.
[2026-05-27 07:12:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-27 07:12:12] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
[2026-05-27 07:12:12] [INFO ] Invariant cache hit.
[2026-05-27 07:12:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-27 07:12:12] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-27 07:12:12] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-27 07:12:12] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
[2026-05-27 07:12:12] [INFO ] Invariant cache hit.
[2026-05-27 07:12:12] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 59/104 variables, 45/96 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 28/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 1/105 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 125 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3816 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 59/104 variables, 45/96 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 28/124 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 63/187 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 1/105 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 188 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3217 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7056ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7057ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/51 places, 64/74 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7333 ms. Remains : 45/51 places, 64/74 transitions.
[2026-05-27 07:12:19] [INFO ] Flatten gal took : 11 ms
[2026-05-27 07:12:19] [INFO ] Flatten gal took : 13 ms
[2026-05-27 07:12:19] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-27 07:12:19] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:19] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11395842210798183422.gal : 3 ms
[2026-05-27 07:12:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5608003685214573476.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11395842210798183422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5608003685214573476.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,11881,0.044451,4164,2,118,5,1361,6,0,240,1080,0


Converting to forward existential form...Done !
original formula: AF(E((!(E(!((((p12==1)&&(p47==1))&&(p49==1))) U EG((p27==1)))) + !(((AF((p10==1)) * (p1!=1)) * ((p16==1)&&(p50==1))))) U (!(EF(AG(((p28==...218
=> equivalent forward existential formula: [FwdG(Init,!(E((!(E(!((((p12==1)&&(p47==1))&&(p49==1))) U EG((p27==1)))) + !(((!(EG(!((p10==1)))) * (p1!=1)) * (...340
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 49/0/15
Using saturation style SCC detection
(forward)formula 0,1,0.111331,5524,1,0,42,7759,68,30,1297,5914,42
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 30 edges and 51 vertex of which 3 / 51 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 46 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 46 transition count 66
Applied a total of 10 rules in 19 ms. Remains 46 /51 variables (removed 5) and now considering 66/74 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12851316900256153269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9773101251872833548.kers'
[2026-05-27 07:12:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12851316900256153269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9773101251872833548.kers]
Normalized transition count is 65 out of 66 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 44 cols 141 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-27 07:12:20] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9773101251872833548.kers
Total runtime 1 ms.
[2026-05-27 07:12:20] [INFO ] Implicit Places using invariants in 116 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/51 places, 66/74 transitions.
Graph (trivial) has 45 edges and 45 vertex of which 11 / 45 are part of one of the 4 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 38 transition count 52
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 33 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 31 transition count 50
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 15 place count 31 transition count 46
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 27 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 26 transition count 44
Applied a total of 26 rules in 15 ms. Remains 26 /45 variables (removed 19) and now considering 44/66 (removed 22) transitions.
[2026-05-27 07:12:20] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2771944818284773580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3940317308444332080.kers'
[2026-05-27 07:12:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2771944818284773580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3940317308444332080.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 40 rows 25 cols 91 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-27 07:12:20] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3940317308444332080.kers
Total runtime 0 ms.
[2026-05-27 07:12:20] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-27 07:12:20] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2026-05-27 07:12:20] [INFO ] Invariant cache hit.
[2026-05-27 07:12:20] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 07:12:20] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 26/51 places, 44/74 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 288 ms. Remains : 26/51 places, 44/74 transitions.
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 4 ms
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 4 ms
[2026-05-27 07:12:20] [INFO ] Input system was already deterministic with 44 transitions.
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 4 ms
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 3 ms
[2026-05-27 07:12:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1219686486949327383.gal : 2 ms
[2026-05-27 07:12:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15243598811900974113.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/CTLFireability1219686486949327383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15243598811900974113.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,785,0.012413,4028,2,64,5,362,6,0,144,284,0


Converting to forward existential form...Done !
original formula: EF((EG(E((p34==1) U (p47==1))) * AF((AG((((p24==0)||(p47==0))||(p49==0))) + AG((p22==0))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG(E((p34==1) U (p47==1)))) * !(EG(!((!(E(TRUE U !((((p24==0)||(p47==0))||(p49==0))))) + !(...192
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.026923,4452,1,0,8,1312,20,0,704,666,12
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 20 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 45 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 45 transition count 62
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 45 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 44 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 44 transition count 61
Applied a total of 16 rules in 21 ms. Remains 44 /51 variables (removed 7) and now considering 61/74 (removed 13) transitions.
[2026-05-27 07:12:20] [INFO ] Flow matrix only has 59 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8878523653495461901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12261195532148750571.kers'
[2026-05-27 07:12:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8878523653495461901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12261195532148750571.kers]
Normalized transition count is 58 out of 59 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 58 rows 42 cols 123 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-27 07:12:20] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12261195532148750571.kers
Total runtime 0 ms.
[2026-05-27 07:12:20] [INFO ] Implicit Places using invariants in 70 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/51 places, 61/74 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 43 transition count 58
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 40 transition count 58
Applied a total of 6 rules in 6 ms. Remains 40 /43 variables (removed 3) and now considering 58/61 (removed 3) transitions.
[2026-05-27 07:12:20] [INFO ] Flow matrix only has 56 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8100618303664564236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-676996560966013357.kers'
[2026-05-27 07:12:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8100618303664564236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-676996560966013357.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 55 rows 39 cols 117 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-27 07:12:20] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-676996560966013357.kers
Total runtime 1 ms.
[2026-05-27 07:12:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-27 07:12:20] [INFO ] Flow matrix only has 56 transitions (discarded 2 similar events)
[2026-05-27 07:12:20] [INFO ] Invariant cache hit.
[2026-05-27 07:12:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-27 07:12:20] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/51 places, 58/74 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 281 ms. Remains : 40/51 places, 58/74 transitions.
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:20] [INFO ] Input system was already deterministic with 58 transitions.
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13269935327759422690.gal : 2 ms
[2026-05-27 07:12:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2854572109707371399.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/CTLFireability13269935327759422690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2854572109707371399.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,7921,0.021518,4204,2,107,5,1192,6,0,216,921,0


Converting to forward existential form...Done !
original formula: E(EG((EF(AG((p13==1))) + (((p12==1)||(((p32==1)&&(p40==1))&&((p50==1)&&((p8==1)||(p33==1)))))&&((p35==1)||(((p11==1)&&(p41==1))&&((p27==1...184
=> equivalent forward existential formula: [(FwdU(Init,EG((E(TRUE U !(E(TRUE U !((p13==1))))) + (((p12==1)||(((p32==1)&&(p40==1))&&((p50==1)&&((p8==1)||(p3...248
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.045133,4676,1,0,10,2933,28,2,1095,1368,14
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (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-4711820397574742960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17144021903498635318.kers'
[2026-05-27 07:12:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4711820397574742960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17144021903498635318.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 74 rows 49 cols 169 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-27 07:12:20] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17144021903498635318.kers
Total runtime 1 ms.
[2026-05-27 07:12:20] [INFO ] Implicit Places using invariants in 114 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 50/51 places, 74/74 transitions.
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:20] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:21] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-27 07:12:21] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:21] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10291028392743278218.gal : 2 ms
[2026-05-27 07:12:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17573953606779195919.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/CTLFireability10291028392743278218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17573953606779195919.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,20737,0.018272,4264,2,164,5,1300,6,0,274,1016,0


Converting to forward existential form...Done !
original formula: AX((AX((EG((p48==1)) + ((p35==1)&&(p49==1)))) + (((p23==1)&&(p36==1))&&(p49==1))))
=> equivalent forward existential formula: [((EY((EY(Init) * !((((p23==1)&&(p36==1))&&(p49==1))))) * !(((p35==1)&&(p49==1)))) * !(EG((p48==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.040803,5376,1,0,16,4909,22,6,1211,2045,11
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-27 07:12:21] [INFO ] Invariant cache hit.
[2026-05-27 07:12:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-27 07:12:21] [INFO ] Invariant cache hit.
[2026-05-27 07:12:21] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-27 07:12:21] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2026-05-27 07:12:21] [INFO ] Invariant cache hit.
[2026-05-27 07:12:21] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3605 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 214 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3403 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7031ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7032ms
Finished structural reductions in LTL mode , in 1 iterations and 7219 ms. Remains : 51/51 places, 74/74 transitions.
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:28] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:12:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13642022718955999629.gal : 1 ms
[2026-05-27 07:12:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6894581231598001933.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/CTLFireability13642022718955999629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6894581231598001933.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,20737,0.033914,4428,2,152,5,1985,6,0,276,1530,0


Converting to forward existential form...Done !
original formula: (EF(AG((EG(((p33==0)||(p50==0))) * (((p12==0)||(p23==0))||(p49==0))))) * ((AX(AX((p8==0))) + AG(EX((((((p24==0)||(p35==0))||(p49==0))&&((...270
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !((EG(((p33==0)||(p50==0))) * (((p12==0)||(p23==0))||(p49==0)))))))))] = FALSE *...577
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.119952,5928,1,0,20,11234,29,7,1370,6083,18
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-27 07:12:28] [INFO ] Invariant cache hit.
[2026-05-27 07:12:28] [INFO ] Implicit Places using invariants in 94 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 50/51 places, 74/74 transitions.
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:28] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4393160442970985000.gal : 2 ms
[2026-05-27 07:12:28] [INFO ] Time to serialize properties into /tmp/CTLFireability114778911332288788.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/CTLFireability4393160442970985000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability114778911332288788.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20737,0.028944,4328,2,141,5,1663,6,0,274,1228,0


Converting to forward existential form...Done !
original formula: AX(AG(EX(EX(((p41==0)||(p50==0))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(EX(((p41==0)||(p50==0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.049864,4648,1,0,6,3769,10,0,1136,1228,4
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 30 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 44 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 44 transition count 59
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 44 transition count 59
Applied a total of 16 rules in 19 ms. Remains 44 /51 variables (removed 7) and now considering 59/74 (removed 15) transitions.
[2026-05-27 07:12:28] [INFO ] Flow matrix only has 57 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13880925248983657436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8191339572874892847.kers'
[2026-05-27 07:12:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13880925248983657436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8191339572874892847.kers]
Normalized transition count is 56 out of 57 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 56 rows 42 cols 117 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-27 07:12:28] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8191339572874892847.kers
Total runtime 1 ms.
[2026-05-27 07:12:28] [INFO ] Implicit Places using invariants in 78 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/51 places, 59/74 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 43 transition count 55
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 39 transition count 55
Applied a total of 8 rules in 8 ms. Remains 39 /43 variables (removed 4) and now considering 55/59 (removed 4) transitions.
[2026-05-27 07:12:28] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5474591931608605114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4971551693714558129.kers'
[2026-05-27 07:12:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5474591931608605114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4971551693714558129.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 52 rows 38 cols 109 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-27 07:12:28] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4971551693714558129.kers
Total runtime 1 ms.
[2026-05-27 07:12:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-27 07:12:28] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
[2026-05-27 07:12:28] [INFO ] Invariant cache hit.
[2026-05-27 07:12:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-27 07:12:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/51 places, 55/74 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 295 ms. Remains : 39/51 places, 55/74 transitions.
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 4 ms
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 4 ms
[2026-05-27 07:12:28] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:28] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6567925850927690845.gal : 1 ms
[2026-05-27 07:12:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2547177698809036711.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/CTLFireability6567925850927690845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2547177698809036711.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,7041,0.018683,4144,2,102,5,1009,6,0,209,649,0


Converting to forward existential form...Done !
original formula: AF((AG(EF(((p39==0)||(p20==0)))) * ((EF((((p16==0)||(p50==0))||(p44==0))) + (p35==0)) + (p48==0))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(E(TRUE U ((p39==0)||(p20==0)))))) * ((E(TRUE U (((p16==0)||(p50==0))||(p44==0))) + (p...186
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.041847,4676,1,0,10,2396,23,2,978,1102,13
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (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-8851498729251495744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9339722926147048853.kers'
[2026-05-27 07:12:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8851498729251495744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9339722926147048853.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 74 rows 49 cols 169 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-27 07:12:29] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9339722926147048853.kers
Total runtime 1 ms.
[2026-05-27 07:12:29] [INFO ] Implicit Places using invariants in 96 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 50/51 places, 74/74 transitions.
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:29] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10477085200074799089.gal : 2 ms
[2026-05-27 07:12:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5941711341090282079.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/CTLFireability10477085200074799089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5941711341090282079.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,20737,0.028146,4340,2,141,5,1663,6,0,274,1228,0


Converting to forward existential form...Done !
original formula: EG(((p34==0) + ((p12==0) * AG(EX(((p5==0)||(p50==0)))))))
=> equivalent forward existential formula: [FwdG(Init,((p34==0) + ((p12==0) * !(E(TRUE U !(EX(((p5==0)||(p50==0)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.163319,7408,1,0,105,15941,21,70,1215,22226,79
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-27 07:12:29] [INFO ] Invariant cache hit.
[2026-05-27 07:12:29] [INFO ] Implicit Places using invariants in 110 ms returned [49, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 112 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 49/51 places, 74/74 transitions.
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:29] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6853126710404039307.gal : 1 ms
[2026-05-27 07:12:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6020689389589695607.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/CTLFireability6853126710404039307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6020689389589695607.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,20737,0.021009,4224,2,141,5,866,6,0,272,592,0


Converting to forward existential form...Done !
original formula: EX((p44==1))
=> equivalent forward existential formula: [(EY(Init) * (p44==1))] != FALSE
(forward)formula 0,0,0.024252,4488,1,0,7,866,8,1,337,592,2
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-27 07:12:29] [INFO ] Invariant cache hit.
[2026-05-27 07:12:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-27 07:12:29] [INFO ] Invariant cache hit.
[2026-05-27 07:12:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-27 07:12:29] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 51/51 places, 74/74 transitions.
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:29] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:12:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7307097728087516348.gal : 1 ms
[2026-05-27 07:12:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2940830284755150251.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/CTLFireability7307097728087516348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2940830284755150251.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,20737,0.032497,4432,2,152,5,1985,6,0,276,1530,0


Converting to forward existential form...Done !
original formula: (AX(((p4==0)||(p50==0))) * EG((((p30==1)&&(p49==1)) + EX(EX((p8==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(((p4==0)||(p50==0))))] = FALSE * [(Init * !(EG((((p30==1)&&(p49==1)) + EX(EX((p8==1)))))))] = FA...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.084306,5444,1,0,13,8420,18,3,1343,4415,10
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-27 07:12:29] [INFO ] Invariant cache hit.
[2026-05-27 07:12:29] [INFO ] Implicit Places using invariants in 70 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 50/51 places, 74/74 transitions.
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 4 ms
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 3 ms
[2026-05-27 07:12:29] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 3 ms
[2026-05-27 07:12:29] [INFO ] Flatten gal took : 3 ms
[2026-05-27 07:12:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6323762945441502202.gal : 1 ms
[2026-05-27 07:12:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1166933569534539573.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/CTLFireability6323762945441502202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1166933569534539573.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,20737,0.01634,4268,2,164,5,1300,6,0,274,1016,0


Converting to forward existential form...Done !
original formula: EF(((E((E((p1!=1) U A((p24==1) U (p27==1))) + ((EX((p48==1)) * EG((((p12==1)&&(p47==1))&&(p49==1)))) * EX((p37==1)))) U !(((((p34==1)||((...333
=> equivalent forward existential formula: ((([((FwdU(FwdU(Init,TRUE),(E((p1!=1) U !((E(!((p27==1)) U (!((p24==1)) * !((p27==1)))) + EG(!((p27==1)))))) + (...718
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 71/0/3
Hit Full ! (commute/partial/dont) 71/0/3
(forward)formula 0,1,0.058348,5848,1,0,22,8040,47,9,1408,4492,26
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-12 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 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2026-05-27 07:12:30] [INFO ] Invariant cache hit.
[2026-05-27 07:12:30] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-27 07:12:30] [INFO ] Invariant cache hit.
[2026-05-27 07:12:30] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-27 07:12:30] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 51/51 places, 74/74 transitions.
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 3 ms
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 2 ms
[2026-05-27 07:12:30] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 2 ms
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 2 ms
[2026-05-27 07:12:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4355622433657394705.gal : 1 ms
[2026-05-27 07:12:30] [INFO ] Time to serialize properties into /tmp/CTLFireability556557735748404571.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/CTLFireability4355622433657394705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability556557735748404571.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20737,0.032788,4428,2,152,5,1985,6,0,276,1530,0


Converting to forward existential form...Done !
original formula: AF(EX((((p48==0) + E((((p12==1)&&(p35==1))&&(p49==1)) U ((p4==1)&&(p50==1)))) + EG(((p20==0)&&(((p24==0)||(p47==0))||(p49==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((p48==0) + E((((p12==1)&&(p35==1))&&(p49==1)) U ((p4==1)&&(p50==1)))) + EG(((p20==0)&&(((p24==...194
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 55/27/19
(forward)formula 0,1,0.083058,5220,1,0,12,6759,31,2,1335,3818,13
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 30 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 44 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 44 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 14 place count 44 transition count 58
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 16 place count 43 transition count 58
Applied a total of 16 rules in 9 ms. Remains 43 /51 variables (removed 8) and now considering 58/74 (removed 16) transitions.
[2026-05-27 07:12:30] [INFO ] Flow matrix only has 57 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16801341941875613626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13803387618090874673.kers'
[2026-05-27 07:12:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16801341941875613626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13803387618090874673.kers]
Normalized transition count is 56 out of 57 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 56 rows 41 cols 117 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-27 07:12:30] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13803387618090874673.kers
Total runtime 1 ms.
[2026-05-27 07:12:30] [INFO ] Implicit Places using invariants in 86 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/51 places, 58/74 transitions.
Graph (trivial) has 38 edges and 42 vertex of which 11 / 42 are part of one of the 4 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 35 transition count 45
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 31 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 30 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 30 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 27 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 27 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 26 transition count 39
Applied a total of 20 rules in 6 ms. Remains 26 /42 variables (removed 16) and now considering 39/58 (removed 19) transitions.
[2026-05-27 07:12:30] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17978042552365091046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5297745486227022912.kers'
[2026-05-27 07:12:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17978042552365091046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5297745486227022912.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 34 rows 25 cols 73 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-27 07:12:30] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5297745486227022912.kers
Total runtime 0 ms.
[2026-05-27 07:12:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-27 07:12:30] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
[2026-05-27 07:12:30] [INFO ] Invariant cache hit.
[2026-05-27 07:12:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-27 07:12:30] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 26/51 places, 39/74 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 210 ms. Remains : 26/51 places, 39/74 transitions.
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 2 ms
[2026-05-27 07:12:30] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 2 ms
[2026-05-27 07:12:30] [INFO ] Time to serialize gal into /tmp/CTLFireability18430935306466565280.gal : 1 ms
[2026-05-27 07:12:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14653785514639828493.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/CTLFireability18430935306466565280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14653785514639828493.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,769,0.011953,3972,2,58,5,331,6,0,138,284,0


Converting to forward existential form...Done !
original formula: AG(AF(E((((p8==1)||(p41==1))||((p20==1)||((p42==1)&&(p49==1)))) U (((p12==1)&&(p47==1))&&(p49==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E((((p8==1)||(p41==1))||((p20==1)||((p42==1)&&(p49==1)))) U (((p12==1)&&(p47==1))&&(p49=...171
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 24/0/15
(forward)formula 0,0,0.036669,4496,1,0,12,2782,23,4,656,2472,13
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 36 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 50 edges and 40 vertex of which 30 / 40 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 16 transition count 60
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 48 place count 12 transition count 22
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 10 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 10 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 63 place count 8 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 8 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 67 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 67 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 71 place count 4 transition count 5
Applied a total of 71 rules in 6 ms. Remains 4 /51 variables (removed 47) and now considering 5/74 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15800679456873596501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2125002774438454995.kers'
[2026-05-27 07:12:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15800679456873596501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2125002774438454995.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-27 07:12:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2125002774438454995.kers
Total runtime 0 ms.
[2026-05-27 07:12:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-27 07:12:30] [INFO ] Invariant cache hit.
[2026-05-27 07:12:30] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-27 07:12:30] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-27 07:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/51 places, 5/74 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 170 ms. Remains : 4/51 places, 5/74 transitions.
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:12:30] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:12:30] [INFO ] Time to serialize gal into /tmp/CTLFireability6327376693929329282.gal : 1 ms
[2026-05-27 07:12:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3877102572577694171.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/CTLFireability6327376693929329282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3877102572577694171.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.002977,3740,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: EF((AG((p44==1)) * (p8==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p8==1)) * !(E(TRUE U !((p44==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.004383,4020,1,0,6,45,13,0,81,19,5
FORMULA FlexibleBarrier-PT-04a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-27 07:12:30] [INFO ] Flatten gal took : 8 ms
[2026-05-27 07:12:30] [INFO ] Flatten gal took : 3 ms
Total runtime 28322 ms.

BK_STOP 1779865950905

--------------------
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="FlexibleBarrier-PT-04a"
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 FlexibleBarrier-PT-04a, 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 r130-smll-177955809000306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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