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.r354-tall-178024402800164.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 SupplyChain-PT-00002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 27 07:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 27 07:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 07:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 07:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 27 10:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.2K May 27 07:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 27 07:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 27 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 27 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 9.1K May 26 18:17 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 SupplyChain-PT-00002-LTLFireability-00
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-01
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-02
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-03
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-04
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-05
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-06
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-07
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-08
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-09
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-10
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-11
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-12
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-13
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-14
FORMULA_NAME SupplyChain-PT-00002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780250542535

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 18:02:24] [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-31 18:02:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 18:02:24] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2026-05-31 18:02:24] [INFO ] Transformed 30 places.
[2026-05-31 18:02:24] [INFO ] Transformed 19 transitions.
[2026-05-31 18:02:24] [INFO ] Parsed PT model containing 30 places and 19 transitions and 78 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA SupplyChain-PT-00002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 19/19 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 19
Applied a total of 1 rules in 17 ms. Remains 29 /30 variables (removed 1) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7337102090785445501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2869838296129319287.kers'
[2026-05-31 18:02:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7337102090785445501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2869838296129319287.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:24] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2869838296129319287.kers
Total runtime 1 ms.
[2026-05-31 18:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/29 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/47 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/48 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 46 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/28 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/29 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/47 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/48 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 63 constraints, problems are : Problem set: 0 solved, 17 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1752ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1767ms
[2026-05-31 18:02:26] [INFO ] Invariant cache hit.
[2026-05-31 18:02:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-31 18:02:26] [INFO ] Invariant cache hit.
[2026-05-31 18:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 19/19 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1961 ms. Remains : 29/30 places, 19/19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:02:26] [INFO ] Invariant cache hit.
[2026-05-31 18:02:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-31 18:02:26] [INFO ] Invariant cache hit.
[2026-05-31 18:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:26] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 29/29 places, 19/19 transitions.
Support contains 27 out of 29 places after structural reductions.
[2026-05-31 18:02:26] [INFO ] Flatten gal took : 22 ms
[2026-05-31 18:02:26] [INFO ] Flatten gal took : 9 ms
[2026-05-31 18:02:26] [INFO ] Input system was already deterministic with 19 transitions.
Reduction of identical properties reduced properties to check from 20 to 18
RANDOM walk for 40000 steps (3074 resets) in 1106 ms. (36 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40002 steps (1179 resets) in 325 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1095 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
[2026-05-31 18:02:27] [INFO ] Invariant cache hit.
[2026-05-31 18:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 11/20 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/21 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/29 variables, 7/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 29/48 variables, and 16 constraints, problems are : Problem set: 2 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/29 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SupplyChain-PT-00002-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA SupplyChain-PT-00002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 18 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' '!(X(X(X(X(X(X(G((p0&&X(p1))))))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 19
Applied a total of 5 rules in 1 ms. Remains 24 /29 variables (removed 5) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16456415172290404237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14033060709006863015.kers'
[2026-05-31 18:02:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16456415172290404237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14033060709006863015.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:27] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14033060709006863015.kers
Total runtime 0 ms.
[2026-05-31 18:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 36 constraints, problems are : Problem set: 0 solved, 17 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 53 constraints, problems are : Problem set: 0 solved, 17 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 756ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 756ms
[2026-05-31 18:02:28] [INFO ] Invariant cache hit.
[2026-05-31 18:02:28] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 10, 11, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 40 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/29 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 797 ms. Remains : 19/29 places, 19/19 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(X(G((p0&&X(p1))))))))))'
Stuttering acceptance computed with spot in 533 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-00 finished in 1412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 19
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-112461168867321657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2739469602277917305.kers'
[2026-05-31 18:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-112461168867321657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2739469602277917305.kers]
Normalized transition count is 18 out of 19 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:29] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2739469602277917305.kers
Total runtime 1 ms.
[2026-05-31 18:02:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 32 constraints, problems are : Problem set: 0 solved, 17 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 49 constraints, problems are : Problem set: 0 solved, 17 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 663ms
[2026-05-31 18:02:29] [INFO ] Invariant cache hit.
[2026-05-31 18:02:29] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1, 9, 10, 11]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 34 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/29 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 698 ms. Remains : 17/29 places, 19/19 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-02 finished in 816 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(F((G(F((!p0&&X((!p1&&(!p0 U (!p2||G(!p0))))))))||(!p3&&F((!p0&&X((!p1&&(!p0 U (!p2||G(!p0)))))))))))))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 19
Applied a total of 4 rules in 1 ms. Remains 25 /29 variables (removed 4) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15860323987246327087.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14849799238298843535.kers'
[2026-05-31 18:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15860323987246327087.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14849799238298843535.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:30] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14849799238298843535.kers
Total runtime 0 ms.
[2026-05-31 18:02:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 38 constraints, problems are : Problem set: 0 solved, 17 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/44 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 55 constraints, problems are : Problem set: 0 solved, 17 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 747ms
[2026-05-31 18:02:30] [INFO ] Invariant cache hit.
[2026-05-31 18:02:30] [INFO ] Implicit Places using invariants in 33 ms returned [0, 1, 11, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/29 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 784 ms. Remains : 21/29 places, 19/19 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(F((G(F((p0&&X((p1&&(p0 U (!p2||G(p0))))))))||(F((p0&&X((p1&&(p0 U (!p2||G(p0)))))))&&p3))))))'
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-04
Product exploration explored 100000 steps with 22612 reset in 248 ms.
Product exploration explored 100000 steps with 22598 reset in 141 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Computed a total of 21 stabilizing places and 18 stable transitions
Detected a total of 21/21 stabilizing places and 18/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 6 factoid took 635 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (3076 resets) in 336 ms. (118 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (1356 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1140 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1737296495284696141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4562967623182920397.kers'
[2026-05-31 18:02:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1737296495284696141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4562967623182920397.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 18 rows 18 cols 44 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-31 18:02:32] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4562967623182920397.kers
Total runtime 0 ms.
[2026-05-31 18:02:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 21/40 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/21 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 8 factoid took 2062 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2026-05-31 18:02:34] [INFO ] Invariant cache hit.
[2026-05-31 18:02:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-31 18:02:34] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-31 18:02:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-31 18:02:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:34] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-31 18:02:34] [INFO ] Computed and/alt/rep : 17/26/17 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-31 18:02:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:02:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-31 18:02:34] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-31 18:02:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-31 18:02:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-31 18:02:34] [INFO ] Computed and/alt/rep : 17/26/17 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-31 18:02:34] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 3332 ms.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
[2026-05-31 18:02:35] [INFO ] Invariant cache hit.
[2026-05-31 18:02:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/39 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 30 constraints, problems are : Problem set: 0 solved, 17 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/39 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/40 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/40 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/40 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 47 constraints, problems are : Problem set: 0 solved, 17 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 687ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 688ms
[2026-05-31 18:02:35] [INFO ] Invariant cache hit.
[2026-05-31 18:02:35] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-31 18:02:35] [INFO ] Invariant cache hit.
[2026-05-31 18:02:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:35] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 21/21 places, 19/19 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Computed a total of 21 stabilizing places and 18 stable transitions
Detected a total of 21/21 stabilizing places and 18/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 69 steps (3 resets) in 7 ms. (8 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 314 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2026-05-31 18:02:36] [INFO ] Invariant cache hit.
[2026-05-31 18:02:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-31 18:02:36] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-31 18:02:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-31 18:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:36] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-31 18:02:36] [INFO ] Computed and/alt/rep : 17/26/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-31 18:02:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:02:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-31 18:02:36] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-31 18:02:36] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-31 18:02:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-31 18:02:36] [INFO ] Computed and/alt/rep : 17/26/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-31 18:02:36] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 833 ms.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22591 reset in 89 ms.
Product exploration explored 100000 steps with 22574 reset in 89 ms.
Spot run failed in 187 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9931490906776740518
[2026-05-31 18:02:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9931490906776740518
Running compilation step : cd /tmp/ltsmin9931490906776740518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 254 ms.
Running link step : cd /tmp/ltsmin9931490906776740518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9931490906776740518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9870989638942768184.hoa' '--buchi-type=spotba'
LTSmin run took 49 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SupplyChain-PT-00002-LTLFireability-04 finished in 7878 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)||G(p1)) U (p1&&((p2 U p3) U !p4))))'
Support contains 11 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Applied a total of 0 rules in 10 ms. Remains 23 /29 variables (removed 6) and now considering 18/19 (removed 1) transitions.
Running 15 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16839896815462844108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6564848680505041212.kers'
[2026-05-31 18:02:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16839896815462844108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6564848680505041212.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 17 rows 21 cols 53 entries
Finished phase 1 with 11 SingleSign rule and 2 generalized
[2026-05-31 18:02:38] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6564848680505041212.kers
Total runtime 0 ms.
[2026-05-31 18:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 17/40 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 17/40 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 602ms
[2026-05-31 18:02:38] [INFO ] Invariant cache hit.
[2026-05-31 18:02:38] [INFO ] Implicit Places using invariants in 25 ms returned [11, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/29 places, 18/19 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 21 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 20 transition count 16
Applied a total of 3 rules in 10 ms. Remains 20 /21 variables (removed 1) and now considering 16/18 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10999158655197175223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4487758172414326936.kers'
[2026-05-31 18:02:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10999158655197175223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4487758172414326936.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 15 rows 18 cols 45 entries
Finished phase 1 with 11 SingleSign rule and 1 generalized
[2026-05-31 18:02:38] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4487758172414326936.kers
Total runtime 1 ms.
[2026-05-31 18:02:38] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-31 18:02:38] [INFO ] Invariant cache hit.
[2026-05-31 18:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:38] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/29 places, 16/19 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 703 ms. Remains : 20/29 places, 16/19 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)||G(p1)) U (p1&&((p2 U p3) U !p4))))'
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p1) p4), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) p4)), p4, (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 p4)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-05
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-05 finished in 1117 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' '!(((((!p1||X(!p1))&&p0) U X(X((p2||X(p3))))) U p2))'
Support contains 12 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 19
Applied a total of 4 rules in 2 ms. Remains 25 /29 variables (removed 4) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6941620006572359846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6376243747927280810.kers'
[2026-05-31 18:02:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6941620006572359846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6376243747927280810.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:39] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6376243747927280810.kers
Total runtime 0 ms.
[2026-05-31 18:02:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 38 constraints, problems are : Problem set: 0 solved, 17 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/43 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/44 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 55 constraints, problems are : Problem set: 0 solved, 17 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 720ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 721ms
[2026-05-31 18:02:39] [INFO ] Invariant cache hit.
[2026-05-31 18:02:39] [INFO ] Implicit Places using invariants in 21 ms returned [1, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/29 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 746 ms. Remains : 23/29 places, 19/19 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' '!(((((!p1||X(!p1))&&p0) U X(X((X(p2)||p3)))) U p3))'
Stuttering acceptance computed with spot in 571 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p1)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-06 finished in 1376 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||G(p1)))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 5 places
Reduce places removed 6 places and 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 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 22 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 22 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 18 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 17 transition count 13
Applied a total of 10 rules in 7 ms. Remains 17 /29 variables (removed 12) and now considering 13/19 (removed 6) transitions.
Running 9 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11342201430588487139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4645957298354956796.kers'
[2026-05-31 18:02:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11342201430588487139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4645957298354956796.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 12 rows 14 cols 30 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-31 18:02:40] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4645957298354956796.kers
Total runtime 0 ms.
[2026-05-31 18:02:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 12/29 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 12/29 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 315ms
[2026-05-31 18:02:40] [INFO ] Invariant cache hit.
[2026-05-31 18:02:40] [INFO ] Implicit Places using invariants in 32 ms returned [6, 7, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/29 places, 13/19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 11
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 12 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 10 transition count 7
Applied a total of 10 rules in 2 ms. Remains 10 /14 variables (removed 4) and now considering 7/13 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8764407738234946127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8327270051325932977.kers'
[2026-05-31 18:02:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8764407738234946127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8327270051325932977.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 7 cols 13 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-31 18:02:40] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8327270051325932977.kers
Total runtime 0 ms.
[2026-05-31 18:02:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-31 18:02:40] [INFO ] Invariant cache hit.
[2026-05-31 18:02:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/29 places, 7/19 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 413 ms. Remains : 10/29 places, 7/19 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||G(p1)))))'
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-07
Product exploration explored 100000 steps with 4 reset in 109 ms.
Product exploration explored 100000 steps with 2 reset in 113 ms.
Computed a total of 10 stabilizing places and 6 stable transitions
Computed a total of 10 stabilizing places and 6 stable transitions
Detected a total of 10/10 stabilizing places and 6/7 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 29 steps (3 resets) in 4 ms. (5 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-31 18:02:41] [INFO ] Invariant cache hit.
[2026-05-31 18:02:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-31 18:02:41] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-31 18:02:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-31 18:02:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-31 18:02:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-31 18:02:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:02:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-31 18:02:41] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-31 18:02:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-31 18:02:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-31 18:02:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-31 18:02:41] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 608 ms.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
[2026-05-31 18:02:41] [INFO ] Invariant cache hit.
[2026-05-31 18:02:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/10 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/16 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/17 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 155ms
[2026-05-31 18:02:42] [INFO ] Invariant cache hit.
[2026-05-31 18:02:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-31 18:02:42] [INFO ] Invariant cache hit.
[2026-05-31 18:02:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-31 18:02:42] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 10/10 places, 7/7 transitions.
Computed a total of 10 stabilizing places and 6 stable transitions
Computed a total of 10 stabilizing places and 6 stable transitions
Detected a total of 10/10 stabilizing places and 6/7 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 68 steps (12 resets) in 4 ms. (13 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-31 18:02:42] [INFO ] Invariant cache hit.
[2026-05-31 18:02:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-31 18:02:42] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-31 18:02:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-31 18:02:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:42] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-31 18:02:42] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-31 18:02:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 18:02:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-31 18:02:42] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-31 18:02:42] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2026-05-31 18:02:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-31 18:02:42] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-31 18:02:42] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 618 ms.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6 reset in 55 ms.
Product exploration explored 100000 steps with 10 reset in 185 ms.
Built C files in :
/tmp/ltsmin7504405155656506445
[2026-05-31 18:02:43] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2026-05-31 18:02:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:02:43] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2026-05-31 18:02:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:02:43] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2026-05-31 18:02:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 18:02:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7504405155656506445
Running compilation step : cd /tmp/ltsmin7504405155656506445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin7504405155656506445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7504405155656506445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4642730603807124968.hoa' '--buchi-type=spotba'
LTSmin run took 19 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SupplyChain-PT-00002-LTLFireability-07 finished in 2841 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)))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 19
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9425186332006511219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3997693629022971671.kers'
[2026-05-31 18:02:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9425186332006511219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3997693629022971671.kers]
Normalized transition count is 18 out of 19 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3997693629022971671.kers
Total runtime 0 ms.
[2026-05-31 18:02:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 32 constraints, problems are : Problem set: 0 solved, 17 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 49 constraints, problems are : Problem set: 0 solved, 17 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 782ms
[2026-05-31 18:02:44] [INFO ] Invariant cache hit.
[2026-05-31 18:02:44] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 9, 10, 11]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/29 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 820 ms. Remains : 17/29 places, 19/19 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)))'
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-08 finished in 961 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&&G(p1))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 7 places
Reduce places removed 8 places and 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 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 16
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 18 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 7 place count 18 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 12 transition count 10
Applied a total of 17 rules in 11 ms. Remains 12 /29 variables (removed 17) and now considering 10/19 (removed 9) transitions.
Running 7 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8935053919635576465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16601975484892633341.kers'
[2026-05-31 18:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8935053919635576465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16601975484892633341.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 12 cols 25 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-31 18:02:44] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16601975484892633341.kers
Total runtime 1 ms.
[2026-05-31 18:02:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/21 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/22 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 7 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/21 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 25 constraints, problems are : Problem set: 0 solved, 7 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 201ms
[2026-05-31 18:02:44] [INFO ] Invariant cache hit.
[2026-05-31 18:02:44] [INFO ] Implicit Places using invariants in 24 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/29 places, 10/19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 8 transition count 7
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 6 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 6 transition count 5
Applied a total of 8 rules in 7 ms. Remains 6 /9 variables (removed 3) and now considering 5/10 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5536480321565230486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9483240383130419999.kers'
[2026-05-31 18:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5536480321565230486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9483240383130419999.kers]
Normalized transition count is 4 out of 5 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 6 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-31 18:02:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9483240383130419999.kers
Total runtime 0 ms.
[2026-05-31 18:02:44] [INFO ] Implicit Places using invariants in 37 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/29 places, 5/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 292 ms. Remains : 5/29 places, 5/19 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)&&p1)))'
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-09
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-09 finished in 385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(G(p1)))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 19
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4504401467223467582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15566330081427375377.kers'
[2026-05-31 18:02:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4504401467223467582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15566330081427375377.kers]
Normalized transition count is 18 out of 19 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:44] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15566330081427375377.kers
Total runtime 1 ms.
[2026-05-31 18:02:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 32 constraints, problems are : Problem set: 0 solved, 17 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 49 constraints, problems are : Problem set: 0 solved, 17 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 596ms
[2026-05-31 18:02:45] [INFO ] Invariant cache hit.
[2026-05-31 18:02:45] [INFO ] Implicit Places using invariants in 46 ms returned [1, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/29 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 647 ms. Remains : 18/29 places, 19/19 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((F(G(p0))&&p1)))'
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-10
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-10 finished in 816 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(p1)||p0))))||F(p2))))'
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 19
Applied a total of 6 rules in 1 ms. Remains 23 /29 variables (removed 6) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3012224070758573879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3755650304703537894.kers'
[2026-05-31 18:02:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3012224070758573879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3755650304703537894.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:45] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3755650304703537894.kers
Total runtime 1 ms.
[2026-05-31 18:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/41 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/42 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 18/41 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/42 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/42 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/42 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 51 constraints, problems are : Problem set: 0 solved, 17 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 710ms
[2026-05-31 18:02:46] [INFO ] Invariant cache hit.
[2026-05-31 18:02:46] [INFO ] Implicit Places using invariants in 26 ms returned [0, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/29 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 739 ms. Remains : 20/29 places, 19/19 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(p1)||p0))))||F(p2))))'
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 48 ms.
Product exploration explored 100000 steps with 1 reset in 57 ms.
Computed a total of 20 stabilizing places and 18 stable transitions
Computed a total of 20 stabilizing places and 18 stable transitions
Detected a total of 20/20 stabilizing places and 18/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 320 steps (23 resets) in 9 ms. (32 steps per ms) remains 0/5 properties
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 656 ms.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12274152040791522367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8134308340258636261.kers'
[2026-05-31 18:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12274152040791522367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8134308340258636261.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 19 cols 48 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-31 18:02:47] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8134308340258636261.kers
Total runtime 0 ms.
[2026-05-31 18:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 18/38 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/39 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 18/38 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1/39 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/39 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 603ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 604ms
[2026-05-31 18:02:48] [INFO ] Invariant cache hit.
[2026-05-31 18:02:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-31 18:02:48] [INFO ] Invariant cache hit.
[2026-05-31 18:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:48] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 20/20 places, 19/19 transitions.
Computed a total of 20 stabilizing places and 18 stable transitions
Computed a total of 20 stabilizing places and 18 stable transitions
Detected a total of 20/20 stabilizing places and 18/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 400 steps (30 resets) in 7 ms. (50 steps per ms) remains 0/5 properties
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 662 ms.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 55 ms.
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8917715955963460118
[2026-05-31 18:02:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8917715955963460118
Running compilation step : cd /tmp/ltsmin8917715955963460118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin8917715955963460118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8917715955963460118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7549055562828951561.hoa' '--buchi-type=spotba'
LTSmin run took 23 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SupplyChain-PT-00002-LTLFireability-11 finished in 4316 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 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 5 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 1 rules applied. Total rules applied 1 place count 24 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 23 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 23 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 19 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Applied a total of 10 rules in 5 ms. Remains 18 /29 variables (removed 11) and now considering 14/19 (removed 5) transitions.
Running 11 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14955232888167999268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7191566941308456563.kers'
[2026-05-31 18:02:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14955232888167999268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7191566941308456563.kers]
Normalized transition count is 13 out of 14 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 13 rows 15 cols 33 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-31 18:02:49] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7191566941308456563.kers
Total runtime 0 ms.
[2026-05-31 18:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 13/31 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 28 constraints, problems are : Problem set: 0 solved, 11 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 13/31 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/32 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 39 constraints, problems are : Problem set: 0 solved, 11 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 390ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 390ms
[2026-05-31 18:02:50] [INFO ] Invariant cache hit.
[2026-05-31 18:02:50] [INFO ] Implicit Places using invariants in 30 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 14/19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 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 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 14 transition count 11
Applied a total of 5 rules in 4 ms. Remains 14 /16 variables (removed 2) and now considering 11/14 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15338712810157704267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11793884466479122212.kers'
[2026-05-31 18:02:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15338712810157704267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11793884466479122212.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 11 cols 24 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-31 18:02:50] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11793884466479122212.kers
Total runtime 1 ms.
[2026-05-31 18:02:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-31 18:02:50] [INFO ] Invariant cache hit.
[2026-05-31 18:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/29 places, 11/19 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 490 ms. Remains : 14/29 places, 11/19 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 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-12
Stuttering criterion allowed to conclude after 10 steps with 2 reset in 0 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-12 finished in 611 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)) U !p0) U (p1&&X(X(F(p2))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 19
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 19/19 (removed 0) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8497859520715389855.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8929515277526622714.kers'
[2026-05-31 18:02:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8497859520715389855.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8929515277526622714.kers]
Normalized transition count is 18 out of 19 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 56 entries
Finished phase 1 with 12 SingleSign rule and 2 generalized
[2026-05-31 18:02:50] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8929515277526622714.kers
Total runtime 1 ms.
[2026-05-31 18:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 32 constraints, problems are : Problem set: 0 solved, 17 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 49 constraints, problems are : Problem set: 0 solved, 17 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 624ms
[2026-05-31 18:02:51] [INFO ] Invariant cache hit.
[2026-05-31 18:02:51] [INFO ] Implicit Places using invariants in 33 ms returned [0, 1, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/29 places, 19/19 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 659 ms. Remains : 18/29 places, 19/19 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)) U !p0) U (p1&&X(X(F(p2))))))'
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), p0, (NOT p2), (NOT p2)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00002-LTLFireability-13 finished in 897 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((!F(X(p0)) U (X(!p1) U p1))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 19/19 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 19
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 19/19 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:02:51] [INFO ] Invariant cache hit.
[2026-05-31 18:02:51] [INFO ] Implicit Places using invariants in 30 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/29 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 19/29 places, 19/19 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((!F(X(p0)) U (X(!p1) U p1))))'
Stuttering acceptance computed with spot in 196 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : SupplyChain-PT-00002-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Computed a total of 19 stabilizing places and 18 stable transitions
Detected a total of 19/19 stabilizing places and 18/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 18 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA SupplyChain-PT-00002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SupplyChain-PT-00002-LTLFireability-15 finished in 410 ms.
All properties solved by simple procedures.
Total runtime 27666 ms.

BK_STOP 1780250571755

--------------------
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="SupplyChain-PT-00002"
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 SupplyChain-PT-00002, 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 r354-tall-178024402800164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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