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-177969914200563.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-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.4K Mar 8 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 8 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 8 07:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 8 07:01 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.9K Mar 16 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 16 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 9.5K Mar 8 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 8 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 8 07:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 8 07:01 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 54K 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-02-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779789270071

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-26 09:54:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 09:54:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:54:31] [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:54:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 09:54:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 553 ms
[2026-05-26 09:54:31] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2026-05-26 09:54:32] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 5 ms.
[2026-05-26 09:54:32] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-COL-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 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 12 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).
RANDOM walk for 40003 steps (829 resets) in 747 ms. (53 steps per ms) remains 4/29 properties
BEST_FIRST walk for 40000 steps (632 resets) in 466 ms. (85 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (481 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (502 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (574 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11393996211397816484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5117773681657425877.kers'
[2026-05-26 09:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11393996211397816484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5117773681657425877.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 16 rows 34 cols 75 entries
Finished phase 1 with 1 SingleSign rule and 15 generalized
[2026-05-26 09:54:32] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5117773681657425877.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/29 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 24 constraints, problems are : Problem set: 4 solved, 0 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA PermAdmissibility-COL-02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 09:54:32] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2026-05-26 09:54:32] [INFO ] Flatten gal took : 17 ms
FORMULA PermAdmissibility-COL-02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 09:54:32] [INFO ] Flatten gal took : 4 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:54:32] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 9 ms.
[2026-05-26 09:54:32] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 23 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 16
Applied a total of 4 rules in 13 ms. Remains 36 /40 variables (removed 4) 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-2090645554498727664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9135777595077770809.kers'
[2026-05-26 09:54:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2090645554498727664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9135777595077770809.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 16 rows 34 cols 75 entries
Finished phase 1 with 1 SingleSign rule and 15 generalized
[2026-05-26 09:54:33] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9135777595077770809.kers
Total runtime 0 ms.
[2026-05-26 09:54:33] [INFO ] Implicit Places using invariants in 58 ms returned [11, 19, 24]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 33/40 places, 16/16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) 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-15716253168431241866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13832638608291770082.kers'
[2026-05-26 09:54:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15716253168431241866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13832638608291770082.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 16 rows 31 cols 67 entries
Finished phase 1 with 4 SingleSign rule and 12 generalized
[2026-05-26 09:54:33] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13832638608291770082.kers
Total runtime 0 ms.
[2026-05-26 09:54:33] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-26 09:54:33] [INFO ] Invariant cache hit.
[2026-05-26 09:54:33] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 09:54:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/32 variables, 12/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) 1/33 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/49 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 364 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 33/33 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/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/32 variables, 12/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) 1/33 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/49 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/49 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 65 constraints, problems are : Problem set: 0 solved, 15 unsolved in 471 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 841ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 842ms
Finished structural reductions in LTL mode , in 1 iterations and 936 ms. Remains : 33/33 places, 16/16 transitions.
Support contains 23 out of 33 places after structural reductions.
[2026-05-26 09:54:34] [INFO ] Flatten gal took : 4 ms
[2026-05-26 09:54:34] [INFO ] Flatten gal took : 4 ms
[2026-05-26 09:54:34] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40001 steps (833 resets) in 182 ms. (218 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40001 steps (574 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
[2026-05-26 09:54:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 15/49 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Generalized P Invariants (flows): 2/17 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 33 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33 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 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 74 edges and 33 vertex of which 26 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 13
Applied a total of 3 rules in 10 ms. Remains 24 /33 variables (removed 9) and now considering 13/16 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-219966846758065853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6780087417410593571.kers'
[2026-05-26 09:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-219966846758065853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6780087417410593571.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 24 cols 55 entries
Finished phase 1 with 3 SingleSign rule and 10 generalized
[2026-05-26 09:54:34] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6780087417410593571.kers
Total runtime 0 ms.
[2026-05-26 09:54:34] [INFO ] Implicit Places using invariants in 35 ms returned [2, 4, 8, 10, 11, 13, 14, 20]
[2026-05-26 09:54:34] [INFO ] Actually due to overlaps returned [2, 8, 10, 13, 14, 20]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 36 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/33 places, 13/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 17 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 11
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 16 transition count 10
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 15 transition count 10
Applied a total of 4 rules in 4 ms. Remains 15 /18 variables (removed 3) and now considering 10/13 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9791214327695829544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12533353423536705334.kers'
[2026-05-26 09:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9791214327695829544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12533353423536705334.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 15 cols 32 entries
Finished phase 1 with 5 SingleSign rule and 5 generalized
[2026-05-26 09:54:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12533353423536705334.kers
Total runtime 0 ms.
[2026-05-26 09:54:34] [INFO ] Implicit Places using invariants in 25 ms returned [3, 7]
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 2 : 13/33 places, 10/16 transitions.
Graph (complete) has 16 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (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-18277118139234070518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3410141856601180646.kers'
[2026-05-26 09:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18277118139234070518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3410141856601180646.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 12 cols 24 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-26 09:54:34] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3410141856601180646.kers
Total runtime 0 ms.
[2026-05-26 09:54:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-26 09:54:34] [INFO ] Invariant cache hit.
[2026-05-26 09:54:34] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 12/33 places, 9/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 126 ms. Remains : 12/33 places, 9/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 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-02
Product exploration explored 100000 steps with 5442 reset in 208 ms.
Product exploration explored 100000 steps with 5452 reset in 107 ms.
Computed a total of 12 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 9
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 105 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 142 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLCardinality-02 finished in 837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 74 edges and 33 vertex of which 26 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 24 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 23 transition count 12
Applied a total of 5 rules in 3 ms. Remains 23 /33 variables (removed 10) 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-10254092503913007464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14100837253296982192.kers'
[2026-05-26 09:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10254092503913007464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14100837253296982192.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 23 cols 53 entries
Finished phase 1 with 4 SingleSign rule and 8 generalized
[2026-05-26 09:54:35] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14100837253296982192.kers
Total runtime 2 ms.
[2026-05-26 09:54:35] [INFO ] Implicit Places using invariants in 41 ms returned [2, 4, 8, 10, 11, 12, 13, 17, 18]
[2026-05-26 09:54:35] [INFO ] Actually due to overlaps returned [2, 8, 10, 12, 13, 17]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 42 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/33 places, 12/16 transitions.
Reduce places removed 1 places and 1 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 16 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 14 transition count 9
Applied a total of 3 rules in 4 ms. Remains 14 /17 variables (removed 3) and now considering 9/12 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1820009794929396068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6639049913979266233.kers'
[2026-05-26 09:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1820009794929396068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6639049913979266233.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 14 cols 29 entries
Finished phase 1 with 7 SingleSign rule and 2 generalized
[2026-05-26 09:54:35] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6639049913979266233.kers
Total runtime 1 ms.
[2026-05-26 09:54:35] [INFO ] Implicit Places using invariants in 27 ms returned [3, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/33 places, 9/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 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 6 transition count 4
Applied a total of 8 rules in 2 ms. Remains 6 /11 variables (removed 5) and now considering 4/9 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11880060965826850130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11462941405301965912.kers'
[2026-05-26 09:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11880060965826850130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11462941405301965912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 6 cols 11 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-26 09:54:35] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11462941405301965912.kers
Total runtime 0 ms.
[2026-05-26 09:54:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 09:54:35] [INFO ] Invariant cache hit.
[2026-05-26 09:54:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/33 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 127 ms. Remains : 6/33 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 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-05
Product exploration explored 100000 steps with 15306 reset in 143 ms.
Product exploration explored 100000 steps with 15330 reset in 86 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 43 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 195 ms.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2026-05-26 09:54:36] [INFO ] Invariant cache hit.
[2026-05-26 09:54:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 09:54:36] [INFO ] Invariant cache hit.
[2026-05-26 09:54:36] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-26 09:54:36] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-26 09:54:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 240 ms.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15273 reset in 56 ms.
Product exploration explored 100000 steps with 15298 reset in 48 ms.
Built C files in :
/tmp/ltsmin17549109014868258930
[2026-05-26 09:54:36] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2026-05-26 09:54:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:54:36] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2026-05-26 09:54:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:54:36] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2026-05-26 09:54:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:54:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17549109014868258930
Running compilation step : cd /tmp/ltsmin17549109014868258930;'/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 167 ms.
Running link step : cd /tmp/ltsmin17549109014868258930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17549109014868258930;'/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/stateBased13516772417860613143.hoa' '--buchi-type=spotba'
LTSmin run took 39 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-05 finished in 1696 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 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 74 edges and 33 vertex of which 29 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 27 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 26 transition count 14
Applied a total of 5 rules in 9 ms. Remains 26 /33 variables (removed 7) 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-2137837609504407849.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17154139845124679011.kers'
[2026-05-26 09:54:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2137837609504407849.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17154139845124679011.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 26 cols 60 entries
Finished phase 1 with 3 SingleSign rule and 11 generalized
[2026-05-26 09:54:36] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17154139845124679011.kers
Total runtime 0 ms.
[2026-05-26 09:54:37] [INFO ] Implicit Places using invariants in 38 ms returned [4, 6, 7, 11, 13, 14, 16, 20, 22]
[2026-05-26 09:54:37] [INFO ] Actually due to overlaps returned [4, 7, 11, 13, 16, 20]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 40 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 14/16 transitions.
Graph (complete) has 31 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 19 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 18 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 5 place count 17 transition count 11
Applied a total of 5 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 11/14 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5089363558601069971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13853780207432136820.kers'
[2026-05-26 09:54:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5089363558601069971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13853780207432136820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 17 cols 36 entries
Finished phase 1 with 8 SingleSign rule and 3 generalized
[2026-05-26 09:54:37] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13853780207432136820.kers
Total runtime 0 ms.
[2026-05-26 09:54:37] [INFO ] Implicit Places using invariants in 54 ms returned [4, 8, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/33 places, 11/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 9 transition count 6
Applied a total of 10 rules in 4 ms. Remains 9 /14 variables (removed 5) and now considering 6/11 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10207205084259414572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3552037653108553429.kers'
[2026-05-26 09:54:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10207205084259414572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3552037653108553429.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 9 cols 17 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-05-26 09:54:37] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3552037653108553429.kers
Total runtime 0 ms.
[2026-05-26 09:54:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-26 09:54:37] [INFO ] Invariant cache hit.
[2026-05-26 09:54:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 9/33 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 159 ms. Remains : 9/33 places, 6/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 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-06
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-06 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 28 transition count 16
Applied a total of 5 rules in 2 ms. Remains 28 /33 variables (removed 5) 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-9864046749279645814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12567542877412086464.kers'
[2026-05-26 09:54:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9864046749279645814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12567542877412086464.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 28 cols 64 entries
Finished phase 1 with 5 SingleSign rule and 11 generalized
[2026-05-26 09:54:37] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12567542877412086464.kers
Total runtime 1 ms.
[2026-05-26 09:54:37] [INFO ] Implicit Places using invariants in 50 ms returned [4, 6, 7, 11, 13, 14, 17, 18, 22, 23, 24]
[2026-05-26 09:54:37] [INFO ] Actually due to overlaps returned [4, 7, 11, 13, 17, 18, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 51 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/33 places, 16/16 transitions.
Applied a total of 0 rules in 0 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 53 ms. Remains : 21/33 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(F(p0)))))'
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 63 ms.
Product exploration explored 100000 steps with 25000 reset in 81 ms.
Computed a total of 21 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 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 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 160 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 319 ms.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3853476558169250682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18014960378712049033.kers'
[2026-05-26 09:54:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3853476558169250682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18014960378712049033.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 21 cols 44 entries
Finished phase 1 with 14 SingleSign rule and 2 generalized
[2026-05-26 09:54:38] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18014960378712049033.kers
Total runtime 0 ms.
[2026-05-26 09:54:38] [INFO ] Implicit Places using invariants in 30 ms returned [5, 10, 16, 17]
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 : 17/21 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 17/21 places, 16/16 transitions.
Computed a total of 17 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 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 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 160 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 294 ms.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 39 ms.
Product exploration explored 100000 steps with 25000 reset in 44 ms.
Spot run failed in 75 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/ltsmin5945765223270775863
[2026-05-26 09:54:38] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5945765223270775863
Running compilation step : cd /tmp/ltsmin5945765223270775863;'/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 75 ms.
Running link step : cd /tmp/ltsmin5945765223270775863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5945765223270775863;'/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/stateBased5912468104474795323.hoa' '--buchi-type=spotba'
LTSmin run took 20 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-07 finished in 1890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 74 edges and 33 vertex of which 26 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 24 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 23 transition count 12
Applied a total of 5 rules in 3 ms. Remains 23 /33 variables (removed 10) 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-1627784932339507276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14543215783464217970.kers'
[2026-05-26 09:54:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1627784932339507276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14543215783464217970.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 23 cols 53 entries
Finished phase 1 with 2 SingleSign rule and 10 generalized
[2026-05-26 09:54:39] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14543215783464217970.kers
Total runtime 0 ms.
[2026-05-26 09:54:39] [INFO ] Implicit Places using invariants in 40 ms returned [4, 8, 10, 11, 12, 13, 17, 18, 19]
[2026-05-26 09:54:39] [INFO ] Actually due to overlaps returned [4, 8, 10, 12, 13, 17]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 42 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/33 places, 12/16 transitions.
Reduce places removed 1 places and 1 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 16 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 13 transition count 8
Applied a total of 5 rules in 2 ms. Remains 13 /17 variables (removed 4) and now considering 8/12 (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-10919537471015021387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13113809160931022729.kers'
[2026-05-26 09:54:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10919537471015021387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13113809160931022729.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 13 cols 27 entries
Finished phase 1 with 4 SingleSign rule and 4 generalized
[2026-05-26 09:54:39] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13113809160931022729.kers
Total runtime 0 ms.
[2026-05-26 09:54:39] [INFO ] Implicit Places using invariants in 22 ms returned [7, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 23 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/33 places, 8/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 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 7 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 5 transition count 3
Applied a total of 8 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 3/8 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8490209682689542178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16279879307145504648.kers'
[2026-05-26 09:54:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8490209682689542178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16279879307145504648.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 5 cols 9 entries
Finished phase 1 with 1 SingleSign rule and 2 generalized
[2026-05-26 09:54:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16279879307145504648.kers
Total runtime 0 ms.
[2026-05-26 09:54:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-26 09:54:39] [INFO ] Invariant cache hit.
[2026-05-26 09:54:39] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 5/33 places, 3/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 106 ms. Remains : 5/33 places, 3/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 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-08
Product exploration explored 100000 steps with 19426 reset in 41 ms.
Product exploration explored 100000 steps with 19356 reset in 55 ms.
Computed a total of 5 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 3
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 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 267 ms.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2026-05-26 09:54:39] [INFO ] Invariant cache hit.
[2026-05-26 09:54:39] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 09:54:39] [INFO ] Invariant cache hit.
[2026-05-26 09:54:39] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-26 09:54:39] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-26 09:54:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/8 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/8 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 5/5 places, 3/3 transitions.
Computed a total of 5 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 3
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 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 294 ms.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19418 reset in 45 ms.
Product exploration explored 100000 steps with 19442 reset in 48 ms.
Built C files in :
/tmp/ltsmin18431693459321943053
[2026-05-26 09:54:40] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2026-05-26 09:54:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:54:40] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2026-05-26 09:54:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:54:40] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2026-05-26 09:54:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:54:40] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18431693459321943053
Running compilation step : cd /tmp/ltsmin18431693459321943053;'/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 79 ms.
Running link step : cd /tmp/ltsmin18431693459321943053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18431693459321943053;'/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/stateBased14849472923146922836.hoa' '--buchi-type=spotba'
LTSmin run took 18 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-08 finished in 1529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&X(X(X(X(F(p1)))))) U G(p2)))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 29 transition count 16
Applied a total of 4 rules in 1 ms. Remains 29 /33 variables (removed 4) 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-6635182484883260530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9858507461493179514.kers'
[2026-05-26 09:54:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6635182484883260530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9858507461493179514.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 28 cols 64 entries
Finished phase 1 with 5 SingleSign rule and 11 generalized
[2026-05-26 09:54:40] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9858507461493179514.kers
Total runtime 0 ms.
[2026-05-26 09:54:40] [INFO ] Implicit Places using invariants in 33 ms returned [5, 8, 15, 19, 23, 24, 25]
[2026-05-26 09:54:40] [INFO ] Actually due to overlaps returned [5, 8, 15, 19, 23]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 34 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/33 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 35 ms. Remains : 24/33 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(p0)&&X(X(X(X(F(p1)))))) U G(p2)))'
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-09
Product exploration explored 100000 steps with 19310 reset in 102 ms.
Product exploration explored 100000 steps with 19306 reset in 109 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)...)
Knowledge based reduction with 9 factoid took 194 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 5998 steps (121 resets) in 20 ms. (285 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 313 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 933 ms.
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4954192032142141067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11433682366451532623.kers'
[2026-05-26 09:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4954192032142141067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11433682366451532623.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 23 cols 49 entries
Finished phase 1 with 11 SingleSign rule and 5 generalized
[2026-05-26 09:54:42] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11433682366451532623.kers
Total runtime 0 ms.
[2026-05-26 09:54:42] [INFO ] Implicit Places using invariants in 30 ms returned [19, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 16/16 transitions.
Applied a total of 0 rules in 0 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 32 ms. Remains : 22/24 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 9 factoid took 204 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 4592 steps (92 resets) in 14 ms. (306 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 288 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 905 ms.
Stuttering acceptance computed with spot in 376 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 379 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 19354 reset in 66 ms.
Stuttering criterion allowed to conclude after 52568 steps with 10181 reset in 32 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-09 finished in 3814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)||X(p2)))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 28 transition count 16
Applied a total of 5 rules in 0 ms. Remains 28 /33 variables (removed 5) 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-13566269465829417423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13357893548628237105.kers'
[2026-05-26 09:54:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13566269465829417423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13357893548628237105.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 28 cols 64 entries
Finished phase 1 with 7 SingleSign rule and 9 generalized
[2026-05-26 09:54:44] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13357893548628237105.kers
Total runtime 0 ms.
[2026-05-26 09:54:44] [INFO ] Implicit Places using invariants in 39 ms returned [4, 6, 11, 13, 14, 17, 22]
[2026-05-26 09:54:44] [INFO ] Actually due to overlaps returned [4, 11, 13, 17, 22]
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 : 23/33 places, 16/16 transitions.
Applied a total of 0 rules in 0 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 40 ms. Remains : 23/33 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(p0)||G(p1)||X(p2)))'
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 62 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)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 15 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 42 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLCardinality-10 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0&&F(G(p0))) U X((p1&&F(p2))))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 16
Applied a total of 6 rules in 1 ms. Remains 27 /33 variables (removed 6) 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-16463097150548592048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17592977607259688398.kers'
[2026-05-26 09:54:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16463097150548592048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17592977607259688398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 27 cols 63 entries
Finished phase 1 with 6 SingleSign rule and 10 generalized
[2026-05-26 09:54:44] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17592977607259688398.kers
Total runtime 0 ms.
[2026-05-26 09:54:44] [INFO ] Implicit Places using invariants in 40 ms returned [5, 6, 10, 12, 17, 21, 22, 23]
[2026-05-26 09:54:44] [INFO ] Actually due to overlaps returned [5, 6, 10, 12, 17, 21]
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 : 21/33 places, 16/16 transitions.
Applied a total of 0 rules in 0 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 42 ms. Remains : 21/33 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(G(((p0&&F(G(p0))) U X((p1&&F(p2))))))))'
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 148 steps with 32 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-11 finished in 406 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||X((G((!p0||X(p1)))||X(X(!p1)))))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 16
Applied a total of 6 rules in 1 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:54:45] [INFO ] Invariant cache hit.
[2026-05-26 09:54:45] [INFO ] Implicit Places using invariants in 40 ms returned [3, 5, 6, 10, 12, 16, 17, 21, 22, 23]
[2026-05-26 09:54:45] [INFO ] Actually due to overlaps returned [3, 6, 10, 12, 16, 17, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 41 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/33 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 20/33 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||X((G((!p0||X(p1)))||X(X(!p1)))))))'
Stuttering acceptance computed with spot in 345 ms :[false, false, false, false, false, p1, true, (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 284 steps with 13 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-13 finished in 415 ms.
All properties solved by simple procedures.
Total runtime 14492 ms.

BK_STOP 1779789286055

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914200563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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