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.r098-tall-177955695800852.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 DoubleExponent-PT-001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800852
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779675618600

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 02:20:19] [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-25 02:20:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:20:19] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2026-05-25 02:20:19] [INFO ] Transformed 57 places.
[2026-05-25 02:20:19] [INFO ] Transformed 48 transitions.
[2026-05-25 02:20:19] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-001-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 16 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (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-12891362400502240589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14318555790055678124.kers'
[2026-05-25 02:20:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12891362400502240589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14318555790055678124.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:20:20] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14318555790055678124.kers
Total runtime 1 ms.
[2026-05-25 02:20:20] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-25 02:20:20] [INFO ] Invariant cache hit.
[2026-05-25 02:20:20] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2026-05-25 02:20:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/101 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 63 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1686 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/101 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 47/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 113 constraints, problems are : Problem set: 0 solved, 47 unsolved in 4020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5736ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 5753ms
Starting structural reductions in LTL mode, iteration 1 : 53/57 places, 48/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6084 ms. Remains : 53/57 places, 48/48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2026-05-25 02:20:26] [INFO ] Invariant cache hit.
[2026-05-25 02:20:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 02:20:26] [INFO ] Invariant cache hit.
[2026-05-25 02:20:26] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 53/53 places, 48/48 transitions.
Support contains 27 out of 53 places after structural reductions.
[2026-05-25 02:20:26] [INFO ] Flatten gal took : 19 ms
[2026-05-25 02:20:26] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:20:26] [INFO ] Input system was already deterministic with 48 transitions.
Reduction of identical properties reduced properties to check from 23 to 20
RANDOM walk for 40000 steps (1322 resets) in 794 ms. (50 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40001 steps (1136 resets) in 594 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1115 resets) in 179 ms. (222 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (1153 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
[2026-05-25 02:20:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/44 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 44/89 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/98 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 101/101 variables, and 61 constraints, problems are : Problem set: 2 solved, 0 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 165ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DoubleExponent-PT-001-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DoubleExponent-PT-001-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 82 edges and 53 vertex of which 51 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0))) U (p1||X(F((p1&&F((!p2||G(p3))))))))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2026-05-25 02:20:28] [INFO ] Invariant cache hit.
[2026-05-25 02:20:28] [INFO ] Implicit Places using invariants in 30 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 5 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (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-9519304755701002435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6683145911793571735.kers'
[2026-05-25 02:20:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9519304755701002435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6683145911793571735.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 123 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:20:28] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6683145911793571735.kers
Total runtime 0 ms.
[2026-05-25 02:20:28] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 02:20:28] [INFO ] Invariant cache hit.
[2026-05-25 02:20:28] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 50/53 places, 47/48 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0))) U (p1||X(F((p1&&F((!p2||G(p3))))))))))'
Stuttering acceptance computed with spot in 516 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND p2 (NOT p0) (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND p2 (NOT p0) (NOT p3)), (OR (NOT p1) (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-01
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 4 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-01 finished in 775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (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-8626755642685389064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15016043982378364652.kers'
[2026-05-25 02:20:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8626755642685389064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15016043982378364652.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:20:28] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15016043982378364652.kers
Total runtime 0 ms.
[2026-05-25 02:20:28] [INFO ] Implicit Places using invariants in 42 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 4 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (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-6313628958970446601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13512845832051100001.kers'
[2026-05-25 02:20:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6313628958970446601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13512845832051100001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 123 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:20:28] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13512845832051100001.kers
Total runtime 0 ms.
[2026-05-25 02:20:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 02:20:28] [INFO ] Invariant cache hit.
[2026-05-25 02:20:29] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 50/53 places, 47/48 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-04
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-04 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(X(p0)))&&(p1||F(p2))))||X(G(!p2))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (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-18144551998283062316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9569493379715095534.kers'
[2026-05-25 02:20:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18144551998283062316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9569493379715095534.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:20:29] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9569493379715095534.kers
Total runtime 0 ms.
[2026-05-25 02:20:29] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 52/53 places, 48/48 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(X(p0)))&&(p1||F(p2))))||X(G(!p2))))'
Stuttering acceptance computed with spot in 614 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-05
Product exploration explored 100000 steps with 3382 reset in 185 ms.
Product exploration explored 100000 steps with 3416 reset in 139 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 79 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 14 states, 27 edges and 3 AP (stutter sensitive) to 13 states, 23 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1337 resets) in 459 ms. (86 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40000 steps (1156 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1154 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1149 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1696976616548093152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10351478401906688418.kers'
[2026-05-25 02:20:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1696976616548093152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10351478401906688418.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 52 cols 128 entries
Finished phase 1 with 44 SingleSign rule and 3 generalized
[2026-05-25 02:20:30] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10351478401906688418.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/36 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 37/73 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 18/91 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/95 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/95 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/99 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/100 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/100 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 57 constraints, problems are : Problem set: 0 solved, 3 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/36 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 37/73 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/91 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/95 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/95 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/99 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/100 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/100 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 62 constraints, problems are : Problem set: 0 solved, 3 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 133 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 52 transition count 40
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 44 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 42 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 42 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 39 transition count 35
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 29 transition count 25
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 29 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 52 place count 26 transition count 22
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 26 transition count 22
Applied a total of 53 rules in 15 ms. Remains 26 /52 variables (removed 26) and now considering 22/48 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 26/52 places, 22/48 transitions.
RANDOM walk for 7874 steps (813 resets) in 80 ms. (97 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 13 states, 23 edges and 3 AP (stutter sensitive) to 13 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 550 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1704 ms.
Stuttering acceptance computed with spot in 606 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2026-05-25 02:20:32] [INFO ] Invariant cache hit.
[2026-05-25 02:20:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 02:20:32] [INFO ] Invariant cache hit.
[2026-05-25 02:20:32] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2026-05-25 02:20:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 48/100 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 61 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 48/100 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/100 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 110 constraints, problems are : Problem set: 0 solved, 47 unsolved in 4188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5449ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 5449ms
Finished structural reductions in LTL mode , in 1 iterations and 5545 ms. Remains : 52/52 places, 48/48 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 79 edges and 52 vertex of which 50 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 13 states, 23 edges and 3 AP (stutter sensitive) to 13 states, 23 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1324 resets) in 123 ms. (322 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40000 steps (1135 resets) in 117 ms. (338 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1162 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1145 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
[2026-05-25 02:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/36 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 37/73 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 18/91 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/95 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/95 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/99 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/100 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/100 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 57 constraints, problems are : Problem set: 0 solved, 3 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/36 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 37/73 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/91 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/95 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/95 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/99 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/100 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/100 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 62 constraints, problems are : Problem set: 0 solved, 3 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 52 transition count 40
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 44 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 42 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 42 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 39 transition count 35
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 29 transition count 25
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 29 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 52 place count 26 transition count 22
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 26 transition count 22
Applied a total of 53 rules in 7 ms. Remains 26 /52 variables (removed 26) and now considering 22/48 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 26/52 places, 22/48 transitions.
RANDOM walk for 24118 steps (2562 resets) in 77 ms. (309 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 13 states, 23 edges and 3 AP (stutter sensitive) to 13 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 541 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1561 ms.
Stuttering acceptance computed with spot in 584 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 595 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3386 reset in 92 ms.
Product exploration explored 100000 steps with 3387 reset in 94 ms.
Spot run failed in 706 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/ltsmin17688985060756855661
[2026-05-25 02:20:41] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17688985060756855661
Running compilation step : cd /tmp/ltsmin17688985060756855661;'/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 248 ms.
Running link step : cd /tmp/ltsmin17688985060756855661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17688985060756855661;'/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/stateBased8994729899637487201.hoa' '--buchi-type=spotba'
LTSmin run took 54 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-001-LTLFireability-05 finished in 12954 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))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (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-2769266364037503140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4723292104980689364.kers'
[2026-05-25 02:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2769266364037503140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4723292104980689364.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:20:42] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4723292104980689364.kers
Total runtime 1 ms.
[2026-05-25 02:20:42] [INFO ] Implicit Places using invariants in 50 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 2 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (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-4296873387652866196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3218115637889813640.kers'
[2026-05-25 02:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4296873387652866196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3218115637889813640.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 51 cols 126 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:20:42] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3218115637889813640.kers
Total runtime 1 ms.
[2026-05-25 02:20:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 02:20:42] [INFO ] Invariant cache hit.
[2026-05-25 02:20:42] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 51/53 places, 47/48 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))))'
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1019 steps with 35 reset in 5 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-06 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(!p0)&&F(!p1))))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (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-5290216663666257053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18443133054217755031.kers'
[2026-05-25 02:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5290216663666257053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18443133054217755031.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:20:42] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18443133054217755031.kers
Total runtime 0 ms.
[2026-05-25 02:20:42] [INFO ] Implicit Places using invariants in 47 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 52/53 places, 48/48 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&F(p1))))))'
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-07
Stuttering criterion allowed to conclude after 52 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-07 finished in 296 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 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 53 transition count 39
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 44 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 43 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 43 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 40 transition count 35
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 48 place count 29 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 29 transition count 24
Applied a total of 49 rules in 15 ms. Remains 29 /53 variables (removed 24) and now considering 24/48 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13416419933546334408.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4240878486033247718.kers'
[2026-05-25 02:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13416419933546334408.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4240878486033247718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 29 cols 88 entries
Finished phase 1 with 18 SingleSign rule and 5 generalized
[2026-05-25 02:20:42] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4240878486033247718.kers
Total runtime 1 ms.
[2026-05-25 02:20:42] [INFO ] Implicit Places using invariants in 33 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/53 places, 24/48 transitions.
Graph (complete) has 65 edges and 27 vertex of which 26 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 23 transition count 20
Applied a total of 7 rules in 3 ms. Remains 23 /27 variables (removed 4) and now considering 20/24 (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-6953131228176760285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13895597135403832627.kers'
[2026-05-25 02:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6953131228176760285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13895597135403832627.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 23 cols 72 entries
Finished phase 1 with 15 SingleSign rule and 4 generalized
[2026-05-25 02:20:42] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13895597135403832627.kers
Total runtime 0 ms.
[2026-05-25 02:20:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 02:20:42] [INFO ] Invariant cache hit.
[2026-05-25 02:20:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 02:20:42] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/53 places, 20/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 23/53 places, 20/48 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 38 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-10
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-10 finished in 182 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 (F(G(p0))&&p1)))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 52 transition count 37
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 42 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 42 transition count 35
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 24 place count 40 transition count 35
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 46 place count 29 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 28 transition count 23
Applied a total of 47 rules in 14 ms. Remains 28 /53 variables (removed 25) and now considering 23/48 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13000026720078354201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-839466509841850117.kers'
[2026-05-25 02:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13000026720078354201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-839466509841850117.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 23 rows 26 cols 70 entries
Finished phase 1 with 19 SingleSign rule and 3 generalized
[2026-05-25 02:20:43] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-839466509841850117.kers
Total runtime 0 ms.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants in 37 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/53 places, 23/48 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 27 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 22
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 4 place count 25 transition count 21
Applied a total of 4 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 21/23 (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-490777384699702475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8395274370596593467.kers'
[2026-05-25 02:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-490777384699702475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8395274370596593467.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 21 rows 23 cols 63 entries
Finished phase 1 with 17 SingleSign rule and 3 generalized
[2026-05-25 02:20:43] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8395274370596593467.kers
Total runtime 0 ms.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 02:20:43] [INFO ] Invariant cache hit.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/53 places, 21/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 25/53 places, 21/48 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 (F(G(p0))&&p1)))))'
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-11
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-11 finished in 258 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 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 52 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 41 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 41 transition count 34
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 26 place count 39 transition count 34
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 27 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 26 transition count 21
Applied a total of 51 rules in 12 ms. Remains 26 /53 variables (removed 27) and now considering 21/48 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8981675445312651033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12204959062469072218.kers'
[2026-05-25 02:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8981675445312651033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12204959062469072218.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 21 rows 24 cols 68 entries
Finished phase 1 with 16 SingleSign rule and 4 generalized
[2026-05-25 02:20:43] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12204959062469072218.kers
Total runtime 0 ms.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants in 34 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/53 places, 21/48 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 25 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 20
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 4 place count 23 transition count 19
Applied a total of 4 rules in 4 ms. Remains 23 /25 variables (removed 2) and now considering 19/21 (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-15747002192573975448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10959919196387122376.kers'
[2026-05-25 02:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15747002192573975448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10959919196387122376.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 19 rows 21 cols 60 entries
Finished phase 1 with 15 SingleSign rule and 3 generalized
[2026-05-25 02:20:43] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10959919196387122376.kers
Total runtime 0 ms.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 02:20:43] [INFO ] Invariant cache hit.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/53 places, 19/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 23/53 places, 19/48 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 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-12
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-12 finished in 223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U (G(!p2)&&F(p3))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (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-2363638720049802115.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13254887358286272206.kers'
[2026-05-25 02:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2363638720049802115.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13254887358286272206.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:20:43] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13254887358286272206.kers
Total runtime 0 ms.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants in 50 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 2 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (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-5512328943381728240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1260662905024602037.kers'
[2026-05-25 02:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5512328943381728240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1260662905024602037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 51 cols 126 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:20:43] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1260662905024602037.kers
Total runtime 1 ms.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 02:20:43] [INFO ] Invariant cache hit.
[2026-05-25 02:20:43] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 51/53 places, 47/48 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U (G(!p2)&&F(p3))))'
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p3) p2), (NOT p1), (AND p2 (NOT p1)), p2, (NOT p3), (NOT p1), true, p2]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-13
Stuttering criterion allowed to conclude after 47 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-13 finished in 492 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(F(!(X(p0) U G((G(p1) U (p0 U p2)))))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (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-16119500229185955868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-463989987680869638.kers'
[2026-05-25 02:20:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16119500229185955868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-463989987680869638.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:20:44] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-463989987680869638.kers
Total runtime 0 ms.
[2026-05-25 02:20:44] [INFO ] Implicit Places using invariants in 34 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (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-6737692103754288510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6119052826122182688.kers'
[2026-05-25 02:20:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6737692103754288510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6119052826122182688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 123 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:20:44] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6119052826122182688.kers
Total runtime 0 ms.
[2026-05-25 02:20:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 02:20:44] [INFO ] Invariant cache hit.
[2026-05-25 02:20:44] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 50/53 places, 47/48 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(F(!(X(p0) U G((G(p1) U (p0 U p2)))))))'
Stuttering acceptance computed with spot in 215 ms :[p2, p2, (AND p0 p2), p2, (AND p2 p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 76 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 18 ms. Proved property starting from automaton with 5 states, 15 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-001-LTLFireability-14 finished in 578 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)) U !p1)&&X(X(X(X(X(F(p1))))))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (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-5448227899893051740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-220891975616956859.kers'
[2026-05-25 02:20:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5448227899893051740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-220891975616956859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:20:44] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-220891975616956859.kers
Total runtime 0 ms.
[2026-05-25 02:20:44] [INFO ] Implicit Places using invariants in 33 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/53 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 7 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (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-13614461596947102190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8499531799926179302.kers'
[2026-05-25 02:20:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13614461596947102190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8499531799926179302.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 123 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:20:44] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8499531799926179302.kers
Total runtime 0 ms.
[2026-05-25 02:20:44] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 02:20:44] [INFO ] Invariant cache hit.
[2026-05-25 02:20:44] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 50/53 places, 47/48 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)) U !p1)&&X(X(X(X(X(F(p1))))))))'
Stuttering acceptance computed with spot in 396 ms :[true, p0, p0, p1, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-001-LTLFireability-15
Stuttering criterion allowed to conclude after 248 steps with 11 reset in 1 ms.
FORMULA DoubleExponent-PT-001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLFireability-15 finished in 550 ms.
All properties solved by simple procedures.
Total runtime 25397 ms.

BK_STOP 1779675645174

--------------------
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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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 r098-tall-177955695800852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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