About the Execution of ITS-Tools for FlexibleBarrier-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 454.407 | 101975.00 | 135652.00 | 500.80 | FFFTTFTFFFFTTTFF | normal |
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-177955809100355.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-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100355
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.4K Mar 7 06:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 7 06:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 7 06:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 7 06:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 7 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 7 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:12 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 94K 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-10a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779882309245
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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-27 11:45:11] [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 11:45:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 11:45:12] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2026-05-27 11:45:12] [INFO ] Transformed 123 places.
[2026-05-27 11:45:12] [INFO ] Transformed 334 transitions.
[2026-05-27 11:45:12] [INFO ] Found NUPN structural information;
[2026-05-27 11:45:12] [INFO ] Parsed PT model containing 123 places and 334 transitions and 1467 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 57 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1823997442851713391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2174176608074842321.kers'
[2026-05-27 11:45:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1823997442851713391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2174176608074842321.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:45:12] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2174176608074842321.kers
Total runtime 4 ms.
[2026-05-27 11:45:13] [INFO ] Implicit Places using invariants in 708 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 785 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/252 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 886 ms. Remains : 122/123 places, 242/252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (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-11277540291432189063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8705158732512950336.kers'
[2026-05-27 11:45:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11277540291432189063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8705158732512950336.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:45:13] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8705158732512950336.kers
Total runtime 2 ms.
[2026-05-27 11:45:13] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-27 11:45:13] [INFO ] Invariant cache hit.
[2026-05-27 11:45:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-27 11:45:13] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2026-05-27 11:45:14] [INFO ] Invariant cache hit.
[2026-05-27 11:45:14] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/364 variables, 122/255 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 50/305 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 305 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23811 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 122/122 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/364 variables, 122/255 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 50/305 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 241/546 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 546 constraints, problems are : Problem set: 0 solved, 241 unsolved in 20780 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 122/122 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44866ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 44897ms
Finished structural reductions in LTL mode , in 1 iterations and 45592 ms. Remains : 122/122 places, 242/242 transitions.
Support contains 21 out of 122 places after structural reductions.
[2026-05-27 11:45:59] [INFO ] Flatten gal took : 67 ms
[2026-05-27 11:45:59] [INFO ] Flatten gal took : 35 ms
[2026-05-27 11:45:59] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (8 resets) in 1237 ms. (32 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
[2026-05-27 11:45:59] [INFO ] Invariant cache hit.
[2026-05-27 11:45:59] [INFO ] State equation strengthened by 50 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 AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 14/364 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Domain max(s): 2/122 constraints, Positive P Invariants (semi-flows): 2/11 constraints, State Equation: 0/122 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F(G(p0)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 107 edges and 122 vertex of which 30 / 122 are part of one of the 10 SCC in 3 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 135 edges and 100 vertex of which 94 / 100 are part of one of the 10 SCC in 1 ms
Free SCC test removed 84 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 16 transition count 184
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Iterating post reduction 1 with 180 rules applied. Total rules applied 184 place count 7 transition count 13
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 2 with 2 rules applied. Total rules applied 186 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 191 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 193 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 4 transition count 5
Applied a total of 195 rules in 32 ms. Remains 4 /122 variables (removed 118) and now considering 5/242 (removed 237) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10546806412005277975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6719373049177211830.kers'
[2026-05-27 11:46:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10546806412005277975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6719373049177211830.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 11:46:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6719373049177211830.kers
Total runtime 0 ms.
[2026-05-27 11:46:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-27 11:46:00] [INFO ] Invariant cache hit.
[2026-05-27 11:46:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-27 11:46:00] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-27 11:46:00] [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 52 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 57 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 113ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/122 places, 5/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 4/122 places, 5/242 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 249 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-01 finished in 656 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 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (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-6147437566741025646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8495826304110694796.kers'
[2026-05-27 11:46:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6147437566741025646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8495826304110694796.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:46:00] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8495826304110694796.kers
Total runtime 2 ms.
[2026-05-27 11:46:00] [INFO ] Implicit Places using invariants in 231 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 233 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/122 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 251 ms. Remains : 121/122 places, 242/242 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 130 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 738 ms.
Product exploration explored 100000 steps with 50000 reset in 437 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 20 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-03 finished in 1640 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(p1)))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 101 edges and 122 vertex of which 27 / 122 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 128 edges and 102 vertex of which 82 / 102 are part of one of the 12 SCC in 1 ms
Free SCC test removed 70 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 32 transition count 193
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Graph (trivial) has 23 edges and 24 vertex of which 2 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 159 rules applied. Total rules applied 164 place count 23 transition count 43
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 170 place count 20 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 170 place count 20 transition count 39
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 172 place count 19 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 18 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 18 transition count 37
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 176 place count 18 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 177 place count 17 transition count 35
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 181 place count 15 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 196 place count 15 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 199 place count 15 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 202 place count 12 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 202 place count 12 transition count 13
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 206 place count 10 transition count 13
Applied a total of 206 rules in 14 ms. Remains 10 /122 variables (removed 112) and now considering 13/242 (removed 229) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12948164742705267859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5203431201194655349.kers'
[2026-05-27 11:46:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12948164742705267859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5203431201194655349.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 12 rows 7 cols 18 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-27 11:46:02] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5203431201194655349.kers
Total runtime 1 ms.
[2026-05-27 11:46:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-27 11:46:02] [INFO ] Invariant cache hit.
[2026-05-27 11:46:02] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-27 11:46:02] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-27 11:46:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 12/22 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 8 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 12/22 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/122 places, 13/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 10/122 places, 13/242 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(p1)))'
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-09 finished in 545 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 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 105 edges and 122 vertex of which 27 / 122 are part of one of the 9 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 104 transition count 186
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 94 transition count 186
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 75 place count 67 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 0 with 53 rules applied. Total rules applied 128 place count 67 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 129 place count 67 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 66 transition count 105
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 66 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 64 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 64 transition count 103
Applied a total of 137 rules in 79 ms. Remains 64 /122 variables (removed 58) and now considering 103/242 (removed 139) transitions.
[2026-05-27 11:46:02] [INFO ] Flow matrix only has 86 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16603006384502399528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13045593187418186387.kers'
[2026-05-27 11:46:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16603006384502399528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13045593187418186387.kers]
Normalized transition count is 85 out of 86 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 63 cols 179 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-27 11:46:02] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13045593187418186387.kers
Total runtime 1 ms.
[2026-05-27 11:46:03] [INFO ] Implicit Places using invariants in 138 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/122 places, 103/242 transitions.
Graph (trivial) has 96 edges and 63 vertex of which 55 / 63 are part of one of the 10 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 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 18 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 23
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 11 place count 9 transition count 14
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 9 transition count 14
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 2 with 2 rules applied. Total rules applied 21 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 8 transition count 10
Applied a total of 24 rules in 8 ms. Remains 8 /63 variables (removed 55) and now considering 10/103 (removed 93) transitions.
[2026-05-27 11:46:03] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4266815183652918961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7040393061154646289.kers'
[2026-05-27 11:46:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4266815183652918961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7040393061154646289.kers]
Normalized transition count is 7 out of 8 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 7 rows 7 cols 15 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-27 11:46:03] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7040393061154646289.kers
Total runtime 0 ms.
[2026-05-27 11:46:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-27 11:46:03] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-27 11:46:03] [INFO ] Invariant cache hit.
[2026-05-27 11:46:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 11:46:03] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/122 places, 10/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 8/122 places, 10/242 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 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-10 finished in 417 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 U ((p2 U p3)||p1))&&X(X(p4)))))'
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (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-7122829019820088403.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14375315679770776612.kers'
[2026-05-27 11:46:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7122829019820088403.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14375315679770776612.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:46:03] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14375315679770776612.kers
Total runtime 3 ms.
[2026-05-27 11:46:03] [INFO ] Implicit Places using invariants in 208 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/122 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 121/122 places, 242/242 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 U ((p2 U p3)||p1))&&X(X(p4)))))'
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p4) (AND (NOT p1) (NOT p3))), (OR (NOT p4) (AND (NOT p1) (NOT p3))), true, (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p4), (NOT p4)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 673 ms.
Product exploration explored 100000 steps with 25000 reset in 480 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 18 factoid took 121 ms. Reduced automaton from 7 states, 13 edges and 5 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 1151 steps (0 resets) in 12 ms. (88 steps per ms) remains 0/1 properties
Knowledge based reduction with 18 factoid took 96 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 193 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p4), true]
Knowledge-based reduction took 428 ms.
Stuttering acceptance computed with spot in 209 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p4), true]
Support contains 1 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (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-13486466168145090483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8141589178710876804.kers'
[2026-05-27 11:46:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13486466168145090483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8141589178710876804.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 121 cols 655 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-27 11:46:05] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8141589178710876804.kers
Total runtime 2 ms.
[2026-05-27 11:46:05] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-27 11:46:05] [INFO ] Invariant cache hit.
[2026-05-27 11:46:06] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2026-05-27 11:46:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/363 variables, 121/252 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 252 constraints, problems are : Problem set: 0 solved, 241 unsolved in 19012 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/363 variables, 121/252 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 241/493 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/363 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 493 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22309 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41433ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 41439ms
Finished structural reductions in LTL mode , in 1 iterations and 41743 ms. Remains : 121/121 places, 242/242 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 55 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 1584 steps (0 resets) in 14 ms. (105 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 77 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 224 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p4), true]
Knowledge-based reduction took 369 ms.
Stuttering acceptance computed with spot in 221 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p4), true]
Stuttering acceptance computed with spot in 219 ms :[(NOT p4), (NOT p4), (NOT p4), (NOT p4), true]
Product exploration explored 100000 steps with 25000 reset in 465 ms.
Product exploration explored 100000 steps with 25000 reset in 401 ms.
Spot run failed in 110 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/ltsmin8956002568180044744
[2026-05-27 11:46:49] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8956002568180044744
Running compilation step : cd /tmp/ltsmin8956002568180044744;'/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 1008 ms.
Running link step : cd /tmp/ltsmin8956002568180044744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin8956002568180044744;'/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/stateBased10620975258412395075.hoa' '--buchi-type=spotba'
LTSmin run took 73 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-12 finished in 47300 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)&&F(p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 242/242 transitions.
Graph (trivial) has 105 edges and 122 vertex of which 27 / 122 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 104 transition count 187
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 95 transition count 187
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 77 place count 66 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 0 with 53 rules applied. Total rules applied 130 place count 66 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 131 place count 66 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 132 place count 65 transition count 104
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 65 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 64 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 64 transition count 103
Applied a total of 135 rules in 46 ms. Remains 64 /122 variables (removed 58) and now considering 103/242 (removed 139) transitions.
[2026-05-27 11:46:50] [INFO ] Flow matrix only has 85 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11217711834006939490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-497831372076470592.kers'
[2026-05-27 11:46:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11217711834006939490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-497831372076470592.kers]
Normalized transition count is 84 out of 85 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 84 rows 63 cols 177 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-27 11:46:50] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-497831372076470592.kers
Total runtime 1 ms.
[2026-05-27 11:46:50] [INFO ] Implicit Places using invariants in 185 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 187 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/122 places, 103/242 transitions.
Graph (trivial) has 94 edges and 63 vertex of which 52 / 63 are part of one of the 11 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 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 22 transition count 29
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 21 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 20 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 20 transition count 27
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 7 place count 19 transition count 27
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 14 place count 12 transition count 19
Iterating global reduction 3 with 7 rules applied. Total rules applied 21 place count 12 transition count 19
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 23 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 26 place count 11 transition count 15
Applied a total of 26 rules in 9 ms. Remains 11 /63 variables (removed 52) and now considering 15/103 (removed 88) transitions.
[2026-05-27 11:46:50] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17514620377523043310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12149747088001421701.kers'
[2026-05-27 11:46:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17514620377523043310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12149747088001421701.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 10 rows 10 cols 22 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-27 11:46:50] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12149747088001421701.kers
Total runtime 0 ms.
[2026-05-27 11:46:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-27 11:46:50] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2026-05-27 11:46:50] [INFO ] Invariant cache hit.
[2026-05-27 11:46:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 11:46:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/122 places, 15/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 11/122 places, 15/242 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)&&F(p1))))'
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-14
Stuttering criterion allowed to conclude after 10 steps with 2 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-14 finished in 507 ms.
All properties solved by simple procedures.
Total runtime 99441 ms.
BK_STOP 1779882411220
--------------------
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-10a"
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-10a, 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-177955809100355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10a.tgz
mv FlexibleBarrier-PT-10a 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 '
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 ;