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.r146-tall-177961074100268.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 GPPP-PT-C0001N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.4K Mar 7 11:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 7 11:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 7 11:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 11:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 17 09:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 17 09:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 17 09:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 17 09:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 11:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 11:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 11:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 7 11:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 17 09:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 17 09:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000001000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779709313125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000001000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 11:41:54] [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 11:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:41:54] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2026-05-25 11:41:54] [INFO ] Transformed 33 places.
[2026-05-25 11:41:54] [INFO ] Transformed 22 transitions.
[2026-05-25 11:41:54] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 119 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 5 formulas.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15449239592058671012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16877772227762848788.kers'
[2026-05-25 11:41:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15449239592058671012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16877772227762848788.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:41:54] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16877772227762848788.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1870ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1885ms
[2026-05-25 11:41:56] [INFO ] Invariant cache hit.
[2026-05-25 11:41:56] [INFO ] Implicit Places using invariants in 47 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2010 ms. Remains : 32/33 places, 22/22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12623931209814363822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11167309112532648749.kers'
[2026-05-25 11:41:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12623931209814363822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11167309112532648749.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:41:56] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11167309112532648749.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 44 constraints, problems are : Problem set: 0 solved, 21 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1351ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1351ms
[2026-05-25 11:41:57] [INFO ] Invariant cache hit.
[2026-05-25 11:41:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 11:41:57] [INFO ] Invariant cache hit.
[2026-05-25 11:41:57] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1431 ms. Remains : 32/32 places, 22/22 transitions.
Support contains 24 out of 32 places after structural reductions.
[2026-05-25 11:41:58] [INFO ] Flatten gal took : 16 ms
[2026-05-25 11:41:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 11:41:58] [INFO ] Input system was already deterministic with 22 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 8844 steps (2 resets) in 153 ms. (57 steps per ms) remains 0/18 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(F((p0&&X(p1))))))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:41:59] [INFO ] Invariant cache hit.
[2026-05-25 11:41:59] [INFO ] Implicit Places using invariants in 43 ms returned [0, 1, 2]
[2026-05-25 11:41:59] [INFO ] Actually due to overlaps returned [1, 0]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 30/32 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(F((p0&&X(p1))))))))))'
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-02
Product exploration explored 100000 steps with 1730 reset in 288 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-02 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 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 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
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 30 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 27 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 25 transition count 17
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 14 place count 24 transition count 16
Applied a total of 14 rules in 24 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
Running 15 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17600469459025212137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15103941185068461981.kers'
[2026-05-25 11:42:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17600469459025212137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15103941185068461981.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 16 rows 20 cols 54 entries
Finished phase 1 with 10 SingleSign rule and 4 generalized
[2026-05-25 11:42:00] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15103941185068461981.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/40 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 34 constraints, problems are : Problem set: 0 solved, 15 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/40 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 49 constraints, problems are : Problem set: 0 solved, 15 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 888ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 888ms
[2026-05-25 11:42:00] [INFO ] Invariant cache hit.
[2026-05-25 11:42:01] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 2, 14]
[2026-05-25 11:42:01] [INFO ] Actually due to overlaps returned [1, 14, 0]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 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 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 16 transition count 12
Applied a total of 9 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 12/16 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2969858651279563887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6255954895224818233.kers'
[2026-05-25 11:42:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2969858651279563887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6255954895224818233.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 12 rows 13 cols 37 entries
Finished phase 1 with 9 SingleSign rule and 1 generalized
[2026-05-25 11:42:01] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6255954895224818233.kers
Total runtime 0 ms.
[2026-05-25 11:42:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 11:42:01] [INFO ] Invariant cache hit.
[2026-05-25 11:42:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1003 ms. Remains : 16/32 places, 12/22 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 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-03
Product exploration explored 100000 steps with 15572 reset in 112 ms.
Product exploration explored 100000 steps with 15479 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2026-05-25 11:42:01] [INFO ] Invariant cache hit.
[2026-05-25 11:42:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 11:42:01] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-25 11:42:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:42:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:42:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 11:42:01] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 11:42:01] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:42:01] [INFO ] Computed and/alt/rep : 11/28/11 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:42:01] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 343 ms.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 11 sub problems to find dead transitions.
[2026-05-25 11:42:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/28 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/28 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/28 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 453ms
[2026-05-25 11:42:02] [INFO ] Invariant cache hit.
[2026-05-25 11:42:02] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 11:42:02] [INFO ] Invariant cache hit.
[2026-05-25 11:42:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-25 11:42:02] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 16/16 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2026-05-25 11:42:02] [INFO ] Invariant cache hit.
[2026-05-25 11:42:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-25 11:42:02] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:42:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:42:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:42:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-25 11:42:02] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 11:42:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:42:02] [INFO ] Computed and/alt/rep : 11/28/11 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:42:02] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 301 ms.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15506 reset in 82 ms.
Product exploration explored 100000 steps with 15609 reset in 204 ms.
Built C files in :
/tmp/ltsmin16466146365946147909
[2026-05-25 11:42:03] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2026-05-25 11:42:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:42:03] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2026-05-25 11:42:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:42:03] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2026-05-25 11:42:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:42:03] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16466146365946147909
Running compilation step : cd /tmp/ltsmin16466146365946147909;'/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 242 ms.
Running link step : cd /tmp/ltsmin16466146365946147909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16466146365946147909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13910937652091790328.hoa' '--buchi-type=spotba'
LTSmin run took 37 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-03 finished in 3380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G((G(p0) U p1))||X(p2))) U X(X(p3))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13057715475916812716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18152400868623178392.kers'
[2026-05-25 11:42:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13057715475916812716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18152400868623178392.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:42:03] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18152400868623178392.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 44 constraints, problems are : Problem set: 0 solved, 21 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1308ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1309ms
[2026-05-25 11:42:04] [INFO ] Invariant cache hit.
[2026-05-25 11:42:04] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 18]
[2026-05-25 11:42:04] [INFO ] Actually due to overlaps returned [1, 18, 0]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1352 ms. Remains : 29/32 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G((G(p0) U p1))||X(p2))) U X(X(p3))))'
Stuttering acceptance computed with spot in 725 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), true, (NOT p3), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-04 finished in 2155 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)||G(p1))))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:42:05] [INFO ] Invariant cache hit.
[2026-05-25 11:42:05] [INFO ] Implicit Places using invariants in 35 ms returned [0, 1, 2, 18]
[2026-05-25 11:42:05] [INFO ] Actually due to overlaps returned [1, 18, 0]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 29/32 places, 22/22 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)||G(p1))))))))'
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-05
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-05 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 31 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 20
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 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 26 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 13 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
Running 15 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7143877650272372468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8646232733158731019.kers'
[2026-05-25 11:42:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7143877650272372468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8646232733158731019.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 15 rows 21 cols 56 entries
Finished phase 1 with 7 SingleSign rule and 7 generalized
[2026-05-25 11:42:05] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8646232733158731019.kers
Total runtime 0 ms.
[2026-05-25 11:42:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 15/39 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 15/39 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1431ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1432ms
[2026-05-25 11:42:07] [INFO ] Invariant cache hit.
[2026-05-25 11:42:07] [INFO ] Implicit Places using invariants in 30 ms returned [0, 2]
[2026-05-25 11:42:07] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 16/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1478 ms. Remains : 23/32 places, 16/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-06 finished in 1565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(!p0)))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1152171127377419030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17180237812652155291.kers'
[2026-05-25 11:42:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1152171127377419030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17180237812652155291.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:42:07] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17180237812652155291.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 44 constraints, problems are : Problem set: 0 solved, 21 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1215ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1215ms
[2026-05-25 11:42:08] [INFO ] Invariant cache hit.
[2026-05-25 11:42:08] [INFO ] Implicit Places using invariants in 40 ms returned [0, 1, 2, 18]
[2026-05-25 11:42:08] [INFO ] Actually due to overlaps returned [1, 18, 0]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1258 ms. Remains : 29/32 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(!p0)))))'
Stuttering acceptance computed with spot in 117 ms :[true, false, false, p0]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-09
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-09 finished in 1399 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&&(F(p0) U p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 26 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 5 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
Running 14 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3714887274458375044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3126036018425040147.kers'
[2026-05-25 11:42:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3714887274458375044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3126036018425040147.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 14 rows 19 cols 49 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-25 11:42:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3126036018425040147.kers
Total runtime 0 ms.
[2026-05-25 11:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/37 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 34 constraints, problems are : Problem set: 0 solved, 14 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/37 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 903ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 904ms
[2026-05-25 11:42:09] [INFO ] Invariant cache hit.
[2026-05-25 11:42:09] [INFO ] Implicit Places using invariants in 30 ms returned [0, 2, 12]
[2026-05-25 11:42:09] [INFO ] Actually due to overlaps returned [12, 0]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 15/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 944 ms. Remains : 21/32 places, 15/22 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(((F(p0) U p1)&&!p0))))'
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-10 finished in 1010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1||X(G(p2)))))))'
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8701764639501782858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13708219746153272606.kers'
[2026-05-25 11:42:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8701764639501782858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13708219746153272606.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:42:09] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13708219746153272606.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 44 constraints, problems are : Problem set: 0 solved, 21 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1208ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1208ms
[2026-05-25 11:42:11] [INFO ] Invariant cache hit.
[2026-05-25 11:42:11] [INFO ] Implicit Places using invariants in 39 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1252 ms. Remains : 30/32 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((X(G(p1))||p2)))))'
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-11 finished in 1658 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(p0)&&X(X(!p1))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:42:11] [INFO ] Invariant cache hit.
[2026-05-25 11:42:11] [INFO ] Implicit Places using invariants in 39 ms returned [0, 1, 2]
[2026-05-25 11:42:11] [INFO ] Actually due to overlaps returned [1, 0]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 30/32 places, 22/22 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(p0)&&X(X(p1))))))'
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 96 ms.
Product exploration explored 100000 steps with 20000 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 152 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Knowledge-based reduction took 298 ms.
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7904578463556204392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8989209828738003324.kers'
[2026-05-25 11:42:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7904578463556204392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8989209828738003324.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 22 rows 25 cols 64 entries
Finished phase 1 with 15 SingleSign rule and 5 generalized
[2026-05-25 11:42:12] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8989209828738003324.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/52 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 40 constraints, problems are : Problem set: 0 solved, 21 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/52 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 61 constraints, problems are : Problem set: 0 solved, 21 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1170ms
[2026-05-25 11:42:13] [INFO ] Invariant cache hit.
[2026-05-25 11:42:13] [INFO ] Implicit Places using invariants in 26 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1198 ms. Remains : 29/30 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 121 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Knowledge-based reduction took 337 ms.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 62 ms.
Product exploration explored 100000 steps with 20000 reset in 64 ms.
Spot run failed in 145 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/ltsmin14240537430871516404
[2026-05-25 11:42:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14240537430871516404
Running compilation step : cd /tmp/ltsmin14240537430871516404;'/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 97 ms.
Running link step : cd /tmp/ltsmin14240537430871516404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14240537430871516404;'/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/stateBased10429783220180368977.hoa' '--buchi-type=spotba'
LTSmin run took 20 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-13 finished in 3535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(p1))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9988630546596524655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-692059579559987300.kers'
[2026-05-25 11:42:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9988630546596524655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-692059579559987300.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:42:15] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-692059579559987300.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 44 constraints, problems are : Problem set: 0 solved, 21 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/54 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1213ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1214ms
[2026-05-25 11:42:16] [INFO ] Invariant cache hit.
[2026-05-25 11:42:16] [INFO ] Implicit Places using invariants in 37 ms returned [0, 2, 18]
[2026-05-25 11:42:16] [INFO ] Actually due to overlaps returned [18, 0]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1255 ms. Remains : 30/32 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(p1))))'
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 62 ms.
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 16 ms. Proved property starting from automaton with 4 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-14 finished in 1584 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((X(p1) U p2))&&p0)) U X(p3)) U p4))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:42:16] [INFO ] Invariant cache hit.
[2026-05-25 11:42:16] [INFO ] Implicit Places using invariants in 28 ms returned [0, 2, 18]
[2026-05-25 11:42:16] [INFO ] Actually due to overlaps returned [18, 0]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 30/32 places, 22/22 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((X(p1) U p2))&&p0)) U X(p3)) U p4))'
Stuttering acceptance computed with spot in 386 ms :[(NOT p4), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-15
Product exploration explored 100000 steps with 338 reset in 120 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-15 finished in 608 ms.
All properties solved by simple procedures.
Total runtime 23059 ms.

BK_STOP 1779709337354

--------------------
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="GPPP-PT-C0001N0000001000"
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 GPPP-PT-C0001N0000001000, 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 r146-tall-177961074100268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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