About the Execution of ITS-Tools for LamportFastMutEx-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 802.907 | 516352.00 | 597242.00 | 1363.40 | FFFTFTFTFTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107800356.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 LamportFastMutEx-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107800356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K Mar 7 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 16:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 16:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 15 11:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 7 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 11:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 40K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-4-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779841952528
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-27 00:32:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 00:32:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 00:32:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-27 00:32:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-27 00:32:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1335 ms
[2026-05-27 00:32:36] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2026-05-27 00:32:36] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 10 ms.
[2026-05-27 00:32:36] [INFO ] Skeletonized 11 HLPN properties in 4 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA LamportFastMutEx-COL-4-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40020 steps (8 resets) in 520 ms. (76 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6406802459370708477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15215779739342380644.kers'
[2026-05-27 00:32:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6406802459370708477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15215779739342380644.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 15 cols 36 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-27 00:32:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15215779739342380644.kers
Total runtime 1 ms.
[2026-05-27 00:32:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 1/32 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 266ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2026-05-27 00:32:37] [INFO ] Flatten gal took : 32 ms
[2026-05-27 00:32:37] [INFO ] Flatten gal took : 6 ms
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2026-05-27 00:32:37] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 54 ms.
[2026-05-27 00:32:37] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
FORMULA LamportFastMutEx-COL-4-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 90 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 15 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-27 00:32:37] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2734507878776978611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4305586392843289870.kers'
[2026-05-27 00:32:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2734507878776978611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4305586392843289870.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 144 rows 98 cols 432 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 00:32:37] [INFO ] Computed 26 invariants in 2 ms
Computed 26 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4305586392843289870.kers
Total runtime 3 ms.
[2026-05-27 00:32:38] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-27 00:32:38] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2026-05-27 00:32:38] [INFO ] Invariant cache hit.
[2026-05-27 00:32:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-27 00:32:38] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-27 00:32:38] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2026-05-27 00:32:38] [INFO ] Invariant cache hit.
[2026-05-27 00:32:38] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 22 solved, 154 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 6/72 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/72 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 144/246 variables, 102/174 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 40/214 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 1/215 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 5/220 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/220 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/220 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 220 constraints, problems are : Problem set: 24 solved, 152 unsolved in 18717 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 29/35 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/35 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/55 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 23/78 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/82 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/82 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 144/246 variables, 102/184 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 40/224 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 152/376 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/377 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 2/379 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 1/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/381 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 3/384 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/384 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 384 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48893ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 48899ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 156/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49407 ms. Remains : 102/102 places, 156/180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:33:27] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17441261664996529640.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11493724733975905650.kers'
[2026-05-27 00:33:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17441261664996529640.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11493724733975905650.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 00:33:27] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11493724733975905650.kers
Total runtime 1 ms.
[2026-05-27 00:33:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-27 00:33:27] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:33:27] [INFO ] Invariant cache hit.
[2026-05-27 00:33:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 00:33:27] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-27 00:33:27] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:33:27] [INFO ] Invariant cache hit.
[2026-05-27 00:33:27] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/102 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 128/230 variables, 102/181 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 36/217 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 0/230 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 221 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 38/44 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 19/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 128/230 variables, 102/185 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 36/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 152/373 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 5/383 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 388 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LTL mode , in 1 iterations and 60322 ms. Remains : 102/102 places, 156/156 transitions.
Support contains 90 out of 102 places after structural reductions.
[2026-05-27 00:34:27] [INFO ] Flatten gal took : 31 ms
[2026-05-27 00:34:27] [INFO ] Flatten gal took : 69 ms
[2026-05-27 00:34:27] [INFO ] Input system was already deterministic with 156 transitions.
Reduction of identical properties reduced properties to check from 25 to 17
RANDOM walk for 40000 steps (8 resets) in 1228 ms. (32 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 692 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 2/2 properties
[2026-05-27 00:34:28] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:34:28] [INFO ] Invariant cache hit.
[2026-05-27 00:34:28] [INFO ] State equation strengthened by 36 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 25/230 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 5/26 constraints, State Equation: 0/102 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA LamportFastMutEx-COL-4-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA LamportFastMutEx-COL-4-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 4 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(p0)||(G(!p1) U p2)))'
Support contains 36 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 15 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:34:29] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:34:29] [INFO ] Invariant cache hit.
[2026-05-27 00:34:29] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-27 00:34:29] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:34:29] [INFO ] Invariant cache hit.
[2026-05-27 00:34:29] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 00:34:29] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 102/102 places, 156/156 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)||(G(!p1) U p2)))'
Stuttering acceptance computed with spot in 496 ms :[p1, true, (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-00
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 3 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-00 finished in 1044 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))) U (p1&&X(X(X(p1))))))||p0)))'
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:34:30] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:34:30] [INFO ] Invariant cache hit.
[2026-05-27 00:34:30] [INFO ] Implicit Places using invariants in 143 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 148 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 98/102 places, 156/156 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))) U (p1&&X(X(X(p1))))))||p0)))'
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-02
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-02 finished in 447 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((G((F(p0)||(F(p2)&&p1)))||(X(F(p3))&&(F(p0)||(F(p2)&&p4)))))))'
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:34:30] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:34:30] [INFO ] Invariant cache hit.
[2026-05-27 00:34:30] [INFO ] Implicit Places using invariants in 174 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 176 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 98/102 places, 156/156 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((G((F(p0)||(F(p2)&&p1)))||(X(F(p3))&&(F(p0)||(F(p2)&&p4)))))))'
Stuttering acceptance computed with spot in 562 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 692 ms.
Product exploration explored 100000 steps with 25000 reset in 415 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 9 states, 17 edges and 5 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (8 resets) in 513 ms. (77 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2539 ms. (15 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1280 ms. (31 steps per ms) remains 2/2 properties
[2026-05-27 00:34:33] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16422677077043765134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7264688326316026293.kers'
[2026-05-27 00:34:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16422677077043765134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7264688326316026293.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 94 cols 392 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 00:34:33] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7264688326316026293.kers
Total runtime 1 ms.
[2026-05-27 00:34:33] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 69/93 variables, 17/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/221 variables, 93/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/226 variables, 5/139 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 1/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/226 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 140 constraints, problems are : Problem set: 1 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 69/93 variables, 17/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 93/226 variables, and 41 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1845 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, State Equation: 0/98 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2180ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 11 factoid took 183 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Knowledge-based reduction took 3971 ms.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Support contains 20 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:34:36] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:34:36] [INFO ] Invariant cache hit.
[2026-05-27 00:34:36] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-27 00:34:36] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:34:36] [INFO ] Invariant cache hit.
[2026-05-27 00:34:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 00:34:37] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-27 00:34:37] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:34:37] [INFO ] Invariant cache hit.
[2026-05-27 00:34:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/98 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 128/226 variables, 98/173 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 0/226 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 196 constraints, problems are : Problem set: 0 solved, 152 unsolved in 19855 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 128/226 variables, 98/176 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 152/348 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 7/358 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 370 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49928ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 49931ms
Finished structural reductions in LTL mode , in 1 iterations and 50366 ms. Remains : 98/98 places, 156/156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/3 properties
BEST_FIRST walk for 874 steps (0 resets) in 7 ms. (109 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Knowledge-based reduction took 488 ms.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 239 ms.
Product exploration explored 100000 steps with 25000 reset in 274 ms.
Spot run failed in 147 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/ltsmin116688360343565993
[2026-05-27 00:35:28] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin116688360343565993
Running compilation step : cd /tmp/ltsmin116688360343565993;'/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 885 ms.
Running link step : cd /tmp/ltsmin116688360343565993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin116688360343565993;'/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/stateBased8231130577812627197.hoa' '--buchi-type=spotba'
LTSmin run took 86 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-4-LTLFireability-03 finished in 59273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(((F(!p1) U G(p2))&&X(p3)))||p0))))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:35:29] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14920779573417311762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5013475505513666519.kers'
[2026-05-27 00:35:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14920779573417311762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5013475505513666519.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 00:35:29] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5013475505513666519.kers
Total runtime 1 ms.
[2026-05-27 00:35:30] [INFO ] Implicit Places using invariants in 172 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 182 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 98/102 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(((F(!p1) U G(p2))&&X(p3)))||p0))))'
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), p1, (NOT p2), (NOT p3), true]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-04
Entered a terminal (fully accepting) state of product in 25 steps with 2 reset in 0 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-04 finished in 637 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((X(F((!p1&&F(!p2))))||p0)))'
Support contains 20 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:35:30] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:35:30] [INFO ] Invariant cache hit.
[2026-05-27 00:35:30] [INFO ] Implicit Places using invariants in 206 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 207 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 98/102 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((p1&&F(p2))))||p0)))'
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-07
Product exploration explored 100000 steps with 3579 reset in 814 ms.
Product exploration explored 100000 steps with 3593 reset in 786 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 12 factoid took 57 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 336 ms. (118 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
[2026-05-27 00:35:32] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6206850090758997981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-119891483342934115.kers'
[2026-05-27 00:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6206850090758997981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-119891483342934115.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 94 cols 392 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 00:35:32] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-119891483342934115.kers
Total runtime 1 ms.
[2026-05-27 00:35:32] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf1 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 20/226 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/98 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 14 factoid took 154 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2026-05-27 00:35:33] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:35:33] [INFO ] Invariant cache hit.
[2026-05-27 00:35:33] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2026-05-27 00:35:33] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-27 00:35:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:35:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 18 ms returned sat
[2026-05-27 00:35:33] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2026-05-27 00:35:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 00:35:33] [INFO ] [Nat]Added 20 Read/Feed constraints in 13 ms returned sat
[2026-05-27 00:35:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1429 ms
[2026-05-27 00:35:35] [INFO ] Computed and/alt/rep : 112/428/112 causal constraints (skipped 12 transitions) in 21 ms.
[2026-05-27 00:35:35] [INFO ] Added : 92 causal constraints over 19 iterations in 373 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3105 ms.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 94 transition count 152
Applied a total of 8 rules in 33 ms. Remains 94 /98 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2026-05-27 00:35:35] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4107320888344186718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6763858582753229470.kers'
[2026-05-27 00:35:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4107320888344186718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6763858582753229470.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 124 rows 90 cols 384 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-27 00:35:35] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6763858582753229470.kers
Total runtime 1 ms.
[2026-05-27 00:35:35] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-27 00:35:35] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
[2026-05-27 00:35:35] [INFO ] Invariant cache hit.
[2026-05-27 00:35:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 00:35:36] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2026-05-27 00:35:36] [INFO ] Redundant transitions in 5 ms returned []
Running 148 sub problems to find dead transitions.
[2026-05-27 00:35:36] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
[2026-05-27 00:35:36] [INFO ] Invariant cache hit.
[2026-05-27 00:35:36] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 4/94 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 124/218 variables, 94/169 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 15 (OVERLAPS) 0/218 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 17 (OVERLAPS) 0/218 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 201 constraints, problems are : Problem set: 0 solved, 148 unsolved in 28859 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 94/94 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 4/94 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 124/218 variables, 94/182 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 148/350 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 218/218 variables, and 363 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 94/94 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58898ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 58899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/98 places, 152/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59340 ms. Remains : 94/98 places, 152/156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 116 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2026-05-27 00:36:35] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
[2026-05-27 00:36:35] [INFO ] Invariant cache hit.
[2026-05-27 00:36:35] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2026-05-27 00:36:35] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2026-05-27 00:36:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:36:35] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2026-05-27 00:36:35] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-27 00:36:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 00:36:35] [INFO ] [Nat]Added 20 Read/Feed constraints in 12 ms returned sat
[2026-05-27 00:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2026-05-27 00:36:36] [INFO ] Computed and/alt/rep : 108/424/108 causal constraints (skipped 12 transitions) in 16 ms.
[2026-05-27 00:36:36] [INFO ] Added : 74 causal constraints over 15 iterations in 354 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1350 ms.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3750 reset in 364 ms.
Product exploration explored 100000 steps with 3744 reset in 617 ms.
Built C files in :
/tmp/ltsmin7570183833139940028
[2026-05-27 00:36:37] [INFO ] Computing symmetric may disable matrix : 152 transitions.
[2026-05-27 00:36:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:36:37] [INFO ] Computing symmetric may enable matrix : 152 transitions.
[2026-05-27 00:36:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:36:37] [INFO ] Computing Do-Not-Accords matrix : 152 transitions.
[2026-05-27 00:36:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:36:37] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7570183833139940028
Running compilation step : cd /tmp/ltsmin7570183833139940028;'/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 428 ms.
Running link step : cd /tmp/ltsmin7570183833139940028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7570183833139940028;'/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/stateBased5035197787116435194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 152/152 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 94 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 148
Applied a total of 8 rules in 14 ms. Remains 90 /94 variables (removed 4) and now considering 148/152 (removed 4) transitions.
[2026-05-27 00:36:52] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6763373822356320347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12705119253567516622.kers'
[2026-05-27 00:36:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6763373822356320347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12705119253567516622.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 120 rows 86 cols 388 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 00:36:52] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12705119253567516622.kers
Total runtime 1 ms.
[2026-05-27 00:36:52] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-27 00:36:52] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 00:36:52] [INFO ] Invariant cache hit.
[2026-05-27 00:36:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 00:36:52] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2026-05-27 00:36:52] [INFO ] Redundant transitions in 4 ms returned []
Running 144 sub problems to find dead transitions.
[2026-05-27 00:36:52] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 00:36:52] [INFO ] Invariant cache hit.
[2026-05-27 00:36:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 120/210 variables, 90/172 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 0/210 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (OVERLAPS) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 194 constraints, problems are : Problem set: 0 solved, 144 unsolved in 23588 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 120/210 variables, 90/185 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 144/349 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 360 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53623ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 53624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/94 places, 148/152 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53935 ms. Remains : 90/94 places, 148/152 transitions.
Built C files in :
/tmp/ltsmin14301833941607421413
[2026-05-27 00:37:46] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2026-05-27 00:37:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:37:46] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2026-05-27 00:37:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:37:46] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2026-05-27 00:37:46] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:37:46] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14301833941607421413
Running compilation step : cd /tmp/ltsmin14301833941607421413;'/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 690 ms.
Running link step : cd /tmp/ltsmin14301833941607421413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14301833941607421413;'/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/stateBased15488322633207042393.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 00:38:01] [INFO ] Flatten gal took : 21 ms
[2026-05-27 00:38:01] [INFO ] Flatten gal took : 18 ms
[2026-05-27 00:38:01] [INFO ] Time to serialize gal into /tmp/LTL11230385374070583307.gal : 8 ms
[2026-05-27 00:38:01] [INFO ] Time to serialize properties into /tmp/LTL7358764993395555576.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11230385374070583307.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3187478872286483828.hoa' '-atoms' '/tmp/LTL7358764993395555576.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7358764993395555576.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3187478872286483828.hoa
Detected timeout of ITS tools.
[2026-05-27 00:38:16] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:38:16] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:38:16] [INFO ] Time to serialize gal into /tmp/LTL9188705705647333851.gal : 3 ms
[2026-05-27 00:38:16] [INFO ] Time to serialize properties into /tmp/LTL211906213216751274.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9188705705647333851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL211906213216751274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(((((X(F(("(((((P_b_3>=1)&&(P_setbi_24_1>=1))||((P_b_2>=1)&&(P_setbi_24_1>=1)))||(((P_b_4>=1)&&(P_setbi_24_2>=1))||((P_b_6>=1)&&(P...744
Formula 0 simplified : G(!"((((P_b_6>=1)&&(P_setbi_24_3>=1))||((P_b_8>=1)&&(P_setbi_24_4>=1)))||(((P_b_7>=1)&&(P_setbi_24_3>=1))||((P_b_9>=1)&&(P_setbi_24_...728
Detected timeout of ITS tools.
[2026-05-27 00:38:31] [INFO ] Flatten gal took : 11 ms
[2026-05-27 00:38:31] [INFO ] Applying decomposition
[2026-05-27 00:38:31] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5647753517394661152.txt' '-o' '/tmp/graph5647753517394661152.bin' '-w' '/tmp/graph5647753517394661152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5647753517394661152.bin' '-l' '-1' '-v' '-w' '/tmp/graph5647753517394661152.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:38:31] [INFO ] Decomposing Gal with order
[2026-05-27 00:38:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:38:32] [INFO ] Removed a total of 162 redundant transitions.
[2026-05-27 00:38:32] [INFO ] Flatten gal took : 74 ms
[2026-05-27 00:38:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 25 ms.
[2026-05-27 00:38:32] [INFO ] Time to serialize gal into /tmp/LTL10623955251157226475.gal : 8 ms
[2026-05-27 00:38:32] [INFO ] Time to serialize properties into /tmp/LTL4867652650522369144.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10623955251157226475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4867652650522369144.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((((X(F(("(((((i0.u0.P_b_3>=1)&&(i5.u34.P_setbi_24_1>=1))||((i0.u0.P_b_2>=1)&&(i5.u34.P_setbi_24_1>=1)))||(((i1.u1.P_b_4>=1)&&(i1...1004
Formula 0 simplified : G(!"((((i2.u2.P_b_6>=1)&&(i5.u35.P_setbi_24_3>=1))||((i3.u3.P_b_8>=1)&&(i3.u36.P_setbi_24_4>=1)))||(((i2.u2.P_b_7>=1)&&(i5.u35.P_set...988
Detected timeout of ITS tools.
Treatment of property LamportFastMutEx-COL-4-LTLFireability-07 finished in 196722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((p0&&X(X(p0))))) U p1))'
Support contains 33 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:38:47] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3239698290633734825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9831204097044315072.kers'
[2026-05-27 00:38:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3239698290633734825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9831204097044315072.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 00:38:47] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9831204097044315072.kers
Total runtime 1 ms.
[2026-05-27 00:38:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-27 00:38:47] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:38:47] [INFO ] Invariant cache hit.
[2026-05-27 00:38:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 00:38:47] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-27 00:38:47] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:38:47] [INFO ] Invariant cache hit.
[2026-05-27 00:38:47] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/102 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 128/230 variables, 102/181 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 36/217 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 0/230 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 221 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 38/44 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 19/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 128/230 variables, 102/185 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 36/221 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 152/373 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 5/383 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 388 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Finished structural reductions in LTL mode , in 1 iterations and 60367 ms. Remains : 102/102 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((X(X(p0))&&p0))) U p1))'
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p0), (AND p1 (NOT p0)), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-08 finished in 60656 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(p0)||X(X(F(p1))))))'
Support contains 28 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:39:47] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:47] [INFO ] Invariant cache hit.
[2026-05-27 00:39:47] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-27 00:39:47] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:47] [INFO ] Invariant cache hit.
[2026-05-27 00:39:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 00:39:48] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 102/102 places, 156/156 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(p0)||X(X(F(p1))))))'
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 166 ms.
Product exploration explored 100000 steps with 25000 reset in 198 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 145 steps (0 resets) in 9 ms. (14 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 328 ms.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 28 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:39:49] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:49] [INFO ] Invariant cache hit.
[2026-05-27 00:39:49] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-27 00:39:49] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:49] [INFO ] Invariant cache hit.
[2026-05-27 00:39:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 00:39:49] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 102/102 places, 156/156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 180 steps (0 resets) in 8 ms. (20 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 385 ms.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 227 ms.
Product exploration explored 100000 steps with 25000 reset in 258 ms.
Spot run failed in 83 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/ltsmin5434766929029102882
[2026-05-27 00:39:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5434766929029102882
Running compilation step : cd /tmp/ltsmin5434766929029102882;'/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 611 ms.
Running link step : cd /tmp/ltsmin5434766929029102882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5434766929029102882;'/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/stateBased11366607108092933425.hoa' '--buchi-type=spotba'
LTSmin run took 20 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-4-LTLFireability-09 finished in 3827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
Support contains 41 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:39:51] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:51] [INFO ] Invariant cache hit.
[2026-05-27 00:39:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-27 00:39:51] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:51] [INFO ] Invariant cache hit.
[2026-05-27 00:39:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 00:39:51] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2026-05-27 00:39:51] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 102/102 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-10
Product exploration explored 100000 steps with 9 reset in 978 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 1 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-10 finished in 1340 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((G(p0)||F(((X(X(!p0)) U (X(X(G(!p0)))||(!p2&&X(X(!p0)))))&&p1)))))'
Support contains 13 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:39:53] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:53] [INFO ] Invariant cache hit.
[2026-05-27 00:39:53] [INFO ] Implicit Places using invariants in 127 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 128 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 98/102 places, 156/156 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((G(p0)||F(((X(X(!p0)) U (X(X(G(!p0)))||(!p2&&X(X(!p0)))))&&p1)))))'
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-11
Product exploration explored 100000 steps with 25001 reset in 933 ms.
Product exploration explored 100000 steps with 24943 reset in 945 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 16 factoid took 172 ms. Reduced automaton from 9 states, 30 edges and 3 AP (stutter sensitive) to 9 states, 30 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 12 to 8
RANDOM walk for 40000 steps (8 resets) in 736 ms. (54 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 385 ms. (103 steps per ms) remains 3/3 properties
[2026-05-27 00:39:56] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7259518227386597612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8632760304930577631.kers'
[2026-05-27 00:39:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7259518227386597612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8632760304930577631.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 94 cols 392 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 00:39:56] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8632760304930577631.kers
Total runtime 1 ms.
[2026-05-27 00:39:56] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 13/226 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/98 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 19 factoid took 363 ms. Reduced automaton from 9 states, 30 edges and 3 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 440 ms :[false, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 1556 ms.
Stuttering acceptance computed with spot in 433 ms :[false, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 13 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:39:57] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:57] [INFO ] Invariant cache hit.
[2026-05-27 00:39:57] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-27 00:39:57] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:57] [INFO ] Invariant cache hit.
[2026-05-27 00:39:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 00:39:57] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-27 00:39:57] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 00:39:57] [INFO ] Invariant cache hit.
[2026-05-27 00:39:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 4/98 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 128/226 variables, 98/173 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 0/226 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 196 constraints, problems are : Problem set: 0 solved, 152 unsolved in 21214 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 128/226 variables, 98/176 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 152/348 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 7/358 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 370 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51267ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 51268ms
Finished structural reductions in LTL mode , in 1 iterations and 51736 ms. Remains : 98/98 places, 156/156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
RANDOM walk for 1233 steps (0 resets) in 11 ms. (102 steps per ms) remains 0/4 properties
Knowledge based reduction with 8 factoid took 179 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[false, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 780 ms.
Stuttering acceptance computed with spot in 470 ms :[false, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 463 ms :[false, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25033 reset in 737 ms.
Product exploration explored 100000 steps with 25051 reset in 486 ms.
Spot run failed in 78 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/ltsmin13083784955572484997
[2026-05-27 00:40:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13083784955572484997
Running compilation step : cd /tmp/ltsmin13083784955572484997;'/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 590 ms.
Running link step : cd /tmp/ltsmin13083784955572484997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin13083784955572484997;'/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/stateBased9971659835292858283.hoa' '--buchi-type=spotba'
LTSmin run took 1739 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-4-LTLFireability-11 finished in 61590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (F(!p1)&&X(!p2))))'
Support contains 22 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 00:40:54] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8482818479892394297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6298303181495256779.kers'
[2026-05-27 00:40:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8482818479892394297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6298303181495256779.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 00:40:54] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6298303181495256779.kers
Total runtime 1 ms.
[2026-05-27 00:40:54] [INFO ] Implicit Places using invariants in 122 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 125 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 98/102 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (F(!p1)&&X(!p2))))'
Stuttering acceptance computed with spot in 181 ms :[(OR p1 p2), p2, p1, p2, true, p0]
Running random walk in product with property : LamportFastMutEx-COL-4-LTLFireability-12
Product exploration explored 100000 steps with 5310 reset in 222 ms.
Stack based approach found an accepted trace after 9499 steps with 479 reset with depth 43 and stack size 43 in 34 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-4-LTLFireability-12 finished in 596 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((X(F((!p1&&F(!p2))))||p0)))'
Spot run failed in 77 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 00:40:55] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6204672026596460227
[2026-05-27 00:40:55] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2026-05-27 00:40:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:40:55] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2026-05-27 00:40:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:40:55] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2026-05-27 00:40:55] [INFO ] Applying decomposition
[2026-05-27 00:40:55] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 00:40:55] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6204672026596460227
Running compilation step : cd /tmp/ltsmin6204672026596460227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-27 00:40:55] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10460749031212126381.txt' '-o' '/tmp/graph10460749031212126381.bin' '-w' '/tmp/graph10460749031212126381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10460749031212126381.bin' '-l' '-1' '-v' '-w' '/tmp/graph10460749031212126381.weights' '-q' '0' '-e' '0.001'
[2026-05-27 00:40:55] [INFO ] Decomposing Gal with order
[2026-05-27 00:40:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 00:40:55] [INFO ] Removed a total of 161 redundant transitions.
[2026-05-27 00:40:55] [INFO ] Flatten gal took : 40 ms
[2026-05-27 00:40:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 22 ms.
[2026-05-27 00:40:55] [INFO ] Time to serialize gal into /tmp/LTLFireability9650072694842906590.gal : 7 ms
[2026-05-27 00:40:55] [INFO ] Time to serialize properties into /tmp/LTLFireability3093771908947944523.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9650072694842906590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3093771908947944523.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(((((i5.i0.u0.P_b_3>=1)&&(i5.i0.u32.P_setbi_24_1>=1))||((i5.i0.u0.P_b_2>=1)&&(i5.i0.u32.P_setbi_24_1>=1)))||(((i3.i0.u1.P_b_4>=...1032
Formula 0 simplified : G(!"(((((i5.i0.u0.P_b_3>=1)&&(i5.i0.u32.P_setbi_24_1>=1))||((i5.i0.u0.P_b_2>=1)&&(i5.i0.u32.P_setbi_24_1>=1)))||(((i3.i0.u1.P_b_4>=1...1014
Compilation finished in 766 ms.
Running link step : cd /tmp/ltsmin6204672026596460227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6204672026596460227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>((X(<>((!(LTLAPp1==true)&&<>(!(LTLAPp2==true)))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t51, t53, t76, t77, t78, t79, t104, t105, t106, t107,...622
LTSmin run took 12646 ms.
FORMULA LamportFastMutEx-COL-4-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 514169 ms.
BK_STOP 1779842468880
--------------------
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="LamportFastMutEx-COL-4"
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 LamportFastMutEx-COL-4, 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 r162-smll-177961107800356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 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 '
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 ;