fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r194-tall-177969914200580
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for PermAdmissibility-COL-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1153.199 124043.00 163011.00 376.10 TFFTTTFTTFFFFFTF 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.r194-tall-177969914200580.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 PermAdmissibility-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.2K Mar 8 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 8 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 8 07:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 8 07:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 16 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Mar 8 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 8 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 8 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 16 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 37K 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 PermAdmissibility-COL-10-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779789539077

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-26 09:59:00] [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-26 09:59:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:59:00] [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-26 09:59:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 09:59:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 519 ms
[2026-05-26 09:59:00] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2026-05-26 09:59:00] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 4 ms.
[2026-05-26 09:59:00] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 30775 steps (172 resets) in 179 ms. (170 steps per ms) remains 0/16 properties
[2026-05-26 09:59:01] [INFO ] Flatten gal took : 20 ms
[2026-05-26 09:59:01] [INFO ] Flatten gal took : 7 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2026-05-26 09:59:01] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 11 ms.
[2026-05-26 09:59:01] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 30 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 10 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17101617225887762156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7494381014719774969.kers'
[2026-05-26 09:59:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17101617225887762156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7494381014719774969.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:59:01] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7494381014719774969.kers
Total runtime 0 ms.
[2026-05-26 09:59:01] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-26 09:59:01] [INFO ] Invariant cache hit.
[2026-05-26 09:59:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 09:59:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 396 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 63 constraints, problems are : Problem set: 0 solved, 15 unsolved in 570 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 995ms
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1238 ms. Remains : 32/40 places, 16/16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:59:02] [INFO ] Invariant cache hit.
[2026-05-26 09:59:02] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-26 09:59:02] [INFO ] Invariant cache hit.
[2026-05-26 09:59:02] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 32/32 places, 16/16 transitions.
Support contains 30 out of 32 places after structural reductions.
[2026-05-26 09:59:02] [INFO ] Flatten gal took : 2 ms
[2026-05-26 09:59:02] [INFO ] Flatten gal took : 3 ms
[2026-05-26 09:59:02] [INFO ] Input system was already deterministic with 16 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 39287 steps (220 resets) in 164 ms. (238 steps per ms) remains 0/16 properties
FORMULA PermAdmissibility-COL-10-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-COL-10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 10 ms. Remains 27 /32 variables (removed 5) and now considering 14/16 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3112432122164175107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3654539732779063805.kers'
[2026-05-26 09:59:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3112432122164175107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3654539732779063805.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 14 rows 26 cols 61 entries
Finished phase 1 with 3 SingleSign rule and 11 generalized
[2026-05-26 09:59:03] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3654539732779063805.kers
Total runtime 0 ms.
[2026-05-26 09:59:03] [INFO ] Implicit Places using invariants in 38 ms returned [4, 5, 6, 7, 13, 15, 16, 17, 18]
[2026-05-26 09:59:03] [INFO ] Actually due to overlaps returned [4, 5, 13, 15, 16]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 40 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 13/14 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 21/32 places, 13/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-00
Product exploration explored 100000 steps with 5011 reset in 220 ms.
Product exploration explored 100000 steps with 4886 reset in 179 ms.
Computed a total of 21 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 13
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 9 factoid took 128 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 161 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLFireability-00 finished in 959 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 X(X(X((F(G(p1)) U p2)))))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4582157138715804297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16293186243977085575.kers'
[2026-05-26 09:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4582157138715804297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16293186243977085575.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:59:04] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16293186243977085575.kers
Total runtime 0 ms.
[2026-05-26 09:59:04] [INFO ] Implicit Places using invariants in 39 ms returned [4, 5, 6, 7, 12, 13, 15, 17]
[2026-05-26 09:59:04] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 40 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 25/32 places, 16/16 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 X(X(X((F(G(p1)) U p2)))))))'
Stuttering acceptance computed with spot in 494 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-01
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLFireability-01 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G((!p0||X(!p1)))) U G(p2)) U X(p3)))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4980212022223907412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13050153164217888631.kers'
[2026-05-26 09:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4980212022223907412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13050153164217888631.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:59:04] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13050153164217888631.kers
Total runtime 0 ms.
[2026-05-26 09:59:04] [INFO ] Implicit Places using invariants in 36 ms returned [4, 5, 6, 7, 13, 16, 18]
[2026-05-26 09:59:04] [INFO ] Actually due to overlaps returned [4, 5, 13, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 27/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G((!p0||X(!p1)))) U G(p2)) U X(p3)))'
Stuttering acceptance computed with spot in 273 ms :[(NOT p3), (AND p2 (NOT p3) p0 p1), (NOT p3), (AND p0 p1), (AND p0 p1), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-02
Product exploration explored 100000 steps with 2331 reset in 152 ms.
Product exploration explored 100000 steps with 2348 reset in 160 ms.
Computed a total of 27 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be false by K+ with min(phi)
Knowledge based reduction with 19 factoid took 33 ms. Proved property starting from automaton with 6 states, 16 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 73 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLFireability-02 finished in 748 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 !p1) U (F(p2) U p3))&&F(p4)))'
Support contains 13 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 4 ms. Remains 24 /32 variables (removed 8) and now considering 12/16 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13953401292471509165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9881935002886634835.kers'
[2026-05-26 09:59:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13953401292471509165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9881935002886634835.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 12 rows 22 cols 51 entries
Finished phase 1 with 3 SingleSign rule and 9 generalized
[2026-05-26 09:59:05] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9881935002886634835.kers
Total runtime 0 ms.
[2026-05-26 09:59:05] [INFO ] Implicit Places using invariants in 30 ms returned [16, 17, 18, 19]
[2026-05-26 09:59:05] [INFO ] Actually due to overlaps returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 12/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37 ms. Remains : 22/32 places, 12/16 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 !p1) U (F(p2) U p3))&&F(p4)))'
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p3) (NOT p4)), (NOT p2), (NOT p3), (NOT p4), (NOT p3), (AND p1 (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-04
Product exploration explored 100000 steps with 5864 reset in 235 ms.
Product exploration explored 100000 steps with 5935 reset in 157 ms.
Computed a total of 22 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 27 factoid took 140 ms. Reduced automaton from 6 states, 15 edges and 5 AP (stutter insensitive) to 13 states, 37 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40025 steps (300 resets) in 186 ms. (214 steps per ms) remains 3/19 properties
BEST_FIRST walk for 40003 steps (57 resets) in 276 ms. (144 steps per ms) remains 1/3 properties
BEST_FIRST walk for 6473 steps (8 resets) in 12 ms. (497 steps per ms) remains 0/1 properties
Knowledge based reduction with 27 factoid took 426 ms. Reduced automaton from 13 states, 37 edges and 4 AP (stutter insensitive) to 13 states, 37 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 580 ms :[(NOT p3), (NOT p2), (NOT p3), (NOT p3), (AND p1 (NOT p2)), false, false, false, false, false, false, false, false]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7880541662276834692.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10461818457912501083.kers'
[2026-05-26 09:59:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7880541662276834692.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10461818457912501083.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 12 rows 20 cols 45 entries
Finished phase 1 with 5 SingleSign rule and 7 generalized
[2026-05-26 09:59:07] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10461818457912501083.kers
Total runtime 0 ms.
[2026-05-26 09:59:07] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-26 09:59:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 09:59:07] [INFO ] Computed and/alt/rep : 11/23/11 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 09:59:07] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 1372 ms.
Stuttering acceptance computed with spot in 532 ms :[(NOT p3), (NOT p2), (NOT p3), (NOT p3), (AND p1 (NOT p2)), false, false, false, false, false, false, false, false]
Support contains 10 out of 22 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 : 22/22 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2026-05-26 09:59:07] [INFO ] Invariant cache hit.
[2026-05-26 09:59:08] [INFO ] Implicit Places using invariants in 25 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/22 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29 ms. Remains : 20/22 places, 12/12 transitions.
Computed a total of 20 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 41 factoid took 155 ms. Reduced automaton from 13 states, 37 edges and 4 AP (stutter insensitive) to 13 states, 37 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40025 steps (300 resets) in 52 ms. (755 steps per ms) remains 3/19 properties
BEST_FIRST walk for 40002 steps (58 resets) in 88 ms. (449 steps per ms) remains 1/3 properties
BEST_FIRST walk for 3151 steps (2 resets) in 7 ms. (393 steps per ms) remains 0/1 properties
Knowledge based reduction with 41 factoid took 480 ms. Reduced automaton from 13 states, 37 edges and 4 AP (stutter insensitive) to 13 states, 37 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 547 ms :[(NOT p3), (NOT p2), (NOT p3), (NOT p3), (AND p1 (NOT p2)), false, false, false, false, false, false, false, false]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8426031602682736220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10490171278327387126.kers'
[2026-05-26 09:59:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8426031602682736220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10490171278327387126.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 12 rows 18 cols 39 entries
Finished phase 1 with 10 SingleSign rule and 2 generalized
[2026-05-26 09:59:09] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10490171278327387126.kers
Total runtime 0 ms.
[2026-05-26 09:59:09] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2026-05-26 09:59:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 09:59:09] [INFO ] Computed and/alt/rep : 11/19/11 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 09:59:09] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 1320 ms.
Stuttering acceptance computed with spot in 570 ms :[(NOT p3), (NOT p2), (NOT p3), (NOT p3), (AND p1 (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 572 ms :[(NOT p3), (NOT p2), (NOT p3), (NOT p3), (AND p1 (NOT p2)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 3218 reset in 126 ms.
Product exploration explored 100000 steps with 3218 reset in 129 ms.
Built C files in :
/tmp/ltsmin12817251215860429302
[2026-05-26 09:59:10] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2026-05-26 09:59:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:59:10] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2026-05-26 09:59:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:59:10] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2026-05-26 09:59:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:59:10] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12817251215860429302
Running compilation step : cd /tmp/ltsmin12817251215860429302;'/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 169 ms.
Running link step : cd /tmp/ltsmin12817251215860429302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12817251215860429302;'/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/stateBased13633326705720496823.hoa' '--buchi-type=spotba'
LTSmin run took 313 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-10-LTLFireability-04 finished in 5976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15934801284818694167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7593098152953252484.kers'
[2026-05-26 09:59:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15934801284818694167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7593098152953252484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:59:11] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7593098152953252484.kers
Total runtime 0 ms.
[2026-05-26 09:59:11] [INFO ] Implicit Places using invariants in 42 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 22, 24]
[2026-05-26 09:59:11] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 44 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 23/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-05
Product exploration explored 100000 steps with 1860 reset in 100 ms.
Product exploration explored 100000 steps with 1858 reset in 105 ms.
Computed a total of 23 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 47 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 532 steps (0 resets) in 5 ms. (88 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4820488732091826707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-407834273258664831.kers'
[2026-05-26 09:59:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4820488732091826707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-407834273258664831.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 23 cols 52 entries
Finished phase 1 with 10 SingleSign rule and 6 generalized
[2026-05-26 09:59:12] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-407834273258664831.kers
Total runtime 0 ms.
[2026-05-26 09:59:12] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2026-05-26 09:59:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-26 09:59:12] [INFO ] Computed and/alt/rep : 15/29/15 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-26 09:59:12] [INFO ] Added : 15 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 408 ms.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:59:12] [INFO ] Invariant cache hit.
[2026-05-26 09:59:12] [INFO ] Implicit Places using invariants in 42 ms returned [4, 5, 10, 11, 17]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 43 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 18/23 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 532 steps (0 resets) in 4 ms. (106 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4259962354109594892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9885095152608583530.kers'
[2026-05-26 09:59:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4259962354109594892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9885095152608583530.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 18 cols 37 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-26 09:59:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9885095152608583530.kers
Total runtime 0 ms.
[2026-05-26 09:59:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-26 09:59:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 09:59:12] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 09:59:12] [INFO ] Added : 15 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 376 ms.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1888 reset in 73 ms.
Product exploration explored 100000 steps with 1889 reset in 80 ms.
Spot run failed in 72 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/ltsmin14866333623815083282
[2026-05-26 09:59:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14866333623815083282
Running compilation step : cd /tmp/ltsmin14866333623815083282;'/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 84 ms.
Running link step : cd /tmp/ltsmin14866333623815083282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14866333623815083282;'/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/stateBased6395728059727436948.hoa' '--buchi-type=spotba'
LTSmin run took 2737 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-10-LTLFireability-05 finished in 5056 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)||(p1&&X(G(p2))))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10634638317872535455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6920411085923010179.kers'
[2026-05-26 09:59:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10634638317872535455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6920411085923010179.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:59:16] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6920411085923010179.kers
Total runtime 0 ms.
[2026-05-26 09:59:16] [INFO ] Implicit Places using invariants in 43 ms returned [4, 6, 13, 16, 18, 23, 24, 25, 26]
[2026-05-26 09:59:16] [INFO ] Actually due to overlaps returned [4, 13, 16, 23, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 44 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 26/32 places, 16/16 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)||(X(G(p1))&&p2))))'
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLFireability-06 finished in 221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((G(F(!p0))||(p1&&X(X((G(F(!p0))||(F(!p0)&&F(p2)))))))))||(F((G(F(!p0))||(p1&&X(X((G(F(!p0))||(F(!p0)&&F(p2))))))))&&F(!p2))))'
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8352175769884772930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13142982752922045409.kers'
[2026-05-26 09:59:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8352175769884772930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13142982752922045409.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:59:16] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13142982752922045409.kers
Total runtime 0 ms.
[2026-05-26 09:59:16] [INFO ] Implicit Places using invariants in 38 ms returned [4, 5, 6, 7, 12, 13, 22, 23, 24, 25]
[2026-05-26 09:59:16] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 22, 23]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 41 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 24/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((G(F(p0))||(p1&&X(X((G(F(p0))||(F(p0)&&F(p2)))))))))||(F((G(F(p0))||(p1&&X(X((G(F(p0))||(F(p0)&&F(p2))))))))&&F(!p2))))'
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-08
Product exploration explored 100000 steps with 5801 reset in 85 ms.
Product exploration explored 100000 steps with 5777 reset in 88 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 15 ms. Proved property starting from automaton with 9 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 44 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-10-LTLFireability-08 finished in 657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 4 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5823331521001077963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6529089461586476755.kers'
[2026-05-26 09:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5823331521001077963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6529089461586476755.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 26 cols 61 entries
Finished phase 1 with 3 SingleSign rule and 11 generalized
[2026-05-26 09:59:17] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6529089461586476755.kers
Total runtime 0 ms.
[2026-05-26 09:59:17] [INFO ] Implicit Places using invariants in 36 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17]
[2026-05-26 09:59:17] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 37 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 18 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 17 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 16 transition count 10
Applied a total of 5 rules in 4 ms. Remains 16 /20 variables (removed 4) and now considering 10/14 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13033382543520244177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17908823944010494398.kers'
[2026-05-26 09:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13033382543520244177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17908823944010494398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 16 cols 35 entries
Finished phase 1 with 5 SingleSign rule and 5 generalized
[2026-05-26 09:59:17] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17908823944010494398.kers
Total runtime 0 ms.
[2026-05-26 09:59:17] [INFO ] Implicit Places using invariants in 23 ms returned [4, 5, 7, 8]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 23 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/32 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 9 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 6 transition count 4
Applied a total of 10 rules in 1 ms. Remains 6 /12 variables (removed 6) and now considering 4/10 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15986982574364761632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17856877080417692550.kers'
[2026-05-26 09:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15986982574364761632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17856877080417692550.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 6 cols 13 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-05-26 09:59:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17856877080417692550.kers
Total runtime 0 ms.
[2026-05-26 09:59:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 09:59:17] [INFO ] Invariant cache hit.
[2026-05-26 09:59:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 107 ms. Remains : 6/32 places, 4/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-12
Stuttering criterion allowed to conclude after 6429 steps with 911 reset in 10 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLFireability-12 finished in 212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 10 /32 variables (removed 22) and now considering 6/16 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5985771601236469065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7830405380114878632.kers'
[2026-05-26 09:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5985771601236469065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7830405380114878632.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 10 cols 21 entries
Finished phase 1 with 3 SingleSign rule and 3 generalized
[2026-05-26 09:59:17] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7830405380114878632.kers
Total runtime 0 ms.
[2026-05-26 09:59:17] [INFO ] Implicit Places using invariants in 23 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/32 places, 6/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10516140256682226299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5859374593394691509.kers'
[2026-05-26 09:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10516140256682226299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5859374593394691509.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 7 cols 15 entries
Finished phase 1 with 4 SingleSign rule and 1 generalized
[2026-05-26 09:59:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5859374593394691509.kers
Total runtime 0 ms.
[2026-05-26 09:59:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-26 09:59:17] [INFO ] Invariant cache hit.
[2026-05-26 09:59:17] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 7/32 places, 5/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-13
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLFireability-13 finished in 125 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(p0))||(X(p1) U p2)||X(X(G(p3)))))'
Support contains 10 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10914374278736376810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2580877623948264997.kers'
[2026-05-26 09:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10914374278736376810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2580877623948264997.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:59:17] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2580877623948264997.kers
Total runtime 0 ms.
[2026-05-26 09:59:17] [INFO ] Implicit Places using invariants in 34 ms returned [4, 5, 6, 7, 14, 15, 16, 17, 18]
[2026-05-26 09:59:17] [INFO ] Actually due to overlaps returned [4, 5, 14, 15, 16]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 26/32 places, 16/16 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(p0))||(X(p1) U p2)||X(X(G(p3)))))'
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-14
Product exploration explored 100000 steps with 1535 reset in 116 ms.
Product exploration explored 100000 steps with 1541 reset in 130 ms.
Computed a total of 26 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 15 factoid took 202 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 620 steps (0 resets) in 5 ms. (103 steps per ms) remains 0/4 properties
Knowledge based reduction with 15 factoid took 233 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8972004344191977512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11483377191373618716.kers'
[2026-05-26 09:59:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8972004344191977512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11483377191373618716.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 25 cols 57 entries
Finished phase 1 with 7 SingleSign rule and 9 generalized
[2026-05-26 09:59:18] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11483377191373618716.kers
Total runtime 0 ms.
[2026-05-26 09:59:18] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-26 09:59:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-26 09:59:18] [INFO ] Computed and/alt/rep : 15/31/15 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 09:59:18] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Knowledge-based reduction took 707 ms.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:59:19] [INFO ] Invariant cache hit.
[2026-05-26 09:59:19] [INFO ] Implicit Places using invariants in 32 ms returned [4, 5, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 22/26 places, 16/16 transitions.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 620 steps (0 resets) in 4 ms. (124 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4474308726698963081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13304282935830751272.kers'
[2026-05-26 09:59:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4474308726698963081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13304282935830751272.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 21 cols 45 entries
Finished phase 1 with 14 SingleSign rule and 2 generalized
[2026-05-26 09:59:19] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13304282935830751272.kers
Total runtime 0 ms.
[2026-05-26 09:59:19] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-26 09:59:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-26 09:59:19] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 09:59:19] [INFO ] Added : 15 causal constraints over 3 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Knowledge-based reduction took 571 ms.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 1544 reset in 101 ms.
Product exploration explored 100000 steps with 1556 reset in 108 ms.
Spot run failed in 43 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/ltsmin8095162718541501061
[2026-05-26 09:59:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8095162718541501061
Running compilation step : cd /tmp/ltsmin8095162718541501061;'/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 81 ms.
Running link step : cd /tmp/ltsmin8095162718541501061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8095162718541501061;'/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/stateBased4562263219312090963.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:59:35] [INFO ] Invariant cache hit.
[2026-05-26 09:59:35] [INFO ] Implicit Places using invariants in 29 ms returned [15, 17]
[2026-05-26 09:59:35] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 21/22 places, 16/16 transitions.
Built C files in :
/tmp/ltsmin3221659197280143536
[2026-05-26 09:59:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3221659197280143536
Running compilation step : cd /tmp/ltsmin3221659197280143536;'/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 87 ms.
Running link step : cd /tmp/ltsmin3221659197280143536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3221659197280143536;'/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/stateBased14978875748536515521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 09:59:50] [INFO ] Flatten gal took : 2 ms
[2026-05-26 09:59:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:59:50] [INFO ] Time to serialize gal into /tmp/LTL1276918438027925353.gal : 1 ms
[2026-05-26 09:59:50] [INFO ] Time to serialize properties into /tmp/LTL14788147990645114629.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/LTL1276918438027925353.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15182945510929560014.hoa' '-atoms' '/tmp/LTL14788147990645114629.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...319
Loading property file /tmp/LTL14788147990645114629.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15182945510929560014.hoa
Reverse transition relation is NOT exact ! Due to transitions t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 10:00:05] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:00:05] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:00:05] [INFO ] Time to serialize gal into /tmp/LTL14877361836306244728.gal : 1 ms
[2026-05-26 10:00:05] [INFO ] Time to serialize properties into /tmp/LTL12446812944103544227.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/LTL14877361836306244728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12446812944103544227.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...277
Read 1 LTL properties
Checking formula 0 : !((((F(X("(((aux16>=1)&&(aux14>=1))&&(c20>=1))")))||((X("(((aux15>=1)&&(aux13>=1))&&(c17>=1))"))U("(((aux16>=1)&&(aux14>=1))&&(c19>=1)...208
Formula 0 simplified : !"(((aux16>=1)&&(aux14>=1))&&(c19>=1))" & X(XF!"(((in1>=1)&&(c6>=1))&&(in3>=1))" & G!"(((aux16>=1)&&(aux14>=1))&&(c20>=1))" & (!"(((...233
Reverse transition relation is NOT exact ! Due to transitions t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 10:00:20] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:00:20] [INFO ] Applying decomposition
[2026-05-26 10:00:20] [INFO ] Flatten gal took : 2 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/graph4257385653593041565.txt' '-o' '/tmp/graph4257385653593041565.bin' '-w' '/tmp/graph4257385653593041565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4257385653593041565.bin' '-l' '-1' '-v' '-w' '/tmp/graph4257385653593041565.weights' '-q' '0' '-e' '0.001'
[2026-05-26 10:00:20] [INFO ] Decomposing Gal with order
[2026-05-26 10:00:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 10:00:20] [INFO ] Removed a total of 1 redundant transitions.
[2026-05-26 10:00:20] [INFO ] Flatten gal took : 30 ms
[2026-05-26 10:00:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-26 10:00:20] [INFO ] Time to serialize gal into /tmp/LTL17043910575825690912.gal : 1 ms
[2026-05-26 10:00:20] [INFO ] Time to serialize properties into /tmp/LTL14098126708080463383.ltl : 0 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/LTL17043910575825690912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14098126708080463383.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...256
Read 1 LTL properties
Checking formula 0 : !((((F(X("(((i2.u4.aux16>=1)&&(i2.u5.aux14>=1))&&(i2.u4.c20>=1))")))||((X("(((u6.aux15>=1)&&(u6.aux13>=1))&&(i2.u4.c17>=1))"))U("(((i2...271
Formula 0 simplified : !"(((i2.u4.aux16>=1)&&(i2.u5.aux14>=1))&&(u6.c19>=1))" & X(XF!"(((i0.u0.in1>=1)&&(i0.u0.c6>=1))&&(i0.u0.in3>=1))" & G!"(((i2.u4.aux1...311
Reverse transition relation is NOT exact ! Due to transitions i2.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...167
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-COL-10-LTLFireability-14 finished in 77951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0||X(p1))&&(p1||X(p0))))||X(!p2))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3752056532583748043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8062390314500226353.kers'
[2026-05-26 10:00:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3752056532583748043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8062390314500226353.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 10:00:35] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8062390314500226353.kers
Total runtime 1 ms.
[2026-05-26 10:00:35] [INFO ] Implicit Places using invariants in 38 ms returned [4, 5, 6, 7, 12, 13, 22, 24]
[2026-05-26 10:00:35] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 22]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 39 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 25/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0||X(p1))&&(p1||X(p0))))||X(p2))))'
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-COL-10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-10-LTLFireability-15 finished in 416 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(p0))||(X(p1) U p2)||X(X(G(p3)))))'
Spot run failed in 44 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-26 10:00:36] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6260506246082783730
[2026-05-26 10:00:36] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2026-05-26 10:00:36] [INFO ] Applying decomposition
[2026-05-26 10:00:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:00:36] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2026-05-26 10:00:36] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:00:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:00:36] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2026-05-26 10:00:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 10:00:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6260506246082783730
Running compilation step : cd /tmp/ltsmin6260506246082783730;'/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'
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/graph6825623709777839088.txt' '-o' '/tmp/graph6825623709777839088.bin' '-w' '/tmp/graph6825623709777839088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6825623709777839088.bin' '-l' '-1' '-v' '-w' '/tmp/graph6825623709777839088.weights' '-q' '0' '-e' '0.001'
[2026-05-26 10:00:36] [INFO ] Decomposing Gal with order
[2026-05-26 10:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 10:00:36] [INFO ] Removed a total of 4 redundant transitions.
[2026-05-26 10:00:36] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-26 10:00:36] [INFO ] Time to serialize gal into /tmp/LTLFireability16126655898615489473.gal : 1 ms
[2026-05-26 10:00:36] [INFO ] Time to serialize properties into /tmp/LTLFireability10630035271006401273.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/LTLFireability16126655898615489473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10630035271006401273.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...278
Read 1 LTL properties
Checking formula 0 : !((((F(X("(((i4.u6.aux16>=1)&&(u0.aux14>=1))&&(i4.u6.c20>=1))")))||((X("(((i4.u5.aux15>=1)&&(i4.u5.aux13>=1))&&(i4.u6.c17>=1))"))U("((...265
Formula 0 simplified : !"(((i4.u6.aux16>=1)&&(u0.aux14>=1))&&(i4.u5.c19>=1))" & X(XF!"(((u1.in1>=1)&&(u1.c6>=1))&&(u1.in3>=1))" & G!"(((i4.u6.aux16>=1)&&(u...305
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin6260506246082783730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6260506246082783730;'/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((LTLAPp0==true)))||(X((LTLAPp1==true)) U (LTLAPp2==true))||X(X([]((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 26541 ms.
FORMULA PermAdmissibility-COL-10-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 122553 ms.

BK_STOP 1779789663120

--------------------
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="PermAdmissibility-COL-10"
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 PermAdmissibility-COL-10, 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 r194-tall-177969914200580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-10.tgz
mv PermAdmissibility-COL-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;