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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.0K Mar 7 05:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 05:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 7 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 7 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:13 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 169K 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-14a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779896919994

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 15:48:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 15:48:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 15:48:42] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2026-05-27 15:48:42] [INFO ] Transformed 171 places.
[2026-05-27 15:48:42] [INFO ] Transformed 578 transitions.
[2026-05-27 15:48:42] [INFO ] Found NUPN structural information;
[2026-05-27 15:48:42] [INFO ] Parsed PT model containing 171 places and 578 transitions and 2719 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 408/408 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 171 transition count 394
Applied a total of 14 rules in 68 ms. Remains 171 /171 variables (removed 0) and now considering 394/408 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6454158662912549386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5299937497639645700.kers'
[2026-05-27 15:48:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6454158662912549386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5299937497639645700.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 394 rows 169 cols 1139 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 15:48:43] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5299937497639645700.kers
Total runtime 5 ms.
[2026-05-27 15:48:43] [INFO ] Implicit Places using invariants in 523 ms returned []
[2026-05-27 15:48:43] [INFO ] Invariant cache hit.
[2026-05-27 15:48:44] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:48:44] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2026-05-27 15:48:44] [INFO ] Invariant cache hit.
[2026-05-27 15:48:44] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30049 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30022 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60594ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60632ms
Starting structural reductions in LTL mode, iteration 1 : 171/171 places, 394/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62142 ms. Remains : 171/171 places, 394/408 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:49:45] [INFO ] Invariant cache hit.
[2026-05-27 15:49:45] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-27 15:49:45] [INFO ] Invariant cache hit.
[2026-05-27 15:49:45] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:49:45] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 583 ms. Remains : 171/171 places, 394/394 transitions.
Support contains 38 out of 171 places after structural reductions.
[2026-05-27 15:49:46] [INFO ] Flatten gal took : 75 ms
[2026-05-27 15:49:46] [INFO ] Flatten gal took : 36 ms
[2026-05-27 15:49:46] [INFO ] Input system was already deterministic with 394 transitions.
RANDOM walk for 6869 steps (0 resets) in 506 ms. (13 steps per ms) remains 0/35 properties
FORMULA FlexibleBarrier-PT-14a-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-14a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 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((X(G((p1 U p2)))&&p0)))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 128 edges and 171 vertex of which 30 / 171 are part of one of the 10 SCC in 2 ms
Free SCC test removed 20 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 115 transitions
Redundant transition composition rules discarded 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 198 place count 110 transition count 173
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 200 place count 110 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 202 place count 108 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 204 place count 108 transition count 171
Applied a total of 204 rules in 97 ms. Remains 108 /171 variables (removed 63) and now considering 171/394 (removed 223) transitions.
[2026-05-27 15:49:47] [INFO ] Flow matrix only has 149 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15924802760640478950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16412331122857510790.kers'
[2026-05-27 15:49:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15924802760640478950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16412331122857510790.kers]
Normalized transition count is 148 out of 149 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 148 rows 106 cols 327 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-27 15:49:47] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16412331122857510790.kers
Total runtime 5 ms.
[2026-05-27 15:49:47] [INFO ] Implicit Places using invariants in 150 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/171 places, 171/394 transitions.
Graph (trivial) has 134 edges and 107 vertex of which 30 / 107 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 87 transition count 117
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 73 transition count 117
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 73 transition count 103
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 57 place count 59 transition count 103
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 93 place count 41 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 41 transition count 72
Applied a total of 106 rules in 28 ms. Remains 41 /107 variables (removed 66) and now considering 72/171 (removed 99) transitions.
[2026-05-27 15:49:47] [INFO ] Flow matrix only has 56 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8213407466993618826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15413312469159512796.kers'
[2026-05-27 15:49:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8213407466993618826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15413312469159512796.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 55 rows 40 cols 141 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-27 15:49:47] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15413312469159512796.kers
Total runtime 1 ms.
[2026-05-27 15:49:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-27 15:49:47] [INFO ] Flow matrix only has 56 transitions (discarded 16 similar events)
[2026-05-27 15:49:47] [INFO ] Invariant cache hit.
[2026-05-27 15:49:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-27 15:49:47] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/171 places, 72/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 41/171 places, 72/394 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((X(G((p1 U p2)))&&p0)))'
Stuttering acceptance computed with spot in 509 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-00 finished in 1019 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(G((X(((!F(p0) U G(p1))&&X(p2))) U p3))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (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-6160767451868202768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-839358363271819171.kers'
[2026-05-27 15:49:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6160767451868202768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-839358363271819171.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 394 rows 169 cols 1139 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 15:49:48] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-839358363271819171.kers
Total runtime 2 ms.
[2026-05-27 15:49:52] [INFO ] Implicit Places using invariants in 4060 ms returned []
[2026-05-27 15:49:52] [INFO ] Invariant cache hit.
[2026-05-27 15:49:52] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:49:52] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 4456 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4462 ms. Remains : 171/171 places, 394/394 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(G((X(((!F(p0) U G(p1))&&X(p2))) U p3))))'
Stuttering acceptance computed with spot in 355 ms :[(NOT p3), (NOT p3), (OR (NOT p2) (NOT p3) (NOT p1)), true, p0, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-01 finished in 4892 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((X(X((X(X(X(p0))) U X(p1))))||G(p2))))'
Support contains 8 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:49:52] [INFO ] Invariant cache hit.
[2026-05-27 15:49:53] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-27 15:49:53] [INFO ] Invariant cache hit.
[2026-05-27 15:49:53] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:49:53] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 533 ms. Remains : 171/171 places, 394/394 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((X(X((X(X(X(p0))) U X(p1))))||G(p2))))'
Stuttering acceptance computed with spot in 640 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-02 finished in 1224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 135 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 105 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 197 place count 105 transition count 161
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 105 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 104 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 104 transition count 160
Applied a total of 200 rules in 70 ms. Remains 104 /171 variables (removed 67) and now considering 160/394 (removed 234) transitions.
[2026-05-27 15:49:54] [INFO ] Flow matrix only has 135 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18173651420593270806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4039386481135042364.kers'
[2026-05-27 15:49:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18173651420593270806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4039386481135042364.kers]
Normalized transition count is 134 out of 135 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 134 rows 102 cols 285 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-27 15:49:54] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-4039386481135042364.kers
Total runtime 17 ms.
[2026-05-27 15:49:54] [INFO ] Implicit Places using invariants in 483 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 491 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/171 places, 160/394 transitions.
Graph (trivial) has 138 edges and 103 vertex of which 36 / 103 are part of one of the 12 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 79 transition count 98
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 65 transition count 98
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 65 transition count 84
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 57 place count 51 transition count 84
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 89 place count 35 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 35 transition count 54
Applied a total of 103 rules in 44 ms. Remains 35 /103 variables (removed 68) and now considering 54/160 (removed 106) transitions.
[2026-05-27 15:49:54] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13129832330491699126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13184048574667840506.kers'
[2026-05-27 15:49:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13129832330491699126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13184048574667840506.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 38 rows 34 cols 93 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-27 15:49:54] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13184048574667840506.kers
Total runtime 0 ms.
[2026-05-27 15:49:54] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-27 15:49:54] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2026-05-27 15:49:54] [INFO ] Invariant cache hit.
[2026-05-27 15:49:55] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-27 15:49:55] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/171 places, 54/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 819 ms. Remains : 35/171 places, 54/394 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 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-05 finished in 966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 137 edges and 171 vertex of which 39 / 171 are part of one of the 13 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 195 edges and 142 vertex of which 135 / 142 are part of one of the 15 SCC in 0 ms
Free SCC test removed 120 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 4 rules applied. Total rules applied 5 place count 22 transition count 300
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Graph (trivial) has 10 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 302 rules applied. Total rules applied 307 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 309 place count 6 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 310 place count 5 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 5 transition count 10
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 313 place count 5 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 315 place count 4 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 316 place count 3 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 319 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 320 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 321 place count 2 transition count 3
Applied a total of 321 rules in 18 ms. Remains 2 /171 variables (removed 169) and now considering 3/394 (removed 391) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2044184279855427536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10664174265717204121.kers'
[2026-05-27 15:49:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2044184279855427536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10664174265717204121.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-27 15:49:55] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10664174265717204121.kers
Total runtime 0 ms.
[2026-05-27 15:49:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-27 15:49:55] [INFO ] Invariant cache hit.
[2026-05-27 15:49:55] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2026-05-27 15:49:55] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-27 15:49:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/171 places, 3/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 2/171 places, 3/394 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 35 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-06 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&G(p1))) U ((X((X(p0)&&G(p1)))&&G(!p2))||X(G((p1&&X(p0)))))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (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-3137997196631076159.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6638915625502022122.kers'
[2026-05-27 15:49:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3137997196631076159.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6638915625502022122.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 394 rows 169 cols 1139 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 15:49:55] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6638915625502022122.kers
Total runtime 2 ms.
[2026-05-27 15:49:55] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-27 15:49:55] [INFO ] Invariant cache hit.
[2026-05-27 15:49:55] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:49:56] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2026-05-27 15:49:56] [INFO ] Invariant cache hit.
[2026-05-27 15:49:56] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30015 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30022 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Finished structural reductions in LTL mode , in 1 iterations and 60813 ms. Remains : 171/171 places, 394/394 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&G(p1))) U (X(G((p1&&X(p0))))||(X((X(p0)&&G(p1)))&&G(!p2)))))'
Stuttering acceptance computed with spot in 346 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) p2)), (OR (NOT p1) p2)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-07 finished in 61221 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(((G(!p0) U X(X(!p1)))&&F(p2))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:50:56] [INFO ] Invariant cache hit.
[2026-05-27 15:50:56] [INFO ] Implicit Places using invariants in 265 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 266 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 170/171 places, 394/394 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(((G(!p0) U X(X(!p1)))&&F(p2))))'
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, (NOT p2), p1, p1, true, p1, p0]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 109 steps with 19 reset in 5 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-08 finished in 691 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(G(p0)))'
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:50:57] [INFO ] Invariant cache hit.
[2026-05-27 15:50:57] [INFO ] Implicit Places using invariants in 370 ms returned [169, 170]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 372 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 169 /169 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 377 ms. Remains : 169/171 places, 394/394 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(G(p0)))'
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-09 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||(!p1 U (p2||G(!p1)))))))))'
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:50:57] [INFO ] Invariant cache hit.
[2026-05-27 15:50:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-27 15:50:58] [INFO ] Invariant cache hit.
[2026-05-27 15:50:58] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:50:58] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 614 ms. Remains : 171/171 places, 394/394 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((!p0 U (p1||G(!p0)))||p2))))))'
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-10
Product exploration explored 100000 steps with 3434 reset in 858 ms.
Stack based approach found an accepted trace after 120 steps with 5 reset with depth 57 and stack size 56 in 2 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-10 finished in 1671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 138 edges and 171 vertex of which 39 / 171 are part of one of the 13 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 196 edges and 142 vertex of which 135 / 142 are part of one of the 15 SCC in 1 ms
Free SCC test removed 120 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 22 transition count 299
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Iterating post reduction 1 with 301 rules applied. Total rules applied 307 place count 7 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 308 place count 6 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 6 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 312 place count 6 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 314 place count 4 transition count 8
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 4 with 2 rules applied. Total rules applied 316 place count 3 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 321 place count 2 transition count 3
Applied a total of 321 rules in 8 ms. Remains 2 /171 variables (removed 169) and now considering 3/394 (removed 391) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3570340137418194590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17115725851587216760.kers'
[2026-05-27 15:50:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3570340137418194590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17115725851587216760.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-27 15:50:59] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17115725851587216760.kers
Total runtime 1 ms.
[2026-05-27 15:50:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-27 15:50:59] [INFO ] Invariant cache hit.
[2026-05-27 15:50:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-27 15:50:59] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-27 15:50:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 53ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/171 places, 3/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 2/171 places, 3/394 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-12 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((X(!X(p1))&&p0))) U p2)))'
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (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-17654991603364338906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4995822690470185540.kers'
[2026-05-27 15:50:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17654991603364338906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4995822690470185540.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 394 rows 169 cols 1139 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 15:50:59] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4995822690470185540.kers
Total runtime 3 ms.
[2026-05-27 15:50:59] [INFO ] Implicit Places using invariants in 253 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 170/171 places, 394/394 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((X(!X(p1))&&p0))) U p2)))'
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p2) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-13 finished in 547 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 (F(p1)||(X(F(p3))&&p2)))))'
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:51:00] [INFO ] Invariant cache hit.
[2026-05-27 15:51:00] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-27 15:51:00] [INFO ] Invariant cache hit.
[2026-05-27 15:51:00] [INFO ] State equation strengthened by 253 read => feed constraints.
[2026-05-27 15:51:00] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2026-05-27 15:51:00] [INFO ] Invariant cache hit.
[2026-05-27 15:51:00] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30016 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30014 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Finished structural reductions in LTL mode , in 1 iterations and 60745 ms. Remains : 171/171 places, 394/394 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 (F(p1)||(X(F(p3))&&p2)))))'
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-14
Product exploration explored 100000 steps with 755 reset in 637 ms.
Stack based approach found an accepted trace after 315 steps with 3 reset with depth 178 and stack size 178 in 3 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-14 finished in 61585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(!p1)) U (X(p2)&&(p3||G(p4)))))'
Support contains 8 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2026-05-27 15:52:01] [INFO ] Invariant cache hit.
[2026-05-27 15:52:02] [INFO ] Implicit Places using invariants in 267 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 271 ms. Remains : 170/171 places, 394/394 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(!p1)) U (X(p2)&&(G(p3)||p4))))'
Stuttering acceptance computed with spot in 1050 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), true, (AND (NOT p1) (NOT p0)), p1, (NOT p2), (NOT p3), p1, (OR (AND p1 (NOT p2) p3) (AND p1 (NOT p2) p4) (AND p0 p1 (NOT p2))), (NOT p2), (AND p1 (NOT p3)), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND p1 (NOT p2) p4) (AND p1 (NOT p2) p3)), (AND p1 (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p3)), (OR (AND p1 (NOT p2) (NOT p3) p4) (AND p0 p1 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3) p4), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-15 finished in 1461 ms.
All properties solved by simple procedures.
Total runtime 200958 ms.

BK_STOP 1779897123367

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

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