Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800827.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 DNAwalker-PT-14ringLRLarge, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800827
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.1K Mar 6 15:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 6 15:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 09:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 15:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 15:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 15:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 15:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 14 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 135K 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 DNAwalker-PT-14ringLRLarge-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-14ringLRLarge-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779669011696

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-14ringLRLarge
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 00:30:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 00:30:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:30:12] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2026-05-25 00:30:12] [INFO ] Transformed 33 places.
[2026-05-25 00:30:12] [INFO ] Transformed 312 transitions.
[2026-05-25 00:30:12] [INFO ] Parsed PT model containing 33 places and 312 transitions and 916 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:30:13] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6055668272123244096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11958826659597980245.kers'
[2026-05-25 00:30:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6055668272123244096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11958826659597980245.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:30:13] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11958826659597980245.kers
Total runtime 2 ms.
[2026-05-25 00:30:13] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20044 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 282/379 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/344 variables, and 379 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20034 ms.
Refiners :[State Equation: 27/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40313ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 40329ms
[2026-05-25 00:30:53] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:30:53] [INFO ] Invariant cache hit.
[2026-05-25 00:30:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 00:30:53] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:30:53] [INFO ] Invariant cache hit.
[2026-05-25 00:30:53] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:30:53] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 40834 ms. Remains : 33/33 places, 312/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:30:53] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:30:53] [INFO ] Invariant cache hit.
[2026-05-25 00:30:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 00:30:53] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:30:53] [INFO ] Invariant cache hit.
[2026-05-25 00:30:54] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:30:54] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 33/33 places, 312/312 transitions.
Support contains 24 out of 33 places after structural reductions.
[2026-05-25 00:30:54] [INFO ] Flatten gal took : 35 ms
[2026-05-25 00:30:54] [INFO ] Flatten gal took : 16 ms
[2026-05-25 00:30:54] [INFO ] Input system was already deterministic with 312 transitions.
Support contains 23 out of 33 places (down from 24) after GAL structural reductions.
RANDOM walk for 40000 steps (3096 resets) in 1975 ms. (20 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40003 steps (226 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (194 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (227 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (177 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (228 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
[2026-05-25 00:30:55] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:30:55] [INFO ] Invariant cache hit.
[2026-05-25 00:30:55] [INFO ] State equation strengthened by 71 read => feed constraints.
Problem AtomicPropp7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 2 (OVERLAPS) 69/74 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 17/23 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/337 variables, 25/48 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 53/101 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/343 variables, 3/104 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/344 variables, 1/105 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/105 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/344 variables, 0/105 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 105 constraints, problems are : Problem set: 3 solved, 2 unsolved in 208 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 17/19 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 270/324 variables, 23/42 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 53/95 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 2/97 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 1/98 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/98 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 106 constraints, problems are : Problem set: 3 solved, 2 unsolved in 2134 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2347ms problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 304
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 299
Applied a total of 13 rules in 494 ms. Remains 28 /33 variables (removed 5) and now considering 299/312 (removed 13) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6269820225164536599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1919278919668107948.kers'
[2026-05-25 00:30:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6269820225164536599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1919278919668107948.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 28 cols 598 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-25 00:30:58] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1919278919668107948.kers
Total runtime 1 ms.
[2026-05-25 00:30:58] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/327 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 45 constraints, problems are : Problem set: 0 solved, 275 unsolved in 9459 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 299/326 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 275/319 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/327 variables, and 319 constraints, problems are : Problem set: 0 solved, 275 unsolved in 20020 ms.
Refiners :[State Equation: 27/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29561ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 29562ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30058 ms. Remains : 28/33 places, 299/312 transitions.
RANDOM walk for 40000 steps (4426 resets) in 433 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (344 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (445 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1023909 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :0 out of 2
Probabilistic random walk after 1023909 steps, saw 222534 distinct states, run finished after 3017 ms. (steps per millisecond=339 ) properties seen :0
[2026-05-25 00:31:31] [INFO ] Invariant cache hit.
[2026-05-25 00:31:31] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 264/318 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/327 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 45 constraints, problems are : Problem set: 0 solved, 2 unsolved in 94 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 264/318 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 47 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18100 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18200ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 15 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 28/28 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 299/299 transitions.
Applied a total of 0 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-25 00:31:49] [INFO ] Invariant cache hit.
[2026-05-25 00:31:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 00:31:49] [INFO ] Invariant cache hit.
[2026-05-25 00:31:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 00:31:49] [INFO ] Implicit Places using invariants and state equation in 649 ms returned [9, 22]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 26 transitions.
Implicit Place search using SMT with State Equation took 706 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 273/299 transitions.
Applied a total of 0 rules in 9 ms. Remains 26 /26 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 723 ms. Remains : 26/28 places, 273/299 transitions.
RANDOM walk for 40000 steps (1921 resets) in 662 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (246 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (266 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1113009 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :0 out of 2
Probabilistic random walk after 1113009 steps, saw 249640 distinct states, run finished after 3001 ms. (steps per millisecond=370 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12523615970829394771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16738244961262889636.kers'
[2026-05-25 00:31:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12523615970829394771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16738244961262889636.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 273 rows 26 cols 544 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 00:31:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16738244961262889636.kers
Total runtime 1 ms.
[2026-05-25 00:31:53] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 237/290 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/299 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/299 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 43 constraints, problems are : Problem set: 0 solved, 2 unsolved in 143 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 237/290 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/299 variables, and 45 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30106 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30280ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 273/273 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 26/26 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 273/273 transitions.
Applied a total of 0 rules in 16 ms. Remains 26 /26 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2026-05-25 00:32:23] [INFO ] Invariant cache hit.
[2026-05-25 00:32:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 00:32:23] [INFO ] Invariant cache hit.
[2026-05-25 00:32:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 00:32:23] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2026-05-25 00:32:24] [INFO ] Redundant transitions in 13 ms returned []
Running 251 sub problems to find dead transitions.
[2026-05-25 00:32:24] [INFO ] Invariant cache hit.
[2026-05-25 00:32:24] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 273/298 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 1/299 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/299 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 43 constraints, problems are : Problem set: 0 solved, 251 unsolved in 8038 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 273/298 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 251/293 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/299 variables, and 294 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30020 ms.
Refiners :[State Equation: 26/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38145ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 38147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38679 ms. Remains : 26/26 places, 273/273 transitions.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 33 stabilizing places and 310 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||F(p1)||X(X(F(p2))))) U X(p3)))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:33:02] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10828117154950104515.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3639340712637205735.kers'
[2026-05-25 00:33:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10828117154950104515.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3639340712637205735.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:33:02] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3639340712637205735.kers
Total runtime 3 ms.
[2026-05-25 00:33:02] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20020 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 282/379 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 385 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20014 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40103ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 40103ms
[2026-05-25 00:33:42] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:42] [INFO ] Invariant cache hit.
[2026-05-25 00:33:42] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 00:33:42] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:42] [INFO ] Invariant cache hit.
[2026-05-25 00:33:42] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:33:43] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 40591 ms. Remains : 33/33 places, 312/312 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||F(p1)||X(X(F(p2))))) U X(p3)))'
Stuttering acceptance computed with spot in 348 ms :[(NOT p3), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 190 ms.
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-00 finished in 41244 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(p0))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:33:43] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:43] [INFO ] Invariant cache hit.
[2026-05-25 00:33:43] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 00:33:43] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:43] [INFO ] Invariant cache hit.
[2026-05-25 00:33:43] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:33:44] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 33/33 places, 312/312 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(p0))))'
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-01 finished in 610 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 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:33:44] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:44] [INFO ] Invariant cache hit.
[2026-05-25 00:33:44] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 00:33:44] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:44] [INFO ] Invariant cache hit.
[2026-05-25 00:33:44] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:33:44] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2026-05-25 00:33:44] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 33/33 places, 312/312 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 30 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-04
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-04 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:33:44] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:44] [INFO ] Invariant cache hit.
[2026-05-25 00:33:45] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-25 00:33:45] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:45] [INFO ] Invariant cache hit.
[2026-05-25 00:33:45] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:33:45] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2026-05-25 00:33:45] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 839 ms. Remains : 33/33 places, 312/312 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 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-05
Product exploration explored 100000 steps with 1 reset in 135 ms.
Product exploration explored 100000 steps with 0 reset in 104 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 88 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 170 steps (9 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 103 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 94 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 307 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 11 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:33:46] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:46] [INFO ] Invariant cache hit.
[2026-05-25 00:33:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 00:33:46] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:46] [INFO ] Invariant cache hit.
[2026-05-25 00:33:46] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:33:47] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2026-05-25 00:33:47] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 74 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 302 steps (22 resets) in 9 ms. (30 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 98 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 75 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 257 ms.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 67 ms.
Product exploration explored 100000 steps with 0 reset in 188 ms.
Built C files in :
/tmp/ltsmin2989945733638593734
[2026-05-25 00:33:47] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2026-05-25 00:33:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:33:47] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2026-05-25 00:33:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:33:47] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2026-05-25 00:33:47] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:33:47] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2989945733638593734
Running compilation step : cd /tmp/ltsmin2989945733638593734;'/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 757 ms.
Running link step : cd /tmp/ltsmin2989945733638593734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin2989945733638593734;'/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/stateBased4811329714510024766.hoa' '--buchi-type=spotba'
LTSmin run took 163 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-05 finished in 3869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((X((p0 U X(p1)))||(p0 U p2)) U (F(p2)&&p3)))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:33:48] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:48] [INFO ] Invariant cache hit.
[2026-05-25 00:33:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 00:33:48] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:48] [INFO ] Invariant cache hit.
[2026-05-25 00:33:48] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:33:49] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 489 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((X((p0 U X(p1)))||(p0 U p2)) U (F(p2)&&p3)))'
Stuttering acceptance computed with spot in 609 ms :[(AND p2 p3), true, p2, (AND p1 p2 p3), (AND p2 p3), p1, p1, (AND p1 p2 p3), (AND p2 p1), (AND p1 p2 p3), (AND p1 p2 p3), (AND p1 p2), (AND (NOT p1) p2)]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 133 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Negative knowledge disproves property using: (X (AND p2 (NOT p3)))
Knowledge based reduction with 27 factoid took 249 ms. Proved property starting from automaton with 13 states, 48 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 260 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-08 finished in 1682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!p0&&F((G(F(p1))||(F(p1)&&X(X(!p0)))))))||(!p0&&F(p2)&&F((G(F(p1))||(F(p1)&&X(X(!p0)))))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:33:50] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:50] [INFO ] Invariant cache hit.
[2026-05-25 00:33:50] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 00:33:50] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:50] [INFO ] Invariant cache hit.
[2026-05-25 00:33:50] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:33:50] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 33/33 places, 312/312 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&&F((G(F(p1))||(F(p1)&&X(X(p0)))))))||(p0&&F(p2)&&F((G(F(p1))||(F(p1)&&X(X(p0)))))))))'
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-09
Product exploration explored 100000 steps with 11 reset in 200 ms.
Product exploration explored 100000 steps with 1 reset in 129 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 11 factoid took 1788 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (3067 resets) in 403 ms. (99 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40003 steps (195 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (221 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (237 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (237 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
[2026-05-25 00:33:53] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:33:53] [INFO ] Invariant cache hit.
[2026-05-25 00:33:53] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 236/335 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 57/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/343 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 4 unsolved in 170 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 236/335 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/344 variables, and 99 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4099 ms.
Refiners :[State Equation: 29/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4275ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 33 transition count 305
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 29 transition count 301
Applied a total of 11 rules in 19 ms. Remains 29 /33 variables (removed 4) and now considering 301/312 (removed 11) transitions.
Running 276 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5658034534323383206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10922478418818033379.kers'
[2026-05-25 00:33:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5658034534323383206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10922478418818033379.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 29 cols 601 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-25 00:33:57] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10922478418818033379.kers
Total runtime 2 ms.
[2026-05-25 00:33:57] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 300/327 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 3/330 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/330 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 59 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10313 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 300/327 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 276/333 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 3/330 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 335 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20023 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30441ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 30442ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30462 ms. Remains : 29/33 places, 301/312 transitions.
RANDOM walk for 40000 steps (4078 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (314 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (331 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (387 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (398 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 712911 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 4
Probabilistic random walk after 712911 steps, saw 144392 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
[2026-05-25 00:34:31] [INFO ] Invariant cache hit.
[2026-05-25 00:34:31] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 231/330 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 59 constraints, problems are : Problem set: 0 solved, 4 unsolved in 175 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 42 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36086 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 13/30 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36267ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 301/301 transitions.
Applied a total of 0 rules in 12 ms. Remains 29 /29 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 29/29 places, 301/301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 301/301 transitions.
Applied a total of 0 rules in 4 ms. Remains 29 /29 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2026-05-25 00:35:07] [INFO ] Invariant cache hit.
[2026-05-25 00:35:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 00:35:08] [INFO ] Invariant cache hit.
[2026-05-25 00:35:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-25 00:35:08] [INFO ] Implicit Places using invariants and state equation in 625 ms returned [10, 23]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 24 transitions.
Implicit Place search using SMT with State Equation took 669 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/29 places, 277/301 transitions.
Applied a total of 0 rules in 11 ms. Remains 27 /27 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 684 ms. Remains : 27/29 places, 277/301 transitions.
RANDOM walk for 40000 steps (2063 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (232 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (262 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (275 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (256 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 729834 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 4
Probabilistic random walk after 729834 steps, saw 154079 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4448664309260494702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13423810482824968364.kers'
[2026-05-25 00:35:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4448664309260494702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13423810482824968364.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 27 cols 549 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-25 00:35:11] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13423810482824968364.kers
Total runtime 1 ms.
[2026-05-25 00:35:11] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 206/304 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 57 constraints, problems are : Problem set: 0 solved, 4 unsolved in 108 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 40 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60094 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 13/30 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 277/277 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 27/27 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 277/277 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2026-05-25 00:36:12] [INFO ] Invariant cache hit.
[2026-05-25 00:36:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 00:36:12] [INFO ] Invariant cache hit.
[2026-05-25 00:36:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-25 00:36:12] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2026-05-25 00:36:12] [INFO ] Redundant transitions in 3 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-25 00:36:12] [INFO ] Invariant cache hit.
[2026-05-25 00:36:12] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 276/301 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 30/55 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 3/304 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 57 constraints, problems are : Problem set: 0 solved, 254 unsolved in 8876 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 276/301 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 30/55 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 311 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30015 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38939ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 38943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39496 ms. Remains : 27/27 places, 277/277 transitions.
Knowledge based reduction with 11 factoid took 2628 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, false, false, false]
Knowledge-based reduction took 182834 ms.
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, false, false, false]
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:36:54] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9845737992262347008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3442877526756804216.kers'
[2026-05-25 00:36:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9845737992262347008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3442877526756804216.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:36:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3442877526756804216.kers
Total runtime 1 ms.
[2026-05-25 00:36:54] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20018 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 282/379 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 385 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20026 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40124ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 40124ms
[2026-05-25 00:37:34] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:37:34] [INFO ] Invariant cache hit.
[2026-05-25 00:37:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 00:37:34] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:37:34] [INFO ] Invariant cache hit.
[2026-05-25 00:37:35] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:37:35] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2026-05-25 00:37:35] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40539 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 17 factoid took 1627 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (3104 resets) in 196 ms. (203 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (200 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (217 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (237 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (230 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
[2026-05-25 00:37:37] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:37:37] [INFO ] Invariant cache hit.
[2026-05-25 00:37:37] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 236/335 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 57/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/343 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 4 unsolved in 185 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 236/335 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/344 variables, and 99 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3293 ms.
Refiners :[State Equation: 29/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3490ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 506 ms.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 33 transition count 305
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 29 transition count 301
Applied a total of 11 rules in 9 ms. Remains 29 /33 variables (removed 4) and now considering 301/312 (removed 11) transitions.
Running 276 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16599794161185785353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16036945969314103923.kers'
[2026-05-25 00:37:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16599794161185785353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16036945969314103923.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 29 cols 601 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-25 00:37:41] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16036945969314103923.kers
Total runtime 1 ms.
[2026-05-25 00:37:41] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 300/327 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 3/330 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/330 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 59 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10399 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 300/327 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 30/57 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 276/333 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 335 constraints, problems are : Problem set: 0 solved, 276 unsolved in 20017 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30467ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 30468ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30478 ms. Remains : 29/33 places, 301/312 transitions.
RANDOM walk for 40000 steps (4134 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (305 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (336 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (379 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (396 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 724054 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 4
Probabilistic random walk after 724054 steps, saw 146332 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
[2026-05-25 00:38:14] [INFO ] Invariant cache hit.
[2026-05-25 00:38:14] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 231/330 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 59 constraints, problems are : Problem set: 0 solved, 4 unsolved in 115 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 42 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36095 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 13/30 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36220ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 301/301 transitions.
Applied a total of 0 rules in 9 ms. Remains 29 /29 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 29/29 places, 301/301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 301/301 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2026-05-25 00:38:50] [INFO ] Invariant cache hit.
[2026-05-25 00:38:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 00:38:50] [INFO ] Invariant cache hit.
[2026-05-25 00:38:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-25 00:38:51] [INFO ] Implicit Places using invariants and state equation in 643 ms returned [10, 23]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 24 transitions.
Implicit Place search using SMT with State Equation took 698 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/29 places, 277/301 transitions.
Applied a total of 0 rules in 6 ms. Remains 27 /27 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 707 ms. Remains : 27/29 places, 277/301 transitions.
RANDOM walk for 40000 steps (2084 resets) in 180 ms. (220 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (227 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (254 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (267 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (260 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 719224 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 4
Probabilistic random walk after 719224 steps, saw 152009 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14914411738846586345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11873808466044883859.kers'
[2026-05-25 00:38:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14914411738846586345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11873808466044883859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 27 cols 549 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-25 00:38:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11873808466044883859.kers
Total runtime 1 ms.
[2026-05-25 00:38:54] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 206/304 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 57 constraints, problems are : Problem set: 0 solved, 4 unsolved in 108 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 40 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60089 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 13/30 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 277/277 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/27 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 277/277 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2026-05-25 00:39:54] [INFO ] Invariant cache hit.
[2026-05-25 00:39:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 00:39:54] [INFO ] Invariant cache hit.
[2026-05-25 00:39:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-25 00:39:55] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2026-05-25 00:39:55] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-25 00:39:55] [INFO ] Invariant cache hit.
[2026-05-25 00:39:55] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 276/301 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 30/55 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 3/304 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 57 constraints, problems are : Problem set: 0 solved, 254 unsolved in 8808 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 276/301 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 30/55 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 254/309 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 3/304 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 311 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30018 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38877ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 38878ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39453 ms. Remains : 27/27 places, 277/277 transitions.
Knowledge based reduction with 17 factoid took 2582 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, false, false, false]
Knowledge-based reduction took 181914 ms.
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 2 reset in 94 ms.
Built C files in :
/tmp/ltsmin3983101080203278546
[2026-05-25 00:40:38] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2026-05-25 00:40:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:40:38] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2026-05-25 00:40:38] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:40:38] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2026-05-25 00:40:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:40:38] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3983101080203278546
Running compilation step : cd /tmp/ltsmin3983101080203278546;'/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 623 ms.
Running link step : cd /tmp/ltsmin3983101080203278546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3983101080203278546;'/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/stateBased15822454393539492165.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-09 finished in 408424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(!p0)))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:40:38] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14279551675369716405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8121025406074206741.kers'
[2026-05-25 00:40:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14279551675369716405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8121025406074206741.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 33 cols 614 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 00:40:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8121025406074206741.kers
Total runtime 2 ms.
[2026-05-25 00:40:38] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 12/343 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20028 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 282/379 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 282 unsolved
SMT process timed out in 40105ms, After SMT, problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 40106ms
[2026-05-25 00:41:19] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:41:19] [INFO ] Invariant cache hit.
[2026-05-25 00:41:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 00:41:19] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:41:19] [INFO ] Invariant cache hit.
[2026-05-25 00:41:19] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:41:19] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 40597 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(!p0)))))'
Stuttering acceptance computed with spot in 118 ms :[false, p0, false]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-10
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 0 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-10 finished in 40742 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 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:41:19] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:41:19] [INFO ] Invariant cache hit.
[2026-05-25 00:41:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 00:41:19] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:41:19] [INFO ] Invariant cache hit.
[2026-05-25 00:41:19] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:41:20] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2026-05-25 00:41:20] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 473 ms. Remains : 33/33 places, 312/312 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 48 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 73 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Knowledge-based reduction took 268 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:41:20] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:41:20] [INFO ] Invariant cache hit.
[2026-05-25 00:41:20] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 00:41:20] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:41:20] [INFO ] Invariant cache hit.
[2026-05-25 00:41:20] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:41:21] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2026-05-25 00:41:21] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 279 steps (20 resets) in 6 ms. (39 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Knowledge-based reduction took 275 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Built C files in :
/tmp/ltsmin15325385294869714463
[2026-05-25 00:41:21] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2026-05-25 00:41:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:41:21] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2026-05-25 00:41:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:41:21] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2026-05-25 00:41:21] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:41:21] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15325385294869714463
Running compilation step : cd /tmp/ltsmin15325385294869714463;'/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 623 ms.
Running link step : cd /tmp/ltsmin15325385294869714463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15325385294869714463;'/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/stateBased16983084402321784598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:41:36] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:41:36] [INFO ] Invariant cache hit.
[2026-05-25 00:41:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 00:41:36] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:41:36] [INFO ] Invariant cache hit.
[2026-05-25 00:41:36] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:41:37] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2026-05-25 00:41:37] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 33/33 places, 312/312 transitions.
Built C files in :
/tmp/ltsmin3348283887105379855
[2026-05-25 00:41:37] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2026-05-25 00:41:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:41:37] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2026-05-25 00:41:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:41:37] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2026-05-25 00:41:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:41:37] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3348283887105379855
Running compilation step : cd /tmp/ltsmin3348283887105379855;'/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 622 ms.
Running link step : cd /tmp/ltsmin3348283887105379855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3348283887105379855;'/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/stateBased11669813650198877894.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 00:41:52] [INFO ] Flatten gal took : 11 ms
[2026-05-25 00:41:52] [INFO ] Flatten gal took : 10 ms
[2026-05-25 00:41:52] [INFO ] Time to serialize gal into /tmp/LTL9428799680150436339.gal : 4 ms
[2026-05-25 00:41:52] [INFO ] Time to serialize properties into /tmp/LTL2835731521576203299.prop : 0 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/LTL9428799680150436339.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13189419280732878024.hoa' '-atoms' '/tmp/LTL2835731521576203299.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...318
Loading property file /tmp/LTL2835731521576203299.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13189419280732878024.hoa
Detected timeout of ITS tools.
[2026-05-25 00:42:07] [INFO ] Flatten gal took : 9 ms
[2026-05-25 00:42:07] [INFO ] Flatten gal took : 9 ms
[2026-05-25 00:42:07] [INFO ] Time to serialize gal into /tmp/LTL5287642640261790048.gal : 3 ms
[2026-05-25 00:42:07] [INFO ] Time to serialize properties into /tmp/LTL3825963620899553709.ltl : 5 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/LTL5287642640261790048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3825963620899553709.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 : !((F(G("(A15<2)"))))
Formula 0 simplified : GF!"(A15<2)"
Detected timeout of ITS tools.
[2026-05-25 00:42:22] [INFO ] Flatten gal took : 12 ms
[2026-05-25 00:42:22] [INFO ] Applying decomposition
[2026-05-25 00:42:22] [INFO ] Flatten gal took : 9 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/graph4241841018391539109.txt' '-o' '/tmp/graph4241841018391539109.bin' '-w' '/tmp/graph4241841018391539109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4241841018391539109.bin' '-l' '-1' '-v' '-w' '/tmp/graph4241841018391539109.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:42:22] [INFO ] Decomposing Gal with order
[2026-05-25 00:42:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:42:22] [INFO ] Removed a total of 544 redundant transitions.
[2026-05-25 00:42:22] [INFO ] Flatten gal took : 63 ms
[2026-05-25 00:42:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 00:42:22] [INFO ] Time to serialize gal into /tmp/LTL7936077353744345013.gal : 2 ms
[2026-05-25 00:42:22] [INFO ] Time to serialize properties into /tmp/LTL1951877586234232.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/LTL7936077353744345013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1951877586234232.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...251
Read 1 LTL properties
Checking formula 0 : !((F(G("(u14.A15<2)"))))
Formula 0 simplified : GF!"(u14.A15<2)"
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30...1829
Detected timeout of ITS tools.
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-12 finished in 78017 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(G(p0)))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:42:37] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:42:37] [INFO ] Invariant cache hit.
[2026-05-25 00:42:37] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 00:42:37] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:42:37] [INFO ] Invariant cache hit.
[2026-05-25 00:42:37] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:42:38] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 33/33 places, 312/312 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(G(p0)))))'
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 196 steps (12 resets) in 5 ms. (32 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 225 ms.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:42:38] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:42:38] [INFO ] Invariant cache hit.
[2026-05-25 00:42:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 00:42:38] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:42:38] [INFO ] Invariant cache hit.
[2026-05-25 00:42:39] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:42:39] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 404 steps (31 resets) in 8 ms. (44 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 272 ms.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Spot run failed in 97 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/ltsmin4498578812027832699
[2026-05-25 00:42:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4498578812027832699
Running compilation step : cd /tmp/ltsmin4498578812027832699;'/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 415 ms.
Running link step : cd /tmp/ltsmin4498578812027832699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4498578812027832699;'/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/stateBased2989828873723072505.hoa' '--buchi-type=spotba'
LTSmin run took 91 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-13 finished in 3180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U X(X(p2)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:42:40] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:42:40] [INFO ] Invariant cache hit.
[2026-05-25 00:42:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 00:42:40] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:42:40] [INFO ] Invariant cache hit.
[2026-05-25 00:42:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:42:41] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U X(X(p2)))))'
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 26 steps with 8 reset in 0 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-14 finished in 803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 00:42:41] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:42:41] [INFO ] Invariant cache hit.
[2026-05-25 00:42:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 00:42:41] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2026-05-25 00:42:41] [INFO ] Invariant cache hit.
[2026-05-25 00:42:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-25 00:42:42] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2026-05-25 00:42:42] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 576 ms. Remains : 33/33 places, 312/312 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-14ringLRLarge-LTLCardinality-15
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-14ringLRLarge-LTLCardinality-15 finished in 626 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)))'
Spot run failed in 44 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-25 00:42:42] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13996477168291274940
[2026-05-25 00:42:42] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2026-05-25 00:42:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:42:42] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2026-05-25 00:42:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 00:42:42] [INFO ] Applying decomposition
[2026-05-25 00:42:42] [INFO ] Flatten gal took : 8 ms
[2026-05-25 00:42:42] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2026-05-25 00:42:42] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph16315567645512982713.txt' '-o' '/tmp/graph16315567645512982713.bin' '-w' '/tmp/graph16315567645512982713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16315567645512982713.bin' '-l' '-1' '-v' '-w' '/tmp/graph16315567645512982713.weights' '-q' '0' '-e' '0.001'
[2026-05-25 00:42:42] [INFO ] Decomposing Gal with order
[2026-05-25 00:42:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:42:42] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13996477168291274940
Running compilation step : cd /tmp/ltsmin13996477168291274940;'/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-25 00:42:42] [INFO ] Removed a total of 544 redundant transitions.
[2026-05-25 00:42:42] [INFO ] Flatten gal took : 59 ms
[2026-05-25 00:42:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 00:42:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality17404512156477995276.gal : 2 ms
[2026-05-25 00:42:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality16852876892639076283.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/LTLCardinality17404512156477995276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16852876892639076283.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...278
Read 1 LTL properties
Checking formula 0 : !((F(G("(u14.A15<2)"))))
Formula 0 simplified : GF!"(u14.A15<2)"
Compilation finished in 669 ms.
Running link step : cd /tmp/ltsmin13996477168291274940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13996477168291274940;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30...1829
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4920 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,49.2548,1779996,1,0,3.50435e+06,203,2338,6.2363e+06,60,224,7914618
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DNAwalker-PT-14ringLRLarge-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 812882 ms.

BK_STOP 1779669825784

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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