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-177955809100435.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-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 6.4K Mar 7 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 06:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 06:56 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.6K Mar 15 10:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:15 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 321K 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-20a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779924236609

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-27 23:23:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 23:23:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 23:23:59] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2026-05-27 23:23:59] [INFO ] Transformed 243 places.
[2026-05-27 23:23:59] [INFO ] Transformed 1064 transitions.
[2026-05-27 23:23:59] [INFO ] Found NUPN structural information;
[2026-05-27 23:23:59] [INFO ] Parsed PT model containing 243 places and 1064 transitions and 5317 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 362 transitions
Reduce redundant transitions removed 362 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 702/702 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 243 transition count 682
Applied a total of 20 rules in 86 ms. Remains 243 /243 variables (removed 0) and now considering 682/702 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13816151224613653342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2422737483410419597.kers'
[2026-05-27 23:23:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13816151224613653342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2422737483410419597.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 682 rows 241 cols 2105 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-27 23:23:59] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2422737483410419597.kers
Total runtime 8 ms.
[2026-05-27 23:24:00] [INFO ] Implicit Places using invariants in 1101 ms returned [241, 242]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1168 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 682/702 transitions.
Applied a total of 0 rules in 10 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1289 ms. Remains : 241/243 places, 682/702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 9 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (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-14284527926386240392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14070563027493215482.kers'
[2026-05-27 23:24:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14284527926386240392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14070563027493215482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 682 rows 241 cols 2105 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-27 23:24:00] [INFO ] Computed 20 invariants in 4 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14070563027493215482.kers
Total runtime 6 ms.
[2026-05-27 23:24:00] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-27 23:24:00] [INFO ] Invariant cache hit.
[2026-05-27 23:24:01] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2026-05-27 23:24:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/923 variables, and 261 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30067 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30053 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61110ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 61154ms
Finished structural reductions in LTL mode , in 1 iterations and 62177 ms. Remains : 241/241 places, 682/682 transitions.
Support contains 25 out of 241 places after structural reductions.
[2026-05-27 23:25:03] [INFO ] Flatten gal took : 147 ms
[2026-05-27 23:25:03] [INFO ] Flatten gal took : 78 ms
[2026-05-27 23:25:03] [INFO ] Input system was already deterministic with 682 transitions.
RANDOM walk for 10139 steps (1 resets) in 992 ms. (10 steps per ms) remains 0/14 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 312 edges and 241 vertex of which 231 / 241 are part of one of the 21 SCC in 6 ms
Free SCC test removed 210 places
Ensure Unique test removed 437 transitions
Reduce isomorphic transitions removed 437 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 244
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 29 transition count 243
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 28 transition count 241
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 28 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 9 place count 28 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10 place count 27 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 191 transitions
Redundant transition composition rules discarded 191 transitions
Iterating global reduction 5 with 191 rules applied. Total rules applied 201 place count 27 transition count 48
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 216 place count 12 transition count 18
Iterating global reduction 5 with 15 rules applied. Total rules applied 231 place count 12 transition count 18
Applied a total of 231 rules in 76 ms. Remains 12 /241 variables (removed 229) and now considering 18/682 (removed 664) transitions.
[2026-05-27 23:25:04] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5889205838908535067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3300077915776350266.kers'
[2026-05-27 23:25:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5889205838908535067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3300077915776350266.kers]
Normalized transition count is 11 out of 12 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 23 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-27 23:25:04] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3300077915776350266.kers
Total runtime 1 ms.
[2026-05-27 23:25:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-27 23:25:04] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
[2026-05-27 23:25:04] [INFO ] Invariant cache hit.
[2026-05-27 23:25:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-27 23:25:04] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2026-05-27 23:25:04] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2026-05-27 23:25:04] [INFO ] Flow matrix only has 12 transitions (discarded 6 similar events)
[2026-05-27 23:25:04] [INFO ] Invariant cache hit.
[2026-05-27 23:25:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 11/23 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 17 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 11/23 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 36 constraints, problems are : Problem set: 0 solved, 17 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1018ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/241 places, 18/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1200 ms. Remains : 12/241 places, 18/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-00 finished in 1663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 9 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (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-13388848140443546060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12336852919003088736.kers'
[2026-05-27 23:25:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13388848140443546060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12336852919003088736.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 682 rows 241 cols 2105 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-27 23:25:05] [INFO ] Computed 20 invariants in 4 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12336852919003088736.kers
Total runtime 6 ms.
[2026-05-27 23:25:06] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-27 23:25:06] [INFO ] Invariant cache hit.
[2026-05-27 23:25:06] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2026-05-27 23:25:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/923 variables, and 261 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30034 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30040 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60631ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60636ms
Finished structural reductions in LTL mode , in 1 iterations and 61243 ms. Remains : 241/241 places, 682/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-05
Product exploration explored 100000 steps with 25000 reset in 1428 ms.
Product exploration explored 100000 steps with 25000 reset in 1307 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 3815 steps (0 resets) in 65 ms. (57 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 327 ms.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:26:10] [INFO ] Invariant cache hit.
[2026-05-27 23:26:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-27 23:26:10] [INFO ] Invariant cache hit.
[2026-05-27 23:26:11] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 241/241 places, 682/682 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 3782 steps (0 resets) in 38 ms. (96 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 370 ms.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 1162 ms.
Product exploration explored 100000 steps with 25000 reset in 855 ms.
Spot run failed in 191 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4737633661607424845
[2026-05-27 23:26:14] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4737633661607424845
Running compilation step : cd /tmp/ltsmin4737633661607424845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2267 ms.
Running link step : cd /tmp/ltsmin4737633661607424845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin4737633661607424845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15630098825647959563.hoa' '--buchi-type=spotba'
LTSmin run took 91 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-05 finished in 70647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 312 edges and 241 vertex of which 225 / 241 are part of one of the 21 SCC in 1 ms
Free SCC test removed 204 places
Ensure Unique test removed 429 transitions
Reduce isomorphic transitions removed 429 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 218 transitions
Reduce isomorphic transitions removed 218 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 19 transition count 32
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 242 place count 17 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 244 place count 15 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 244 place count 15 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 248 place count 13 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 12 transition count 26
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 12 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 3 rules applied. Total rules applied 253 place count 12 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 255 place count 10 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 9 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 9 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 269 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 270 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 271 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 271 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 275 place count 6 transition count 7
Applied a total of 275 rules in 12 ms. Remains 6 /241 variables (removed 235) and now considering 7/682 (removed 675) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17154197415539805758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13225450482566527523.kers'
[2026-05-27 23:26:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17154197415539805758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13225450482566527523.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-27 23:26:16] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13225450482566527523.kers
Total runtime 0 ms.
[2026-05-27 23:26:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-27 23:26:16] [INFO ] Invariant cache hit.
[2026-05-27 23:26:16] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2026-05-27 23:26:16] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-27 23:26:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/241 places, 7/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 6/241 places, 7/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-07
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-07 finished in 364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 314 edges and 241 vertex of which 232 / 241 are part of one of the 22 SCC in 1 ms
Free SCC test removed 210 places
Ensure Unique test removed 455 transitions
Reduce isomorphic transitions removed 455 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 12 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 228 place count 11 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 229 place count 10 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 229 place count 10 transition count 17
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 231 place count 9 transition count 17
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 232 place count 8 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 235 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 241 place count 7 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 243 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 7 with 4 rules applied. Total rules applied 247 place count 4 transition count 5
Applied a total of 247 rules in 12 ms. Remains 4 /241 variables (removed 237) and now considering 5/682 (removed 677) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2885900052446581260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5102983961553385786.kers'
[2026-05-27 23:26:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2885900052446581260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5102983961553385786.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 23:26:16] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5102983961553385786.kers
Total runtime 0 ms.
[2026-05-27 23:26:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-27 23:26:16] [INFO ] Invariant cache hit.
[2026-05-27 23:26:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-27 23:26:17] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-27 23:26:17] [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 48 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 48 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 100ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/241 places, 5/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 4/241 places, 5/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-08 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 7 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (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-9232440387134716383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5187137158423424871.kers'
[2026-05-27 23:26:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9232440387134716383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5187137158423424871.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 682 rows 241 cols 2105 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-27 23:26:17] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5187137158423424871.kers
Total runtime 3 ms.
[2026-05-27 23:26:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-27 23:26:17] [INFO ] Invariant cache hit.
[2026-05-27 23:26:17] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2026-05-27 23:26:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 923/923 variables, and 502 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30032 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30033 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60472ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Finished structural reductions in LTL mode , in 1 iterations and 60962 ms. Remains : 241/241 places, 682/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-10 finished in 61133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((!p0||X(p1))))) U G((F(p2) U p3))))'
Support contains 6 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 6 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:27:18] [INFO ] Invariant cache hit.
[2026-05-27 23:27:18] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-27 23:27:18] [INFO ] Invariant cache hit.
[2026-05-27 23:27:19] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 241/241 places, 682/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((!p0||X(p1))))) U G((F(p2) U p3))))'
Stuttering acceptance computed with spot in 1374 ms :[(NOT p3), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p3) p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-12
Product exploration explored 100000 steps with 136 reset in 739 ms.
Stack based approach found an accepted trace after 2548 steps with 4 reset with depth 280 and stack size 279 in 22 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-12 finished in 2854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-27 23:27:21] [INFO ] Invariant cache hit.
[2026-05-27 23:27:21] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-27 23:27:21] [INFO ] Invariant cache hit.
[2026-05-27 23:27:21] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 241/241 places, 682/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 1522 ms.
Product exploration explored 100000 steps with 50000 reset in 1619 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 12 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 39 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-13 finished in 3732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 317 edges and 241 vertex of which 238 / 241 are part of one of the 20 SCC in 1 ms
Free SCC test removed 218 places
Ensure Unique test removed 467 transitions
Reduce isomorphic transitions removed 467 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 0 with 227 rules applied. Total rules applied 228 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 230 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 230 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 232 place count 2 transition count 3
Applied a total of 232 rules in 6 ms. Remains 2 /241 variables (removed 239) and now considering 3/682 (removed 679) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3061629558555661842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6385146961664937038.kers'
[2026-05-27 23:27:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3061629558555661842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6385146961664937038.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-27 23:27:24] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6385146961664937038.kers
Total runtime 1 ms.
[2026-05-27 23:27:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-27 23:27:25] [INFO ] Invariant cache hit.
[2026-05-27 23:27:25] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-27 23:27:25] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-27 23:27:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 44 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/241 places, 3/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 2/241 places, 3/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-14 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0)))))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (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-11336125278447681990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6539387129984073079.kers'
[2026-05-27 23:27:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11336125278447681990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6539387129984073079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 682 rows 241 cols 2105 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-27 23:27:25] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6539387129984073079.kers
Total runtime 3 ms.
[2026-05-27 23:27:25] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-27 23:27:25] [INFO ] Invariant cache hit.
[2026-05-27 23:27:25] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2026-05-27 23:27:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/923 variables, and 261 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30041 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30044 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 241/241 places, 682/682 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!p0)) U (X(X(G(!p0)))||(!p1&&X(X(!p0)))))))'
Stuttering acceptance computed with spot in 218 ms :[p0, p0, p0, p0, true]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-15 finished in 60974 ms.
All properties solved by simple procedures.
Total runtime 267482 ms.

BK_STOP 1779924506224

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-20a"
export BK_EXAMINATION="LTLCardinality"
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-20a, examination is LTLCardinality"
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-177955809100435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20a.tgz
mv FlexibleBarrier-PT-20a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;