Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914200668.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 Peterson-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.2K Mar 8 07:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 8 07:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 8 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 8 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 16 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 8 07:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 8 07:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 8 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 44K 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 Peterson-COL-4-LTLFireability-00
FORMULA_NAME Peterson-COL-4-LTLFireability-01
FORMULA_NAME Peterson-COL-4-LTLFireability-02
FORMULA_NAME Peterson-COL-4-LTLFireability-03
FORMULA_NAME Peterson-COL-4-LTLFireability-04
FORMULA_NAME Peterson-COL-4-LTLFireability-05
FORMULA_NAME Peterson-COL-4-LTLFireability-06
FORMULA_NAME Peterson-COL-4-LTLFireability-07
FORMULA_NAME Peterson-COL-4-LTLFireability-08
FORMULA_NAME Peterson-COL-4-LTLFireability-09
FORMULA_NAME Peterson-COL-4-LTLFireability-10
FORMULA_NAME Peterson-COL-4-LTLFireability-11
FORMULA_NAME Peterson-COL-4-LTLFireability-12
FORMULA_NAME Peterson-COL-4-LTLFireability-13
FORMULA_NAME Peterson-COL-4-LTLFireability-14
FORMULA_NAME Peterson-COL-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779808275028

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-26 15:11:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 15:11:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 15:11:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 15:11:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 15:11:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 532 ms
[2026-05-26 15:11:16] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2026-05-26 15:11:16] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 4 ms.
[2026-05-26 15:11:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-COL-4-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 815 steps (0 resets) in 32 ms. (24 steps per ms) remains 0/11 properties
[2026-05-26 15:11:17] [INFO ] Flatten gal took : 15 ms
[2026-05-26 15:11:17] [INFO ] Flatten gal took : 2 ms
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2026-05-26 15:11:17] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 39 ms.
[2026-05-26 15:11:17] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 40 transitions.
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 27 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:11:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-31834352700628857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5890602736437235930.kers'
[2026-05-26 15:11:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-31834352700628857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5890602736437235930.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:11:17] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5890602736437235930.kers
Total runtime 4 ms.
[2026-05-26 15:11:17] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-26 15:11:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:11:17] [INFO ] Invariant cache hit.
[2026-05-26 15:11:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:11:17] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2026-05-26 15:11:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:11:17] [INFO ] Invariant cache hit.
[2026-05-26 15:11:17] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (OVERLAPS) 5/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 65 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 109 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Finished structural reductions in LTL mode , in 1 iterations and 60913 ms. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:12:18] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:12:18] [INFO ] Invariant cache hit.
[2026-05-26 15:12:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-26 15:12:18] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:12:18] [INFO ] Invariant cache hit.
[2026-05-26 15:12:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:12:18] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 480 out of 480 places after structural reductions.
[2026-05-26 15:12:18] [INFO ] Flatten gal took : 52 ms
[2026-05-26 15:12:18] [INFO ] Flatten gal took : 58 ms
[2026-05-26 15:12:18] [INFO ] Input system was already deterministic with 690 transitions.
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40000 steps (8 resets) in 3827 ms. (10 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 2/2 properties
[2026-05-26 15:12:20] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:12:20] [INFO ] Invariant cache hit.
[2026-05-26 15:12:20] [INFO ] State equation strengthened by 116 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 405/470 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/475 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/480 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 630/1110 variables, 480/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 116/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1110 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 616 constraints, problems are : Problem set: 0 solved, 2 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 405/470 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/475 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/480 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 49 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5782ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 384 place count 288 transition count 414
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 552 place count 204 transition count 414
Applied a total of 552 rules in 44 ms. Remains 204 /480 variables (removed 276) and now considering 414/690 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 204/480 places, 414/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 463 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 216 steps, run visited all 2 properties in 7 ms. (steps per millisecond=30 )
Probabilistic random walk after 216 steps, saw 182 distinct states, run finished after 11 ms. (steps per millisecond=19 ) properties seen :2
FORMULA Peterson-COL-4-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(!p0) U X(p1)))'
Support contains 35 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 28 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:12:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:12:26] [INFO ] Invariant cache hit.
[2026-05-26 15:12:27] [INFO ] Implicit Places using invariants in 252 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 257 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 16 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 304 ms. Remains : 475/480 places, 690/690 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(p1)))'
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : Peterson-COL-4-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 344 ms.
Product exploration explored 100000 steps with 0 reset in 366 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 9 factoid took 55 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 441 ms. (90 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 531 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2026-05-26 15:12:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1891334766090847582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11328024989883501936.kers'
[2026-05-26 15:12:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1891334766090847582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11328024989883501936.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:12:28] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11328024989883501936.kers
Total runtime 5 ms.
[2026-05-26 15:12:28] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 415/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/455 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 630/1085 variables, 455/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1085 variables, 116/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1085 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 20/1105 variables, 20/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1105 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1105 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1105 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1105/1105 variables, and 605 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 475/475 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 415/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/455 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 630/1085 variables, 455/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 116/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1085 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1085 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/1105 variables, 20/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1105 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1105 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1105 variables, 7/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1105 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1105/1105 variables, and 624 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 475/475 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6269ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 475 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 283 transition count 498
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 384 place count 283 transition count 409
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 562 place count 194 transition count 409
Applied a total of 562 rules in 34 ms. Remains 194 /475 variables (removed 281) and now considering 409/690 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 194/475 places, 409/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1342914 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :2 out of 3
Probabilistic random walk after 1342914 steps, saw 224443 distinct states, run finished after 3002 ms. (steps per millisecond=447 ) properties seen :2
[2026-05-26 15:12:38] [INFO ] Flow matrix only has 349 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17838428902791810418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10211858029891874751.kers'
[2026-05-26 15:12:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17838428902791810418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10211858029891874751.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 349 rows 189 cols 858 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-26 15:12:38] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10211858029891874751.kers
Total runtime 8 ms.
[2026-05-26 15:12:38] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/174 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 349/523 variables, 174/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 116/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/543 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/543 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 194/194 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/174 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 349/523 variables, 174/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 116/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/543 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 16/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/543 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1858 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 194/194 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2058ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11611 steps, including 523 resets, run visited all 1 properties in 86 ms. (steps per millisecond=135 )
Parikh walk visited 1 properties in 90 ms.
Negative knowledge disproves property using: (G (NOT p0))
Knowledge based reduction with 9 factoid took 30 ms. Proved property starting from automaton with 6 states, 15 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 12238 ms.
FORMULA Peterson-COL-4-LTLFireability-00 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property Peterson-COL-4-LTLFireability-00 finished in 13618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||(p0 U X(G(!p1))))))))'
Support contains 40 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:12:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1358141960945142480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-40672043469614921.kers'
[2026-05-26 15:12:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1358141960945142480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-40672043469614921.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:12:40] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-40672043469614921.kers
Total runtime 4 ms.
[2026-05-26 15:12:40] [INFO ] Implicit Places using invariants in 302 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 309 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 320 ms. Remains : 475/480 places, 690/690 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||(p0 U X(G(!p1))))))))'
Stuttering acceptance computed with spot in 224 ms :[true, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : Peterson-COL-4-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 242 ms.
Product exploration explored 100000 steps with 0 reset in 295 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 330 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 327 ms. (121 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2026-05-26 15:12:42] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8749999055245295554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10605476665126117618.kers'
[2026-05-26 15:12:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8749999055245295554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10605476665126117618.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:12:42] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10605476665126117618.kers
Total runtime 2 ms.
[2026-05-26 15:12:42] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 410/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/455 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 630/1085 variables, 455/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1085 variables, 116/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1085 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/1105 variables, 20/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1105 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1105 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1105 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1105/1105 variables, and 605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 475/475 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 410/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/455 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 630/1085 variables, 455/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 116/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1085 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1085 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1085 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/1105 variables, 20/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1105 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1105/1105 variables, and 630 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 475/475 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5714ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 475 transition count 546
Reduce places removed 144 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 160 rules applied. Total rules applied 304 place count 331 transition count 530
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 320 place count 315 transition count 530
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 320 place count 315 transition count 430
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 520 place count 215 transition count 430
Applied a total of 520 rules in 29 ms. Remains 215 /475 variables (removed 260) and now considering 430/690 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 215/475 places, 430/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 52 steps, run visited all 2 properties in 4 ms. (steps per millisecond=13 )
Probabilistic random walk after 52 steps, saw 46 distinct states, run finished after 4 ms. (steps per millisecond=13 ) properties seen :2
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Knowledge-based reduction took 6726 ms.
Stuttering acceptance computed with spot in 251 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 40 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:12:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:12:48] [INFO ] Invariant cache hit.
[2026-05-26 15:12:48] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-26 15:12:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:12:48] [INFO ] Invariant cache hit.
[2026-05-26 15:12:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:12:49] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2026-05-26 15:12:49] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:12:49] [INFO ] Invariant cache hit.
[2026-05-26 15:12:49] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/1105 variables, and 94 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/475 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 80/94 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/1105 variables, and 134 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/475 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 61356 ms. Remains : 475/475 places, 690/690 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 53 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
[2026-05-26 15:13:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:13:50] [INFO ] Invariant cache hit.
[2026-05-26 15:13:50] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 410/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/455 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 630/1085 variables, 455/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1085 variables, 116/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1085 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/1105 variables, 20/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1105 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1105 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1105 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1105/1105 variables, and 605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 475/475 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 410/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/455 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 630/1085 variables, 455/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 116/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1085 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1085 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1085 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/1105 variables, 20/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1105 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5801ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 192 ms.
Support contains 40 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 475 transition count 546
Reduce places removed 144 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 160 rules applied. Total rules applied 304 place count 331 transition count 530
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 320 place count 315 transition count 530
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 320 place count 315 transition count 430
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 520 place count 215 transition count 430
Applied a total of 520 rules in 20 ms. Remains 215 /475 variables (removed 260) and now considering 430/690 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 215/475 places, 430/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 52 steps, run visited all 2 properties in 4 ms. (steps per millisecond=13 )
Probabilistic random walk after 52 steps, saw 46 distinct states, run finished after 4 ms. (steps per millisecond=13 ) properties seen :2
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Knowledge-based reduction took 6702 ms.
Stuttering acceptance computed with spot in 238 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 246 ms :[true, p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Product exploration explored 100000 steps with 0 reset in 279 ms.
Spot run failed in 83 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/ltsmin15824570109944200436
[2026-05-26 15:13:57] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15824570109944200436
Running compilation step : cd /tmp/ltsmin15824570109944200436;'/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 1635 ms.
Running link step : cd /tmp/ltsmin15824570109944200436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15824570109944200436;'/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/stateBased11581196357699741637.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA Peterson-COL-4-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-4-LTLFireability-01 finished in 79098 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)&&F(G(p2))))'
Support contains 80 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 384 place count 288 transition count 409
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 562 place count 199 transition count 409
Applied a total of 562 rules in 24 ms. Remains 199 /480 variables (removed 281) and now considering 409/690 (removed 281) transitions.
[2026-05-26 15:13:59] [INFO ] Flow matrix only has 349 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3332103977669907413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3735104585662521104.kers'
[2026-05-26 15:13:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3332103977669907413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3735104585662521104.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 349 rows 189 cols 858 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-26 15:13:59] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3735104585662521104.kers
Total runtime 2 ms.
[2026-05-26 15:13:59] [INFO ] Implicit Places using invariants in 90 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 91 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 194/480 places, 409/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 194 /194 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 194/480 places, 409/690 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)&&F(G(p2))))'
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 692 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-02 finished in 1009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((!p1 U p2))&&G(!p3))))'
Support contains 305 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:14:00] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11471741519952504110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5790139227260944223.kers'
[2026-05-26 15:14:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11471741519952504110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5790139227260944223.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:14:00] [INFO ] Computed 19 invariants in 4 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5790139227260944223.kers
Total runtime 5 ms.
[2026-05-26 15:14:00] [INFO ] Implicit Places using invariants in 122 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 123 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 475/480 places, 690/690 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((!p1 U p2))&&G(p3))))'
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p3) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p3)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-04
Product exploration explored 100000 steps with 2783 reset in 685 ms.
Stack based approach found an accepted trace after 1020 steps with 32 reset with depth 58 and stack size 58 in 8 ms.
FORMULA Peterson-COL-4-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-04 finished in 1040 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)&&F(G((p1 U p2))))))'
Support contains 50 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 480 transition count 546
Reduce places removed 144 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 160 rules applied. Total rules applied 304 place count 336 transition count 530
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 320 place count 320 transition count 430
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 520 place count 220 transition count 430
Applied a total of 520 rules in 26 ms. Remains 220 /480 variables (removed 260) and now considering 430/690 (removed 260) transitions.
[2026-05-26 15:14:01] [INFO ] Flow matrix only has 370 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14908441510938552059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2819093896029107463.kers'
[2026-05-26 15:14:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14908441510938552059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2819093896029107463.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 370 rows 210 cols 900 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-26 15:14:01] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2819093896029107463.kers
Total runtime 4 ms.
[2026-05-26 15:14:01] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-26 15:14:01] [INFO ] Flow matrix only has 370 transitions (discarded 60 similar events)
[2026-05-26 15:14:01] [INFO ] Invariant cache hit.
[2026-05-26 15:14:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:14:02] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2026-05-26 15:14:02] [INFO ] Redundant transitions in 34 ms returned []
Running 425 sub problems to find dead transitions.
[2026-05-26 15:14:02] [INFO ] Flow matrix only has 370 transitions (discarded 60 similar events)
[2026-05-26 15:14:02] [INFO ] Invariant cache hit.
[2026-05-26 15:14:02] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 5/220 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 220/590 variables, and 139 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/220 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 116/120 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 5/220 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 15/194 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 220/590 variables, and 200 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/220 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/425 constraints, Known Traps: 181/181 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 220/480 places, 430/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60743 ms. Remains : 220/480 places, 430/690 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)&&F(G((p1 U p2))))))'
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 357 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-05 finished in 61291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((G(p1) U (p2&&G(p1))))||p0) U X(X(p3))))'
Support contains 250 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:15:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2998973950919390151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9763262756806071173.kers'
[2026-05-26 15:15:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2998973950919390151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9763262756806071173.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:15:02] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9763262756806071173.kers
Total runtime 4 ms.
[2026-05-26 15:15:03] [INFO ] Implicit Places using invariants in 176 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 177 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 475/480 places, 690/690 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(p1) U (p2&&G(p1))))||p0) U X(X(p3))))'
Stuttering acceptance computed with spot in 405 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-06
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-06 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(!p0)||X(X(p1))))||(G(p2) U p3))))'
Support contains 120 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:15:03] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:15:03] [INFO ] Invariant cache hit.
[2026-05-26 15:15:03] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-26 15:15:03] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:15:03] [INFO ] Invariant cache hit.
[2026-05-26 15:15:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:15:04] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2026-05-26 15:15:04] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:15:04] [INFO ] Invariant cache hit.
[2026-05-26 15:15:04] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (OVERLAPS) 5/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 69 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 111 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in LTL mode , in 1 iterations and 60786 ms. Remains : 480/480 places, 690/690 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p0)||X(X(p1))))||(G(p2) U p3))))'
Stuttering acceptance computed with spot in 794 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p3), (AND p2 (NOT p3) (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 235 ms.
Product exploration explored 100000 steps with 0 reset in 314 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 20 factoid took 435 ms. Reduced automaton from 21 states, 49 edges and 4 AP (stutter sensitive) to 21 states, 49 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1107 ms. (36 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1350 ms. (29 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 10/10 properties
[2026-05-26 15:16:07] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:16:07] [INFO ] Invariant cache hit.
[2026-05-26 15:16:07] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem apf11 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 5/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 340/460 variables, 5/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 630/1090 variables, 460/475 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 116/591 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/591 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 20/1110 variables, 20/611 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 4/615 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 2 solved, 8 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 5/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 340/460 variables, 5/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 630/1090 variables, 460/475 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 116/591 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 4/595 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1090 variables, 0/595 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 20/1110 variables, 20/615 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 4/619 constraints. Problems are: Problem set: 2 solved, 8 unsolved
SMT process timed out in 7128ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 499 ms.
Support contains 120 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 480 transition count 578
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 224 place count 368 transition count 578
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 224 place count 368 transition count 479
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 422 place count 269 transition count 479
Applied a total of 422 rules in 19 ms. Remains 269 /480 variables (removed 211) and now considering 479/690 (removed 211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 269/480 places, 479/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 460 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 693606 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :4 out of 8
Probabilistic random walk after 693606 steps, saw 118464 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :4
[2026-05-26 15:16:19] [INFO ] Flow matrix only has 419 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2916468646123040894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4152515101069102369.kers'
[2026-05-26 15:16:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2916468646123040894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4152515101069102369.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 419 rows 259 cols 998 entries
Finished phase 1 with 250 SingleSign rule and 0 generalized
[2026-05-26 15:16:19] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4152515101069102369.kers
Total runtime 2 ms.
[2026-05-26 15:16:19] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 129/249 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 419/668 variables, 249/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 116/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/688 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/688 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 688/688 variables, and 404 constraints, problems are : Problem set: 0 solved, 4 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 269/269 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 129/249 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 419/668 variables, 249/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 116/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 20/688 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 20/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/688 variables, 20/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 20/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf19 is UNSAT
Problem apf21 is UNSAT
Problem apf22 is UNSAT
Solver is answering 'unknown', stopping.
Problem apf12 is UNSAT
After SMT solving in domain Int declared 688/688 variables, and 496 constraints, problems are : Problem set: 3 solved, 1 unsolved in 24281 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 269/269 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24859ms problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge based reduction with 26 factoid took 523 ms. Reduced automaton from 21 states, 49 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 39110 ms.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 110 out of 480 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:16:45] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1802707443471986263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15250687044586189386.kers'
[2026-05-26 15:16:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1802707443471986263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15250687044586189386.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:16:45] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15250687044586189386.kers
Total runtime 3 ms.
[2026-05-26 15:16:45] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-26 15:16:45] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:16:45] [INFO ] Invariant cache hit.
[2026-05-26 15:16:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:16:45] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 480/480 places, 690/690 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 3 factoid took 68 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
[2026-05-26 15:16:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:16:46] [INFO ] Invariant cache hit.
[2026-05-26 15:16:46] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/455 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/460 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 630/1090 variables, 460/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 116/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1090 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 20/1110 variables, 20/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/455 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/460 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 630/1090 variables, 460/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 116/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1090 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 20/1110 variables, 20/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 13/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1110 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 636 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4442 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5394ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 12836 steps, including 658 resets, run visited all 2 properties in 115 ms. (steps per millisecond=111 )
Parikh walk visited 2 properties in 115 ms.
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 6176 ms.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 290 ms.
Spot run failed in 45 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/ltsmin12532679622019015398
[2026-05-26 15:16:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12532679622019015398
Running compilation step : cd /tmp/ltsmin12532679622019015398;'/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 1017 ms.
Running link step : cd /tmp/ltsmin12532679622019015398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12532679622019015398;'/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/stateBased3585988859590914622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 110 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:17:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:17:08] [INFO ] Invariant cache hit.
[2026-05-26 15:17:08] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-26 15:17:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:17:08] [INFO ] Invariant cache hit.
[2026-05-26 15:17:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:17:08] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 833 ms. Remains : 480/480 places, 690/690 transitions.
Built C files in :
/tmp/ltsmin8742589201867216778
[2026-05-26 15:17:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8742589201867216778
Running compilation step : cd /tmp/ltsmin8742589201867216778;'/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 1002 ms.
Running link step : cd /tmp/ltsmin8742589201867216778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8742589201867216778;'/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/stateBased5149208075062320575.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 15:17:24] [INFO ] Flatten gal took : 27 ms
[2026-05-26 15:17:24] [INFO ] Flatten gal took : 26 ms
[2026-05-26 15:17:24] [INFO ] Time to serialize gal into /tmp/LTL4876871609058827453.gal : 7 ms
[2026-05-26 15:17:24] [INFO ] Time to serialize properties into /tmp/LTL4191592806304181677.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4876871609058827453.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4864239156188892637.hoa' '-atoms' '/tmp/LTL4191592806304181677.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4191592806304181677.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4864239156188892637.hoa
Detected timeout of ITS tools.
[2026-05-26 15:17:39] [INFO ] Flatten gal took : 28 ms
[2026-05-26 15:17:39] [INFO ] Flatten gal took : 25 ms
[2026-05-26 15:17:39] [INFO ] Time to serialize gal into /tmp/LTL692928490569041793.gal : 7 ms
[2026-05-26 15:17:39] [INFO ] Time to serialize properties into /tmp/LTL14403095456272819559.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL692928490569041793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14403095456272819559.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X((G("((((((IsEndLoop_54<1)&&(IsEndLoop_84<1))&&((IsEndLoop_19<1)&&(IsEndLoop_49<1)))&&(((IsEndLoop_94<1)&&(IsEndLoop_29<1))&&((...4243
Formula 0 simplified : F(X(F!"((((((IsEndLoop_54<1)&&(IsEndLoop_84<1))&&((IsEndLoop_19<1)&&(IsEndLoop_49<1)))&&(((IsEndLoop_94<1)&&(IsEndLoop_29<1))&&((IsE...4230
Detected timeout of ITS tools.
[2026-05-26 15:17:54] [INFO ] Flatten gal took : 20 ms
[2026-05-26 15:17:54] [INFO ] Applying decomposition
[2026-05-26 15:17:54] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11883821633146510775.txt' '-o' '/tmp/graph11883821633146510775.bin' '-w' '/tmp/graph11883821633146510775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11883821633146510775.bin' '-l' '-1' '-v' '-w' '/tmp/graph11883821633146510775.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:17:54] [INFO ] Decomposing Gal with order
[2026-05-26 15:17:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:17:54] [INFO ] Removed a total of 500 redundant transitions.
[2026-05-26 15:17:54] [INFO ] Flatten gal took : 82 ms
[2026-05-26 15:17:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 9 ms.
[2026-05-26 15:17:54] [INFO ] Time to serialize gal into /tmp/LTL12543522431050945172.gal : 7 ms
[2026-05-26 15:17:54] [INFO ] Time to serialize properties into /tmp/LTL4663982850741967444.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12543522431050945172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4663982850741967444.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X((G("((((((i0.u55.IsEndLoop_54<1)&&(i8.u103.IsEndLoop_84<1))&&((i3.u53.IsEndLoop_19<1)&&(i1.u54.IsEndLoop_49<1)))&&(((i9.u108.I...5993
Formula 0 simplified : F(X(F!"((((((i0.u55.IsEndLoop_54<1)&&(i8.u103.IsEndLoop_84<1))&&((i3.u53.IsEndLoop_19<1)&&(i1.u54.IsEndLoop_49<1)))&&(((i9.u108.IsEn...5980
Detected timeout of ITS tools.
Treatment of property Peterson-COL-4-LTLFireability-08 finished in 186282 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((G(F((G(!p1)||(!p0&&X(X(!p1)))))) U !p2))))'
Support contains 145 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:18:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:18:09] [INFO ] Invariant cache hit.
[2026-05-26 15:18:09] [INFO ] Implicit Places using invariants in 136 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 138 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 475/480 places, 690/690 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((G(F((G(!p1)||(!p0&&X(X(!p1)))))) U !p2))))'
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) p2), (NOT p0), p2, p1, p1, p1, p1, p1]
Running random walk in product with property : Peterson-COL-4-LTLFireability-09
Product exploration explored 100000 steps with 535 reset in 453 ms.
Stack based approach found an accepted trace after 232 steps with 6 reset with depth 82 and stack size 82 in 2 ms.
FORMULA Peterson-COL-4-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-09 finished in 962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:18:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:18:10] [INFO ] Invariant cache hit.
[2026-05-26 15:18:11] [INFO ] Implicit Places using invariants in 254 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 256 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 270 ms. Remains : 475/480 places, 690/690 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-10 finished in 372 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(X(p1)))) U (p2&&X(X(X(X(p1)))))))||p0)))'
Support contains 110 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:18:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-26 15:18:11] [INFO ] Invariant cache hit.
[2026-05-26 15:18:11] [INFO ] Implicit Places using invariants in 219 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 220 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 475/480 places, 690/690 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(X(p1)))) U (p2&&X(X(X(X(p1)))))))||p0)))'
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-COL-4-LTLFireability-11
Entered a terminal (fully accepting) state of product in 16 steps with 1 reset in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-11 finished in 521 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 120 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 480 transition count 594
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 384 transition count 594
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 192 place count 384 transition count 574
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 232 place count 364 transition count 574
Applied a total of 232 rules in 23 ms. Remains 364 /480 variables (removed 116) and now considering 574/690 (removed 116) transitions.
[2026-05-26 15:18:11] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2284723513733730023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11367130581166113273.kers'
[2026-05-26 15:18:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2284723513733730023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11367130581166113273.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 514 rows 354 cols 1188 entries
Finished phase 1 with 345 SingleSign rule and 0 generalized
[2026-05-26 15:18:11] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11367130581166113273.kers
Total runtime 2 ms.
[2026-05-26 15:18:11] [INFO ] Implicit Places using invariants in 181 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 182 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/480 places, 574/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 359 /359 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 359/480 places, 574/690 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 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-12
Product exploration explored 100000 steps with 10788 reset in 482 ms.
Product exploration explored 100000 steps with 10786 reset in 516 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 3 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 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 64 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 79 ms :[(NOT p0), (NOT p0)]
[2026-05-26 15:18:13] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15425698972827175580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16986687995468888517.kers'
[2026-05-26 15:18:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15425698972827175580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16986687995468888517.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 514 rows 354 cols 1188 entries
Finished phase 1 with 345 SingleSign rule and 0 generalized
[2026-05-26 15:18:13] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16986687995468888517.kers
Total runtime 3 ms.
[2026-05-26 15:18:13] [INFO ] [Real]Absence check using 14 positive place invariants in 62 ms returned sat
[2026-05-26 15:18:15] [INFO ] [Real]Absence check using state equation in 1415 ms returned sat
[2026-05-26 15:18:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:18:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 41 ms returned sat
[2026-05-26 15:18:17] [INFO ] [Nat]Absence check using state equation in 1330 ms returned sat
[2026-05-26 15:18:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:18:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 84 ms returned sat
[2026-05-26 15:18:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2140 ms
[2026-05-26 15:18:19] [INFO ] Computed and/alt/rep : 473/990/473 causal constraints (skipped 36 transitions) in 26 ms.
[2026-05-26 15:18:22] [INFO ] Added : 279 causal constraints over 56 iterations in 3400 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 9729 ms.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 120 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 574/574 transitions.
Applied a total of 0 rules in 18 ms. Remains 359 /359 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2026-05-26 15:18:22] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
[2026-05-26 15:18:22] [INFO ] Invariant cache hit.
[2026-05-26 15:18:22] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 15:18:22] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
[2026-05-26 15:18:22] [INFO ] Invariant cache hit.
[2026-05-26 15:18:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:18:23] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2026-05-26 15:18:23] [INFO ] Redundant transitions in 15 ms returned []
Running 569 sub problems to find dead transitions.
[2026-05-26 15:18:23] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
[2026-05-26 15:18:23] [INFO ] Invariant cache hit.
[2026-05-26 15:18:23] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/873 variables, and 118 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/359 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 104/104 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/873 variables, and 138 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/359 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 124/124 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61222 ms. Remains : 359/359 places, 574/574 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 3 factoid took 48 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 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 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).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2026-05-26 15:19:24] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
[2026-05-26 15:19:24] [INFO ] Invariant cache hit.
[2026-05-26 15:19:24] [INFO ] [Real]Absence check using 14 positive place invariants in 64 ms returned sat
[2026-05-26 15:19:26] [INFO ] [Real]Absence check using state equation in 1429 ms returned sat
[2026-05-26 15:19:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 15:19:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 40 ms returned sat
[2026-05-26 15:19:28] [INFO ] [Nat]Absence check using state equation in 1310 ms returned sat
[2026-05-26 15:19:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-26 15:19:28] [INFO ] [Nat]Added 116 Read/Feed constraints in 86 ms returned sat
[2026-05-26 15:19:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2121 ms
[2026-05-26 15:19:30] [INFO ] Computed and/alt/rep : 473/990/473 causal constraints (skipped 36 transitions) in 27 ms.
[2026-05-26 15:19:33] [INFO ] Added : 279 causal constraints over 56 iterations in 3279 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 9547 ms.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10856 reset in 483 ms.
Product exploration explored 100000 steps with 10783 reset in 511 ms.
Built C files in :
/tmp/ltsmin10954852566648677649
[2026-05-26 15:19:34] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2026-05-26 15:19:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:19:34] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2026-05-26 15:19:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:19:34] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2026-05-26 15:19:34] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:19:34] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10954852566648677649
Running compilation step : cd /tmp/ltsmin10954852566648677649;'/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 1253 ms.
Running link step : cd /tmp/ltsmin10954852566648677649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10954852566648677649;'/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/stateBased802275395482781287.hoa' '--buchi-type=spotba'
LTSmin run took 1686 ms.
FORMULA Peterson-COL-4-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-4-LTLFireability-12 finished in 86157 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(p0)&&F(!p1))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2026-05-26 15:19:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15039772405655780930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1649218737578302879.kers'
[2026-05-26 15:19:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15039772405655780930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1649218737578302879.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 630 rows 470 cols 1420 entries
Finished phase 1 with 461 SingleSign rule and 0 generalized
[2026-05-26 15:19:37] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1649218737578302879.kers
Total runtime 5 ms.
[2026-05-26 15:19:38] [INFO ] Implicit Places using invariants in 187 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 202 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 475/480 places, 690/690 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(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Peterson-COL-4-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-13 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 45 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 398 place count 281 transition count 410
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 560 place count 200 transition count 410
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 590 place count 185 transition count 395
Applied a total of 590 rules in 18 ms. Remains 185 /480 variables (removed 295) and now considering 395/690 (removed 295) transitions.
[2026-05-26 15:19:38] [INFO ] Flow matrix only has 335 transitions (discarded 60 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1651859223634113096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1708024060612404065.kers'
[2026-05-26 15:19:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1651859223634113096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1708024060612404065.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 335 rows 175 cols 830 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-26 15:19:38] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1708024060612404065.kers
Total runtime 4 ms.
[2026-05-26 15:19:38] [INFO ] Implicit Places using invariants in 97 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 98 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/480 places, 395/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 180 /180 variables (removed 0) and now considering 395/395 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 180/480 places, 395/690 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 792 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-15 finished in 972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(!p0)||X(X(p1))))||(G(p2) U p3))))'
Spot run failed in 45 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 15:19:39] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2860453011839559608
[2026-05-26 15:19:39] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2026-05-26 15:19:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:19:39] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2026-05-26 15:19:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:19:39] [INFO ] Applying decomposition
[2026-05-26 15:19:39] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8146881867316023353.txt' '-o' '/tmp/graph8146881867316023353.bin' '-w' '/tmp/graph8146881867316023353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8146881867316023353.bin' '-l' '-1' '-v' '-w' '/tmp/graph8146881867316023353.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:19:39] [INFO ] Decomposing Gal with order
[2026-05-26 15:19:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:19:39] [INFO ] Removed a total of 514 redundant transitions.
[2026-05-26 15:19:39] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.
[2026-05-26 15:19:39] [INFO ] Flatten gal took : 32 ms
[2026-05-26 15:19:39] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:19:39] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2860453011839559608
Running compilation step : cd /tmp/ltsmin2860453011839559608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 15:19:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2026-05-26 15:19:39] [INFO ] Time to serialize gal into /tmp/LTLFireability7316048330605262490.gal : 10 ms
[2026-05-26 15:19:39] [INFO ] Time to serialize properties into /tmp/LTLFireability12475169948985311692.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7316048330605262490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12475169948985311692.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X((G(!("((((((i9.u10.IsEndLoop_54>=1)||(i8.u123.IsEndLoop_84>=1))||((i0.u6.IsEndLoop_19>=1)||(i2.u42.IsEndLoop_49>=1)))||(((i18....5970
Formula 0 simplified : F(X(F"((((((i9.u10.IsEndLoop_54>=1)||(i8.u123.IsEndLoop_84>=1))||((i0.u6.IsEndLoop_19>=1)||(i2.u42.IsEndLoop_49>=1)))||(((i18.i1.u10...5953
Compilation finished in 1652 ms.
Running link step : cd /tmp/ltsmin2860453011839559608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2860453011839559608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((X(([](!(LTLAPp0==true))||X(X((LTLAPp1==true)))))||([]((LTLAPp2==true)) U (LTLAPp3==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t10, t12, t13, t14, t15, t16, t18, t19, t20, t21, t22, t24, t25, t26, t27, t2...1457
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
130432 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1304.39,7282584,1,0,7.88995e+06,5871,4382,4.62297e+07,312,34997,19373124
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Peterson-COL-4-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1855586 ms.

BK_STOP 1779810131807

--------------------
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="Peterson-COL-4"
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 Peterson-COL-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914200668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;