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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.8K Mar 8 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 8 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 8 07:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 8 07:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 16 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 16 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 16 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 8 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 8 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 8 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 8 07:02 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-05-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779789330844

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-26 09:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 09:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:55:32] [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:55:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 09:55:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 549 ms
[2026-05-26 09:55:32] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2026-05-26 09:55:32] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 4 ms.
[2026-05-26 09:55:32] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-COL-05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-15 TRUE 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).
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 320 steps (0 resets) in 19 ms. (16 steps per ms) remains 0/13 properties
[2026-05-26 09:55:32] [INFO ] Flatten gal took : 17 ms
[2026-05-26 09:55: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:55:32] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 11 ms.
[2026-05-26 09:55:32] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 28 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 11 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16604223841833305012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2033999150864223904.kers'
[2026-05-26 09:55:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16604223841833305012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2033999150864223904.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:55:32] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2033999150864223904.kers
Total runtime 1 ms.
[2026-05-26 09:55:33] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-26 09:55:33] [INFO ] Invariant cache hit.
[2026-05-26 09:55:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 09:55:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 391 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 63 constraints, problems are : Problem set: 0 solved, 15 unsolved in 404 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 813ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 822ms
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1048 ms. Remains : 32/40 places, 16/16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:55:33] [INFO ] Invariant cache hit.
[2026-05-26 09:55:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-26 09:55:33] [INFO ] Invariant cache hit.
[2026-05-26 09:55:34] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 32/32 places, 16/16 transitions.
Support contains 28 out of 32 places after structural reductions.
[2026-05-26 09:55:34] [INFO ] Flatten gal took : 4 ms
[2026-05-26 09:55:34] [INFO ] Flatten gal took : 3 ms
[2026-05-26 09:55:34] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 330 steps (0 resets) in 11 ms. (27 steps per ms) remains 0/13 properties
FORMULA PermAdmissibility-COL-05-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7952066670309040360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16880284547158335183.kers'
[2026-05-26 09:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7952066670309040360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16880284547158335183.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:55:34] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16880284547158335183.kers
Total runtime 1 ms.
[2026-05-26 09:55:34] [INFO ] Implicit Places using invariants in 42 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 23, 25]
[2026-05-26 09:55:34] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 16, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 45 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 23/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Stuttering acceptance computed with spot in 333 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-02 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0&&F((G(F(!p0))||(!p1&&F(!p0)))))) U (p2 U X(p3))))'
Support contains 10 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:55:34] [INFO ] Invariant cache hit.
[2026-05-26 09:55:34] [INFO ] Implicit Places using invariants in 38 ms returned [5, 7, 12, 13, 16, 18, 22, 26]
[2026-05-26 09:55:34] [INFO ] Actually due to overlaps returned [5, 12, 13, 16, 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 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 25/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0&&F((G(F(!p0))||(!p1&&F(!p0)))))) U (p2 U X(p3))))'
Stuttering acceptance computed with spot in 536 ms :[(NOT p3), (AND p0 (NOT p3)), (NOT p3), (AND p0 p2 (NOT p3)), true, p0, p0, (AND (NOT p3) (NOT p0)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND p0 (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-03
Entered a terminal (fully accepting) state of product in 777 steps with 258 reset in 18 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-03 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (!p1 U G(p0)))&&X((G(p2) U p3))))'
Support contains 10 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13894868568403673992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4116519678237418783.kers'
[2026-05-26 09:55:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13894868568403673992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4116519678237418783.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:55:35] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4116519678237418783.kers
Total runtime 0 ms.
[2026-05-26 09:55:35] [INFO ] Implicit Places using invariants in 36 ms returned [4, 6, 12, 15, 16, 23, 24, 26, 27]
[2026-05-26 09:55:35] [INFO ] Actually due to overlaps returned [4, 12, 15, 23, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 37 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 26/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (!p1 U G(p0)))&&X((G(p2) U p3))))'
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p3)), true, (NOT p0), (NOT p3), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-04 finished in 322 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((!p1 U (!p0||G(!p1))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8742815494428812303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17528003397503837186.kers'
[2026-05-26 09:55:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8742815494428812303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17528003397503837186.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:55:35] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17528003397503837186.kers
Total runtime 0 ms.
[2026-05-26 09:55:35] [INFO ] Implicit Places using invariants in 52 ms returned [4, 5, 6, 7, 14, 17, 19, 23, 24, 26, 27]
[2026-05-26 09:55:35] [INFO ] Actually due to overlaps returned [4, 5, 14, 17, 23, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 56 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 25/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((!p1 U (!p0||G(!p1))))))'
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1), true]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-05
Entered a terminal (fully accepting) state of product in 24 steps with 5 reset in 1 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-05 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 16 ms. Remains 11 /32 variables (removed 21) and now considering 6/16 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9221554717779800994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6894688023740840713.kers'
[2026-05-26 09:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9221554717779800994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6894688023740840713.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 6 rows 10 cols 21 entries
Finished phase 1 with 3 SingleSign rule and 3 generalized
[2026-05-26 09:55:36] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6894688023740840713.kers
Total runtime 0 ms.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 30 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/32 places, 6/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 5
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 9 transition count 5
Applied a total of 2 rules in 3 ms. Remains 9 /10 variables (removed 1) and now considering 5/6 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17039754336009075919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9593598258419914005.kers'
[2026-05-26 09:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17039754336009075919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9593598258419914005.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 5 rows 8 cols 17 entries
Finished phase 1 with 3 SingleSign rule and 2 generalized
[2026-05-26 09:55:36] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9593598258419914005.kers
Total runtime 0 ms.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 09:55:36] [INFO ] Invariant cache hit.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 9/32 places, 5/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-07
Stuttering criterion allowed to conclude after 162 steps with 16 reset in 1 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-07 finished in 177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17797779104412575134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16143727633382179984.kers'
[2026-05-26 09:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17797779104412575134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16143727633382179984.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 14 cols 31 entries
Finished phase 1 with 3 SingleSign rule and 5 generalized
[2026-05-26 09:55:36] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16143727633382179984.kers
Total runtime 0 ms.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 33 ms returned [4, 5, 8, 10]
[2026-05-26 09:55:36] [INFO ] Actually due to overlaps returned [4, 5, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/32 places, 8/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 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 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 6
Applied a total of 2 rules in 5 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (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-978677621225940562.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17756048754574977707.kers'
[2026-05-26 09:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-978677621225940562.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17756048754574977707.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 9 cols 19 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-05-26 09:55:36] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17756048754574977707.kers
Total runtime 0 ms.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/32 places, 6/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13683961688380846955.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9756889539167383247.kers'
[2026-05-26 09:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13683961688380846955.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9756889539167383247.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 7 cols 15 entries
Finished phase 1 with 4 SingleSign rule and 1 generalized
[2026-05-26 09:55:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9756889539167383247.kers
Total runtime 0 ms.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-26 09:55:36] [INFO ] Invariant cache hit.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 104 ms. Remains : 7/32 places, 5/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-08
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-08 finished in 170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2420514434777304448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10595624610537210976.kers'
[2026-05-26 09:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2420514434777304448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10595624610537210976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:55:36] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10595624610537210976.kers
Total runtime 0 ms.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 63 ms returned [4, 6, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
[2026-05-26 09:55:36] [INFO ] Actually due to overlaps returned [4, 12, 13, 14, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 65 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/32 places, 16/16 transitions.
Applied a total of 0 rules in 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 67 ms. Remains : 23/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-09 finished in 171 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))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:55:36] [INFO ] Invariant cache hit.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 44 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 23, 25]
[2026-05-26 09:55:36] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 16, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 45 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 16/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 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 14
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 21 transition count 13
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 20 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 19 transition count 12
Applied a total of 5 rules in 3 ms. Remains 19 /23 variables (removed 4) 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-18241081685750458747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7591520300700397091.kers'
[2026-05-26 09:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18241081685750458747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7591520300700397091.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 19 cols 42 entries
Finished phase 1 with 6 SingleSign rule and 6 generalized
[2026-05-26 09:55:36] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7591520300700397091.kers
Total runtime 0 ms.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 30 ms returned [4, 5, 7, 8, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 31 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 12/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 7 transition count 5
Applied a total of 12 rules in 3 ms. Remains 7 /14 variables (removed 7) and now considering 5/12 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3727604233109751138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8000701354461755603.kers'
[2026-05-26 09:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3727604233109751138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8000701354461755603.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 7 cols 15 entries
Finished phase 1 with 4 SingleSign rule and 1 generalized
[2026-05-26 09:55:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8000701354461755603.kers
Total runtime 0 ms.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-26 09:55:36] [INFO ] Invariant cache hit.
[2026-05-26 09:55:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 129 ms. Remains : 7/32 places, 5/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-10
Product exploration explored 100000 steps with 15738 reset in 181 ms.
Product exploration explored 100000 steps with 15728 reset in 124 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
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 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 52 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 56 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2026-05-26 09:55:37] [INFO ] Invariant cache hit.
[2026-05-26 09:55:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-26 09:55:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 09:55:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:55:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-26 09:55:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-26 09:55:37] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 09:55:37] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 280 ms.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2026-05-26 09:55:37] [INFO ] Invariant cache hit.
[2026-05-26 09:55:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-26 09:55:37] [INFO ] Invariant cache hit.
[2026-05-26 09:55:37] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-26 09:55:37] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-26 09:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/12 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
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 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 52 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2026-05-26 09:55:37] [INFO ] Invariant cache hit.
[2026-05-26 09:55:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-26 09:55:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-26 09:55:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:55:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-26 09:55:37] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2026-05-26 09:55:37] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 09:55:37] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 236 ms.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15749 reset in 143 ms.
Product exploration explored 100000 steps with 15768 reset in 100 ms.
Built C files in :
/tmp/ltsmin18131490531337161701
[2026-05-26 09:55:38] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2026-05-26 09:55:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:55:38] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2026-05-26 09:55:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:55:38] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2026-05-26 09:55:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 09:55:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18131490531337161701
Running compilation step : cd /tmp/ltsmin18131490531337161701;'/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 177 ms.
Running link step : cd /tmp/ltsmin18131490531337161701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18131490531337161701;'/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/stateBased12199654324904255414.hoa' '--buchi-type=spotba'
LTSmin run took 35 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLFireability-10 finished in 1818 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 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-790514374206458128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7369297766305957112.kers'
[2026-05-26 09:55:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-790514374206458128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7369297766305957112.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:55:38] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7369297766305957112.kers
Total runtime 1 ms.
[2026-05-26 09:55:38] [INFO ] Implicit Places using invariants in 44 ms returned [4, 5, 6, 7, 12, 15, 16, 17, 19, 23, 24, 26, 27]
[2026-05-26 09:55:38] [INFO ] Actually due to overlaps returned [4, 5, 12, 15, 17, 23, 24]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 46 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 24/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-11
Product exploration explored 100000 steps with 17788 reset in 151 ms.
Product exploration explored 100000 steps with 17729 reset in 69 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 2 factoid took 46 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 28 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 58 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 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9258956668346461409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17540883288121666981.kers'
[2026-05-26 09:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9258956668346461409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17540883288121666981.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 23 cols 51 entries
Finished phase 1 with 11 SingleSign rule and 5 generalized
[2026-05-26 09:55:39] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17540883288121666981.kers
Total runtime 1 ms.
[2026-05-26 09:55:39] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2026-05-26 09:55:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-26 09:55:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:55:39] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-26 09:55:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 09:55:39] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-26 09:55:39] [INFO ] Added : 15 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 375 ms.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 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 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:55:39] [INFO ] Invariant cache hit.
[2026-05-26 09:55:39] [INFO ] Implicit Places using invariants in 37 ms returned [4, 5, 12, 14, 19, 20]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 39 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/24 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 18/24 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 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 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 63 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 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-847088143247063915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15705902154800995208.kers'
[2026-05-26 09:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-847088143247063915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15705902154800995208.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 17 cols 33 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-26 09:55:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15705902154800995208.kers
Total runtime 0 ms.
[2026-05-26 09:55:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-26 09:55:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 09:55:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 09:55:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-26 09:55:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-26 09:55:39] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 09:55:39] [INFO ] Added : 15 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 394 ms.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17595 reset in 49 ms.
Product exploration explored 100000 steps with 17628 reset in 54 ms.
Spot run failed in 70 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/ltsmin14216354254733278906
[2026-05-26 09:55:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14216354254733278906
Running compilation step : cd /tmp/ltsmin14216354254733278906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin14216354254733278906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14216354254733278906;'/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/stateBased12422998348354784282.hoa' '--buchi-type=spotba'
LTSmin run took 18 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLFireability-11 finished in 2066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 22 /32 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-4866534597950078841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16244144506309733374.kers'
[2026-05-26 09:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4866534597950078841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16244144506309733374.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 22 cols 51 entries
Finished phase 1 with 3 SingleSign rule and 9 generalized
[2026-05-26 09:55:40] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16244144506309733374.kers
Total runtime 0 ms.
[2026-05-26 09:55:40] [INFO ] Implicit Places using invariants in 35 ms returned [4, 6, 12, 13, 14, 15, 16, 18]
[2026-05-26 09:55:40] [INFO ] Actually due to overlaps returned [4, 12, 13, 14, 16]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/32 places, 12/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 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 10
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 15 transition count 9
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 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 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-4827111868353480987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15666687042062738747.kers'
[2026-05-26 09:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4827111868353480987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15666687042062738747.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 13 cols 28 entries
Finished phase 1 with 4 SingleSign rule and 4 generalized
[2026-05-26 09:55:40] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15666687042062738747.kers
Total runtime 1 ms.
[2026-05-26 09:55:40] [INFO ] Implicit Places using invariants in 25 ms returned [5, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/32 places, 8/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 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
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 6 place count 6 transition count 4
Applied a total of 6 rules in 1 ms. Remains 6 /10 variables (removed 4) and now considering 4/8 (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-17945697905731885296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8218478348458495836.kers'
[2026-05-26 09:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17945697905731885296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8218478348458495836.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 6 cols 13 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-05-26 09:55:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8218478348458495836.kers
Total runtime 0 ms.
[2026-05-26 09:55:40] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-26 09:55:40] [INFO ] Invariant cache hit.
[2026-05-26 09:55:40] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 106 ms. Remains : 6/32 places, 4/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-12
Product exploration explored 100000 steps with 7992 reset in 96 ms.
Product exploration explored 100000 steps with 8030 reset in 96 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)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 16 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 47 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLFireability-12 finished in 453 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||(!p1 U (p2 U X(X(X(!p2)))))))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7750154438564379114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17541851676633341973.kers'
[2026-05-26 09:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7750154438564379114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17541851676633341973.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 71 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:55:40] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17541851676633341973.kers
Total runtime 0 ms.
[2026-05-26 09:55:40] [INFO ] Implicit Places using invariants in 34 ms returned [5, 7, 12, 13, 16, 18, 22, 26]
[2026-05-26 09:55:40] [INFO ] Actually due to overlaps returned [5, 12, 13, 16, 22]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 25/32 places, 16/16 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0 U (p1 U X(X(X(!p1)))))||p2))))'
Stuttering acceptance computed with spot in 706 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-14
Product exploration explored 100000 steps with 19843 reset in 80 ms.
Product exploration explored 100000 steps with 19905 reset in 196 ms.
Computed a total of 25 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 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 26 factoid took 19 ms. Proved property starting from automaton with 15 states, 52 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 41 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLFireability-14 finished in 1117 ms.
All properties solved by simple procedures.
Total runtime 10050 ms.

BK_STOP 1779789342311

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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