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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.9K Mar 7 06:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 06:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 06:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 06:08 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 8.9K Mar 7 06:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 06:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 06:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 7 06:10 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 41K 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-06a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779868607799

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-27 07:56:50] [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 07:56:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 07:56:50] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2026-05-27 07:56:50] [INFO ] Transformed 75 places.
[2026-05-27 07:56:50] [INFO ] Transformed 154 transitions.
[2026-05-27 07:56:50] [INFO ] Found NUPN structural information;
[2026-05-27 07:56:50] [INFO ] Parsed PT model containing 75 places and 154 transitions and 599 arcs in 343 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 2 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 128/128 transitions.
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 6 place count 75 transition count 122
Applied a total of 6 rules in 27 ms. Remains 75 /75 variables (removed 0) and now considering 122/128 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10122480015424838928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4034091155319474908.kers'
[2026-05-27 07:56:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10122480015424838928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4034091155319474908.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 122 rows 73 cols 299 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-27 07:56:51] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4034091155319474908.kers
Total runtime 2 ms.
[2026-05-27 07:56:51] [INFO ] Implicit Places using invariants in 453 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 541 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 74/75 places, 122/128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (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-3400856916648023877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13630584000396066630.kers'
[2026-05-27 07:56:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3400856916648023877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13630584000396066630.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 122 rows 73 cols 299 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-27 07:56:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13630584000396066630.kers
Total runtime 2 ms.
[2026-05-27 07:56:51] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-27 07:56:51] [INFO ] Invariant cache hit.
[2026-05-27 07:56:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-27 07:56:51] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-27 07:56:52] [INFO ] Invariant cache hit.
[2026-05-27 07:56:52] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/196 variables, 74/155 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 31/186 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 186 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7907 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/196 variables, 74/155 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 31/186 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 121/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 307 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7005 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15067ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15097ms
Finished structural reductions in LTL mode , in 1 iterations and 15497 ms. Remains : 74/74 places, 122/122 transitions.
Support contains 34 out of 74 places after structural reductions.
[2026-05-27 07:57:07] [INFO ] Flatten gal took : 67 ms
[2026-05-27 07:57:07] [INFO ] Flatten gal took : 27 ms
[2026-05-27 07:57:07] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 33 out of 74 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1107 ms. (36 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
[2026-05-27 07:57:08] [INFO ] Invariant cache hit.
[2026-05-27 07:57:08] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 14/196 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 46 ms.
Refiners :[Domain max(s): 2/74 constraints, Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/74 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 2 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' '!((G(p0)||(((p1 U p2)&&F(G(p0))) U !p3)))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Graph (trivial) has 75 edges and 74 vertex of which 25 / 74 are part of one of the 6 SCC in 7 ms
Free SCC test removed 19 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 55 transition count 88
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 47 transition count 88
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 17 place count 47 transition count 82
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 29 place count 41 transition count 82
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 29 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 75 place count 29 transition count 48
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 29 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 28 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 28 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 28 transition count 46
Applied a total of 83 rules in 72 ms. Remains 28 /74 variables (removed 46) and now considering 46/122 (removed 76) transitions.
[2026-05-27 07:57:08] [INFO ] Flow matrix only has 38 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11648908639396197265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2419206152613253032.kers'
[2026-05-27 07:57:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11648908639396197265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2419206152613253032.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 37 rows 27 cols 87 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-27 07:57:08] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2419206152613253032.kers
Total runtime 1 ms.
[2026-05-27 07:57:08] [INFO ] Implicit Places using invariants in 65 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/74 places, 46/122 transitions.
Graph (trivial) has 26 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 21 transition count 35
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 21 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 9 place count 21 transition count 33
Applied a total of 9 rules in 9 ms. Remains 21 /27 variables (removed 6) and now considering 33/46 (removed 13) transitions.
[2026-05-27 07:57:08] [INFO ] Flow matrix only has 28 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12022951947148763210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3980335401249711061.kers'
[2026-05-27 07:57:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12022951947148763210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3980335401249711061.kers]
Normalized transition count is 27 out of 28 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 27 rows 20 cols 65 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-27 07:57:08] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3980335401249711061.kers
Total runtime 1 ms.
[2026-05-27 07:57:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-27 07:57:08] [INFO ] Flow matrix only has 28 transitions (discarded 5 similar events)
[2026-05-27 07:57:08] [INFO ] Invariant cache hit.
[2026-05-27 07:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 07:57:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/74 places, 33/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 21/74 places, 33/122 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(p0)||(((p1 U p2)&&F(G(p0))) U !p3)))'
Stuttering acceptance computed with spot in 656 ms :[(AND (NOT p0) p3), true, (NOT p0), (NOT p2), (NOT p0), p3, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-00 finished in 1055 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(!p1)||p0)) U X((G(p2) U X(p1)))))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (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-7858087930364766405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1476127165030597565.kers'
[2026-05-27 07:57:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7858087930364766405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1476127165030597565.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 122 rows 73 cols 299 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-27 07:57:09] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1476127165030597565.kers
Total runtime 1 ms.
[2026-05-27 07:57:09] [INFO ] Implicit Places using invariants in 114 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/74 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 73/74 places, 122/122 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(!p1)||p0)) U X((G(p2) U X(p1)))))'
Stuttering acceptance computed with spot in 466 ms :[(NOT p1), false, (NOT p1), false, false, false, (NOT p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 587 ms.
Product exploration explored 100000 steps with 33333 reset in 264 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 10 factoid took 18 ms. Proved property starting from automaton with 9 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-01 finished in 1564 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(p0)||X(G(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:57:11] [INFO ] Invariant cache hit.
[2026-05-27 07:57:11] [INFO ] Implicit Places using invariants in 66 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/74 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 73/74 places, 122/122 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(p0)||X(G(p1))))'
Stuttering acceptance computed with spot in 203 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-02 finished in 310 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(p0))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Graph (trivial) has 81 edges and 74 vertex of which 37 / 74 are part of one of the 8 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 45 transition count 70
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 38 transition count 70
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 15 place count 38 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 32 transition count 64
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 23 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 23 transition count 37
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 23 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 22 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 22 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 22 transition count 34
Applied a total of 69 rules in 31 ms. Remains 22 /74 variables (removed 52) and now considering 34/122 (removed 88) transitions.
[2026-05-27 07:57:11] [INFO ] Flow matrix only has 25 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6281791051086603552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17212435386614576860.kers'
[2026-05-27 07:57:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6281791051086603552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17212435386614576860.kers]
Normalized transition count is 24 out of 25 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 24 rows 21 cols 53 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-27 07:57:11] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17212435386614576860.kers
Total runtime 1 ms.
[2026-05-27 07:57:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-27 07:57:11] [INFO ] Flow matrix only has 25 transitions (discarded 9 similar events)
[2026-05-27 07:57:11] [INFO ] Invariant cache hit.
[2026-05-27 07:57:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-27 07:57:11] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2026-05-27 07:57:11] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-27 07:57:11] [INFO ] Flow matrix only has 25 transitions (discarded 9 similar events)
[2026-05-27 07:57:11] [INFO ] Invariant cache hit.
[2026-05-27 07:57:11] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 24/46 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 1/47 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 36 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 24/46 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/47 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/47 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 69 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2231ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/74 places, 34/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2383 ms. Remains : 22/74 places, 34/122 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(p0))'
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 20 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 23 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-03 finished in 3184 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 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Graph (trivial) has 87 edges and 74 vertex of which 48 / 74 are part of one of the 6 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 38 edges and 30 vertex of which 25 / 30 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
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 3 rules applied. Total rules applied 4 place count 10 transition count 56
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 59 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 3 transition count 4
Applied a total of 63 rules in 9 ms. Remains 3 /74 variables (removed 71) and now considering 4/122 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18114713695867848289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16045146737445013840.kers'
[2026-05-27 07:57:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18114713695867848289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16045146737445013840.kers]
Normalized transition count is 3 out of 4 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 3 cols 6 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-27 07:57:14] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16045146737445013840.kers
Total runtime 1 ms.
[2026-05-27 07:57:14] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-27 07:57:14] [INFO ] Invariant cache hit.
[2026-05-27 07:57:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2026-05-27 07:57:14] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-27 07:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/6 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 71 ms.
Refiners :[Domain max(s): 3/3 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/6 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/7 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75 ms.
Refiners :[Domain max(s): 3/3 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/74 places, 4/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 3/74 places, 4/122 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 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-08 finished in 415 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)&&(F(p1)||X(p2))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (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-14548481583640906119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4328683086533069347.kers'
[2026-05-27 07:57:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14548481583640906119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4328683086533069347.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 122 rows 73 cols 299 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-27 07:57:14] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4328683086533069347.kers
Total runtime 1 ms.
[2026-05-27 07:57:15] [INFO ] Implicit Places using invariants in 138 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/74 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 73/74 places, 122/122 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)&&(F(p1)||X(p2))))'
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-10 finished in 432 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 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Graph (trivial) has 87 edges and 74 vertex of which 43 / 74 are part of one of the 6 SCC in 1 ms
Free SCC test removed 37 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 37 transition count 58
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 30 transition count 58
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 15 place count 30 transition count 52
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 24 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 43 place count 16 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 65 place count 16 transition count 22
Applied a total of 65 rules in 11 ms. Remains 16 /74 variables (removed 58) and now considering 22/122 (removed 100) transitions.
[2026-05-27 07:57:15] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2106854365990469897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11560016875154313132.kers'
[2026-05-27 07:57:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2106854365990469897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11560016875154313132.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 15 cols 37 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-27 07:57:15] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11560016875154313132.kers
Total runtime 0 ms.
[2026-05-27 07:57:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-27 07:57:15] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2026-05-27 07:57:15] [INFO ] Invariant cache hit.
[2026-05-27 07:57:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-27 07:57:15] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2026-05-27 07:57:15] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2026-05-27 07:57:15] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2026-05-27 07:57:15] [INFO ] Invariant cache hit.
[2026-05-27 07:57:15] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/33 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/33 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 705 ms.
Refiners :[Domain max(s): 16/16 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 16/16 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 21/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 1/33 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/33 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 697 ms.
Refiners :[Domain max(s): 16/16 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 16/16 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1408ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1408ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/74 places, 22/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1525 ms. Remains : 16/74 places, 22/122 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 51 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-12
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-12 finished in 1612 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)) U (p1||G(p2))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Graph (trivial) has 80 edges and 74 vertex of which 34 / 74 are part of one of the 7 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 53 edges and 45 vertex of which 26 / 45 are part of one of the 5 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 24 transition count 79
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 58 place count 18 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 17 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 16 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 16 transition count 31
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 64 place count 16 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 14 transition count 28
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 5 with 4 rules applied. Total rules applied 70 place count 12 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 71 place count 12 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 81 place count 12 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 84 place count 12 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 87 place count 9 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 87 place count 9 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 89 place count 8 transition count 11
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 90 place count 8 transition count 11
Applied a total of 90 rules in 15 ms. Remains 8 /74 variables (removed 66) and now considering 11/122 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2049585066135019147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7327690051516870394.kers'
[2026-05-27 07:57:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2049585066135019147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7327690051516870394.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 10 rows 6 cols 16 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-27 07:57:17] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7327690051516870394.kers
Total runtime 0 ms.
[2026-05-27 07:57:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-27 07:57:17] [INFO ] Invariant cache hit.
[2026-05-27 07:57:17] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2026-05-27 07:57:17] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-27 07:57:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 11 constraints, problems are : Problem set: 0 solved, 7 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 7 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 294ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/74 places, 11/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 8/74 places, 11/122 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)) U (p1||G(p2))))'
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-13 finished in 633 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 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 122/122 transitions.
Graph (trivial) has 88 edges and 74 vertex of which 48 / 74 are part of one of the 6 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 38 edges and 30 vertex of which 20 / 30 are part of one of the 4 SCC in 1 ms
Free SCC test removed 16 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 4 rules applied. Total rules applied 5 place count 14 transition count 55
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 52 place count 8 transition count 14
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 2 with 4 rules applied. Total rules applied 56 place count 6 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 61 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 2 with 4 rules applied. Total rules applied 65 place count 4 transition count 5
Applied a total of 65 rules in 9 ms. Remains 4 /74 variables (removed 70) and now considering 5/122 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-630271643498823727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7698431621487237167.kers'
[2026-05-27 07:57:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-630271643498823727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7698431621487237167.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:57:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7698431621487237167.kers
Total runtime 1 ms.
[2026-05-27 07:57:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-27 07:57:17] [INFO ] Invariant cache hit.
[2026-05-27 07:57:17] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2026-05-27 07:57:17] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-27 07:57:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 66 ms.
Refiners :[Domain max(s): 4/4 constraints, 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 60 ms.
Refiners :[Domain max(s): 4/4 constraints, 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 129ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/74 places, 5/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 4/74 places, 5/122 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 49 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLCardinality-15 finished in 294 ms.
All properties solved by simple procedures.
Total runtime 27597 ms.

BK_STOP 1779868638024

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

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